Papers by Lin Yuan
Copied to clipboard
| Challenge: | Existing data selection techniques are designed for small data pools, a study finds . filtering data by token length is an efficient method for improving results . |
| Approach: | They use self-scoring methods that do not rely on external help to perform fine-tuning . they also find that filtering data by token length offers a stable and efficient method . |
| Outcome: | The proposed methods outperform random selection on large datasets on large data pools. |
Copied to clipboard
| Challenge: | Recent studies have shown that Transformers is implicitly learning syntactic information from data, albeit is highly dependent on the quality and scale of the training data. |
| Approach: | They propose a syntax-guided localized self-attention model that allows directly incorporating grammar structures from an external constituency parser. |
| Outcome: | The proposed model improves translation performance on a variety of datasets, from small to large datasets and with different source languages. |
Copied to clipboard
| Challenge: | Large Language Models exhibit a significant performance gap in Information Extraction (IE) high-quality instruction data is the vital key for enhancing LLMs' specific capabilities . |
| Approach: | They propose a bilingual (English and Chinese) IE instruction corpus that contains 0.32B tokens. |
| Outcome: | The proposed model improves the performance of LLMs for IE with zero-shot generalization. |
Copied to clipboard
| Challenge: | a number of tools are used to perform complex tasks, but the tool utilization process can cause errors. |
| Approach: | They propose a critique evaluation benchmark for tool learning that analyzes function-calling errors on tool evaluation benchmarks. |
| Outcome: | The proposed critique evaluation benchmark holds diverse tool-use errors with varying complexities, which better reflects real-world scenarios. |
Copied to clipboard
| Challenge: | Existing methods for deep semantic retrieval are highly sensitive to hyper-parameters . a novel adaptive metric learning method is proposed to overcome this limitation . |
| Approach: | They propose a method that adaptively obtains hyper-parameters without fixed or extra-trainable hyper-parmeters . they adopt a symmetric metric learning method to mitigate model collapse issues . |
| Outcome: | The proposed method outperforms existing methods on a real-world dataset and brings economic benefits. |
Copied to clipboard
| Challenge: | Recent LLM-based search agents often concatenate the full interaction history into the context, producing long and noisy inputs and increasing compute cost and memory overhead. |
| Approach: | They propose an agent framework that maintains a compact memory during multi-turn interactions. |
| Outcome: | The proposed framework outperforms strong history-concatenation (ReAct-style) baselines on a range of public datasets while maintaining nearly constant token counts across multi-turn interactions. |
Copied to clipboard
| Challenge: | Existing query classification methods rely on posterior click behavior to construct training samples, resulting in insufficient prior information for modeling. |
| Approach: | They propose a semi-supervised scaleable unified framework that integrates enhanced modules to unify query classification tasks. |
| Outcome: | The proposed framework outperforms the state-of-the-art models in offline and online A/B experiments. |
Copied to clipboard
| Challenge: | Existing research on inductive reasoning models emphasizes rule design without grounding them in specific scenarios. |
| Approach: | They propose to use LLMs to learn underlying patterns from limited examples in entirely new environments. |
| Outcome: | The proposed benchmark evaluates the inductive reasoning abilities of large language models in scientific settings. |
Copied to clipboard
| Challenge: | In-context learning is a new learning paradigm where a language model conditions on a few input-output pairs (demonstrations) and a test input, and directly outputs the prediction. |
| Approach: | They propose a single model to retrieve demonstrations for a wide range of tasks by combining training signals from various tasks into a unified list-wise ranking formulation by language model’s feedback. |
| Outcome: | The proposed model outperforms baselines on 30+ tasks across 13 task families and multiple data domains. |
Copied to clipboard
| Challenge: | Existing presentation agents rely on predefined workflows and fixed templates to generate presentations. |
| Approach: | They propose an agentic framework that adapts to diverse user intents and iterative refinement based on observation. |
| Outcome: | The proposed framework can be used to generate presentations with environmental observations. |
Copied to clipboard
| Challenge: | Existing Large Language Models (LLMs) mainly address isolated tasks such as emotion analysis or stance detection. |
| Approach: | They propose a large-scale model that combines large-level annotations with hyperbolic space to model human cognitive states. |
| Outcome: | The proposed model outperforms baseline models on cognitive dimensions on single dimension tasks while retaining strong hierarchical structure. |
Copied to clipboard
| Challenge: | Pre-trained language models have enabled deep neural networks to perform natural language understanding tasks, but their performance can drastically deteriorate when logical reasoning is needed. |
| Approach: | They propose a framework for NLU based on analogical reasoning based upon neural processing and logical reasoning using both neural and symbolic processing. |
| Outcome: | The proposed framework outperforms state-of-the-art methods on two NLU tasks, question answering (QA) and natural language inference (NLI). |
Copied to clipboard
| Challenge: | Document images are characterized by higher resolutions, denser content, and more complex structural layouts. |
| Approach: | They propose a 1.2B-parameter document parsing vision-language model that decouples layout analysis from local content recognition. |
| Outcome: | The proposed model surpasses general-purpose and domain-specific models on multiple benchmarks while maintaining significantly lower computational overhead. |
Copied to clipboard
| Challenge: | Existing meta-learning models rely on implicit instance statistics and are unreliability and weak interpretability. |
| Approach: | They propose a meta-information guided meta-learning framework that uses semantics to guide meta- learning . experimental results demonstrate the effectiveness of the proposed framework . |
| Outcome: | The proposed framework can establish connections between instance-based information and semantic-based data, enabling faster initialization and adaptation. |
Copied to clipboard
| Challenge: | Large Language Models (LLMs) acquire a wide range of abilities during pre-training, but aligning LLMs under Reinforcement Learning with Human Feedback (RLHF) can lead to forgetting pretrained abilities, which is also known as the alignment tax. |
| Approach: | They propose to use a model averaging technique to find the most powerful alignment-forging Pareto front among RLHF algorithms. |
| Outcome: | The proposed method achieves the strongest alignment-forging Pareto front among competing methods. |
Copied to clipboard
| Challenge: | Existing methods to extract emotions and causes from unannotated text are pipelined, causing error propagation. |
| Approach: | They propose to transform a task into a procedure of parsing-like directed graph construction . they propose to generate a directed graph with labeled edges based on a sequence of actions . |
| Outcome: | The proposed method outperforms the state-of-the-art methods by 6.71% (p0.01) in F1 measure. |
Copied to clipboard
| Challenge: | Large Language Models have shown promising results in coreference resolution, but they face a critical issue: hallucinations. |
| Approach: | They propose a low-hallucination and efficient solution to the problem of hallucinations . they propose efficient constrained decoding for coreference resolution . |
| Outcome: | The proposed approach achieves better performance on the English OntoNotes development set. |
Copied to clipboard
| Challenge: | Named entity recognition (NER) is a fundamental task of information extraction. |
| Approach: | They propose to perform randomization tests on standard NER benchmarks to examine name regularity, mention coverage and context diversity. |
| Outcome: | The proposed model performs better on standard NER benchmarks than other models on open datasets. |
Copied to clipboard
| Challenge: | Large language model agents have enabled GUI-based automation, but their deployment is limited by noisy data, poor generalization, and lack of support for non-English GUIs. |
| Approach: | They propose an 8B-parameter GUI agent built for robust and efficient on-device GUI interaction. |
| Outcome: | The proposed GUI agent achieves promising performance on five public benchmarks and proposed Chinese benchmark CAGUI. |
Copied to clipboard
| Challenge: | Analogical reasoning plays a critical role in human cognition, enabling us to understand new concepts by associating them with familiar ones. |
| Approach: | They propose to use free-form analogies to aid students in understanding scientific concepts . they also show that analogies generated by student LMs can improve their own performance . |
| Outcome: | The proposed model can help students understand scientific concepts, the authors show . |
Copied to clipboard
| Challenge: | a lack of benchmarks capture real-world, cross-platform heterogeneity in GUI training . traditional methods to train GUI agents rely on centralized data collection and manual labeling . |
| Approach: | They propose a benchmark for developing and evaluating federated GUI agents across mobile, web and desktop platforms. |
| Outcome: | The proposed benchmarks show that cross-platform collaboration improves performance and identify platform and OS as the most influential factors. |
Copied to clipboard
| Challenge: | Existing instruction data synthesis methods focus on single-turn instructions and neglect cross-turn coherence, resulting in context drift and reduced task completion rates. |
| Approach: | They propose a framework that constrains multi-turn instruction synthesis by explicitly modeling human conversational intent. |
| Outcome: | The proposed framework outperforms existing models trained on single-turn and multi-turn instruction datasets. |
Copied to clipboard
| Challenge: | In-battle commentary is an important component of live streaming of e-sports competitions and is applicable to a wide range of scenarios like combat information analysis and live streaming. |
| Approach: | They propose a generative system for in-battle real-time commentary in mobile MOBA games and propose 'transform' method to convert match statistics and utterances into consistent encoding space. |
| Outcome: | The proposed system is based on real-time match statistics and events and can be used for live streaming, e-sports commentary and combat information analysis. |
Copied to clipboard
| Challenge: | Existing algorithms for achieving optimal alignment are mostly unidirectional . a recent study suggests that large language models can be ground with evident preferences . |
| Approach: | They propose to ground large language models with evident preferences . they propose to use controllable preference optimization to specify different objectives . |
| Outcome: | The proposed models can provide responses that match various preferences among the ”3H” desiderata. |
Copied to clipboard
| Challenge: | Large Language Models struggle to adapt content to users with differing cognitive capacities, leading to cognitive misalignment. |
| Approach: | They propose a cognitive-level alignment framework that aligns both knowledge complexity and presentation style with user cognition. |
| Outcome: | The proposed framework aligns knowledge complexity and presentation style with user cognition. |
Copied to clipboard
| Challenge: | Recent studies have shown promising results of prompt tuning in stimulating pre-trained language models (PLMs) for natural language processing tasks. |
| Approach: | They propose a prompt tuning framework that reformulates NLP tasks into a discriminative language modeling problem. |
| Outcome: | The proposed framework improves on text classification and question answering tasks and prevents unstable tuning problems in low-resource settings. |
Copied to clipboard
| Challenge: | Recent work adapts textual transcreation to image editing and formulates image transcreations to better match a target audience while preserving meaning. |
| Approach: | They propose a two-stage planner-editor pipeline in which an VLM planner specifies executable edits and an image editor renders them. |
| Outcome: | The proposed model can transcreate a visual asset for a different market while preserving its identity while matching market-specific design preferences and multilingual typography. |
Copied to clipboard
| Challenge: | Existing approaches to visual-language understanding lack unified tokenization for images and videos . lack of unified visual representations makes it difficult to learn multi-modal interactions from poor projection layers. |
| Approach: | They propose to unify visual representation into the language feature space to advance the foundational LLM towards a unified LVLM. |
| Outcome: | The proposed model outperforms Video-ChatGPT on image benchmarks and on 9 image benchmark benchmarks. |
Copied to clipboard
| Challenge: | Existing quantization methods are compromising performance of large language models (LLMs) despite their high computational intensity, LLMs are still demanding intensive computation. |
| Approach: | They propose to generate the KV cache of pivot tokens losslessly from the full-precision model. |
| Outcome: | The proposed method generates the KV cache of pivot tokens losslessly from the full-precision model with no extra inference overhead. |
Copied to clipboard
| Challenge: | Existing benchmarks evaluate temporal reasoning and planning in isolation and under limited forms of complexity. |
| Approach: | They propose a temporal constraint-based planning benchmark that assesses temporal reasoning and planning capabilities in large language models. |
| Outcome: | The proposed model fails to perform well under limited constraints and lacks temporal grounding. |
Copied to clipboard
| Challenge: | Existing methods for parameter-efficient fine-tuning (PEFT) are limited by computational costs and performance degradation. |
| Approach: | They propose a method that integrates Low-Rank Adaptation and Mixture-of-Experts (MoE) they propose combining expert load imbalance and representation collapse to improve LLM performance . |
| Outcome: | The proposed method outperforms homogeneous MoE-LoRA architectures in performance and parameter efficiency. |
Copied to clipboard
| Challenge: | Existing approaches to self-reflection fail to deliver robust response refinement for models with parameter sizes of 10 billion or smaller. |
| Approach: | They propose to redesign Self-Refine and introduce an information-theoretic framework based on Chain-of-Thought prompt engineering to improve self-reflection in Small Language Models. |
| Outcome: | The proposed framework improves reasoning accuracy and computational efficiency by up to 36.2% under identical model and data settings. |
Copied to clipboard
| Challenge: | Retrieval augmentation is effective for large graph parsing tasks, but can fail to identify the most informative exemplars . structure-aware and uncertainty-guided adaptive retrieval (SUGAR) exploits two unique sources of information: structural similarity and model uncertainty. |
| Approach: | They propose a structure-aware and uncertainty-guided adaptive retrieval approach that exploits structural similarity and model uncertainty to improve retrieval-augmented parsing for complex graph problems. |
| Outcome: | The proposed method improves retrieval-augmented parsing for graph parsers with large output graphs and non-trivial structure. |
Copied to clipboard
| Challenge: | Existing machine reading comprehension tasks lack interactive information-seeking component of comprehension. |
| Approach: | They propose a question-asking task that asks questions in a text-based environment . they propose QAit, which uses a game generator to build models that include deep reinforcement learning agents. |
| Outcome: | The proposed task poses questions about existence, location, and attributes of objects found in environment. |
Copied to clipboard
| Challenge: | Automated theorem proving (ATP) benchmarks focus on symbolic inference but rarely involve understanding complex number combination reasoning. |
| Approach: | They propose a benchmark that requires a model to reduce a trigonometric expression with step-by-step proof and evaluates a generative LM’s reasoning ability on formulas and ability to manipulate, group, and factor number terms. |
| Outcome: | The proposed benchmark evaluates a generative LM’s reasoning ability on formulas and ability to manipulate, group, and factor number terms. |
Copied to clipboard
| Challenge: | Existing approaches to reasoning faithfulness violate constraints, authors say . a science fantasy series and companion books are among the books . |
| Approach: | They propose a framework that enforces verification over internal belief states within the agent before action commitment, achieving faithful reasoning. |
| Outcome: | The proposed framework improves reasoning faithfulness while preserving competitive end-task performance. |
Copied to clipboard
| Challenge: | Existing datasets and benchmarks focus only on patents or cover limited aspects of the IP field, lacking alignment with real-world scenarios. |
| Approach: | They propose a bilingual IP task taxonomy and a large-scale bilingual benchmark to evaluate LLMs in real-world IP practice. |
| Outcome: | The proposed model achieves only 75.8% accuracy, indicating room for improvement . open-source IP and law-oriented models lag behind closed-source general-purpose models . |
Copied to clipboard
| Challenge: | a recent study shows that large language models have limited generalization in low-resource languages like Chinese. |
| Approach: | They propose to evaluate the zero-shot generalizability of large language models to the Chinese language . they release only half of the dataset publicly, with the remainder kept private . |
| Outcome: | The Chinese Instruction-Following Benchmark evaluates the generalizability of LLMs to the Chinese language. |
Copied to clipboard
| Challenge: | Existing OpenRE methods cast different relation types in isolation without considering their hierarchical dependency. |
| Approach: | They propose a framework to establish bidirectional connections between OpenRE and relation hierarchies by integrating hierarchy information into relation representations. |
| Outcome: | The proposed framework outperforms state-of-the-art models on relation clustering and hierarchy expansion. |
Copied to clipboard
| Challenge: | a rapid proliferation of large language models (LLMs) generate text that increasingly resembles human writing . this makes it difficult to capture subtle cues that distinguish AI-generated content from human-written content . |
| Approach: | They propose a framework that disentangles AI-detection semantics from generator-aware artifacts by latent encoding and perturbation-based regularization. |
| Outcome: | The proposed framework disentangles AI-detection semantics from generator-aware artifacts on 20 representative LLMs across 7 categories. |
Copied to clipboard
| Challenge: | Despite LLMs' impressive capabilities in musical knowledge, music reasoning remains an unsolved task. |
| Approach: | They propose an open-source large language model (LLM) that integrates intrinsic musical abilities into LLaMA2 and GPT-3.5. |
| Outcome: | The proposed model can understand and generate music with a pure text tokenizer without external multi-modal neural structures or tokenizers. |
Copied to clipboard
| Challenge: | Existing methods to extract relational facts from open domain corpora are time-consuming and human-intensive. |
| Approach: | They propose a framework to learn similarity metrics of relations from labeled data . they propose to transfer relational knowledge to identify novel relations in unlabeled data. |
| Outcome: | Experiments on two real-world datasets show that the proposed framework improves compared with state-of-the-art methods. |
Copied to clipboard
| Challenge: | Existing approaches to safety alignment of large language models rely on costly manual annotations or human review. |
| Approach: | They propose a closed-loop reinforcement learning framework called TriPlay-RL that enables iterative collaboration among three roles with near-zero manual annotation. |
| Outcome: | The proposed framework achieves 20%–50% improvement in adversarial effectiveness while preserving high output diversity while achieving 10%–30% gains in safety performance without degrading general reasoning capability. |
Copied to clipboard
| Challenge: | Existing studies have found that when LLMs are given criminal facts and legal rules, then asked whether cases constitute a certain charge, they struggle to understand legal theories and perform basic legal reasoning tasks. |
| Approach: | They propose a task to assess LLMs' understanding of legal theories and reasoning capabilities by using a novel framework: Multi-Agent framework for improving complex legal reasoning capability. |
| Outcome: | The proposed framework improves LLMs' understanding of legal theories and reasoning abilities in real-world scenarios. |
Copied to clipboard
| Challenge: | Existing topic modelling methods encode contextual information of documents while ignoring contextual details of candidate centroid words. Existing methods are limited by the contextualization gap. |
| Approach: | They propose a topic modelling method that builds upon candidate centroid word embeddings contextualized on the dataset and a self-similarity-based method to filter out less meaningful tokens. |
| Outcome: | The proposed method significantly enhances the coherence and diversity of generated topics, and handles noisy data, outperforming strong baselines. |
Copied to clipboard
| Challenge: | Recent advances in neural theorem-proving resort to large language models and tree searches. |
| Approach: | They propose a Dynamic-Tree Driven Theorem Solver to accommodate general theoremes by guiding the search procedure with state confidence and proof-level values. |
| Outcome: | The proposed method outperforms state-of-the-art methods on two popular theorem-proving datasets with a 6.65% improvement on average in terms of success rate. |
Copied to clipboard
| Challenge: | Language models can perform step-by-step reasoning and achieve high accuracy in both in-domain and out-of-domain tests via implicit reasoning. |
| Approach: | They train GPT-2 from scratch on a curated multi-step mathematical reasoning dataset and conduct analytical experiments to investigate how language models perform implicit reasoning in multi- step tasks. |
| Outcome: | The proposed model performs better on multi-step tasks than the explicit reasoning model. |
Copied to clipboard
| Challenge: | Existing evaluation benchmarks for text-to-audio-video (T2AV) generation are largely designed for human-recorded videos or single-speaker settings. |
| Approach: | They propose a failure-driven diagnostic benchmark for multi-talker dialogue-centric audio-video generation. |
| Outcome: | The benchmark evaluates multi-speaker dialogue generation at four levels: audio-visual signal fidelity, temporal attribute consistency, social interaction, and cinematic expression. |
Copied to clipboard
| Challenge: | Recent studies have identified significant redundancy in large language models . quantization and pruning are two methods that reduce computational resources . |
| Approach: | They propose simple pruning methods that prune redundant layers based on their BI scores. |
| Outcome: | The proposed pruning methods demonstrate superior performance over previous pruning methods. |
Copied to clipboard
| Challenge: | Large Language Models (LLMs) have limitations when it comes to comprehending and expressing world knowledge that extends beyond the boundaries of natural language. |
| Approach: | They propose a model that integrates symbolic data into LLM training without loss of generality ability. |
| Outcome: | The proposed model performs better on symbol- and NL-centric tasks. |
Copied to clipboard
| Challenge: | Existing methods to improve code generation from natural language descriptions are difficult due to complex structure, subtle bugs, and lack of supplementary contents. |
| Approach: | They propose a framework that enhances complex code generation by online searching for more information with planned queries and correctness testing for code refinement. |
| Outcome: | The proposed framework improves the quality of complex code generation on the DS-1000 and ClassEval datasets. |
Copied to clipboard
| Challenge: | Graphical User Interfaces (GUIs) are a pivotal medium for human-computer interaction. |
| Approach: | They propose a series of datasets for training visual-based GUI agents using general VLMs. |
| Outcome: | The proposed GUICourse datasets show that even a small-sized GUI agent performs better on GUI tasks. |
Copied to clipboard
| Challenge: | Large language models (LLMs) experience significant performance degradation when the input exceeds the pretraining context window due to the out-of-distribution (OOD) behavior of Rotary Position Embedding (RoPE). |
| Approach: | They propose a training-free method that remaps out-of-distribution (OOD) positions into the in-distance range with fixed mapping strategies, ignoring the dynamic relationship between input length and effective context window. |
| Outcome: | Experiments on three representative LLMs across five mainstream long-context benchmarks show that the proposed method achieves significant performance improvements compared to existing methods. |
Copied to clipboard
| Challenge: | Existing general-domain benchmarks do not capture complexity of real-world judicial cognition and decision-making. |
| Approach: | They propose a benchmark specifically designed to evaluate LLM Agents in the legal domain. |
| Outcome: | The proposed benchmark includes 17 corpora from real-world legal scenarios and provides 37 tools for interacting with external knowledge. |
Copied to clipboard
| Challenge: | Existing Chinese preference datasets suffer from limited scale, restricted domain coverage, and insufficiently rigorous data validation. |
| Approach: | They propose an LLM-based data annotation pipeline with no human intervention to annotate Chinese preference datasets. |
| Outcome: | The proposed pipeline outperforms existing Chinese preference datasets on AlignBench and Chinese Reward Benchmark. |
Copied to clipboard
| Challenge: | Current systems for legal consultation are insufficient to handle the knowledge-intensive nature of real-world consultations. |
| Approach: | They propose a multi-turn benchmark dataset to evaluate LLMs in legal consultation settings. |
| Outcome: | The proposed framework assesses LLMs’ consultation capabilities in terms of (1) clarification capability and (2) professional advice quality. |
Copied to clipboard
| Challenge: | Existing methods to generate auto-labeled sentences for relation extraction (RE) are difficult to extend to document-level relation extraction as noise from DS may be even multiplied in documents. |
| Approach: | They propose a pre-trained model which de-emphasizes noisy DS data via multiple pre-training tasks. |
| Outcome: | The proposed model can capture useful information from noisy data and achieve promising results on the large-scale DocRE benchmark. |
Copied to clipboard
| Challenge: | Existing ensemble methods for Large Language Models focus on reward model ranking of outputs, leading to significant computation overhead. |
| Approach: | They propose a reward-guided routing method distilling rewards on training queries to train a routing function. |
| Outcome: | The proposed method outperforms the best single model and ranks first on 44% of tasks. |
Copied to clipboard
| Challenge: | Recent advances in large language models (LLMs) have catalyzed numerous AI applications, among which role-playing agents (RPAs) are particularly popular. |
| Approach: | They propose to evaluate LLMs' character understanding capability via the character profiling task, i.e., summarizing character profiles from corresponding materials, a widely adopted yet understudied practice for RPA development. |
| Outcome: | The proposed model outperforms existing models and literature summarization methods and proves its ability to understand fictional characters in downstream tasks. |
Copied to clipboard
| Challenge: | Text editing is an important domain of processing tasks to edit the text in a localized fashion, such as text simplification. |
| Approach: | They propose a nonautoregressive decoder for state-to-action demonstrations that parallels the decoding while retaining the dependencies between tokens. |
| Outcome: | The proposed model outperforms the autoregressive baselines on a suite of Arithmetic Equation benchmarks in terms of performance, efficiency, and robustness. |
Copied to clipboard
| Challenge: | Multimodal Sentiment Analysis (MSA) is a rapidly developing field that integrates multimodal information to recognize sentiments. |
| Approach: | They propose a multimodal fusion model that integrates multimodal information to recognize sentiments using multimodal transformers. |
| Outcome: | The proposed model achieves significantly higher performance than MulTs and the existing model is robust. |
Copied to clipboard
| Challenge: | Large Language Models (LLMs) are capable of generating human-like text, but the potential for freely customisable characters remains underexplored. |
| Approach: | They propose a framework which employs Large Language Models to create freely customisable characters through personalised characteristic feature injection. |
| Outcome: | The proposed framework provides valuable insights for developing more accurate and customisable human simulacra. |
Copied to clipboard
| Challenge: | We introduce PaSa, an advanced Paper Search agent powered by large language models . despite being trained on synthetic data, PaSA outperforms existing baselines on RealScholarQuery . |
| Approach: | They introduce PaSa, an advanced Paper Search agent powered by large language models . they optimize PaSA using a synthetic dataset, AutoScholarQuery, which includes 35k fine-grained queries . |
| Outcome: | The paper analyzes the performance of a paper search agent using a synthetic dataset . it significantly outperforms existing benchmarks on RealScholarQuery . |
Copied to clipboard
| Challenge: | Existing relation extraction methods focus on extracting relational facts between entity pairs within single sentences or documents. |
| Approach: | They present a problem of cross-document relation extraction (CRE) using human annotations. |
| Outcome: | The proposed dataset is the first human-annotated cross-document RE dataset . it shows that it is challenging to existing RE methods including strong BERT-based models. |
Copied to clipboard
| Challenge: | Named Entity Recognition and Entity Linking are challenging for voice assistants . utterances are relatively short, so there is not much context to help disambiguate . |
| Approach: | They propose a Named Entity Understanding system that combines NER and EL in a joint reranking module. |
| Outcome: | The proposed framework improves NER accuracy by up to 3.13% and EL accuracy by 3.6% in F1 score . it also leads to better accuracies in other natural language understanding tasks . |
Copied to clipboard
| Challenge: | Text error correction methods usually use the source (incorrect) sentence as encoder input and generate the target (correct) sentences through the decoder. |
| Approach: | They propose a method to correct errors in text sequences by randomly masking out the correct tokens in the source sentence. |
| Outcome: | The proposed method improves accuracy on Mandarin and English datasets with autoregressive and non-autoregressive generation models. |
Copied to clipboard
| Challenge: | Existing large language models for software engineering rely on coarse-grained pass rates obscuring specific cognitive bottlenecks. |
| Approach: | They propose a repository-level benchmark that dissects coding capabilities through atomized tasks. |
| Outcome: | The proposed framework achieves a 78.55% validity yield, surpassing the 31.7% retention rate of SWE-bench-Verified. |
Copied to clipboard
| Challenge: | Existing methods focus on Python and Java, neglecting Solidity, the programming language for Ethereum smart contracts. |
| Approach: | They construct a repository-level benchmark for Solidity to evaluate the performance of LLMs on Ethereum. |
| Outcome: | The proposed benchmarks show that the best performing LLM achieves only 26.29% Pass@10, highlighting room for improvement in Solidity code generation. |
Copied to clipboard
| Challenge: | Evaluation and Management (E/M) coding is performed by physicians and trained human coders who review clinical encounter notes and electronic health record data to assign appropriate codes. |
| Approach: | They propose a framework that automates evaluation and management coding tasks using the Current Procedural Terminology (CPT) taxonomy. |
| Outcome: | The proposed framework achieves an increase in coding accuracy of more than 36% over a commercial CPT E/M coding system and almost 5% over our strongest single-prompt baseline. |
Copied to clipboard
| Challenge: | Existing evaluation frameworks focus on English and a handful of high-resource languages, thereby overlooking the realistic performance of large language models in multilingual and lower-resourced scenarios. |
| Approach: | They propose a unified and lightweight framework that integrates 27 benchmarks under a standard ISO 639-3 language identifier system to enable seamless incorporation of new benchmarks. |
| Outcome: | The proposed framework integrates 27 benchmarks under a standard ISO 639-3 language identifier system, allowing for seamless incorporation of new benchmarks. |
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 methods for inference are often myopic and have divergent reasoning paths . a meta-adaptive reasoning framework is proposed to improve the efficiency of LLM agents . |
| Approach: | They propose a meta-adaptive reasoning framework that integrates tool execution and reasoning planning. |
| Outcome: | The proposed framework outperforms existing methods in performance and inference efficiency. |
Copied to clipboard
| Challenge: | Existing datasets for Chinese instruction tuning are not well-aligned with Chinese users’ interaction patterns. |
| Approach: | They propose to use Chinese instruction tuning datasets to improve instruction fine-tuning for Chinese users. |
| Outcome: | The proposed dataset shows that Chinese models achieve competitive performance in diverse benchmarks. |
Copied to clipboard
| Challenge: | evolving generic Large Language Models into specialized Large Reasoning Models requires effective post-training. |
| Approach: | They propose a plasticity-ceiling framework to harness expert trajectories . they establish the Sequential SFT-then-RL pipeline as the superior standard . |
| Outcome: | The proposed framework overcomes stability and premature convergence deficits in synchronized approaches. |
Copied to clipboard
| Challenge: | Labeling data is a fundamental bottleneck in machine learning due to annotation cost and time. |
| Approach: | They propose a strategy that uses the pre-training loss to find examples that surprise the model and minimize labeling costs. |
| Outcome: | The proposed approach reduces labeling costs and costs by using pre-trained language models. |
Copied to clipboard
| Challenge: | Effective evaluation of multi-hop tool use is critical for analyzing the understanding, reasoning, and function-calling capabilities of large language models. |
| Approach: | They propose a dataset that provides rigorous evaluation of multi-hop tool use. |
| Outcome: | The proposed model achieves 49.04% accuracy across five model families. |
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 natural language understanding are based on a well-defined intent 1 ontology. |
| Approach: | They propose to retrain the natural language understanding model as new data from real users are merged into existing data. |
| Outcome: | The proposed model shows that the semantically entangled intents can be recognized with an automatic workflow. |
Copied to clipboard
| Challenge: | Low-bit floating-point formats like MXFP and NVFP4 offer new opportunities for precision and efficiency. |
| Approach: | They evaluate HiFloat (HiF8 and HiF4), a family of floating-point formats tailored for Ascend NPUs. |
| Outcome: | The proposed formats excel with high-variance data and are compatible with state-of-the-art quantization frameworks. |
Copied to clipboard
| Challenge: | Fine-grained vision-language models (VLMs) have been widely used for inter-modality local alignment between fixed patches and textual words, but they provide incomplete representations of lesions. |
| Approach: | They propose an Adaptive patch-word Matching model to correlate chest X-ray (CXR) image regions with words in medical reports and apply it to CXR-report generation to provide explicit explanations. |
| Outcome: | The proposed model correlates chest X-ray image regions with words in medical reports and provides explanations for the generation process. |
Copied to clipboard
| Challenge: | Existing relation extraction methods focus on extracting intra-sentence relations for single entities. |
| Approach: | They propose a relation extraction dataset from Wikipedia and Wikidata with three features . document-level relation extraction is a task to identify relational facts between entities . |
| Outcome: | The proposed dataset is the largest human-annotated dataset for document-level RE from plain text. |