Papers by Yong Huang
Copied to clipboard
| Challenge: | Large Language Models (LLMs) have achieved considerable performance across various agentic planning tasks. |
| Approach: | They propose a data-centric approach that applies agents with knowledgeable self-awareness like humans to a heuristic situation judgement criterion to mark special tokens on their self-explored trajectories for collecting training data. |
| Outcome: | The proposed paradigm outperforms baseline models on various tasks with minimal external knowledge. |
Copied to clipboard
| Challenge: | Large language models (LLMs) are currently used to evaluate scientific papers by assigning an absolute score to each paper independently. |
| Approach: | They propose a comparison-native framework for paper evaluation that integrates comparison into both data construction and model learning. |
| Outcome: | The proposed framework achieves an average relative improvement of 21.8% over the strong baseline DeepReview-14B, while exhibiting robust generalization to five previously unseen datasets. |
Copied to clipboard
| Challenge: | Existing approaches to zero-shot sequence labeling are expensive and hard to obtain for lowresource languages/domains. |
| Approach: | They propose a framework for zero-shot sequence labeling with minimum risk training and a decomposable risk function that models the relations between predicted labels from the source models and the true labels. |
| Outcome: | The proposed framework outperforms state-of-the-art systems on 21 datasets. |
Copied to clipboard
| Challenge: | Experiments show that ChunkAttention can speed up the self-attention kernel by 3.2-4.8 compared to the start-of-the-art implementation. |
| Approach: | They propose a prefix-aware self-attention module that can detect matching prompt prefixes across multiple requests and share their key/value tensors in memory at runtime. |
| Outcome: | The proposed module can speed up the self-attention kernel by 3.2-4.8 compared to the start-of-the-art implementation, with the length of the system prompt ranging from 1024 to 4096. |
Copied to clipboard
| Challenge: | Existing studies focus on misspelled characters, ignoring faked characters which are more common and difficult to correct. |
| Approach: | They propose to use Chinese character checking to identify and correct wrong characters in texts by human annotation. |
| Outcome: | The proposed dataset is the first real-world visual and the largest human-crafted dataset for the Chinese character checking scenario. |
Copied to clipboard
| Challenge: | Argumentation mining on essays is a new task in natural language processing. |
| Approach: | They propose a multi-scale argumentation mining model which aims to identify the types and locations of argumentation components from essay text. |
| Outcome: | The proposed model outperforms existing models on mining all types of argumentation components on the Persuasive Essay dataset. |
Copied to clipboard
| Challenge: | Existing methods for key point analysis rely on semantic similarity instead of measuring the existence of shared key points . |
| Approach: | They propose a key point analysis approach with pairwise generation and graph partitioning to summarize arguments into a concise set of key points. |
| Outcome: | The proposed model surpasses existing models on ArgKP and QAM datasets. |
Copied to clipboard
| Challenge: | Currently, ML&DL methods fail to provide reasons for stock trend predictions, lacking interpretability and reasoning processes. large language models (LLMs) suffer from hallucinations and are unable to keep up with the latest information. |
| Approach: | They develop a method to train large language models to handle financial analysis tasks . they use AlphaFin datasets to compare performance with traditional methods . |
| Outcome: | The proposed method improves stock trend prediction and financial question answering tasks. |
Copied to clipboard
| Challenge: | Existing knowledge-enhanced pre-trained language models (KEPLMs) can capture internal knowledge, but can't understand external background knowledge. |
| Approach: | They propose to use Chinese knowledge-enhanced pre-trained language models to improve context-aware representations via learning from structured relations in knowledge bases. |
| Outcome: | Experiments show that Chinese knowledge-enhanced pre-trained language models outperform strong baselines over various benchmark NLP tasks and in different model sizes. |
Copied to clipboard
| Challenge: | Embodied Question Answering (EQA) tasks are primarily focused on indoor environments, leaving the complexities of urban settings unexplored. |
| Approach: | They propose a task where an embodied agent answers open-vocabulary questions in dynamic city spaces. |
| Outcome: | The proposed agent achieves 60.7% of human-level answering accuracy compared to baselines . the proposed agent outperforms existing agents in open-ended city spaces . |
Copied to clipboard
| Challenge: | Retrieval-Augmented Generation (RAG) systems have emerged as a pivotal methodology for enhancing Large Language Models (LLMs). |
| Approach: | They propose a framework that decouples planning and search processes using dual value models, enabling independent optimization of plan reasoning and search grounding. |
| Outcome: | The proposed framework decouples planning and search processes using dual value models, enabling independent optimization of plan reasoning and search grounding. |
Copied to clipboard
| Challenge: | Diverse real-world APIs require precise, robust function-calling intelligence, which needs agents to develop these capabilities through interaction in varied environments. |
| Approach: | They propose a framework that scales up environments to enable agentic intelligence . they use a two-phase agent fine-tuning strategy to first endow agents with basic agentic capabilities, then specializing them for domain-specific contexts. |
| Outcome: | Experiments on -bench, -Bench, and ACEBench show that the model significantly enhances the models’ function-calling capability. |
Copied to clipboard
| Challenge: | Current sentence encoders are word order sensitive, resulting in poor performance . Adapting word order from one language to another is key in cross-lingual structured prediction. |
| Approach: | They propose a new module to organize words following the source language order . they build structured prediction models with bag-of-words inputs and introduce a module to do this . |
| Outcome: | The proposed model significantly improves target language performance for languages that are distant from the source language. |
Copied to clipboard
| Challenge: | Large Language Models (LLMs) have shown potential in reasoning over structured environments, e.g., knowledge graphs and tables. |
| Approach: | They propose a framework that allows LLMs to efficiently and faithfully reason over structured environments. |
| Outcome: | The proposed framework surpasses state-of-the-art fine-tuned methods on three KGQA and two TableQA datasets and surpasse CWQ and WTQ methods. |
Copied to clipboard
| Challenge: | Existing beam retrieval frameworks for multi-hop question answering were customized for two-hop questions and were poorly supervised. |
| Approach: | They propose an end-to-end beam retrieval framework for multi-hop question answering . they combine an encoder and two classification heads to optimize the retrieval process . |
| Outcome: | The proposed framework improves on MuSiQue-Ans and surpasses all previous retrievers on HotpotQA and achieves 99.9% precision on 2WikiMultiHopQA. |
Copied to clipboard
| Challenge: | Existing knowledge-grounded conversation models lack knowledge that occurs in training data, resulting in incomplete knowledge generation. |
| Approach: | They propose an Entity-Agnostic Representation Learning method to introduce knowledge graphs to informative conversation generation using context of conversations and relational structure of knowledge graph. |
| Outcome: | The proposed model generates more informative, coherent, and natural responses than baseline models. |
Copied to clipboard
| Challenge: | Chinese geographic re-ranking task aims to find the most relevant addresses among retrieved candidates. |
| Approach: | They propose a framework to integrate Chinese geographic semantics into re-ranking pipelines. |
| Outcome: | The proposed framework improves on two Chinese benchmark datasets. |
Copied to clipboard
| Challenge: | Retrieval-augmented generation (RAG) is employed to tackle these challenges . a Knowledge Boundary Model (KBM) is used to express the known/unknown of a given question . |
| Approach: | They propose a Knowledge Boundary Model to express the known/unknown of a given question . they find that not all questions need to trigger RAG to improve performance . |
| Outcome: | The proposed model reduces time and computational costs by retrieving parts of unknown knowledge . the proposed model can express the known/unknown of a given question and determine whether a RAG needs to be triggered . |
Copied to clipboard
| Challenge: | Existing augmentation techniques manipulate words in the original text that break the semantic coherence of the text, or exploit generative models that ignore preserving entities in the text. |
| Approach: | They propose a novel Entity-to-Text based data augmentation technique called EnTDA to add, delete, replace or swap entities in the original text. |
| Outcome: | The proposed technique generates semantically coherent and entity preserving texts on thirteen NER tasks and two settings. |
Copied to clipboard
| Challenge: | Recent work shows document-level contexts can significantly improve Named Entity Recognition models. |
| Approach: | They propose to find external contexts of a sentence by retrieving and selecting a set of semantically relevant texts through a search engine with the original sentence as the query. |
| Outcome: | The proposed approach can achieve new state-of-the-art performance on 8 NER data sets across 5 domains. |
Copied to clipboard
| Challenge: | Recent advances in Large Language Models (LLMs) have demonstrated remarkable progress in machine writing such as open domain long-form generation. |
| Approach: | They propose a slow-thinking machine writing framework that emulates the human-like process of iterative expansion and reflection to improve the knowledge density of generated articles. |
| Outcome: | The proposed framework improves the knowledge density of generated articles without compromising metrics such as coherence and depth. |
Copied to clipboard
| Challenge: | Large Language Models (LLMs) have driven the rise of agentic workflows . yet, how can we attribute performance gains to individual upgrades and their interactions? |
| Approach: | They propose a game-theoretic framework that models component upgrades as players and evaluates component coalitions to compute Shapley values. |
| Outcome: | The proposed framework provides interaction-aware attribution and recommendation for model allocation under a fixed workflow structure. |
Copied to clipboard
| Challenge: | a frozen GPT can generate state-of-the-art performance on perfect pinyin, but performance drops when input includes abbreviated pinyan, which links to even larger number of Chinese characters. |
| Approach: | They propose to use Chinese GPT to generate fluent sentences using abbreviated pinyin. |
| Outcome: | The proposed approach improves on abbreviated pinyin across all domains. |
Copied to clipboard
| Challenge: | Conventional knowledge Graph Reasoning models learn the embeddings of KG components over the structure of a KG. |
| Approach: | They propose a pipeline to integrate knowledge from LLMs into KGs without fine-tuning . they propose knowledge alignment, KG reasoning and entity reranking to enhance conventional models . |
| Outcome: | The proposed pipeline can enhance the performance of conventional KGR models in incomplete and general situations. |
Copied to clipboard
| Challenge: | Existing approaches to reduce OOD recommendations fall into three grounding paradigms: retrieval, constrained generation and discrete item tokenizer generation. |
| Approach: | They propose a framework that instantiates three grounding paradigms under a single architecture . embedding-based retrieval, constrained generation and discrete item-tokenizer methods are implemented . |
| Outcome: | The proposed framework eradicates OOD recommendations across all variants and achieves state-of-the-art accuracy compared to strong ID-based and LLM-based baselines. |
Copied to clipboard
| Challenge: | Existing models for fact extraction and verification fail to utilize multi-view contextual information. |
| Approach: | They propose to integrate multi-view contextual information (IMCI) for fact extraction and verification by combining contextual information with inter-document context. |
| Outcome: | The proposed framework achieves state-of-the-art performance on the open-domain Wikipedia task with a winning FEVER score of 73.96% and label accuracy of 77.25% on the online blind test set. |
Copied to clipboard
| Challenge: | Existing large vision-language model (LVLM) approaches overlook a common strategy used by humans — using maps. |
| Approach: | They propose a method to equip a vision-language model with the ability to think with maps and optimize it using agentic reinforcement learning and parallel test-time scaling. |
| Outcome: | The proposed method outperforms open- and closed-source models on most metrics. |
Copied to clipboard
| Challenge: | Knowledge distillation is a technique to transfer knowledge between models, typically from a large model (the teacher) to a more fine-grained one (the student). |
| Approach: | They propose a factorized form of the knowledge distillation objective for structured prediction which is tractable for many typical choices of the teacher and student models. |
| Outcome: | The proposed model is able to transfer knowledge between teacher and student models without loss of accuracy under four different scenarios. |
Copied to clipboard
| Challenge: | Existing approaches to enabling LLM web search proficiency struggle with data production in open-search domains, while supervised fine-tuning struggles with data utilization efficiency. |
| Approach: | They propose an iterative self-evolution framework that combines SFT and RL to enhance agentic web search capabilities without external human-annotated reasoning data. |
| Outcome: | EvolveSearch achieves 4.7% improvement over current state-of-the-art in seven benchmarks . supervised fine-tuning struggles with data production in open-search domains compared with RL . |
Copied to clipboard
| Challenge: | Recent work shows that better word representations can be obtained by concatenating different types of embeddings. |
| Approach: | They propose to automate the process of finding better concatenated embeddings for structured prediction tasks by concatending different types of embeddables. |
| Outcome: | The proposed approach outperforms baselines and achieves state-of-the-art with fine-tuned embeddings on 6 tasks and 21 datasets. |
Copied to clipboard
| Challenge: | Existing work on cross-lingual transfer learning focuses on transferring knowledge from high-resource languages to low-resourced ones. |
| Approach: | They propose a multi-view framework that integrates multiple source models into an aggregated source view and transfers it to a target view based on a task-specific model. |
| Outcome: | The proposed framework improves on three structured prediction tasks on 16 datasets. |
Copied to clipboard
| Challenge: | Existing approaches to dialog generation suffer from the over-confidence issue, which leads to poor generation diversity. |
| Approach: | They propose an Adaptive Label Smoothing approach that can adaptively estimate a target label distribution at each time step for different dialog contexts. |
| Outcome: | The proposed approach outperforms competing models on two benchmark datasets in producing diverse responses. |
Copied to clipboard
| Challenge: | Large Language Models (LLMs) have demonstrated impressive capabilities across a wide range of natural language processing tasks. |
| Approach: | They propose a benchmark to assess the ability of LLMs to perform web traversal by using an explore-critic paradigm. |
| Outcome: | The proposed framework mimics human-like web navigation through an explore-critic paradigm and demonstrates the effectiveness of RAG combined with WebWalker in real-world scenarios. |
Copied to clipboard
| Challenge: | Direct Preference Optimization (DPO) has proven effective in aligning LLM behavior with human preferences across various tasks, but is limited in multi-turn social interactions. |
| Approach: | They propose a method which dynamically selects key segments within interactions to optimize multi-turn agent behavior. |
| Outcome: | The proposed methods outperform existing methods and proprietary LLMs on the SOTOPIA benchmark and show that they can improve social intelligence. |
Copied to clipboard
| Challenge: | Existing approaches to encode dynamic structures only encode partial information of structures. |
| Approach: | They propose a new attention-based encoder unifying all structures in a transition system. |
| Outcome: | The proposed method significantly improves the test speed and achieves the best transition-based model. |
Copied to clipboard
| Challenge: | Emotional support is a crucial ability for many conversation scenarios, including social interactions, mental health support, and customer service chats. |
| Approach: | They propose an Emotional Support Conversation task and an ESC Framework to train emotional support into dialog systems. |
| Outcome: | The proposed framework provides an example of an Emotional Support Conversation task and shows that it is more effective than existing models. |
Copied to clipboard
| Challenge: | Existing methods to preserve inference privacy are available as cloud services . however, the risk of privacy leakage remains, according to recent studies . |
| Approach: | They propose a method to preserve inference privacy by fusing token representations in the cloud. |
| Outcome: | The proposed method preserves inference privacy without sacrificing performance on different scenarios. |
Copied to clipboard
| Challenge: | Existing models ignore dynamic and different relations between time series patterns and textual features, which leads to poor performance in temporal-textual feature fusion. |
| Approach: | They propose a temporal-textual fusion framework that replaces Cross Attention with Cross-Ranker to reduce computational complexity and enhances modality-aware correlation memorization with Mixture-of-Experts (MoE) networks to tolerate the distributional shifts in time series. |
| Outcome: | The proposed framework reduces MSE by 8.78% compared to the current SOTA model and requires only 75% of computational overhead and 12.5% of activated parameters. |
Copied to clipboard
| Challenge: | Existing methods to detect the knowledge boundary of Vision Large Language Models (VLLMs) are expensive and require indiscriminate retrieval to address questions that require real-time information or are knowledge-intensive. |
| Approach: | They propose a method that fine-tunes a VLLM on an automatically constructed dataset for boundary identification. |
| Outcome: | The proposed method reduces indiscriminate retrieval while maintaining or improving the performance of a VLLM on an automatically constructed dataset. |
Copied to clipboard
| Challenge: | Recent advances in large language models (LLMs) have significantly enhanced their performance in various natural language processing tasks. |
| Approach: | They propose a robust and pluggable knowledge rewriter that is optimized for LLM generation by supporting the model's supportiveness. |
| Outcome: | The proposed model can be used to rewrite knowledge in a supervised manner. |
Copied to clipboard
| Challenge: | Shortcuts such as APIs and deep-links have emerged as efficient complements to flexible GUI operations, but systematic evaluation of GUI–shortcut hybrid agents remains underexplored. |
| Approach: | They propose a benchmark that evaluates GUI-shortcut hybrid agents with a specific focus on the mobile domain. |
| Outcome: | MAS-Bench evaluates agent's ability to generate shortcuts by discovering and creating reusable, low-cost workflows. |
Copied to clipboard
| Challenge: | Extensive experiments on AppWorld and BFCL demonstrate consistent and significant improvements over strong base models, yielding absolute gains of 19.43%, 15.58%, and 18.14%, respectively. |
| Approach: | They propose a framework that extracts feedback signals such as forgetting and uncertainty from rollout trajectories and utilizes them to guide LLM-based task synthesis. |
| Outcome: | Extensive experiments on AppWorld and BFCL show that the proposed framework improves over strong base models. |
Copied to clipboard
| Challenge: | Recent work on Multi-modal Named Entity Recognition (MNER) relies on image information to model interactions between image and text representations. |
| Approach: | They propose to align image features into the textual space to better utilize attention mechanisms . they use regional object tags, captions and optical characters as visual contexts . |
| Outcome: | The proposed model can achieve state-of-the-art accuracy on multi-modal Named Entity Recognition datasets even without image information. |
Copied to clipboard
| Challenge: | Existing methods for lifelong TKG reasoning only address part of the challenges. |
| Approach: | They propose a temporal-path-based reinforcement learning framework for lifelong TKG reasoning . they add temporal displacement into the action space of RL to extrapolate for the future . |
| Outcome: | The proposed model outperforms existing models against well-adapted baselines on three lifelong TKG reasoning benchmarks. |
Copied to clipboard
| Challenge: | Recent advances in conversational information seeking (CIS) suggest a remedy for the lack of interactive clarification when people face unfamiliar domains. |
| Approach: | They propose a fully autonomous conversational information-seeking agent that couples large language models with a set of domain-specific tools to provide product demand clarification. |
| Outcome: | The proposed agent can iterate over 2,000 automatically generated sessions and score high on real-world evaluations without human annotation. |
Copied to clipboard
| Challenge: | Current approaches to visual question answering train attention models from coarse-grained associations between sentences and images, which fail on small objects or uncommon concepts. |
| Approach: | They propose a multi-grained attention method that learns explicit word-object correspondence by word-level attention complementary to the sentence-image association. |
| Outcome: | The proposed method achieves competitive performance with state-of-the-art models on the VQA benchmark. |
Copied to clipboard
| Challenge: | Synthetic data suffer from poor diversity, which leads to performance limitations. |
| Approach: | They propose a graph-propagated data augmentation framework for named entity recognition that uses graph propagation to build relationships between labeled data and unlabeled natural texts. |
| Outcome: | The proposed framework improves on a low-resource named entity recognition dataset. |
Copied to clipboard
| Challenge: | Existing methods for empathetic response generation ignore hierarchical relationships between different factors, leading to a weak ability of empathy modeling. |
| Approach: | They propose a multi-factor hierarchical framework for empathetic response generation which models the above three key factors in a hierarchically structured way. |
| Outcome: | The proposed model generates more empathetic responses than previous methods. |
Copied to clipboard
| Challenge: | Existing multilingual models still underperform individual monolingual models due to model capacity limitations. |
| Approach: | They propose to distill the structural knowledge of several monolingual models (teachers) to the unified multilingual model (student). |
| Outcome: | The proposed model outperforms strong baseline models and teacher models on 4 multilingual tasks with 25 datasets and has stronger zero-shot generalizability. |
Copied to clipboard
| Challenge: | CANDY is a benchmark to evaluate the capabilities and limitations of large language models (LLMs) for fact-checking misinformation. |
| Approach: | a team of researchers develop a benchmark to evaluate the capabilities and limitations of large language models in fact-checking misinformation in Chinese. |
| Outcome: | CANDY is a benchmark to evaluate the capabilities and limitations of large language models in fact-checking misinformation in China. |
Copied to clipboard
| Challenge: | Named entity recognition (NER) is a computationally difficult task in Chinese since there is no natural delimiter between words in sentences. |
| Approach: | They propose a data-driven Adaptive Threshold Selective Self-Attention mechanism to select the most relevant characters to enhance Transformer architecture for Chinese named entity recognition. |
| Outcome: | Experiments on four benchmark Chinese NER datasets show the proposed mechanism improves performance. |
Copied to clipboard
| Challenge: | Recent advances in in-context learning (ICL) have limited customization and inadequate error coverage. |
| Approach: | They propose a method to retrieve in-context principles from mistakes to improve model performance. |
| Outcome: | The proposed framework enhances model performance when applied to various prompting strategies. |
Copied to clipboard
| Challenge: | Existing methods emphasize contextual semantics while others pay more attention to explicit logical features. Existing models utilize graph convolutional networks (GCN) for node updates, still exhibiting some shortcomings. |
| Approach: | They propose a logical reasoning method with contrastive learning and lightweight graph networks (LogiGraph) they employ conjunction and punctuation marks as two types of edges to construct a dual graph. |
| Outcome: | The proposed method improves the GCN and employs conjunction and punctuation marks as two types of edges to construct a dual graph. |
Copied to clipboard
| Challenge: | Recent advances in entity retrieval ignore the property that meanings of entity mentions diverge in different contexts and are related to various portions of descriptions. |
| Approach: | They propose a novel approach that constructs multi-view representations for entity descriptions and approximates the optimal view for mentions via a heuristic searching method. |
| Outcome: | The proposed approach achieves state-of-the-art performance on ZESHEL and improves quality of candidates on three standard Entity Linking datasets. |
Copied to clipboard
| Challenge: | Recent work has noted that due to the extremely high cost of iterative updates of LLMs, they are often unable to answer dynamic questions well. |
| Approach: | They propose a Chinese Dynamic QA benchmark containing question-answer pairs related to the latest dynamic questions on the Chinese Internet. |
| Outcome: | The proposed benchmark will be one of the key data resources for improving LLMs’ Chinese question-answering ability in the future. |
Copied to clipboard
| Challenge: | Existing work suggests contextual embeddings improve sequence labeling accuracy . but, there is no definite conclusion on whether concatenating different kinds of embeddables is effective . |
| Approach: | They propose a family of contextual embeddings that improves sequence labeling accuracy . they conduct extensive experiments on 3 tasks over 18 datasets and 8 languages . |
| Outcome: | The proposed family of contextual embeddings improves the accuracy of sequence labelers over non-contextual embedders. |
Copied to clipboard
| Challenge: | Existing methods for semantic parsing fail when hallucinations are encountered . QueryAgent solves a question step-by-step and performs stepwise self-correction . |
| Approach: | They propose a framework that solves a query step-by-step and performs stepwise self-correction. |
| Outcome: | The proposed framework outperforms existing methods on GrailQA and GraphQ by 5.7 and 15.0 points. |
Copied to clipboard
| Challenge: | Named Entity Recognition (NER) is a fundamental NLP task that aims at classifying mention spans into entity types. |
| Approach: | They propose a variational memory-augmented few-shot named entity recognition model that uses a memory module to store information from source domain and retrieve relevant information from the memory to augment few-shot task in target domain. |
| Outcome: | The proposed model can adapt the learned knowledge from source domain to target domain and achieve superior performance on English and Chinese cross domain few-shot NER datasets. |
Copied to clipboard
| Challenge: | Existing quantization techniques have been categorized as 'simple' and 'highly efficient' however, their configurations vary from each other and cannot be fairly compared . |
| Approach: | They propose a plug-and-play compression toolkit to explore the impact of quantization. |
| Outcome: | The proposed toolkit explores the impact of quantization on large language models. |
Copied to clipboard
| Challenge: | Existing work on confidence in LLMs is limited. |
| Approach: | They propose to use confidence scores to determine model answer quality and encourage model to try again until it reaches satisfactory confidence level. |
| Outcome: | The proposed methods significantly reduce token consumption while demonstrating competitive performance compared to baseline fixed budget methods. |
Copied to clipboard
| Challenge: | Existing approaches to sequence labeling are based on the neural linear-chain CRF model. |
| Approach: | They propose a series of increasingly expressive potential functions for neural CRF models that integrate emission and transition functions and explicitly take contextual words as input. |
| Outcome: | The proposed model consistently achieves the best performance on the decomposed quadrilinear potential function based on the representations of two neighboring labels and two neighbored words. |
Copied to clipboard
| Challenge: | Reinforcement Learning from Human Feedback (RLHF) is an effective approach for aligning language models to human preferences. |
| Approach: | They compare the accuracy of DPORM and EXRM with a reward function for scoring human preferences. |
| Outcome: | The proposed methods can approximate an EXRM on the limit infinite samples, but it is unclear how effective they are in practice. |
Copied to clipboard
| Challenge: | Existing approaches treat length as an incidental output property rather than a statistically regular phenomenon worthy of rigorous modeling. |
| Approach: | They propose a statistical framework for modeling and controlling large language model response lengths using extreme value theory and cross-validation on Qwen and DeepSeek architectures. |
| Outcome: | The proposed model improves tail fit and generalizability while maintaining generalizzability. |
Copied to clipboard
| Challenge: | Using large language models, we can understand knowledge mechanisms in LLMs for learning, storage, utilization, and evolution. |
| Approach: | They propose to analyze knowledge mechanisms in Large Language Models (LLMs) they examine utilization, evolution, and the potential dark knowledge (hypothesis) they hope to help understand knowledge in LLMs and provide insights for future research . |
| Outcome: | The proposed model can be used to analyze the evolution of parametric knowledge in LLMs. |
Copied to clipboard
| Challenge: | Large Language Models (LLMs) and Retrieval Augmentation Generation (RAG) techniques have evolved to enhance document retrieval by reformulating queries. |
| Approach: | They propose a framework for training query rewriting models that leverages a reranker framework. |
| Outcome: | The proposed framework provides ranking feedback aligned well with the rewriting objectives without needing signals from annotations and supports both online and offline training models. |
Copied to clipboard
| Challenge: | Existing tool learning methods focus on selecting the most effective tool from a wide array of options, often overlooking cost-effectiveness. |
| Approach: | They propose to predict query performance and cost required to accomplish a given task . they then assign queries to the optimal tools in a cost-effective manner . |
| Outcome: | The proposed method achieves higher performance at lower cost compared to baseline approaches. |
Copied to clipboard
| Challenge: | Using Large Language Models (LLMs)-based agents can enhance their understanding of environments and tasks. |
| Approach: | They propose a framework that allows agents to synthesize possible scenarios with multi-step action invocation within the action space and perform Monte Carlo Tree Search exploration to refine their action knowledge in the current environment. |
| Outcome: | The proposed framework synthesizes possible scenarios with multi-step action invocation within the action space and performs Monte Carlo Tree Search exploration to refine action knowledge in the current environment. |
Copied to clipboard
| Challenge: | Existing approaches to sequence labeling require sequential computation that makes parallelization impossible. |
| Approach: | They propose to employ a parallelizable approximate variational inference algorithm for the CRF model. |
| Outcome: | The proposed approach improves decoding speed and accuracy with long sentences and is parallelizable for faster training and prediction. |
Copied to clipboard
| Challenge: | Existing knowledge evolution benchmarks are static and fail to capture the evolving nature of LLMs and knowledge. |
| Approach: | They propose an evolving dataset that categorizes information into stable, evolved, and uncharted states. |
| Outcome: | The proposed dataset is auto-updatable and enables evaluation of continuously changing knowledge and newly released LLMs. |
Copied to clipboard
| Challenge: | a new approach to timeline summarization is proposed for open-domain news content . large language models (LLMs) can be used to extract and organize news events from multiple documents . |
| Approach: | They propose a method to integrate Large Language Models into news timeline summarization by iterating on how events are linked and posing new questions. |
| Outcome: | The proposed system is able to generate and refresh chronological summaries based on documents retrieved in each round. |
Copied to clipboard
| Challenge: | Existing inference services are plagued by privacy concerns, such as sharing sensitive data with service providers. |
| Approach: | They propose a framework for protecting inference privacy by applying random perturbations to clustered representations. |
| Outcome: | The proposed framework protects inference privacy by applying random perturbations to clustered representations. |
Copied to clipboard
| Challenge: | Retrieval Augmented Generation can be used to process long contexts in Open-Domain Question-Answering tasks. |
| Approach: | They propose a method to cover longer contexts in Open-Domain Question-Answering tasks by using a small encoder language model and cross-attention with origin inputs. |
| Outcome: | The proposed method can cover longer contexts while keeping the computing requirements close to the baseline. |
Copied to clipboard
| Challenge: | Existing methods for few-shot relation extraction are limited to labeled instances and rely on data labeling. |
| Approach: | They propose a partial order-centered hyperbolic representation learning framework which imposes constraints on relations on instances by modeling partial order in hyperbolical space. |
| Outcome: | The proposed framework outperforms baseline methods on three benchmark datasets on 1-shot settings lacking relation descriptions. |