Papers by Le Liu
Copied to clipboard
| Challenge: | Large Reasoning Models (LRMs) are often bottlenecked by the high cost of output tokens. |
| Approach: | They propose a lightweight, turnkey component for Large Reasoning Models that is minimally invasive to its reasoning trajectory. |
| Outcome: | The proposed component is lightweight and low overhead, and lacks semantic value. |
Copied to clipboard
| Challenge: | Instruction fine-tuning (IFT) is a crucial phase in building large language models (LLMs). |
| Approach: | They propose a knowledge intervention framework to decouple the potential underlying factors of IFT and enable individual analysis of different factors. |
| Outcome: | The proposed framework decouples the potential underlying factors of IFT, enabling individual analysis of different factors. |
Copied to clipboard
| Challenge: | Information extraction suffers from its varying targets, heterogeneous structures, and demand-specific schemas. |
| Approach: | They propose a unified text-to-structure generation framework, namely UIE, which can universally model different IE tasks, adaptively generate targeted structures, and collaboratively learn general IE abilities from different knowledge sources. |
| Outcome: | The proposed framework can model different IE tasks, generate targeted structures, and learn general IE abilities from different knowledge sources. |
Copied to clipboard
| Challenge: | Existing extractive summarization models hardly capture inter-sentence relationships, especially in long documents. |
| Approach: | They propose to use a graph neural network to capture inter-sentence relationships efficiently via graph-structured document representation. |
| Outcome: | The proposed model outperforms existing models on CNN/DM and NYT datasets and significantly outperfies them on longer documents. |
Copied to clipboard
| Challenge: | Existing methods for dynamic web navigation rely on greedy strategies or value estimation, struggle to achieve effective backtracking and are heavily dependent on proprietary models. |
| Approach: | They propose a cognitive multi-agent collaboration framework that enhances cyberspace exploration capability through In-Context Exploration. |
| Outcome: | The proposed framework surpasses the proprietary model Claude-3.5 Sonnet on the WebArena benchmark. |
Copied to clipboard
| Challenge: | Existing few-shot named entity recognition (NER) models capture information from limited instances while transferring useful knowledge from external resources. |
| Approach: | They propose a self-describing mechanism for few-shot NER which can universally describe mentions using concepts and automatically map novel entity types to concepts. |
| Outcome: | The proposed model can universally describe mentions using concepts and automatically map novel entity types to concepts and adaptively recognize entities on-demand. |
Copied to clipboard
| Challenge: | Existing approaches to long-term dialogue memory management fail to capture the natural semantic structure of conversations, leading to fragmented and incomplete representations. |
| Approach: | They propose a mechanism that integrates forward- and backward-looking reflections into a personalized memory bank for effective future retrieval. |
| Outcome: | The proposed mechanism outperforms state-of-the-art benchmarks on a long-term dialogue memory model. |
Copied to clipboard
| Challenge: | Open-domain question answering is a task that requires answering questions based on a collection of document images. |
| Approach: | They propose to use document images to answer questions using layouts and visual features instead of text. |
| Outcome: | The proposed approach reduces human cost and improves scalability of QA systems by incorporating layouts and visual features. |
Copied to clipboard
| Challenge: | Existing methods for natural planning lack constraint-guided iterative verification and adaptive selection . a recent study found that LLMs are not good at such planning. |
| Approach: | They propose a model-agnostic and easily scalable agent framework with three key components: constraint, verification, and selection agents. |
| Outcome: | The proposed framework improves inference-time algorithms on NATURAL PLAN and OlympiadBench benchmarks. |
Copied to clipboard
| Challenge: | Existing approaches to training dialogue agents separately are not optimized for multi-domain task-oriented dialogues. |
| Approach: | They propose a unified neural architecture for end-to-end conversational systems in multi-domain task-oriented dialogues that jointly trains a bi-level state tracker and a joint dialogue act and response generator. |
| Outcome: | The proposed system outperforms existing systems on the MultiWOZ2.1 benchmark in dialogue state tracking, context-to-text, and end-to end settings. |
Copied to clipboard
| Challenge: | Recent studies observe a phenomenon where reward models achieve high accuracy on static datasets but fail to generalize effectively during RLHF. |
| Approach: | They propose a method that combines rationale consistency with outcome accuracy to improve performance on RM-Bench and JudgeBench. |
| Outcome: | The proposed method surpasses baselines on RM-Bench and JudgeBench by an average of 5% and improves creative writing tasks by 7%. |
Copied to clipboard
| Challenge: | Current benchmarks for large language model reasoning focus on math and coding abilities, leaving a gap in evaluating broader reasoning proficiencies. |
| Approach: | They propose a benchmark to evaluate general reasoning in large language models . they use BIG-Bench and its harder version BIG-Benefit Hard to assess general reasoning . |
| Outcome: | The new benchmark pushes the boundaries of LLM reasoning evaluation. |
Copied to clipboard
| Challenge: | Scientific discovery evolution does not occur ex nihilo but is characterized by structural deepening and reconfiguration of existing functionalities. |
| Approach: | They propose a framework for hypothesis generation based on evolutionary narratives . they extract structured P-M-L-F quadruples from citation networks and introduce a mechanism to assess their semantic compatibility. |
| Outcome: | The proposed framework reduces logical disconnects by evaluating its semantic compatibility. |
Copied to clipboard
| Challenge: | Low-Rank Adaptation (LoRA) is a parameter-efficient fine-tuning algorithm for large-scale language models. |
| Approach: | They conduct a systematic study of Low-Rank Adaptation (LoRA) on diverse tasks and rich resources with different learning capacities. |
| Outcome: | The proposed algorithm can achieve remarkable performance in high-resource and multi-task scenarios, even comparable to full fine-tuning. |
Copied to clipboard
| Challenge: | generative language agents predict user behaviors such as liking, sharing, and flagging content. |
| Approach: | They propose a framework where generative language agents predict user behaviors such as liking, sharing, and flagging content. |
| Outcome: | The proposed framework analyzes content moderation strategies and user engagement dynamics at scale and demonstrates that agents’ articulated reasoning for their social interactions aligns with their collective engagement patterns. |
Copied to clipboard
| Challenge: | Existing retrieval methods aim to gather relevant passages but fail to prioritize consistent and useful information for the reader. |
| Approach: | They propose a novel method which re-ranks passages based on the reader's prediction probability distribution and clusters passage according to the predicted answers. |
| Outcome: | The proposed method improves the quality of evidence passages under zero-shot scenarios. |
Copied to clipboard
| Challenge: | Long context capability is a crucial competency for large language models as it mitigates the human struggle to digest long-form texts. |
| Approach: | They propose to evaluate 10+ state-of-the-art approaches for long context-capable LLMs. |
| Outcome: | The proposed methods are compared against 10+ state-of-the-art approaches across seven categories of long context tasks. |
Copied to clipboard
| Challenge: | Low-shot relation extraction (RE) aims to recognize novel relations with very few or even no samples. |
| Approach: | They propose a method that leverages triplet paraphrase to pre-train zero-shot label matching ability and uses meta-learning paradigm to learn few-shot instance summarizing ability. |
| Outcome: | The proposed method outperforms strong baselines and achieves the best performance on few-shot RE leaderboard. |
Copied to clipboard
| Challenge: | Existing methods for question matching only transmit one kind of information while failing to utilize both kinds of information simultaneously. |
| Approach: | They propose a question matching network that can transmit both representation and interactive information together in a simultaneous fashion. |
| Outcome: | The proposed approach outperforms strong baseline models on two standard benchmarks. |
Copied to clipboard
| Challenge: | Current OpenRE models are often trained on the datasets generated from distant supervision, which often results in instability and makes the model easily collapsed. |
| Approach: | They propose to use a causal model to identify relation instances referring to the same relation . they propose to perform Element Interventions on context and entities respectively . |
| Outcome: | The proposed method outperforms existing methods and is robust across datasets. |
Copied to clipboard
| Challenge: | Existing NER models are supervised by a large number of training sequences, each pre-annotated with token-level labels. |
| Approach: | They propose a conditional hidden Markov model which can effectively infer true labels from multi-source noisy labels in an unsupervised way. |
| Outcome: | The proposed model outperforms state-of-the-art weakly supervised NER models on four benchmarks from various domains. |
Copied to clipboard
| Challenge: | Existing models for machine translation and dialogue response generation require a large number of handcrafted features. |
| Approach: | They propose to interpret a general neural model comparatively by using the seq2seq model in two mainstream NLP tasks. |
| Outcome: | The proposed model is used in two mainstream NLP tasks and is compared with a standard model. |
Copied to clipboard
| Challenge: | Existing methods for XMC struggle with the growing set of labels due to their static label assumptions, and embedding-based methods struggle with complex mapping relationships due to late interaction paradigm. |
| Approach: | They propose a large language model (LLM) powered agent framework for extreme multi-label classification, XMC-Agent, which can effectively learn, manage and predict the extremely large and dynamically increasing set of labels. |
| Outcome: | The proposed framework can learn, manage and predict the extremely large and dynamically growing set of labels and achieves state-of-the-art performance on three standard datasets. |
Copied to clipboard
| Challenge: | In-context learning (ICL) has gained considerable attention due to its data efficiency and task adaptability. |
| Approach: | They propose to de-biase demonstration bias in in-context learning by focusing on semantic ambiguity induced by demonstrations and reducing the semantic hazard. |
| Outcome: | The proposed methods significantly improve performance on six datasets. |
Copied to clipboard
| Challenge: | Using a novel dataset, we evaluate the counterfactual reasoning capabilities of Large Language Models (LLMs) . |
| Approach: | They propose a dataset to evaluate the counterfactual reasoning capabilities of Large Language Models (LLMs) using a pedagogical approach. |
| Outcome: | The proposed method mimics how educators anticipate and model potential student misconceptions by creating plausible but incorrect answer options by envisioning hypothetical scenarios and logically coherent reasoning paths. |
Copied to clipboard
| Challenge: | Existing datasets that ignore law requirements are limited to English. |
| Approach: | They construct a Chinese privacy policy dataset that can be used to analyze software privacy policies. |
| Outcome: | The proposed dataset includes 483 Chinese Android privacy policies, over 11K sentences, and 52K fine-grained annotations. |
Copied to clipboard
| Challenge: | Chain-of-Thought reasoning introduces significant inference latency due to its verbosity. |
| Approach: | They propose a framework that leverages token elasticity phenomenon to progressively compress CoTs via multiround refinement. |
| Outcome: | The proposed method achieves an average accuracy improvement of 5.6% over state-of-the-art baselines while reducing CoT length by an average of 47 tokens and significantly lowering latency. |
Copied to clipboard
| Challenge: | Existing work on rationale quality underestimates the importance of CoT distillation, focusing primarily on data quantity, which may result in transferring noisy or incorrect information to the student model. |
| Approach: | They propose a method which can discern and select high quality rationales for distillation and a Rationale Difficulty metric to measure the ability of the student model to generate the correct answer under a given rationale. |
| Outcome: | The proposed method achieves 4.6% accuracy improvement over baseline data on seven datasets over three tasks, controlling accuracy, diversity, and difficulty. |
Copied to clipboard
| Challenge: | Existing research treats MLLMs as unified systems optimized through end-to-end training, but the impact of vision encoder’s prior knowledge is seldom investigated. |
| Approach: | They propose a metric to quantify the effect of prior knowledge on MLLM performance by integrating prior knowledge at the vision encoder level into a training framework. |
| Outcome: | The proposed training framework incorporates prior knowledge at the vision encoder level, and significantly boosts visual understanding capabilities of MLLMs. |
Copied to clipboard
| Challenge: | Existing methods to rank documents using large language models do not understand these challenging ranking formulations. |
| Approach: | They propose to use Pairwise Ranking Prompting to improve ranking performance . they propose to outperform fine-tuned baseline rankers on benchmark datasets . |
| Outcome: | The proposed technique outperforms supervised baselines on benchmark datasets and outperformed other LLM-based solutions by over 10% on average. |
Copied to clipboard
| Challenge: | Recent studies have found prompt-based probing evaluations inaccurate, inconsistent and unreliable. |
| Approach: | They propose to conduct debiasing via causal intervention to uncover biases in probing evaluations . authors argue that prompt-based probing is inaccurate, inconsistent and unreliable . |
| Outcome: | This paper examines the effectiveness of prompt-based probing in pretrained language models . it highlights critical biases which could induce biased results and conclusions . authors suggest rethinking criteria for evaluating better pretrained models based on such evaluations . |
Copied to clipboard
| Challenge: | Existing approaches to fine-grained entity typing are based on independent classification paradigms, which make them difficult to recognize inter-dependent, long-tailed and fine-granular entities. |
| Approach: | They propose a label reasoning network that exploits label dependencies knowledge entailed in the data. |
| Outcome: | The proposed network can model, learn and reason complex labels in a sequence-to-set, end-to end manner. |
Copied to clipboard
| Challenge: | Chain-of-thought reasoning has emerged as a crucial paradigm for multi-step reasoning tasks. |
| Approach: | They propose a multi-stage probing framework that enforces structured reasoning with three explicit stages: keyword extraction, theorem generation, and computation execution. |
| Outcome: | The proposed framework enforces structured reasoning with three explicit stages: keyword extraction, theorem generation, and computation execution. |
Copied to clipboard
| Challenge: | Web documents are one of the most primary and biggest data resources in current era, and understanding their discourse structure will benefit various downstream document processing applications. |
| Approach: | They propose a web document discourse structure representation schema by extending classical discourse theories and adding special features to well represent discourse characteristics of web documents. |
| Outcome: | The proposed task is feasible but challenging for current models. |
Copied to clipboard
| Challenge: | Existing approaches to answer open-domain question have encountered term mismatch and limited interaction between IR systems and large language models. |
| Approach: | They propose a method which leverages the guidance and feedback gained from the analysis to provide faithful and consistent extensions for effective question answering. |
| Outcome: | Experiments on four open-domain question answering datasets show the proposed method performs well under zero-shot settings. |
Copied to clipboard
| Challenge: | Existing approaches to distilling large language models (LLMs) are inefficient and generate excessively long chain-of-thought reasoning even for inputs that admit concise solutions. |
| Approach: | They propose a distillation framework that empowers non-reasoning LLMs to think only when necessary. |
| Outcome: | The proposed framework reduces reasoning length up to 71% with minimal accuracy loss while preserving accuracy. |
Copied to clipboard
| Challenge: | Existing approaches to training document conversion models with manual annotation are costly and time-consuming, and training student models by distilling outputs from teacher models can significantly limit their performance in real-world applications. |
| Approach: | They propose a fully automated framework for constructing high-quality document extraction datasets and models capable of handling diverse document formats and layouts. |
| Outcome: | The proposed model outperforms existing models and improves on annotated documents. |
Copied to clipboard
| Challenge: | Differentiable Search Index (DSI) is a new information retrieval framework . however, due to the black-box nature of the end-to-end neural architecture, it remains unclear to what extent it possesses basic indexing and retrieval abilities. |
| Approach: | They propose a multi-task distillation approach to enhance the retrieval quality without altering the structure of the model. |
| Outcome: | The proposed method outperforms baselines on various datasets. |
Copied to clipboard
| Challenge: | Existing machine translation systems obscure or mistranslate key terminology, while paraphrasing aimed at lay readers often oversimplifies it, hindering their ability to master domain-specific technical vocabulary. |
| Approach: | They propose a task which produces translations dynamically adapted to a reader’s academic proficiency, or level, and a framework to address this challenge. |
| Outcome: | The proposed framework achieves higher scores than baselines on a synthesized benchmark and human evaluations. |
Copied to clipboard
| Challenge: | Recent studies suggest that fixing the routers can achieve competitive performance by alleviating the collapsing problem, where all experts eventually learn similar representations. |
| Approach: | They propose a method that dynamically generates router parameters through a fixed hypernetwork and trainable embeddings to achieve a balance between training the routers and freezing them to learn an improved routing policy. |
| Outcome: | Experiments on a wide range of tasks show that the proposed method performs better than existing methods. |
Copied to clipboard
| Challenge: | Existing neural semantic parsers require a large amount of training data which is expensive and difficult to obtain. |
| Approach: | They propose a framework for a supervised retrieval system based on pretrained language models . they propose ambiguous supervision to improve the precision and coverage of the task . |
| Outcome: | The proposed approach outperforms state-of-the-art zero-shot parsing methods in ambiguous supervision. |
Copied to clipboard
| Challenge: | Recent advances in pre-trained language models have made it possible to generate human-like text. |
| Approach: | They propose to integrate an open-ended text adventure game in Chinese, named KuiLeiXi, where players interact with the AI until the plot goals are reached. |
| Outcome: | The proposed game lacks incentives and relies on players to explore on their own. |