Papers by Cheng Luo
Copied to clipboard
| Challenge: | Existing large language model (LLM) agents are unable to adapt to changing domain knowledge and rules. |
| Approach: | They propose an LLM agent framework that continuously learns updated domain knowledge at test time. |
| Outcome: | The proposed agent improves on a customer due diligence name screening task on . the agent learns updated domain knowledge at test time. |
Copied to clipboard
| Challenge: | Existing studies have shown that adapter-based tuning is more parameter-efficient than fine-tuning. |
| Approach: | They propose to add adapter modules to a pretrained language model and update the parameters of adapter module when learning on a downstream task. |
| Outcome: | The proposed method outperforms fine-tuning on low-resource and cross-lingual tasks and settings. |
Copied to clipboard
| Challenge: | Empirical results show that CCLM significantly outperforms the prior state-of-the-art with an average absolute improvement of over 10%. |
| Approach: | They introduce a pre-training framework that unifies cross-lingual and cross-modal pre-trained models with shared architectures and objectives. |
| Outcome: | The proposed framework outperforms the state-of-the-art in two multi-lingual datasets and two multilingual image-text retrieval datasets. |
Copied to clipboard
| Challenge: | Existing approaches to visual question answering (VQA) are not suitable for real-world applications. |
| Approach: | They propose a supervised multi-modal domain adaptation method for visual question answering in images that exploits supervised domain adaptation. |
| Outcome: | The proposed method outperforms state-of-the-art methods on the benchmark VQA 2.0 and VizWiz datasets. |
Copied to clipboard
| Challenge: | Existing LLMs operate as an opaque process without explicit separation between knowledge retrieval and reasoning steps, making the decision-making process unclear and disorganized. |
| Approach: | They propose a language model inference paradigm that decomposes the complex inference process into two distinct and clear actions: (1) memory recall: which retrieves relevant knowledge, and (2) reasoning: which performs reasoning steps based on the recalled knowledge. |
| Outcome: | The proposed paradigm decomposes the inference process into two distinct and clear actions, memory and reason, guiding the model to distinguish between steps that require knowledge retrieval and those that involve reasoning. |
Copied to clipboard
| Challenge: | Existing methods to optimise pretraining performance have not addressed the complexities of domain-adaptive continual pretraining. |
| Approach: | They propose a framework that dynamically assesses learning velocity and adjusts data proportions accordingly, favouring slower learning domains while de-emphasising faster learning ones. |
| Outcome: | The proposed framework achieves performance gains in math and code reasoning tasks and command-line generation benchmarks. |
Copied to clipboard
| Challenge: | Natural language inference (NLI) tasks are difficult to perform on large datasets . a small number of simple sentences can improve model performance, authors say . |
| Approach: | They propose to use syntactically simple sentences to test the inference ability of NLI models. |
| Outcome: | The proposed set of simple sentences shows that the models fine-tuned on MNLI and SNLI perform poorly on Simple Pair. |
Copied to clipboard
| Challenge: | Current methods for multimodal sarcasm target identification focus on superficial indicators in an end-to-end manner, overlooking the nuanced understanding of multimodal content. |
| Approach: | They propose a multimodal sarcasm target identification framework with a coarse-to-fine paradigm by augmenting sarcasm explainability with reasoning and pre-training knowledge. |
| Outcome: | The proposed framework outperforms state-of-the-art methods and exhibits explainability in deciphering sarcasm as well. |
Copied to clipboard
| Challenge: | Retrieval-augmented Large Language Models struggle with complex inputs and noisy knowledge retrieval hindering model effectiveness. |
| Approach: | They propose a query generation method that integrates query generation blending with knowledge filtering to enhance retrieval-augmented LLMs. |
| Outcome: | The proposed approach surpasses state-of-the-art benchmarks on open-domain question answering benchmarks. |
Copied to clipboard
| Challenge: | Large Language Models (LLMs) excel in various domains but face challenges when applied to data science workflows due to their complex, multi-stage nature. |
| Approach: | They propose a hierarchical graph-based agent that represents complexity and a progressive strategy for step-by-step verification, refinement, and consistent context management. |
| Outcome: | The proposed agent surpasses state-of-the-art baselines on the MATH dataset and performs better on InfiAgent-DABench. |
Copied to clipboard
| Challenge: | Existing methods for improving multilingual models did not focus on learning the semantic structure of representation. |
| Approach: | They propose a method to improve multilingual language models by aligning parallel sentences . they propose token-, word-, sentence- and structure-level alignment objectives . |
| Outcome: | The proposed method outperforms baseline models on XNLI, PAWS-X, and XQuAD . it obtains comparable performance on low-resource languages, the authors show . |
Copied to clipboard
| Challenge: | Existing models for stock price movement prediction use auxiliary data, but we assume other stocks should be utilized as auxiliary information to enhance performance. |
| Approach: | They propose a Causality-guided multi-memory interaction network for stock movement prediction which transforms basic attention into Causal Attention by calculating transfer entropy between multivariate stocks. |
| Outcome: | The proposed model outperforms existing models on three real-world datasets from the U.S. and Chinese markets. |
Copied to clipboard
| Challenge: | a new text generation dataset is needed to controllable text summarization, but it lacks the domain knowledge. |
| Approach: | They propose to use existing text generation datasets to leverage input and control signals . they propose to annotate each meta-review sentence manually with a control signal . |
| Outcome: | The proposed method can be used to control the structure of a text generation dataset . it can be applied to a variety of tasks, including a task with a large number of meta-review sentences . |
Copied to clipboard
| Challenge: | Argument pair extraction (APE) is a research task for extracting arguments from two passages and identifying potential argument pairs. |
| Approach: | They propose a novel attention-guided multi-layer multi-cross encoding scheme that processes two passages with two individual sequence encoders and updates their representations using each other’s attention. |
| Outcome: | The proposed model significantly improves the performance over several alternatives. |
Copied to clipboard
| Challenge: | Existing rule-based chunking methods lead to suboptimal splits, where overly large chunks introduce irrelevant information and small chunks lack semantic coherence. |
| Approach: | They propose a method that leverages document summaries as pseudo-instructions to guide chunking by computing semantic similarity between sentences and the summary. |
| Outcome: | Experiments on multiple open-domain question-answering benchmarks show that PIC significantly improves retrieval accuracy (Hits@k) and end-to-end QA performance (Exact Match) without any additional training. |
Copied to clipboard
| Challenge: | Long-context extension attempts to extend contextual window in pre-trained LLMs . primary method involves expanding initial positional encodings, disrupting positional learning . |
| Approach: | They propose a new extension strategy based on Rotary Position Embedding to extend contextual window in pre-trained large language models. |
| Outcome: | The proposed method can extend the contextual window in pre-trained large language models . expansion disrupts positional encodings learned during pre-training, authors show . |
Copied to clipboard
| Challenge: | Existing training paradigms fail to explicitly target factual accuracy, resulting in inaccuracies and serious patient safety risks. |
| Approach: | They propose an automatic and generalizable report evaluation technique that uses question proposing and answering to enable controllable, structured reasoning grounded in medical domain knowledge and the factual correctness of the report. |
| Outcome: | The proposed method can improve human preference scores and perform better on downstream tasks. |
Copied to clipboard
| Challenge: | Existing language model agents excel in planning and reasoning, but lack creativity in unfamiliar environments. |
| Approach: | They propose a benchmark suite of room escape game environments to challenge agents with creative reasoning, unconventional tool use and iterative problem-solving to uncover implicit goals. |
| Outcome: | The proposed framework can perform with 40% fewer steps and hints and performs robustly across difficulty levels. |
Copied to clipboard
| Challenge: | Tabular data analysis is an important application task of large language models, but advanced models are not yet on par with expert level performance. |
| Approach: | They propose to employ Large Language Models to facilitate an automated guide and execute high-precision data analyzes on tabular datasets. |
| Outcome: | The proposed framework is based on large language models and an automated machine learning pipeline for predictive modeling. |
Copied to clipboard
| Challenge: | Existing supervised neural methods are underexplored for coreference resolution, especially in incremental clustering. |
| Approach: | They propose a dual-threshold incremental clustering approach based on a lightweight Transformer. |
| Outcome: | Experiments on common benchmarks show that MEIC-DT achieves highly competitive coreference performance under stringent memory constraints. |
Copied to clipboard
| Challenge: | Existing answer selection approaches for community question answering lack additional answer summaries due to redundancy and lengthiness issues of crowdsourced answers. |
| Approach: | They constructed a dataset which contains a corresponding reference summary for each original lengthy answer. |
| Outcome: | The proposed model improves the performance of a question and candidate answer on a WikiHowQA dataset. |
Copied to clipboard
| Challenge: | Existing approaches to tool invocation are often unnecessarily long and require lengthy reasoning paths. |
| Approach: | They propose a framework for stepwise code generation that improves LLM tool invocation . they incorporate two distinct process rewards: the On-the-spot and the Latent Reward . |
| Outcome: | The proposed framework improves LLM tool invocation by leveraging the concise nature of code. |
Copied to clipboard
| Challenge: | Structure-controlled summarization is a useful and interesting research direction . current structure-controlling methods have limited effectiveness in enforcing the desired structure. |
| Approach: | They propose a sentence-level beam search generation method to select suitable sentences for subsequent generations. |
| Outcome: | The proposed method significantly reduces structural discrepancies by 68% on a structure-controlled dataset. |
Copied to clipboard
| Challenge: | Generative world models could be used to enhance agents' cognition . agents are expected to operate in settings where tasks unfold over long horizons and involve intricate chains of interdependent decisions. |
| Approach: | They propose to use vision-language models as external simulators to enhance cognition . they find that agents rarely invoke simulation and misuse predicted rollouts . |
| Outcome: | The proposed model could be used to predict future states rather than short-horizon reasoning . the model could also be used for real-world planning and robotics . |
Copied to clipboard
| Challenge: | Existing relevance-based generative retrieval methods lack personalization, leading to a mismatch between diverse user expectations and the retrieved results. |
| Approach: | They propose a representation learning model that learns discriminative user representations to encode user-specific sticker preferences. |
| Outcome: | The proposed framework outperforms state-of-the-art methods in generating relevant stickers for queries. |
Copied to clipboard
| Challenge: | Existing methods for ad hoc dataset retrieval are lexical and cannot capture semantic similarity. |
| Approach: | They propose to implement and evaluate a set of implicit and explicit knowledge-enhancement retrieval methods on two test collections to find semantic matches for ad hoc dataset retrieval. |
| Outcome: | The proposed methods are compared with existing methods on two test collections and reveal the unique features of the task and suggest an interpolation of different kinds of methods as the current best practice. |
Copied to clipboard
| Challenge: | Argument mining (AM) is a computational process that is used to analyze information in a debating system. |
| Approach: | They propose to use a large dataset to automate the manual process of debating . they propose to integrate claim extraction, stance classification and evidence extraction tasks . |
| Outcome: | The proposed tasks can extract claims, stances, evidence and more from a large dataset . the proposed tasks are highly efficient and can be applied to argument mining tasks . |
Copied to clipboard
| Challenge: | Existing typography solutions lack adaptability, creativity, and computational efficiency. |
| Approach: | They propose a user-driven framework for artistic typography synthesis based on the Large Language Model (LLM) the LLM Engine interprets user inputs and generates actionable prompts for the other modules, transforming abstract concepts into tangible designs. |
| Outcome: | The proposed framework incorporates four key modules: the LLM Engine, SemTypo, StyTyPo, and TexTyPO. |
Copied to clipboard
| Challenge: | Existing knowledge graphs lack the ability to integrate structural information into LLMs and output predictions deterministically. |
| Approach: | They propose a method which encodes structural information of KGs and merges it with LLMs to enhance KGC performance. |
| Outcome: | The proposed method improves the performance of KG Completion datasets on KGs by integrating structural information with LLMs. |
Copied to clipboard
| Challenge: | Existing dense retrieval methods have achieved notable progress, but their effectiveness in legal case retrieval remains limited. |
| Approach: | They propose a self-evolving framework for rule-driven query rewriting that enhances BM25 without any parameter training. |
| Outcome: | The proposed framework outperforms non-evolutionary baselines, including human-designed rules and greedy rule selection, especially when powered by a high-capacity core LLM. |
Copied to clipboard
| Challenge: | Existing supervised neural methods for coreference resolution are underexplored . current methods rely on small language models, but their potential is underexploited . |
| Approach: | They propose a framework that integrates an enhanced supervised model with LLM-based reasoning. |
| Outcome: | The proposed method surpasses existing state-of-the-art methods in coreference resolution. |
Copied to clipboard
| Challenge: | Existing studies on large language models have limited evaluation of their geospatial cognition . a unified framework for evaluating geospcial cognition in LLMs remains absent . |
| Approach: | They propose a benchmark to evaluate the geospatial route cognition of Large Language Models . they propose 'pathbuilder' tool for converting natural language instructions into navigation routes . |
| Outcome: | The proposed framework and metrics evaluate 9 state-of-the-art LLMs on route reversal task. |
Copied to clipboard
| Challenge: | Global scientific publications are growing annually by about 4%-5% (Pinedo et al., 2024). |
| Approach: | They introduce an AI-assisted platform that answers diverse questions from researchers using Retrieval-Augmented Generation (RAG) they develop various tools to understand queries, search from the scientific literature, filter retrieved information, provide accurate and comprehensive answers, and self-refine answers. |
| Outcome: | OpenResearcher is built on Retrieval-Augmented Generation (RAG) to integrate Large Language Models (LLMs) with up-to-date, domain-specific knowledge. |
Copied to clipboard
| Challenge: | Existing multilingual neural machine translation models fail to capture diversity and specificity of different languages, resulting in inferior performance against individual models that are sufficiently trained. |
| Approach: | They propose to integrate a language-aware interlingua into an Encoder-Decoder architecture to learn a semantic representation from the semantic spaces of different languages while allowing for language-specific specialization of a particular language pair. |
| Outcome: | The proposed model achieves remarkable improvements over state-of-the-art multilingual NMT models and produces comparable performance with strong individual models. |
Copied to clipboard
| Challenge: | Positional biases in large language models hinder their ability to process long inputs. |
| Approach: | They propose a benchmark to assess positional bias in large language models involving multiple pieces of relevant information. |
| Outcome: | The proposed benchmark assesses the performance of long-context language models by examining their models with different input lengths and tasks. |
Copied to clipboard
| Challenge: | RAG systems that integrate external knowledge with Large Language Models often become bottlenecks due to their limited parameters compared to LLMs and their inability to perform step-by-step reasoning. |
| Approach: | They propose a model that integrates external knowledge with Large Language Models to enhance factual correctness and mitigate hallucination. |
| Outcome: | The proposed model outperforms baselines and can transfer well to different retrievers. |
Copied to clipboard
| Challenge: | Existing approaches to learning models (LMs) incorporate old task data or task-wise inductive bias into LMs, but old data and accurate task information are often unavailable or costly to collect. |
| Approach: | They propose a rehearsal-free method that updates model parameters with large magnitudes . they found that the L1-normalized magnitude distribution is different when different task data is used . |
| Outcome: | The proposed method improves accuracy and performance on four CL benchmarks. |
Copied to clipboard
| Challenge: | Existing benchmarks for evaluating long-context language models employ irrelevant noise texts to artificially extend the length of test cases, diverging from the real-world scenarios of long-constituency applications. |
| Approach: | They propose a long-context benchmark, Loong, aligning with realistic scenarios through extended multi-document question answering (QA) . |
| Outcome: | The proposed model can scale up the context window of large language models to perform in-depth analysis of multiple long documents. |
Copied to clipboard
| Challenge: | Existing studies show that training LLMs on data containing unfamiliar knowledge during instruction tuning can encourage hallucinations. |
| Approach: | They propose a framework that measures how familiar the LLM is with instruction data and introduce an expert-aligned reward model to ensure the quality of selected samples. |
| Outcome: | The proposed framework reduces hallucinations while maintaining a competitive ability to follow instructions. |
Copied to clipboard
| Challenge: | Pre-trained language models (PLMs) are often easily deceived by tricky questions such as “How many eyes does the sun have?” . |
| Approach: | They annotate a FalseQA dataset containing 2365 human-written FPQs and find that PLMs are capable of discriminating FPqs by fine-tuning on moderate numbers. |
| Outcome: | The proposed model can discriminate on FPQs by fine-tuning on moderate numbers of examples and generate reasonable explanations for false premise questions. |
Copied to clipboard
| Challenge: | Existing methods for quantifying uncertainty in large language models with black-box API access are limited due to the complex data distributions and inner model mechanism. |
| Approach: | They propose a conformal prediction method that minimizes the size of prediction sets and ensures a statistical guarantee of the user-defined coverage. |
| Outcome: | The proposed method outperforms existing methods on close-ended and open-ended questions. |
Copied to clipboard
| Challenge: | Code LLMs lack reproducible data pipelines and training protocols for reproducible advancements in code intelligence. |
| Approach: | They propose a top-tier code LLM that releases model weights and inference code . reproducible data pipelines, rigorous experimental ablation results and training protocols are included . |
| Outcome: | The proposed model achieves comparable performance to leading models and serves as an "open cookbook" reproducible training data, rigorous experimental ablation results, and detailed training protocols are also included in the model. |
Copied to clipboard
| Challenge: | Large Language Models (LLMs) have demonstrated remarkable linguistic comprehension and generation capability, but when applied to specialized industries, they face challenges such as hallucination, insufficient domain knowledge, and failing to incorporate the latest domain knowledge. |
| Approach: | They propose a paradigm for fine-tuning LLMs that effectively injects domain-specific knowledge while safeguarding inference-time data privacy. |
| Outcome: | The proposed model protects private data while enhancing the model's knowledge. |
Copied to clipboard
| Challenge: | a novel evaluation framework assesses the capabilities of Large Language Models (LLMs) for editorial capabilities in Chinese journalism. |
| Approach: | They propose to use a benchmark dataset to assess the capabilities of Large Language Models (LLMs) for editorial capabilities in Chinese journalism. |
| Outcome: | The proposed evaluation framework is based on a dataset of 1,267 test samples in 24 news domains. |
Copied to clipboard
| Challenge: | Reinforcement Learning with Verifiable Rewards (RLVR) has improved reasoning capabilities of Large Language Models (LLMs). |
| Approach: | They propose an online pruning method that prunes rollouts while steering correct ones to enhance learning signals. |
| Outcome: | The proposed method improves average accuracy by +2.30 to +2.99 across GRPO and DAPO on Qwen-3 and LLaMA-3.2 models. |
Copied to clipboard
| Challenge: | a library to facilitate the development, use, and evaluation of large language models (LLMs) is presented. |
| Approach: | They propose a unified library to facilitate the development, use and evaluation of large language models (LLMs). |
| Outcome: | The proposed library is based on extensive experiments in a variety of evaluation settings. |
Copied to clipboard
| Challenge: | Existing studies have neglected the systematic design and procedure evaluation of court simulations, which are critical to the credibility and usage of court simulators in practice. |
| Approach: | They propose a court simulation paradigm based on the real-world procedure structure of Chinese courts and a framework that focuses on both legal judgment prediction and court procedure analysis. |
| Outcome: | The proposed model outperforms judges and lawyers from the real trials in many aspects. |
Copied to clipboard
| Challenge: | Biomedical data-to-text generation is a branch of Natural Language Generation, aiming at generating textual natural language descriptions that can fluently and precisely describe the structured data. |
| Approach: | They propose an LLM framework that can be used to generate textual natural language descriptions using in-context learning. |
| Outcome: | The proposed framework provides good interpretability and superior performance on the BioLeaflets dataset. |
Copied to clipboard
| Challenge: | Existing knowledge graphs focus on connecting intentions but lacks the ability to model the relationships between different intentions. |
| Approach: | They propose a framework to automatically generate an intention knowledge graph, capturing connections between user intentions. |
| Outcome: | The proposed model outperforms state-of-the-art methods and shows its utility. |
Copied to clipboard
| Challenge: | Recent results show that prompting methods are inefficient for slot tagging tasks . inverse prompting only requires a one-turn prediction for each slot type . |
| Approach: | They propose an inverse prompting paradigm that reversely predicts slot values given slot types . the method is faster and significantly improves the effect on 10-shot setting . |
| Outcome: | The proposed method improves over 6.1 F1-scores on 10-shot setting and achieves new state-of-the-art performance. |
Copied to clipboard
| Challenge: | Existing LLM-based Chinese spelling check methods rely on fixed prompt samples . existing methods are limited by technical bottlenecks, complex recognition environments, and individual differences . |
| Approach: | They propose a framework called RagID to provide well-chosen prompt samples . they propose to use semantic-based similarity search and iterative discriminator mechanism . |
| Outcome: | The proposed framework can provide well-chosen prompt samples and reduce overcorrection issues in Chinese spelling check tasks. |
Copied to clipboard
| Challenge: | Existing generative models lack the capacity for explicit and controllable reasoning, a key advantage of LLMs. |
| Approach: | They propose a framework that integrates dialogue, reasoning, and personalized recommendation. |
| Outcome: | Experiments across public benchmarks show state-of-the-art performance. |
Copied to clipboard
| Challenge: | Current approaches to addressing knowledge outdating in LLMs struggle with retrieval and generation aspects when handling outdated information. |
| Approach: | They propose a benchmark to evaluate the impact of outdated information on RAG . they use token-level diff algorithms and LLM pipelines to create a large-scale QA dataset . |
| Outcome: | The proposed benchmark analyzes the impact of outdated information on RAG performance. |
Copied to clipboard
| Challenge: | Existing LLMs are difficult to achieve satisfactory results in table-related tasks. |
| Approach: | They propose to develop a specialized logical table-to-text generation model that can be used for table-related tasks. |
| Outcome: | The proposed model achieves state-of-the-art on a Logic2Text dataset. |
Copied to clipboard
| Challenge: | Existing models for knowledge-to-text generation use RDF triples or key-value pairs to generate a natural language description. |
| Approach: | They propose a large-scale dataset to facilitate the study of KG-to-text . they propose MGCN model architecture that incorporates aggregation methods to extract the rich graph information. |
| Outcome: | The proposed model can represent the original graph information more comprehensively and integrates multiple aggregation methods to extract the rich graph information. |
Copied to clipboard
| Challenge: | Argument mining is an important research field that attracts growing attention in recent years. |
| Approach: | They propose a new task to extract argument pairs from peer review and rebuttal . they use an open review platform to analyze the contents, structure and connections . |
| Outcome: | The proposed task is based on a dataset of 4,764 fully annotated review-rebuttal passage pairs . it is able to detect argumentative propositions and extract argument pairs from the corpus . |