Papers by Lin Liu
Copied to clipboard
| Challenge: | Existing studies only adopt a vanilla strategy when learning representations of new relations . experimental results show that the importance of the first training stage to CRE models may be underestimated. |
| Approach: | They propose a framework that splits the last FFN layer into separated previous and current classifiers to maintain previous knowledge and encourage model to learn more robust representations at this training stage. |
| Outcome: | The proposed framework outperforms the state-of-the-art models on two benchmarks. |
Copied to clipboard
| Challenge: | Existing studies focus on building a meta-learner from input text but ignore abundant semantic information beneath class labels. |
| Approach: | They propose a framework to make full use of label semantics in few-shot text classification systems. |
| Outcome: | The proposed framework can be plugged into the existing few-shot text classification system. |
Copied to clipboard
| Challenge: | Existing methods for multi-turn function calling are limited by redundancy and lack explicit integration of progress awareness into training. |
| Approach: | They propose a framework that explicitly integrates progress awareness into LLM training for multi-turn function calling. |
| Outcome: | Empirical results show that Progra outperforms existing methods on two public benchmarks. |
Copied to clipboard
| Challenge: | Existing studies have shown that rule-based evaluation methods are ineffective for open-ended natural language generation. |
| Approach: | They propose a pointwise generative reward model with a dedicated two-stage rollout method and unified query-based criteria that can be trained with 5.7K high-quality data. |
| Outcome: | The proposed model achieves superior performance on diverse reward model benchmarks, especially in Best-of-N scenarios, and delivers more effective improvements in downstream RL practice. |
Copied to clipboard
| Challenge: | Continual pre-training is the paradigm where pre-trained language models acquire fresh knowledge and gradually get upgraded. |
| Approach: | They propose to use adapted weights to recycle old PLMs for continual pre-training . they propose to combine initialization and distillation methods to achieve better performance . |
| Outcome: | The proposed method improves the convergence and performance of the upgraded PLM. |
Copied to clipboard
| Challenge: | High-quality post-training data is the primary engine driving LLM capabilities . datasets are often treated as isolated artifacts, overlooking their true developmental context . |
| Approach: | They propose a framework to reconstruct the evolutionary graph of dataset development using data lineage. |
| Outcome: | The proposed framework characterizes domain-specific structural patterns in Math-oriented datasets and general-domain corpora. |
Copied to clipboard
| Challenge: | Existing methods focus on replicating dialogues in textual form, neglecting the role’s voice traits as a crucial effect in interaction, which tends to be more immersive experiences in realistic scenarios. |
| Approach: | They propose a first seamless speech-language personality interaction model to achieve immersive RPAs with low latency. |
| Outcome: | The proposed model exhibits role-specific personality traits and vocal traits throughout the interaction, enabling a mixture of speech and language responses. |
Copied to clipboard
| Challenge: | Researchers have developed a sound codec that can be used as tokenizers for preserving audio data and minimizing data transmission latency. |
| Approach: | They propose to use codec-SUPERB to assess codec models across representative sound applications and signal-level metrics rooted in sound domain knowledge. |
| Outcome: | The proposed codec-SUPERB model is evaluated on selected experimental settings. |
Copied to clipboard
| Challenge: | Existing studies show that neural MT achieves much worse translation quality than statistical MT with a small number of corpora. |
| Approach: | They propose a visual pivoting method for alignment between distant language pairs . they first construct a dataset and then apply it to pre-training and fine-tuning . |
| Outcome: | The proposed method outperforms baselines on DLPs and close language pairs. |
Copied to clipboard
| Challenge: | Existing benchmarks rely heavily on text-based evaluation and largely ignore paralinguistic cues such as prosody, emotion, and speaker traits. |
| Approach: | They propose a speech-native benchmark for evaluating instruction-following S2S models with explicit assessment of both semantic understanding and paralinguistic expression. |
| Outcome: | The proposed system enables more natural, robust, and human-aligned speech agents. |
Copied to clipboard
| Challenge: | Large language models (LLMs) have demonstrated remarkable performance, but lack of transparency in their inference logic raises concerns about their trustworthiness. |
| Approach: | They conduct a detailed analysis of the operations of attention heads to understand their in-context learning of LLMs. |
| Outcome: | The proposed analysis of attention heads reveals that they increase the output logits of object tokens and recall objects . the proposed model is a novel approach to understand the in-context learning of large language models. |
Copied to clipboard
| Challenge: | CriticBench is a benchmark designed to assess LLMs’ abilities to critique and refine their reasoning across a variety of tasks. |
| Approach: | They propose a benchmark to assess LLMs' ability to critique and correct reasoning across a variety of tasks. |
| Outcome: | The proposed benchmark examines the performance of 17 large language models in generation, critique, and correction reasoning. |
Copied to clipboard
| Challenge: | MERaLiON-AudioLLM is the first general-purpose audio-based large language model for multitask learning. |
| Approach: | They introduce MERaLiON-AudioLLM, a general-purpose audio-based large language model for multitask learning with a focus on Singlish understanding. |
| Outcome: | The proposed model exhibits strong generalization across a diverse set of tasks . it is a leading solution for region-specific AI applications. |
Copied to clipboard
| Challenge: | Existing LLM-based recommender systems rely on standard fine-tuning methodologies, often ignoring hallucination issues during the fine-uning process. |
| Approach: | They propose a logit space constraint-based fine-tuning framework to mitigate hallucination in LLM-based recommenders by incorporating Kullback–Leibler divergence into the training objective. |
| Outcome: | Experiments on two recommendation models with distinct LLM backbones and four real-world datasets show that LCFT reduces hallucination and enhances recommendation performance. |
Copied to clipboard
| Challenge: | Existing work on question-answer extraction fails to integrate incomplete utterances from dialog context for composite QA retrieval. |
| Approach: | They propose a task where questions and corresponding answers might be separated across different utterances. |
| Outcome: | The proposed methods perform well on 5 customer service datasets and set a benchmark for N-to-N DialogQAE with utterance and session level evaluation metrics. |
Copied to clipboard
| Challenge: | Experimental results show that pre-trained language model GPT2 can generate better continuations by learning to generate the in the fine-tuning stage. |
| Approach: | They conduct experiments on an English essay dataset using Chinese-GPT2 . they find that the model can generate better continuations by learning to generate the in the fine-tuning stage. |
| Outcome: | The pre-trained language model GPT2 can generate better continuations by learning to generate the in the fine-tuning stage. |
Copied to clipboard
| Challenge: | Existing models exhibit memorization and generalization behaviors in ways that are not easily interpretable or controllable. |
| Approach: | They propose to use a GPT-2 and LLaMA-3.2 model to identify distinct neuron subsets responsible for each behavior to steer the model toward memorization or generalization. |
| Outcome: | The proposed models show that inference-time interventions on these neurons can steer the model’s behavior toward memorization or generalization. |
Copied to clipboard
| Challenge: | Existing benchmarks for large language models (LLMs) do not accurately uncover safety vulnerabilities in LLMs. |
| Approach: | They propose a value alignment benchmark called Flames that encompasses both harmlessness principles and a unique morality dimension that integrates specific Chinese values such as harmony. |
| Outcome: | The proposed model performs poorly on Flames, particularly in safety and fairness dimensions. |
Copied to clipboard
| Challenge: | Existing model-based channel prediction methods suffer from limited accuracy due to imperfect temporal modeling, while existing AI-based methods suffers from limited generalization due to inadequate training strategies. |
| Approach: | They propose a generative pre-trained language model for channel prediction based on channel correlation and train it based upon transformer decoder architecture. |
| Outcome: | The proposed model can learn various channel characteristics and perform impressive tasks across multiple dimensions. |
Copied to clipboard
| Challenge: | Prompting has shown to be sample efficient compared to fine-tuning with pre-trained models. |
| Approach: | They propose a fully automatic prompting method that uses natural language prompts on sequence-to-sequence models and a beam search method to generate a large amount of label sequence candidates. |
| Outcome: | The proposed method significantly outperforms other no-manual-design methods on single label words and generates large amount of label sequence candidates. |
Copied to clipboard
| Challenge: | Existing benchmarks for evaluating the code understanding and generation capacities of Large Language Models are insufficient . existing benchmarks focus on a narrow range of popular programming languages and specific tasks . |
| Approach: | They propose an execution-based, multilingual, multitask evaluation benchmark for LLMs . they evaluate coding performance from three dimensions: length, difficulty, efficiency . |
| Outcome: | The proposed benchmark covers 43 programming languages and eight coding tasks. |
Copied to clipboard
| Challenge: | Domain Large Language Models (LLMs) are developed for domain-specific tasks based on general LLMs, but it still requires professional knowledge to facilitate the expertise for some domain- specific tasks. |
| Approach: | They propose a pipeline to solve domain-specific calculation problems with KIPG . they use it to extract key variables and calculate outcomes dependent on domain knowledge . |
| Outcome: | The proposed pipeline solves domain-specific calculation problems more effectively . it generates knowledge-intensive programs according to the domain- specific documents . |
Copied to clipboard
| Challenge: | Existing evaluation frameworks that use large language models as referees are insufficient for accurately assessing their alignment with human intent. |
| Approach: | They propose a calibration framework to address positional bias in large language models as evaluators by manually annotating the “win/tie/lose” outcomes of responses from ChatGPT and Vicuna-13B in the Vicun A Benchmark’s question prompt. |
| Outcome: | The proposed framework alleviates evaluation bias, resulting in closer alignment with human judgments. |
Copied to clipboard
| Challenge: | Existing tools to generate structured content for research tasks are limited in their ability to generate high-quality roadmaps. |
| Approach: | They propose a benchmark to evaluate the ability of large language models (LLMs) to generate high-quality roadmaps for solving complex research problems. |
| Outcome: | The proposed system can improve LLMs’ ability for roadmap generation while saving 84% of the time required by human experts. |
Copied to clipboard
| Challenge: | Existing DS-QA models ignore rich information contained in other paragraphs and are noisy . Existing systems rely on pre-identified relevant texts, which do not always exist in real-world QA scenarios. |
| Approach: | They propose a model which uses a paragraph selector to filter out noisy paragraphs and a reader to extract the correct answer from denoised paragraphs. |
| Outcome: | The proposed model can capture useful information from noisy data and achieve significant improvements on open domain question answering. |
Copied to clipboard
| Challenge: | Existing benchmarks for logical reasoning in large language models lack language naturalness or limited complexity. |
| Approach: | They propose to use first-order logic annotations to evaluate logical reasoning capabilities of large language models. |
| Outcome: | The proposed dataset evaluates the FOL reasoning ability of supervised fine-tuning on medium-sized language models. |
Copied to clipboard
| Challenge: | Pretrained language models can be fine-tuned on limited training data, which can overfit and thus diminish performance. |
| Approach: | They propose a fine-tuning strategy that selectively updates model parameters using gradients from various sub-nets dynamically generated by dropout. |
| Outcome: | The proposed method outperforms existing methods on the GLUE benchmark and exhibits excellent generalization ability and robustness for domain transfer, data imbalance, and low-resource scenarios. |
Copied to clipboard
| Challenge: | Large Language Model-based Multi-Agent Systems (LLM-MAS) have revolutionized complex problem-solving capability by enabling agent collaboration through message-based communications. |
| Approach: | They propose an attack that exploits communication mechanisms in Large Language Model-based Multi-Agent Systems (LLM-MAS) by intercepting and manipulating inter-agent messages. |
| Outcome: | The proposed attack exploits communication mechanisms in large language model-based multi-agent systems by intercepting and manipulating inter-agencies. |
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: | 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: | 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: | Cool-Fusion is a simple yet effective approach to combine two or more heterogeneous large language models . |
| Approach: | They propose a method that fuses the knowledge of two or more heterogeneous large language models to leverage complementary strengths. |
| Outcome: | The proposed method increases accuracy from three strong source LLMs on GSM8K by 17.4%. |
Copied to clipboard
| Challenge: | Existing methods for difficulty estimation rely on repeated response sampling, auxiliary models, or fine-tuning the target model itself. |
| Approach: | They propose a method that leverages only the hidden representations produced by large language models. |
| Outcome: | The proposed method outperforms baselines in difficulty estimation on textual and multimodal tasks and improves adaptive reasoning strategies with fewer generated tokens. |
Copied to clipboard
| Challenge: | Existing studies have shown that LLMs struggle to identify the boundaries of their own knowledge and tend to prioritize external information over internal knowledge learned during pre-training. |
| Approach: | They conduct a comprehensive analysis of LLM representation behaviors and demonstrate the significance of using representations in knowledge checking. |
| Outcome: | The proposed classifiers improve performance even when dealing with noisy knowledge databases. |
Copied to clipboard
| Challenge: | Recent advances in Large Language Models (LLMs) represent significant strides toward artificial general intelligence (AGI). |
| Approach: | They introduce OpenHuEval, the first benchmark for LLMs focusing on the Hungarian language and specifics. |
| Outcome: | The framework reveals intrinsic patterns and mechanisms of LLMs in non-English languages, with Hungarian serving as an example. |
Copied to clipboard
| Challenge: | Existing methods for GMNER fail to address semantic ambiguity caused by polysemy and long-tail distribution of datasets. |
| Approach: | They propose a framework for Grounded Multimodal Named Entity Recognition that leverages a Multimodal Large Language Model to address semantic ambiguity. |
| Outcome: | Extensive experiments show that the proposed framework outperforms existing methods on two benchmark datasets. |
Copied to clipboard
| Challenge: | Existing open-source vision language models lack high-quality training data for chart reasoning . current models are simplistic and repetitive, while associated QA pairs are prone to hallucinations . |
| Approach: | They propose a framework to synthesize complex charts and reliable reasoning data from scratch. |
| Outcome: | Experimental results show that ChartVerse-8B surpasses existing models in QA and difficulty . lack of high-quality training data hampers development of open-source models . |
Copied to clipboard
| Challenge: | Existing large language models (LLMs) can be adopted as tutoring agents for math and language learning. |
| Approach: | They propose a framework to construct profiles of different student groups by refining and integrating both cognitive and noncognitive aspects, and leverage LLMs for personality-aware student simulation in a language learning scenario. |
| Outcome: | The proposed framework can construct profiles of different student groups by refining and integrating both cognitive and noncognitive aspects, and leverage LLMs for personality-aware student simulation in a language learning scenario. |
Copied to clipboard
| Challenge: | Existing benchmarks for privacy performance of LLM agents are limited to static, simplified scenarios. |
| Approach: | They propose a model-agnostic, contextual integrity based mitigation approach that effectively reduces privacy leakage from 36.08% to 7.30% on DeepSeek-R1 and from 33.06% to 8.32% on GPT-4o. |
| Outcome: | The proposed approach reduces privacy leakage from 36.08% to 7.30% on DeepSeek-R1 and from 33.06% to 8.32% on GPT-4o while preserving task helpfulness. |
Copied to clipboard
| Challenge: | Xia et al., 2018) demonstrate that a large language model can generate and maintain high-quality code documentation. |
| Approach: | They propose a large language model powered open-source framework for generating, maintaining, and updating code documentation. |
| Outcome: | The proposed framework generates high-quality documentation for the entire project. |
Copied to clipboard
| Challenge: | Prevailing methods for task-specific instruction tuning use similarity metrics to select training data . but instruction tuning loss often fails to exhibit a monotonic relationship with actual task performance . |
| Approach: | They propose a task-specific instruction tuning method that leverages pairwise preference loss as a reward signal. |
| Outcome: | The proposed method surpasses state-of-the-art methods for task-specific instruction tuning. |
Copied to clipboard
| Challenge: | Empirical studies show that SingaKids provides effective dialogic teaching, benefiting learners at different performance levels. |
| Approach: | They propose a dialogic tutor designed to facilitate language learning through picture description tasks. |
| Outcome: | Empirical studies show that SingaKids provides effective dialogic teaching, benefiting learners at different performance levels. |
Copied to clipboard
| Challenge: | Existing methods for prompt tuning can overfit to few-shot training samples, causing overfitting . authors propose a new framework for prompt learning with supervised meta-learning . |
| Approach: | They propose a self-supervised meta-prompt learning framework with MEta-gradient Regularization for few-shot generalization that leverages self-recognized meta-learning with a diverse set of meta-tasks to learn a universal prompt initialization using only unlabeled data. |
| Outcome: | The proposed framework learns a universal prompt initialization for efficient adaptation using only unlabeled data. |
Copied to clipboard
| Challenge: | Existing language representation models cannot explicitly handle coreference, which is essential to the coherent understanding of the whole discourse. |
| Approach: | They propose a language representation model that captures coreferential relations in context. |
| Outcome: | The proposed model can achieve significant improvements on downstream NLP tasks while maintaining comparable performance to baseline models on other common NLP task. |
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: | Recent years have witnessed the prevalent application of pre-trained language models (PLMs) in NLP. From the perspective of parameter space, PLMs provide generic initialization, starting from which high-performance minima could be found. |
| Approach: | They investigate the geometric connections of different minima through the lens of mode connectivity, which measures whether two minima can be connected with a low-loss path. |
| Outcome: | The proposed model can be used to find low-loss paths between two minima, and to understand how their mode connectivity affects their task knowledge. |
Copied to clipboard
| Challenge: | Among the approximately 7,000 languages spoken globally, fewer than 20 receive substantial attention in NLP research. |
| Approach: | They propose to use African multi-modal speech and text data to validate African multimodal models and validate them on targeted language data. |
| Outcome: | The African Languages Lab's results show that the proposed model outperforms untrained models in 31 languages and a 1B-parameter model beats the commercial system in Yoruba and Twi. |
Copied to clipboard
| Challenge: | Existing large-scale pre-trained language models are mainly trained from scratch individually, ignoring that many well-taught PLMs are available. |
| Approach: | They propose a pre-training framework called knowledge inheritance and propose auxiliary supervision to efficiently learn larger PLMs. |
| Outcome: | The proposed framework can be used to train large-scale language models with huge parameters and a large dataset can be adapted to domain adaptation and knowledge transfer. |
Copied to clipboard
| Challenge: | Existing datasets exhibit data scarcity and limited coverage of general-domain events. |
| Approach: | They present a MAssive eVENt detection dataset which contains 4,480 Wikipedia documents and 168 event types. |
| Outcome: | The proposed dataset shows that existing methods cannot achieve promising results on the small datasets. |
Copied to clipboard
| Challenge: | State-of-the-art large language models (LLMs) have demonstrated impressive code generation capabilities but struggle with real-world software engineering tasks such as revising source code to address code reviews. |
| Approach: | They propose a benchmark to evaluate large language models' ability to bridge both technical and conversational contexts by decomposing the generation task of code refinement into three essential reasoning steps. |
| Outcome: | The proposed benchmark exposes specific model weaknesses in code review comprehension disentangled from their generative automated code refinement results. |
Copied to clipboard
| Challenge: | Existing datasets for event understanding have limited coverage due to complexity of tasks. |
| Approach: | They propose a dataset that augments MAVEN datasets with event argument annotations . they propose 98,591 events and 290,613 arguments obtained with laborious human annotation . |
| Outcome: | The proposed dataset is the first all-in-one dataset supporting event detection, event argument extraction, and event relation extraction. |
Copied to clipboard
| Challenge: | lack of reliable reward models for tool-use tasks has limited progress toward agentic AI . recent advances in agentic artificial intelligence are driven by tool-using capabilities of large language models. |
| Approach: | They propose a pipeline that constructs pairwise preference data using rule-based scoring and multidimensional sampling to build lightweight reward models. |
| Outcome: | The proposed model outperforms existing models on tool calling tasks with higher accuracy. |
Copied to clipboard
| Challenge: | Currently, tool-augmented large language models (LLMs) only achieve total scores of 45.3 and 37.0, respectively, on a scale of 100. |
| Approach: | They propose a multi-level diagnostic process to assess the LLM's hallucinations through two perspectives: depth and breadth. |
| Outcome: | The proposed diagnostic process assesses the hallucinations of large language models through two perspectives: depth and breadth. |
Copied to clipboard
| Challenge: | Existing approaches to finetuning large language models rely on expensive manual annotations or auxiliary models and fail to address the unique constraints of smaller "weak" LLMs. |
| Approach: | Weak2Wise is a fully automated framework for synthesizing highquality, weak-LLM-friendly reasoning traces. |
| Outcome: | Weak2Wise is a fully automated, lightweight framework for synthesizing highquality, weak-LLM-friendly reasoning traces. |
Copied to clipboard
| Challenge: | Existing large language models are limited in understanding, reasoning, calculation, and generation, limiting their performance in complex reasoning and dynamic tasks. |
| Approach: | They propose a plug-and-play framework that integrates a small-scale LLM (as agent) with large-scale large-level LLMs (a as environment) they propose generating prompts that are used to interact with LLM, and a double constraint reward that optimizes correctness and quality of generation. |
| Outcome: | The proposed framework significantly outperforms baseline large-scale large-language models across various tasks. |
Copied to clipboard
| Challenge: | Current data selection paradigms rely on static, externally defined metrics, which fail to adapt to the evolving capabilities of models during training. |
| Approach: | They propose a dynamic sampling framework that aligns training data with the model's intrinsic competence by iterating on real-time feedback. |
| Outcome: | Extensive experiments on eight benchmarks show that SAI-DPO outperforms static baselines at most nearly 6 points, achieving state-of-the-art efficiency with significantly less data. |
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: | Patronizing and condescending language is an essential branch of toxic language . pre-trained language models perform poorly in detecting PCL due to its implicit toxicity traits . |
| Approach: | They propose a novel LLM benchmark for patronizing and condescending language . they use a dataset to analyze the toxicity of patronizing condescending languages . |
| Outcome: | The proposed model can detect patronizing and condescending language (PCL) the model can be used to analyze the toxicity of the language and to improve the detection. |
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 evaluation regimes for audio large language models do not cover the breadth of their possible use cases. |
| Approach: | They propose to use AudioBench to evaluate audio large language models . they found that no single model excels consistently across all tasks . |
| Outcome: | The proposed evaluation targets speech understanding, audio scene understanding, and voice understanding (paralinguistic) . no single model excels consistently across all tasks, the paper found . |
Copied to clipboard
| Challenge: | Existing benchmarks for mathematical reasoning are becoming less effective due to performance saturation. |
| Approach: | They propose to use a mathematical reasoning benchmark with Olympiad difficulty to evaluate top-tier LLMs. |
| Outcome: | The proposed benchmarks are cross-validated by experts to meet IMO difficulty standards and entirely original problems to prevent performance leakages from data memorization. |
Copied to clipboard
| Challenge: | Existing methods for event argument extraction rely on a single prompt . existing methods ignore complex structural and dynamic interdependencies between event arguments . |
| Approach: | They propose a multi-prompt learning framework that generates event arguments via multi-perspective prompts and ontology steering. |
| Outcome: | The proposed framework captures interrelationships between arguments and ontology steering . it uses multiple unfilled prompts for each sentence to generate event arguments . |
Copied to clipboard
| Challenge: | Existing methods for fine-tuning are resource-efficient, but performance often falls short . a new approach, TeamLoRA, integrates collaborative and competitive modules to improve performance. |
| Approach: | They propose to introduce task-specific LoRA as domain experts to improve learning efficiency . teamLoRA integrates collaborative and competition modules to improve model learning . |
| Outcome: | Experiments show that TeamLoRA improves performance in multi-task learning . teamLorea integrates collaborative and competitive modules to improve performance . |
Copied to clipboard
| Challenge: | Auto-regressive decoding is a memory-bound job, meaning decoding performance is limited by the bandwidth rather than the computational capabilities of the GPU. |
| Approach: | They propose a framework that supports lossless weight-only quantization inference and validate it on Qwen and LLaMA Models. |
| Outcome: | The proposed framework achieves the highest efficiency with lossless accuracy on Qwen and LLaMA Models across various modalities. |
Copied to clipboard
| Challenge: | Pre-trained models excel at graph semantic parsing with rich annotated data, but generalize poorly to out-of-distribution and long-tail examples. |
| Approach: | They propose a compositionality-aware approach to neural-symbolic inference informed by model confidence to capture different aspects of the graph prediction. |
| Outcome: | The proposed method outperforms state-of-the-art models on an English resource grammar parsing problem on standard in-domain and seven OOD corpora. |
Copied to clipboard
| Challenge: | Existing methods for extracting relational facts from text have been successful . but with explosion of Web text, human knowledge is increasing drastically . |
| Approach: | They propose to improve relation extraction methods to extract relational facts from text . they analyze existing methods and show promising directions towards more powerful RE . |
| Outcome: | The proposed methods can extract relational facts from text, but they are still lacking in the current field. |
Copied to clipboard
| Challenge: | Existing pipelines that combine document image restoration with semantic-aware post-OCR correction can improve text extraction from degraded images. |
| Approach: | They propose a two-stage pipeline that combines document image restoration with semantic-aware post-OCR correction to enhance both visual clarity and textual consistency. |
| Outcome: | The proposed pipeline reduces character error rates by 63.9-70.3% on 13,831 pages of real historical documents in English, French, and Spanish compared to OCR on raw images. |
Copied to clipboard
| Challenge: | Current language model-driven agents lack mechanisms for effective user participation, which is crucial given the vagueness commonly found in user instructions. |
| Approach: | They propose a benchmark to inspect users’ implicit intentions through explicit queries and a model expert as the upstream in agent design to enhance user-agent interaction. |
| Outcome: | The proposed approach excels at identifying vague user tasks, recovering and summarizing critical missing information, setting precise and necessary agent execution goals, and minimizing redundant tool usage, thus boosting overall efficiency. |
Copied to clipboard
| Challenge: | Existing platforms lack a mechanism for user actions to dynamically reshape the environment. |
| Approach: | They propose a novel agent-based simulation platform for recommender systems with a robust interaction mechanism. |
| Outcome: | The proposed platform improves the credibility of the simulation and replicates the Matthew Effect and Brand Loyalty. |
Copied to clipboard
| Challenge: | Large language models (LLMs) have demonstrated remarkable capabilities across various domains since the release of ChatGPT . a key challenge in developing these general capabilities is efficiently sourcing diverse, high-quality data. |
| Approach: | They introduce Flaming-hot Initiation with Regular Execution (FIRE) sampling to efficiently find good responses by promoting diversity. |
| Outcome: | The proposed method enhances inference-time generation quality and benefits training in the alignment stage. |
Copied to clipboard
| Challenge: | Existing multilingual benchmarks show severe drawbacks, such as overly translated content, the absence of difficulty control, and disciplinary imbalance, making the benchmarking process unreliable and showing low convincingness. |
| Approach: | They propose a multilingual benchmark that integrates LLM-assisted formatting, expert quality verification, and multi-level difficulty screening to provide a comprehensive, difficult multilingual assessment. |
| Outcome: | The proposed benchmark features 93,536 questions sourced from native speakers across 14 languages and 63 academic disciplines. |
Copied to clipboard
| Challenge: | Multi-modal Large Language Models (MLLMs) exhibit limited generality and often fall short when compared to specialized models. |
| Approach: | They propose a multi-modal medical agent that picks the most suitable medical tools based on user inputs. |
| Outcome: | The proposed agent performs better than open-source models and the closed-source model, GPT-4o. |
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: | Existing methods focus on manipulating entity features to find pairwise relations, yet neglect the more fundamental structural information that links disparate entity pairs together. |
| Approach: | They propose a Visual Relation Extraction framework that generates relation predictions on entity pairs extracted from scanned images and incorporates global structural knowledge into the representations of the entities. |
| Outcome: | The proposed framework outperforms existing methods in fine-tuning setting and yields stronger data-efficient performance in the low-resource setting. |
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: | Generating high-quality long-form survey articles poses significant challenges to AI Agent systems. |
| Approach: | They propose a hierarchically modular agent system for long-form survey generation . they use atomic models to implement skeleton initialization, digest construction, and skelet refinement . human evaluations demonstrate system surpasses representative baselines . |
| Outcome: | The proposed system surpasses representative baselines in both content depth and length, highlighting the strength of MCP-based modular planning. |
Copied to clipboard
| Challenge: | Existing methods for fine-tuning large language models are inefficient and redundant . a light-PEFT framework can be used to prune redundant parameters during training . |
| Approach: | They propose a parameter-efficient fine-tuning framework that freezes most parameters of the foundation model and finetuns only a small number of parameters. |
| Outcome: | The proposed framework achieves training and inference speedup, reduces memory usage, and maintains comparable performance and plug-and-play feature of PEFT. |
Copied to clipboard
| Challenge: | In named entity recognition, the majority of annotation efforts are centered on English, and cross-lingual transfer performance remains brittle. |
| Approach: | They propose to develop gold-standard named entity recognition benchmarks in many languages using a cross-lingual consistent schema. |
| Outcome: | The proposed benchmarks will be released to the public in 2022 . they will provide baselines on in-language and cross-lingual learning settings. |
Copied to clipboard
| Challenge: | Existing methods to solve geometric problems are dependent on handcraft rules and limited on small-scale datasets. |
| Approach: | They propose a Geometric Question Answering dataset with 5,010 geometric problems with corresponding annotated programs to illustrate the solving process. |
| Outcome: | The proposed method is significantly lower than human performance on the proposed dataset than on a publicly available dataset. |
Copied to clipboard
| Challenge: | Creating lyrics and melodies in symbolic format requires expert knowledge of melody and an advanced understanding of lyrics. |
| Approach: | They introduce SongComposer, a music-specialized large language model that can create symbolic lyrics and melodies following instructions. |
| Outcome: | The proposed model outperforms existing models in symbolic song composition tasks. |
Copied to clipboard
| Challenge: | Existing evaluation metrics struggle to evaluate adversarial negative examples . existing metrics struggle in handling adversarials, resulting in low correlations with human judgments. |
| Approach: | They propose a framework that integrates AMR and domain-specific language models for automatic open-domain dialogue evaluation. |
| Outcome: | The proposed evaluation framework achieves strong correlations with human judgments across multiple datasets. |
Copied to clipboard
| Challenge: | Recent studies have shown that LLMs struggle with instructions containing multiple constraints. |
| Approach: | They propose a self-correction pipeline that decomposes the original instruction into a list of constraints and uses a Critic model to decide when and where the LLM’s response needs refinement. |
| Outcome: | The proposed model outperforms GPT-4 on RealInstruct and IFEval even with weak feedback. |
Copied to clipboard
| Challenge: | Existing approaches for relation extraction (RE) use supervised learning on relation-specific training data, which is expensive to acquire. |
| Approach: | They propose to use a new testing dataset to re-examine distant supervision approaches . they aim to draw new conclusions based on the new testing data . |
| Outcome: | The proposed method can generate training data without noise and bias issues . the proposed method is annotated by the researchers on Amzaon Mechanical Turk . |
Copied to clipboard
| Challenge: | Existing datasets that focus on natural language tasks are not considered as a general evaluation benchmark for multimodal tasks. |
| Approach: | They present a general evaluation benchmark for multimodal tasks, GEM 1 . they compare it with existing multimodal vision-language datasets . |
| Outcome: | The proposed model is compared with existing vision-language datasets focusing on natural language tasks . it is the largest vision-linguistic dataset covering image-language tasks and video-language task at the same time . |
Copied to clipboard
| Challenge: | Vision-Language Models (VLMs) have advanced multimodal learning, driving progress in cross-modal reasoning. |
| Approach: | They propose to examine moral robustness of vision-language models by analyzing their moral stances under multimodal perturbations. |
| Outcome: | The proposed model-agnostic multimodal perturbations expose VLMs to a variety of moral vulnerabilities, including a sycophancy trade-off where stronger instruction-following models are more susceptible to persuasion. |
Copied to clipboard
| Challenge: | Recent advances in Language Models (LMs) have shown their effectiveness in knowledge-intensive tasks. |
| Approach: | They investigate whether a generative language model is able to access its memory sequentially or randomly. |
| Outcome: | The proposed LMs are able to access memory sequentially or randomly. |
Copied to clipboard
| Challenge: | Prior denoising methods suppress redundant and noisy information at risk of losing critical information. |
| Approach: | They propose a denoising bottleneck fusion model for fine-grained video multimodal fusion . they employ a bottleneck mechanism to filter out noise and redundancy with a restrained receptive field . |
| Outcome: | The proposed model improves on state-of-the-art video multimodal fusion benchmarks. |
Copied to clipboard
| Challenge: | Existing techniques for relevance and semantic matching cannot be easily adapted to the other. |
| Approach: | They propose a model that incorporates a hybrid encoder module, a relevance matching module and co-attention mechanisms that capture context-aware semantic relatedness. |
| Outcome: | The proposed model incorporates a hybrid encoder module, a relevance matching module and co-attention mechanisms that capture context-aware semantic relatedness. |
Copied to clipboard
| Challenge: | Large language models (LLMs) are powerful tools for interpreting human commands and generating text. |
| Approach: | They examine the resilience of large language models against five common types of disruptions including ASR, OCR, grammatical errors, typographical errors and distractive content. |
| Outcome: | The models show resistance to noise, but their performance suffers . authors evaluated the models against five common types of disruptions based on their results . |
Copied to clipboard
| Challenge: | Existing QG systems perform substantially worse in answering multi-hop questions than single-hop ones. |
| Approach: | They propose a framework that progressively increases question difficulty through step-by-step rewriting under the guidance of an extracted reasoning chain. |
| Outcome: | The proposed framework increases question difficulty through step-by-step rewriting under the guidance of an extracted reasoning chain. |
Copied to clipboard
| Challenge: | Large language models (LLMs) have shown promise in natural language reasoning, especially with techniques like chain-of-thought prompting. |
| Approach: | They propose a framework to enhance autoformalization and self-refinement for logical reasoning with Retrieval-Augmented Generation (RAG) by building knowledge bases of thought-guided examples. |
| Outcome: | The proposed framework outperforms Logic-LM and LINC on FOLIO and AR-LSAT, and achieves an accuracy gain of 13% over Logic LM and the proposed methods on GPT-4 and AR LSAT. |
Copied to clipboard
| Challenge: | a new framework for image-text instruction data evolution improves MLLM performance . lack of high-quality instruction data remains a major bottleneck in ML modeling . |
| Approach: | They propose a multimodal instruction data evolution framework that iteratively enhances data quality through fine-grained perception, cognitive reasoning, and interaction evolution. |
| Outcome: | The proposed approach improves MLLM performance in nine vision-language tasks while using significantly less data. |
Copied to clipboard
| Challenge: | Video-to-speech (V2S) synthesis requires acoustic hints to accurately reconstruct both speech content and speaker characteristics from video clips alone. |
| Approach: | They propose a video-to-speech (V2S) model that predicts Mel-spectrograms directly from video frames. |
| Outcome: | The proposed model outperforms existing models in acoustic intelligibility and preserves speaker-specific characteristics. |
Copied to clipboard
| Challenge: | Large language models (LLMs) struggle with ex-ante reasoning—making inferences or predictions without access to future information. |
| Approach: | They propose a benchmark that assesses LLMs’ ex-ante inference ability across four tasks: stock prediction, question answering, Wikipedia event generation, and scientific publication generation. |
| Outcome: | The proposed benchmark assesses LLMs’ ex-ante inference ability across four tasks. |
Copied to clipboard
| Challenge: | Existing approaches to training a dialogue state tracking model require extensive annotated dialogue data. |
| Approach: | They propose to transfer cross-task knowledge from general question answering corpora to QA model that can handle zero-shot DST. |
| Outcome: | The proposed model improves existing zero-shot and few-shot results on MultiWoz and shows better generalization ability in unseen domains. |
Copied to clipboard
| Challenge: | Despite recent progress in multi-answer MRC, there is no systematic analysis of how this phenomenon arises and how to better address it. |
| Approach: | They develop a taxonomy to categorize commonly-seen multi-answer MRC instances and examine how well different paradigms deal with different types of multi-announced questions. |
| Outcome: | The proposed taxonomy categorizes commonly-seen multi-answer instances and analyzes how well different paradigms deal with different types of multi-announced instances. |
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 evaluation frameworks for audio foundation models are heavily reliant on English, making it difficult to objectively assess models’ performance on Chinese. |
| Approach: | They propose a unified framework that supports 10 languages, 14 task categories, 24 models, and 36 benchmarks with one-command evaluation and real-time leaderboards. |
| Outcome: | The proposed framework supports 10 languages, 14 task categories, 24 models, and 36 benchmarks with one-command evaluation and real-time leaderboards. |
Copied to clipboard
| Challenge: | Text-Centric Visual Question Answering (TEC-VQA) is a text-centric visual task understanding tool. |
| Approach: | They introduce a benchmark that features human expert annotations across 9 languages . they prioritize the text in question-answer pairs while disregarding visual text in images . |
| Outcome: | The proposed benchmarks prioritize the text in question-answer pairs while disregarding visual text in images. |
Copied to clipboard
| Challenge: | Automatic speech recognition systems have advanced significantly with models like Whisper, Conformer, and self-supervised frameworks such as Wav2vec 2.0. |
| Approach: | They propose to use Mandarin speech datasets to analyze pronunciation and tone of children aged 3 to 5 and evaluate their models on speaker verification (SV) They find that the datasets are more robust than those used by adult speech recognition systems and are open-source and available for all academic purposes. |
| Outcome: | The proposed dataset includes 41.25 hours of speech with carefully crafted manual transcriptions, collected from 397 speakers across various provinces in China, with balanced gender representation. |
Copied to clipboard
| Challenge: | Experimental results show that system summaries struggle to preserve syntactic meaning of source texts. |
| Approach: | They propose to incorporate syntactic information from source sentences into abstractive summaries by structure-infused copy mechanisms. |
| Outcome: | The proposed approach compares favorably to state-of-the-art methods. |
Copied to clipboard
| Challenge: | Named Entity Recognition (NER) tasks are a fundamental task of natural language processing (NLP). |
| Approach: | They propose a text-to-text framework for Few-Shot Named Entity Recognition (NER) that employs instruction finetuning and auxiliary tasks to enhance the model's understanding of entity types in the overall semantic context of a sentence. |
| Outcome: | The proposed framework outperforms existing Few-Shot NER methods and remains competitive with state-of-the-art NER algorithms. |
Copied to clipboard
| Challenge: | Large language models (LLMs) have impressive capabilities, but still suffer from inconsistency issues. |
| Approach: | They develop a ConsisEval benchmark to evaluate LLMs' inconsistency . they find that LLM models can paradoxically fail at easier problems . |
| Outcome: | The proposed model achieves highest consistency score but inconsistent to specific questions due to distraction by redundant information, misinterpretation of questions, etc. |
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: | Unfairness is a well-known challenge in Recommender Systems (RSs) some approaches have started to improve fairness in offline or static contexts, but it often exacerbates over time, leading to significant problems like the Matthew effect, filter bubbles, and echo chambers. |
| Approach: | They propose a framework to promote multi-interest diversity fairness in RSs by establishing diverse hypergraphs through contrastive learning. |
| Outcome: | The proposed framework achieves state-of-the-art performance while effectively alleviating unfairness in two CRS-based datasets. |
Copied to clipboard
| Challenge: | Existing mathematical verifiers are trained with binary classification labels, which are not informative enough for the model to accurately assess the solutions. |
| Approach: | They propose a natural language feedback-enhanced verifier that can validate the correctness of response generated by policy models by constructing automatically generated training data and a two-stage training paradigm. |
| Outcome: | The proposed verifier significantly improves in verification and reinforcement learning and alleviates data-demanding problems of the reward model. |
Copied to clipboard
| Challenge: | Existing language models are inadequate in reasoning, according to studies . a new reasoning pre-training paradigm is based on pretraining language models with programs . |
| Approach: | They propose a reasoning pre-training paradigm that empowers language models to harvest reasoning knowledge possessed by program executors. |
| Outcome: | The proposed reasoning pre-training paradigm can boost models' reasoning skills . it can be instantiated by different kinds of program executors and run on a single database . |
Copied to clipboard
| Challenge: | Structured pruning is a feasible solution for end-side LLM deployment . however, achieving a high compression ratio for scaled-up LLMs remains a challenge . |
| Approach: | They propose a task-agnostic structured pruning approach coupled with a compact Transformer architecture to prune LLMs into an intra-module low-rank architecture. |
| Outcome: | The proposed approach reduces transitional activations inside multi-head attention (MHA) and multi-layer perceptron (MLP) modules while preserving inter-module activations sensitive to perturbations. |
Copied to clipboard
| Challenge: | Recent approaches to fine-tuning of large language models suffer from task interference and catastrophic forgetting. |
| Approach: | They propose a fine-tuning framework that adapts isolation decisions based on online estimates of parameter importance. |
| Outcome: | The proposed framework reduces interference and forgetting while releasing outdated parameters to recover plasticity. |
Copied to clipboard
| Challenge: | Existing methods to attack transformer models are not effective at character level, but they are a natural attack scenario. |
| Approach: | They propose a character-level adversarial attack method against transformer models . they use a gradient-based method to find the most vulnerable words in a sentence . |
| Outcome: | The proposed method outperforms previous methods on sentence-level and token-level tasks. |
Copied to clipboard
| Challenge: | Existing studies attribute catastrophic forgetting to the corruption of the learned representations as new relations come . Continual relation extraction models suffer from catastrophic forgetting when learning new relations . |
| Approach: | They propose to use adversarial class augmentation mechanism to learn more precise representations . they propose to train the model on a sequence of tasks where two new relations are discovered . |
| Outcome: | The proposed model improves on two popular benchmarks. |
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: | coding scaffolds that follow heterogeneous instructions remain under-examined in software engineering . coding models are capable software agents, but their ability to follow constraints remains under-explored . |
| Approach: | They introduce OctoBench, which benchmarks scaffold-aware instruction following in agentic coding. |
| Outcome: | The proposed benchmark aims to accelerate the development of more scaffold-aware agents. |
Copied to clipboard
| Challenge: | Large language models (LLMs) have impressive capabilities in utilizing external tools, but in practice, they are often exposed to tools that are irrelevant to the user’s query, in which case the desired behavior is to refrain from invocations. |
| Approach: | They propose a new dataset that decouples structural alignment from semantic relevance and propose rebalancing strategies that effectively mitigates structural alignment bias. |
| Outcome: | The proposed approach effectively mitigates structural alignment bias without degrading general tool-use capabilities. |
Copied to clipboard
| Challenge: | Large language models are increasingly employed to empower autonomous agents to simulate human behavior. |
| Approach: | They propose to evaluate LLM-driven agents through multi-turn interactions using a bottom-up approach to create diverse social scenarios constructed from extensive scripts. |
| Outcome: | The proposed model evaluates LLM-driven agents through multi-turn interactions emphasizing goal completion and implicit reasoning. |
Copied to clipboard
| Challenge: | Large Language Models often exhibit deficiencies with complex reasoning tasks, such as maths, due to the discrepancy between human reasoning patterns and those presented in training data. |
| Approach: | They propose to insert insights between consecutive reasoning steps to bridge this gap by generating insights between the next reasoning steps. |
| Outcome: | Experiments on mathematical datasets confirm the effectiveness of the proposed reasoning framework on complex problems. |
Copied to clipboard
| Challenge: | Existing methods for stance detection are not applicable to zero-shot and few-shot scenarios. |
| Approach: | They propose a model that integrates commonsense knowledge into a stance detection model. |
| Outcome: | The proposed model outperforms state-of-the-art methods on zero-shot and few-shot stance detection tasks. |
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 collaboration between multiple Large Language Models (LLMs) rely on highly capable models with strong self-reflection abilities or are limited to models sharing the same tokenizer. |
| Approach: | They propose a mechanism that enables collaboration among less capable LLMs independent of tokenizer differences. |
| Outcome: | The proposed mechanism improves performance over individual models and generalizes well across different quantities and sizes of participating models. |
Copied to clipboard
| Challenge: | Recent work on applying large language models (LMs) achieves impressive performance in many NLP applications. |
| Approach: | They propose to continuously post-train an LM with unlabeled domains to expand its knowledge without forgetting previous skills. |
| Outcome: | The proposed system improves few-shot end-task learning in these domains. |
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: | 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: | Medical Information Extraction (MIE) tasks are a fundamental component of medical NLP. |
| Approach: | They propose an alternative adaptive constraint strategy to adjust the scale and scope of contrastive tokens. |
| Outcome: | The proposed approach selectively enhances the identification and classification capabilities while minimizing the influence of other inherent abilities in LLMs. |
Copied to clipboard
| Challenge: | Hierarchical text classification (HTC) is a multi-label classification problem with a complex label hierarchy. |
| Approach: | They propose a Hierarchy-aware Prompt Tuning method to handle HTC from a multi-label perspective using a dynamic virtual template and label words that take the form of soft prompts to fuse the label hierarchy knowledge. |
| Outcome: | The proposed method achieves state-of-the-art performance on 3 popular HTC datasets and is adept at handling imbalance and low resource situations. |
Copied to clipboard
| Challenge: | Existing methods for learning logic rules for knowledge graph reasoning face limitations such as searching in vast search space and inefficient optimization. |
| Approach: | They propose a framework to efficiently mine logic rules by controllable generation in the latent space by a pre-trained VAE and a discriminator. |
| Outcome: | The proposed framework efficiently mines logic rules by controllable generation in the latent space. |
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: | Data-to-text annotations can be costly when dealing with tables with nontrivial structures. |
| Approach: | They propose a procedure for extracting semantic triples from tables that encodes their structures by exploiting table headers and table title. |
| Outcome: | The proposed method exploits the semantic dependencies between table headers and title to extract semantic triples from tables. |
Copied to clipboard
| Challenge: | MPLSandbox is an out-of-the-box multi-programming language sandbox designed to provide unified and comprehensive feedback from compiler and analysis tools for Large Language Models (LLMs). |
| Approach: | They propose a multi-programming language sandbox that provides unified feedback from compilers and analysis tools for Large Language Models. |
| Outcome: | The proposed multi-language sandbox can provide comprehensive feedback from compilers and analysis tools for large language models (LLMs). |
Copied to clipboard
| Challenge: | Existing methods for model merging struggle to maintain performance gains as the number of merged models increases. |
| Approach: | They propose a Reparameterized Heavy-Tailed method to extend the merged model’s coverage and enhance performance. |
| Outcome: | The proposed method extends the merged model’s coverage and enhances performance on 19 benchmarks, including knowledge-intensive and general-purpose tasks. |
Copied to clipboard
| Challenge: | Existing defenses for indirect prompt injection are limited by static protection mechanisms . existing models prioritize injected rules due to strict alignment, whereas static protections sever the feedback loop required for adaptive reasoning. |
| Approach: | They propose a framework that shifts the paradigm from restrictive isolation to a verify-before-commit protocol. |
| Outcome: | The proposed framework outperforms state-of-the-art dynamic defenses by reducing the attack success rate by over 22% while more thandoubling utility under attack compared to static baselines. |
Copied to clipboard
| Challenge: | Existing approaches to matching use Large Language Models as feature extractors, underutilizing their full modeling capabilities. |
| Approach: | They propose a matching paradigm that integrates two-tower, single-towing, and generative tasks within a unified LLM framework via attention-mask partitioning. |
| Outcome: | The proposed model achieves superior performance and strong practical value in an industrial search engine. |
Copied to clipboard
| Challenge: | Recent work has aimed to enhance reasoning capabilities of language models, but these methods are limited to domains with objectively verifiable answers. |
| Approach: | They propose a self-play framework to improve reasoning on general-domain data. |
| Outcome: | Experiments show that the proposed framework improves reasoning performance on general-domain data while maintaining competitive performance on verifiable academic benchmarks. |
Copied to clipboard
| Challenge: | Recent advances in large language models have led to the development of LLM-based autonomous agents. |
| Approach: | They propose a Reinforcement Learning-based Human-Agent Collaboration method which trains a policy model to determine the most opportune stages for human intervention within the task-solving process. |
| Outcome: | The proposed method improves human-agent collaboration significantly through well-planned, limited human intervention. |
Copied to clipboard
| Challenge: | Existing models fail to generalize to more challenging math problems, authors say . existing benchmarks related to assessing language models' reasoning process are limited . |
| Approach: | They propose a tool to measure language models' ability to identify erroneous steps in reasoning . they use two types of models: process reward models and critic models . |
| Outcome: | The proposed model outperforms existing models in evaluating language models' reasoning process . the best open-source model has demonstrated the critique capability competitive with the proprietary model . |
Copied to clipboard
| Challenge: | Existing evaluation benchmarks for Multimodal Large Language Models (MLLMs) focus on single-turn question answering, overlooking the complexity of multi-turn dialogues in real-world scenarios. |
| Approach: | They propose a video understanding benchmark for MLLMs in multi-turn dialogues that assesses six core competencies that focus on perceptivity and interactivity. |
| Outcome: | The MT-Video-Bench evaluates 1,000 multi-turn dialogues from diverse domains and reveals significant performance discrepancies and limitations in handling multi-turned video dialogues. |
Copied to clipboard
| Challenge: | Existing knowledge-based VQA benchmarks focus on coarse-grained categories and simple reasoning over single entities. |
| Approach: | They propose a knowledge-based Visual Question Answering benchmark to enhance multimodality evaluation. |
| Outcome: | The proposed benchmark improves evaluation of multimodal large language models in fine-grained multimodal entity understanding and complex multihop reasoning. |
Copied to clipboard
| Challenge: | Existing approaches for dialogue state tracking are mainly based on classification-based and extraction-based methods. |
| Approach: | They propose a model which incorporates both classification-based and extraction-based methods and integrates four modules to jointly extract dialogue states. |
| Outcome: | The proposed model outperforms the state-of-the-art models in multi-domain dialogues with many turns of utterances. |
Copied to clipboard
| Challenge: | Existing methods to detect sarcasm target with text lacking context are not sufficient and complete. |
| Approach: | They propose a multi-modal sarcasm target identification task that performs both textual and visual detection. |
| Outcome: | The proposed model can perform textual target labeling and visual target detection. |
Copied to clipboard
| Challenge: | Existing benchmarks for multimodal large language models fail to capture complexity and traceability of reasoning processes . SciVQR includes domain-specific visuals and challenges models to combine visual comprehension with reasoning. |
| Approach: | They propose a multimodal benchmark for scientific reasoning covering 54 subfields . SciVQR includes domain-specific visuals and challenges models to combine visual comprehension with reasoning . |
| Outcome: | SciVQR evaluates 54 subfields in mathematics, physics, chemistry, geography, astronomy, and biology . the results highlight the need for improved multi-step reasoning and integration of interdisciplinary knowledge . |
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 latent reasoning methods suffer from a bandwidth bottleneck . explicit textual rationales suffer from premature semantic collapse . |
| Approach: | They propose a new paradigm that reformulates visual deduction via Dynamic Windowed Alignment Learning. |
| Outcome: | The proposed paradigm achieves state-of-the-art performance among latent reasoning methods surpassing the strong baseline Monet by 5.03% on average. |
Copied to clipboard
| Challenge: | Traditional goal-oriented dialogue systems require annotations which are hard to obtain for every new domain, limiting scalability. |
| Approach: | They propose a data-driven approach to building goal-oriented dialogue systems . they use a seed dialogue simulator to generate annotated conversations instead of collecting annotations . |
| Outcome: | The proposed system improves turn-level action signature prediction accuracy by 50% . the system is scalable, extensible and data efficient . |
Copied to clipboard
| Challenge: | Large language models (LLMs) have impressive reasoning capabilities in financial tasks, but struggle with multi-step, goal-oriented scenarios in interactive financial markets. |
| Approach: | They propose a framework that integrates large language models with gradient-driven reinforcement learning (RL) policy optimization. |
| Outcome: | The proposed framework improves performance in trading and other financial domain tasks. |
Copied to clipboard
| Challenge: | DialogUSR is a plug-in and domain-agnostic module that empowers multi-intent detection for chatbots . a single user query triggers inquiries on highspeed train ticket price and weather of destination. |
| Approach: | They propose a dialog utterance splitting and reformulation task that splits multi-intent user query into multiple single-intention sub-queries and recovers all coreferred and omitted information in the sub-questions. |
| Outcome: | The proposed model can be used to split multi-intent user queries into multiple sub-queries . it can be trained in two stages and perform in-depth analyses on the proposed models . |
Copied to clipboard
| Challenge: | Existing benchmarks for agentic programming in long-horizon command-line interface tasks are limited by short task horizons, data contamination from GitHub scraping, and a lack of fine-grained evaluation metrics. |
| Approach: | They propose a benchmark to evaluate agentic capabilities across long-horizon command-line interface tasks. |
| Outcome: | The proposed benchmarks cover four engineering categories: from scratch, feature addition, bug fixing, and refactoring. |
Copied to clipboard
| Challenge: | Privacy-sensitive users require deploying large language models within their own infrastructure (on-premises) vulnerabilities in local environments can lead to unauthorized access and potential model theft. |
| Approach: | They propose a framework that secures a few bottom layers in a secure environment . they propose metric to optimize trade-off between protection and customization flexibility . |
| Outcome: | The proposed framework outperforms baselines on five models with 1.3B to 70B parameters. |
Copied to clipboard
| Challenge: | Generative retrieval (GR) is an emerging search paradigm for food delivery search. |
| Approach: | They propose a method that harnesses the advanced query understanding capabilities of large language models to enhance the retrieval of results for complex and long-tail queries in food delivery search scenarios. |
| Outcome: | The proposed method increases the number of online orders by 0.68% for complex search intents. |
Copied to clipboard
| Challenge: | Existing approaches to reward modeling in reinforcement learning tasks are limited when dealing with ambiguous preferences. |
| Approach: | They propose to use AAM to dynamically calibrate preference margins using the Bradley-Terry model's internal parameter knowledge to improve reward modeling in subjective tasks. |
| Outcome: | The proposed approach improves reward modeling by dynamically calibrating preference margins using the model’s internal parameter knowledge. |
Copied to clipboard
| Challenge: | Modern Large Language Models (LLMs) facilitate high-quality, multi-turn dialogues with humans, but human-based evaluation of such a capability requires substantial manual effort. |
| Approach: | They propose to evaluate LLMs' ability to emulate human-like, multi-turn conversations using an LLM-centric approach. |
| Outcome: | The proposed model emulates human-like, multi-turn conversations using an LLM-centric approach. |
Copied to clipboard
| Challenge: | Existing research has developed frameworks to understand human-to-human CSE attacks. |
| Approach: | They propose a modular defense pipeline that improves detection at both the message and conversation levels. |
| Outcome: | The proposed model can be exploited to facilitate chat-based social engineering attacks and generate high-quality CSE content, but their detection capabilities are suboptimal, leading to increased operational costs for defense. |
Copied to clipboard
| Challenge: | Existing shallow discourse parsing systems focus on the Wall Street Journal corpus, but the data is limited to the news domain and is 35 years old. |
| Approach: | They propose to use the Wall Street Journal corpus as a benchmark for PDTB-style shallow discourse parsing. |
| Outcome: | The proposed dataset is compatible with PDTB, but suffers from degradation out-of-domain. |
Copied to clipboard
| Challenge: | RAAMove is a comprehensive multi-domain corpus dedicated to the annotation of move structures in Research Article (RA) abstracts. |
| Approach: | They propose a multi-domain corpus dedicated to the annotation of move structures in RA abstracts. |
| Outcome: | The proposed corpus is based on a human-annotated dataset and a BERT-based model to verify its effectiveness. |
Copied to clipboard
| Challenge: | Existing approaches to prompt optimization trade off signal quality against computational cost. |
| Approach: | They propose a framework that uses a first-order gradient approximation to score segment importance in a continuous masking direction. |
| Outcome: | The proposed framework improves efficiency and robustness by using a first-order gradient approximation to score segment importance in a continuous masking direction. |
Copied to clipboard
| Challenge: | Long-context processing ability has emerged as a significant challenge for large language models. |
| Approach: | They propose a pipeline for synthesizing faithful long-context reasoning instruction datasets . they integrate ground truth and citation-based reasoning prompts integrating them . |
| Outcome: | The proposed pipeline eliminates distractions and improves reasoning chains. |
Copied to clipboard
| Challenge: | Recent researches focus on deep learning and reinforcement learning for multi-turn information seeking conversation systems. |
| Approach: | They propose an efficient and effective multi-turn conversation model based on convolutional neural networks and extend it to adapt the knowledge learned from a resource-rich domain to enhance the performance. |
| Outcome: | The proposed model performs better than the existing model on an industrial chatbot called AliMe Assist. |
Copied to clipboard
| Challenge: | Humor plays important role in human communication, which makes it important problem for natural language processing. |
| Approach: | They propose a novel annotation scheme to give scenarios of how humor arises in text . they report reasonable agreement between annotators and analyze the dataset . |
| Outcome: | The proposed scheme gives scenarios of how humor arises in text . it contains key words that trigger humor, character relationship, scene, and humor categories . |
Copied to clipboard
| Challenge: | Document-level Event Argument Extraction (DEAE) aims to identify arguments and their specific roles from unstructured document. |
| Approach: | They propose a document-prompt-based method for document-level event argument extraction that uses a semantic mention graph to capture relations between documents and prompts. |
| Outcome: | The proposed method surpasses baseline methods and achieves state-of-the-art performance on RAMS and WikiEvents datasets. |
Copied to clipboard
| Challenge: | Existing efforts to improve data quality have focused on deduplication and the evaluation of data diversity and difficulty. |
| Approach: | They propose a set of metrics to evaluate the quality of long texts by evaluating three fundamental linguistic dimensions: coherence, cohesion, and complexity. |
| Outcome: | The proposed model improves on long-text tasks with over 160B tokens and categorizes long texts into holistic, aggregated, and chaotic types. |
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 methods for tuning pre-trained language models ignore the running cost and only optimize the terminal cost. |
| Approach: | They propose to use stochastic bridges to regularize intermediate states and use regularization as running cost of PETs. |
| Outcome: | The proposed methods can be used to tune large pre-trained language models . they can be compared to full-parameter fine-tuning by tuning a small number of parameters . |
Copied to clipboard
| Challenge: | Existing studies rely on the small language model (SLM) to enhance them jointly, and the large language model’s strong reasoning ability is ignored. |
| Approach: | They propose a framework which can make knowledge base completion and knowledge base question answering enhance each other in an iterative manner by combining the strengths of the small language model and the large language model. |
| Outcome: | The proposed framework surpasses baselines for both KBC and KBQA tasks over two public benchmark data sets. |
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: | Existing work on affected package identification is limited by large language models . a recent study shows that 84% third-party packages contain security vulnerabilities . |
| Approach: | They propose a method to use LLM to generate the affected package . they propose supervised fine-tuning, retrieval augmented generation and a local search algorithm . |
| Outcome: | The proposed method has an average precision of 0.806 for identifying vulnerable packages in four most popular ecosystems in GitHub Advisory. |
Copied to clipboard
| Challenge: | Despite the promising performance of Large Vision Language Models, they sometimes generate incorrect outputs. |
| Approach: | They propose a multi-modal reward model that aligns LVLMs with human preferences. |
| Outcome: | The proposed model achieves excellent results on the latest multi-modal reward model benchmark and shows competitive performance on text-only reward model. |
Copied to clipboard
| Challenge: | Scaling laws in language modeling quantify training loss as a function of dataset size and model parameters, but neglect the critical role of data quality in model generalization. |
| Approach: | They propose to use effective training tokens as a combination of text diversity and syntheticity as measured by a teacher model to calculate scaling laws. |
| Outcome: | The proposed term effective training tokens is a combination of two readily-computed indicators of text diversity and syntheticity as measured by a teacher model. |
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: | XAI has achieved remarkable advances, but few efforts have been devoted to solving the problem. |
| Approach: | They propose a model-agnostic explanation method termed Sparse Contrastive Coding . they use model-based explanations to explain the black-box in a more model-oriented way . |
| Outcome: | The proposed method outperforms five state-of-the-art methods in interpretability and classification metrics. |
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 graph embedding methods overlook streaming nature of incoming data in real-world applications. |
| Approach: | They propose a disentangle-based continual graph representation learning framework inspired by the human’s ability to learn procedural knowledge. |
| Outcome: | The proposed framework outperforms state-of-the-art continual graph representation learning framework and alleviate catastrophic forgetting problem. |
Copied to clipboard
| Challenge: | Using paralinguistic cues is challenging for speech large language models, authors say . limited training data, annotation difficulty, and models exploiting lexical shortcuts are challenges . a recent study shows that modeling paralinguistic reasoning with multitask RL improves paralinguistics understanding . |
| Approach: | They propose multi-task reinforcement learning with chain-of-thought prompting that elicits explicit affective reasoning. |
| Outcome: | The proposed model improves paralinguistics understanding over baselines and strong proprietary models by 8-12% on Expresso, IEMOCAP, and RAVDESS. |
Copied to clipboard
| Challenge: | Existing methods to annotate large language models rely on a fixed set of human-annotated exemplars, which are not always the most effective for different tasks. |
| Approach: | They propose a method to adapt large language models to different tasks with task-specific example prompts (annotated with human-designed CoT reasoning) they introduce several metrics to characterize uncertainty so as to select the most uncertain questions for annotation. |
| Outcome: | The proposed method significantly improves performance on eight complex reasoning tasks. |
Copied to clipboard
| Challenge: | Modern large language models face a major bottleneck: each new version of a pre-trained model requires expensive and repetitive alignment. |
| Approach: | They propose a method that transfers fine-tuning updates across model versions . they extract the diff vector, which is the difference in parameters induced by fine-uning, from a source model and apply it to the base of a different target model. |
| Outcome: | The proposed method reduces training costs while maintaining model performance. |
Copied to clipboard
| Challenge: | Existing benchmarks for large language models (LLMs) are coarse, single-dimensional metrics and do not explicitly assess fine-grained legal reasoning. |
| Approach: | They propose a Practical Law Benchmark to evaluate large language models in real-world legal practice scenarios. |
| Outcome: | The proposed model is based on 850 questions and 13 scenarios with expert-designed evaluation rubrics. |
Copied to clipboard
| Challenge: | Existing methods to regularize task variance are unexplored in multi-task text classification. |
| Approach: | They propose a multi-task learning method based on adversarial multi-armed bandit to regularize the task variance by means of a mirror gradient ascent-descent algorithm. |
| Outcome: | The proposed method achieves state-of-the-art in multi-task text classification. |
Copied to clipboard
| Challenge: | Existing work mitigates memory overhead by offloading or compressing the Key-Value cache. |
| Approach: | They propose a method that integrates quantization and offloading into a generative large language model by using a hybrid compression method. |
| Outcome: | The proposed method outperforms the state-of-the-art in long-context evaluations. |
Copied to clipboard
| Challenge: | Existing studies on pre-trained Transformers show that they learn fine-grained neuron functions. |
| Approach: | They examine the presence of modularity in pre-trained Transformers . they focus on Mixture-of-Experts, a promising candidate for modularity . |
| Outcome: | The proposed structure stabilizes at the early stage, which is faster than neuron stabilization. |
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: | Existing benchmarks evaluate multi-session memory in text-only conversations or assess multimodal understanding within localized contexts. |
| Approach: | They propose a benchmark for evaluating multimodal long-term conversational memory in MLLM agents. |
| Outcome: | The proposed framework assesses key memory capabilities along three functional dimensions: memory extraction and test-time adaptation, memory reasoning, and memory knowledge management. |
Copied to clipboard
| Challenge: | Error correction is widely used in automatic speech recognition (ASR) to post-process the generated sentence. |
| Approach: | They propose a fast correction model that takes multiple ASR candidates as input for better correction accuracy. |
| Outcome: | The proposed model can reduce the word error rate (WER) with multiple candidates by 3.2% and 2.6%. |
Copied to clipboard
| Challenge: | SMARTMiner extracts specific, measurable, attainable, relevant, time-bound (SMART) goals from unstructured health coaching notes. |
| Approach: | They propose a framework for extracting and evaluating specific, measurable, attainable, relevant, time-bound (SMART) goals from unstructured health coaching notes. |
| Outcome: | The framework extracts behavior change goal spans and categorizes their SMARTness. |
Copied to clipboard
| Challenge: | Existing methods for optimizing reasoning quality are limited by overthinking. |
| Approach: | They propose a method that allocates thinking budgets to critical reasoning steps by tracking and aggregating step-wise uncertainty over time. |
| Outcome: | The proposed method reduces computation by over 45% on average while improving accuracy by 0.33–3.46%. |
Copied to clipboard
| Challenge: | Existing approaches to parsing are greedy transition-based and globally optimized . however, the decision-making process is based on local information, causing error propagation to subsequent steps. |
| Approach: | They propose hierarchical pointer network parsers and apply them to dependency and sentence-level discourse parsing tasks. |
| Outcome: | The proposed method outperforms existing methods and sets new state-of-the-art methods on benchmark datasets. |
Copied to clipboard
| Challenge: | Current unified stream-based memory systems facilitate context updates but remain vulnerable to interference from transient noise. |
| Approach: | They propose a hierarchical Graph-based Agentic Memory framework that explicitly decouples memory encoding from consolidation to resolve conflict between rapid context perception and stable knowledge retention. |
| Outcome: | The proposed framework outperforms state-of-the-art benchmarks on LoCoMo and LongDialQA. |
Copied to clipboard
| Challenge: | Existing approaches to sarcastic detection use a uniform reasoning strategy . existing approaches lack a framework to deal with the diverse analytical demands of sarcasm . |
| Approach: | They propose a Retrieval-Augmented Multi-Agent framework for Sarcasm Detection . the framework provides transparent and interpretable reasoning traces . |
| Outcome: | The proposed framework outperforms existing methods on four benchmarks and outperformed the strong GPT-4o+CoC baseline. |
Copied to clipboard
| Challenge: | PersLEARN is a tool designed to facilitate the cultivation of scientific perspectives . junior researchers struggle to identify the perspectives reflected in the literature and struggle to develop their own viewpoints. |
| Approach: | They propose a tool to facilitate the cultivation of scientific perspectives by interacting with a prompt-based model and allowing students to develop their own perspectives explicitly. |
| Outcome: | The proposed tool outperforms baseline approaches across multiple domains of literature from different perspectives. |
Copied to clipboard
| Challenge: | Existing vision-language planning methods struggle with long-horizon reasoning in dynamic environments due to the difficulty of training models to generate high-quality reasoning processes. |
| Approach: | They propose a framework that enhances reasoning and action selection for long-horizon task planning through structured evaluation and optimized training. |
| Outcome: | The proposed framework outperforms existing methods on short-horizon tasks but struggles with long-horizon reasoning in dynamic environments. |
Copied to clipboard
| Challenge: | Existing methods for event prediction are incomplete and noisy. |
| Approach: | They propose to use news-related event schemas to extract newsworthy events . they build a demo website and include a video demonstrating the framework . |
| Outcome: | The proposed framework can be applied to a wide variety of newsworthy scenarios. |
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: | 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: | Existing safety benchmarks focus on explicitly harmful content, but ignore context-dependent expressions such as dogwhistles. |
| Approach: | They propose a benchmark for evaluating LLM safety under dogwhistle-driven prompts . their findings expose a blind spot in current safety evaluation practices . |
| Outcome: | The proposed benchmark compared safety performance with toxic terms using dogwhistle-driven prompts. |
Copied to clipboard
| Challenge: | Existing models for zero-shot cross-domain dialogue state tracking require in-domain data to model a new domain. |
| Approach: | They propose a slot descriptions enhanced generative approach for zero-shot cross-domain DST by encoding a dialogue context and a slots with a pre-trained encoder and generating slot value in auto-regressive manner. |
| Outcome: | The proposed model significantly improves state-of-the-art results in zero-shot cross-domain setting. |
Copied to clipboard
| Challenge: | Existing methods to pretrain multilingual models are limited by the number of embedding parameters and the complexity of the model. |
| Approach: | They propose a framework that initializes the embeddings of unseen subwords and can adapt a model to multiple languages. |
| Outcome: | The proposed framework can adapt a pre-trained model to multiple languages efficiently and effectively. |
Copied to clipboard
| Challenge: | Existing Mixture-of-Experts training frameworks use a micro-batch to calculate LBL . micro-batches are restricted to a single sequence, preventing expert specialization . |
| Approach: | They propose to use a global-batch to loosen the load balance constraint for MoEs models . they propose to synchronize fi across micro-batches and then use it to calculate the LBL . |
| Outcome: | The proposed global-batch LBL improves the domain specialization of experts . the micro-battery LBL is almost at the sequence level, and the router is pushed to distribute the token evenly . |
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: | Prior work on RAG grounds Large Language Models to reduce factual hallucinations lacks a comprehensive evaluation of different language families. |
| Approach: | They propose a human-annotated dataset for evaluating LLM robustness in RAG . they find that most models struggle to balance the two capacities . |
| Outcome: | The proposed dataset includes both a non-relevant and a relevant subset. |
Copied to clipboard
| Challenge: | Recent studies show that obfuscation techniques for MLaaS are susceptible to embedding inversion attacks (EIAs). |
| Approach: | They propose a model obfuscation framework that protects client inputs from embedding inversion attacks by obliviously obbing models. |
| Outcome: | The proposed framework outperforms existing works in utility by 10% with a nearly 80% resistance rate against embedding inversion attacks. |
Copied to clipboard
| Challenge: | Existing benchmark datasets focus on short to moderately long videos, leaving a substantial gap in evaluating extensive, ultra-long egocentric video recordings. |
| Approach: | X-LeBench is a benchmark dataset designed to evaluate long egocentric video recordings . it uses a life-logging pipeline to produce realistic, coherent daily plans . |
| Outcome: | X-LeBench is a new benchmark dataset designed to evaluate long-form egocentric video understanding . the approach produces realistic, coherent daily plans aligned with real-world video data . |
Copied to clipboard
| Challenge: | Extractive Machine Reading Comprehension (MRC) is a challenging field in the field of Natural Language Processing. |
| Approach: | They propose a Question-Attended Span Extraction module to address the limitations of generative approaches for extractive machine reading comprehension (MRC) . module significantly enhances performance of pre-trained generative language models, enabling them to surpass the extractive capabilities of advanced Large Language Models (LLMs) |
| Outcome: | The QASE module surpasses state-of-the-art models in few-shot settings. |
Copied to clipboard
| Challenge: | Existing EE methods do not model event characteristics from large unsupervised data. |
| Approach: | They propose a contrastive pre-training framework for event extraction to better learn event knowledge from large unsupervised data and their semantic structures. |
| Outcome: | The proposed framework improves on ACE 2005 and MAVEN datasets on event extraction tasks. |
Copied to clipboard
| Challenge: | Existing studies fail to provide comprehensive service satisfaction analysis . Existing models fail to include satisfaction polarity classification and sentimental utterance identification . |
| Approach: | They propose a model that predicts customer sentiments and aggregates them into service satisfaction polarity. |
| Outcome: | The proposed model predicts customer sentiments and aggregates them into service satisfaction polarity and reasoning clues. |
Copied to clipboard
| Challenge: | Medical quality control indicators are essential to assess the qualifications of healthcare institutions for medical services. |
| Approach: | They propose a Chinese electronic medical records-based dataset for MQCIC and propose CF-IR method that disentangles clinical fact verification and inferential rule reasoning actions. |
| Outcome: | The proposed method outperforms Chain-of-Thought methods on 20 representative LLMs, covering general and medical models. |
Copied to clipboard
| Challenge: | Existing frameworks for extrapolating knowledge graphs are incomplete and do not represent real-world knowledge. |
| Approach: | They propose an explainable extrapolation reasoning framework that integrates propositional reasoning and first-order reasoning by introducing a reasoning graph that iteratively expands to find the answer. |
| Outcome: | The proposed framework outperforms state-of-the-art baselines in explaining future facts based on past counterparts. |
Copied to clipboard
| Challenge: | Large Reasoning Models (LRMs) have demonstrated remarkable capabilities in complex reasoning through long chain-of-thought, yet they struggle with precise computations and algorithmic operations. |
| Approach: | They propose a training-free approach that activates LRMs’ latent tool-use capabilities through artificial hints and a framework that enables models to learn effective tool utilization through diverse hint patterns and rejection-based data synthesis. |
| Outcome: | Experiments show that START significantly improves state-of-the-art LRMs across challenging benchmarks, including competition-level mathematics (AMC23: 95.0%, AIME24: 75.6%) and graduate-level science questions (GPQA: 64.6%). |
Copied to clipboard
| Challenge: | Currently, researchers focus on generating codes from requirement documents. |
| Approach: | They propose to generate source code from flowcharts with texts instead of directly translating requirements into codes. |
| Outcome: | The proposed model improves on the baselines by transforming flowcharts into pseudo-code . the proposed model is based on 320 flowchartes with their corresponding source codes . |
Copied to clipboard
| Challenge: | Recent knowledge graph embedding models based on hyperbolic geometry are complicated than Euclidean operations. |
| Approach: | They propose to use hyperbolic geometry to generate high-fidelity and parsimonious representations of hierarchical patterns in knowledge graphs. |
| Outcome: | The proposed models achieve state-of-the-art performance on two widely-used datasets and cost less than RotH. |
Copied to clipboard
| Challenge: | Existing models cannot capture consistency and diversity of relation patterns in different languages. |
| Approach: | They propose an adversarial multi-lingual neural relation extraction model which considers consistency and diversity among languages. |
| Outcome: | The proposed model outperforms the state-of-the-art models on real-world datasets. |
Copied to clipboard
| Challenge: | Existing solutions for document QA fail to provide personalized and up-to-date information efficiently. |
| Approach: | They propose to deploy a self-evolving, efficient LLM system that can offer personalized research services, maintaining a real-time updated database. |
| Outcome: | The proposed system saves 69.92% of time after efficient deployment. |
Copied to clipboard
| Challenge: | Current state-of-the-art LLMs exhibit clear limitations on multiple tasks, while performing well on tasks that involve contextual semantic understanding. |
| Approach: | They propose a mouse-based benchmark to evaluate LLMs' performance on NLP tasks involving Chouxiang Language. |
| Outcome: | The proposed benchmark evaluates the performance of LLMs on six NLP tasks involving Chouxiang Language. |
Copied to clipboard
| Challenge: | XML-CNN has been a popular research topic in NLP due to its superior performance . however, the increasing complexity brings difficulties to ensure the true architectural progress . |
| Approach: | They propose to re-examine an influential multi-label text classification method . they propose suitable baselines for multi-level text classification tasks . |
| Outcome: | The proposed method performs better than the original model, the authors show . they show that the re-implementation reveals contradictory results to the original work . |
Copied to clipboard
| Challenge: | Time series data is ubiquitous across various domains, including manufacturing, finance, and healthcare. |
| Approach: | They propose a multi-agent system to generate general and domain-specific annotations for time series data. |
| Outcome: | The proposed system outperforms existing methods on synthetic and real-world datasets. |
Copied to clipboard
| Challenge: | Existing methods to extract relations from distant supervision contain low-quality instances with noisy words and overlapped relations. |
| Approach: | They propose a Regularized Attentive Capsule Network to better identify overlapped relations in informal sentences . they embed multi-head attention into the capsule network as the low-level capsules . |
| Outcome: | Extensive experiments show that the proposed model improves relation extraction. |
Copied to clipboard
| Challenge: | a new text-image attribution analysis model for text-to-image generation is understudied due to ethical constraints . corporators have restricted the general public from using the models and their weights . |
| Approach: | They perform a text-image attribution analysis on Stable Diffusion, a recently open-sourced model. |
| Outcome: | The proposed method achieves a competitive 58.8-64.8 mIoU on noun segmentation and fair to good mean opinion scores on all parts of speech rated by humans . it also achieves good attribution quality on all part of speech, rated in humans - and the first to interpret large diffusion models from a visuolinguistic perspective. |
Copied to clipboard
| Challenge: | Existing neural semantic parsing methods for knowledge base question answering are lacking . a generic and extensible framework is lacking for KBQA. |
| Approach: | They propose a neural semantic parsing framework for large scale knowledge base question answering . they propose 'retriever-transducer-checker' framework that provides a retriever and a transducer . |
| Outcome: | The proposed framework is ranked at top1 overall performance on the GrailQA leaderboard and achieves competitive performance on typical WebQuestionsSP benchmark. |
Copied to clipboard
| Challenge: | Existing retrieval-based methods compromise semantic integrity through fixed-size chunking and suffer from inefficient linear scanning. |
| Approach: | They propose a method that preserves local semantic coherence through boundary-aware chunking and constructs a recursive hierarchical index rooted in the triangle inequality. |
| Outcome: | The proposed method achieves 3.6 end-to-end inference speedup with negligible degradation in model performance. |
Copied to clipboard
| Challenge: | Large language models (LLMs) are the foundation of modern natural language processing, powering applications across diverse domains. |
| Approach: | They propose a model-agnostic defense framework which aggregates and evaluates the outputs of a knowledge-injected LLM, a base LLM and a dedicated judge model to enhance resistance against membership inference attacks. |
| Outcome: | The proposed framework reduces MIA success by up to 27.8% for SFT and 526.3% for RAG compared to inference-time baseline while maintaining answer quality. |
Copied to clipboard
| Challenge: | Existing methods of lexical sememe prediction rely on external context information of words to represent meaning. |
| Approach: | They propose a character-enhanced sememe prediction framework for Chinese language that takes advantage of internal character information and external context information. |
| Outcome: | The proposed framework outperforms state-of-the-art methods on a Chinese sememe knowledge base and maintains robust performance even for low-frequency words. |
Copied to clipboard
| Challenge: | Existing benchmarks for multimodal large language models do not capture real-world clinical complexity. |
| Approach: | They evaluate multilingual, multimodal multimodal models of clinical cases with up to 7 distinct visual clinical evidence types per case. |
| Outcome: | The proposed model outperforms human models on differential diagnosis (DDx) generation and final diagnosis (FDx) selection. |
Copied to clipboard
| Challenge: | Large language models (LLMs) rely on English data for training, but are often not comparable across other languages. |
| Approach: | They propose to develop a family of open language models for SEA languages . they use BPE dropout, aggressive data cleaning and deduplication to improve model robustness . |
| Outcome: | The proposed models perform well across four benchmarks, including commonsense reasoning, question answering, reading comprehension and examination. |
Copied to clipboard
| Challenge: | Parameter-efficient tuning (PET) methods can drive large pre-trained language models by training only minimal parameters. |
| Approach: | They propose a parameter-efficient tuning method that is compatible with a tunable module and uses a random number generator to optimize fewer table parameters. |
| Outcome: | The proposed method is compatible with a tunable module and tested on 11 NLP tasks. |
Copied to clipboard
| Challenge: | Event temporal reasoning (ETR) is a significant indicator that a large language model understands the physical world. |
| Approach: | They propose a unified taxonomy for event temporal questions and construct a benchmark based on this taxonomies. |
| Outcome: | The proposed taxonomy inherits and expands existing datasets and contains multiple categories of compound questions. |
Copied to clipboard
| Challenge: | Recent advances in Large Language Models (LLMs) have demonstrated significant strides in generating high-quality speech . discretizing speech by neural audio codecs often results in sequences that differ from text sequences . |
| Approach: | They quantitatively analyze the Discrete Representation Inconsistency phenomenon within popular audio tokenizers such as EnCodec. |
| Outcome: | The proposed method mitigates the DRI phenomenon within popular audio tokenizers such as EnCodec. |
Copied to clipboard
| Challenge: | Recent studies on zero-shot and few-shot stance detection neglect implicit yet semantically important targets. |
| Approach: | They propose a framework that uses Large Language Models to annotate implicit targets . they also propose 'DyMCA' to dynamically adjust text-target contributions based on context . |
| Outcome: | The proposed framework achieves state-of-the-art on a benchmark dataset. |
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 approaches fuse long-term behavioral profiles and short-term interactions, suffering from representational misalignment and noise in transient signals. |
| Approach: | They propose a framework that redefines interest fusion as a hierarchical denoising process through diffusion models. |
| Outcome: | The proposed framework redefines interest fusion as a hierarchical denoising process through diffusion models. |
Copied to clipboard
| Challenge: | a new framework to digest relevant biomedical knowledge is needed to combat COVID-19 . quantity of research results is a bottleneck, and false information promoted in publications . |
| Approach: | a team of researchers has developed a framework to extract multimedia knowledge elements from scientific literature to combat COVID-19. |
| Outcome: | a new framework extracts fine-grained multimedia knowledge elements from scientific literature . it provides detailed contextual sentences, subfigures, and knowledge subgraphs as evidence . the framework is based on a case study of drug repurposing . |
Copied to clipboard
| Challenge: | MIRACL is a multilingual dataset for ad hoc retrieval across 18 languages that collectively encompass over three billion native speakers around the world. |
| Approach: | They have gathered over 726k high-quality relevance judgments for 78k queries over Wikipedia in these languages, where all annotations have been performed by native speakers hired by their team. |
| Outcome: | MIRACL covers languages that are typologically close as well as distant from 10 language families and 13 sub-families, associated with varying amounts of publicly available resources. |
Copied to clipboard
| Challenge: | Existing literature on knowledge extraction for question answering questions whether it is still relevant for question answerrs. |
| Approach: | They extend an existing benchmark with knowledge extraction annotations and evaluate commercial and open-source LLMs of varying sizes. |
| Outcome: | The proposed model can achieve high QA accuracy, but can still benefit from knowledge extraction through augmentation with extracted triples and multi-task learning. |
Copied to clipboard
| Challenge: | Sememes are defined as the minimum semantic units of human languages . but most languages do not have sememe-based linguistic knowledge bases . a new framework is proposed to predict sememes for words in other languages based on semems . |
| Approach: | They propose a framework to model correlations between sememes and multi-lingual words in low-dimensional semantic space for sememe prediction. |
| Outcome: | The proposed model improves on baseline methods on real-world datasets. |
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: | Large reasoning models exhibit human-like behaviors such as exploration, verification, reflection, and correction. |
| Approach: | They propose a supervised fine-tuning framework for long chain-of-thoughts reasoning . they leverage a difficulty-aware reward model to estimate the learning value of questions . |
| Outcome: | The proposed framework performs fine-tuning on large reasoning models on 10% of the data selected. |
Copied to clipboard
| Challenge: | Existing models fail to handle the varied search intents inherent to disaster management scenarios, resulting in inconsistent and unreliable performance. |
| Approach: | They propose a new series of dense retrieval models tailored for disaster management that train on a three-stage framework with unsupervised contrastive pre-training and difficulty-aware progressive instruction fine-tuning. |
| Outcome: | The proposed model outperforms baseline models by 13.3 times and 33 times over baselines with only 7.6% of their parameters. |
Copied to clipboard
| Challenge: | Recent work utilizes feedbacks generated from erroneous cases to guide prompt optimization . previous methods rely on computational resources and powerful GPUs . |
| Approach: | They propose an automatic prompt engineering method that leverages feedbacks from erroneous cases to guide prompt optimization. |
| Outcome: | The proposed method surpasses state-of-the-art methods with less steps and lower computational resources. |
Copied to clipboard
| Challenge: | Existing approaches to interpretable representation learning rely on masks that weight the significance of input features, but the origin of these masks is uncertain. |
| Approach: | They propose a causal framework that directly learns identifiable representations from attention weights rather than relying on importance masks. |
| Outcome: | The proposed framework learns identifiable and explainable representations from attention weights, rather than masks, and guarantees faithfulness on real-world datasets. |
Copied to clipboard
| Challenge: | In practice, memory designs vary widely across agents due to their diverse objectives and functionalities. |
| Approach: | They conduct an empirical study on how memory management choices impact the LLM agents’ behavior, especially their long-term performance. |
| Outcome: | The proposed methods show that LLM agents display an experience-following property, which results in highly similar agent outputs. |
Copied to clipboard
| Challenge: | Recent advances in large language models showcase varied multilingual capabilities across tasks . previous assessments focused on fundamental natural language processing (NLP) or isolated capability-specific tasks. |
| Approach: | They propose a multilingual multitask benchmark to assess multilingual capabilities . they use a large-scale benchmark covering fundamental and capability-specialized datasets . |
| Outcome: | The proposed benchmark compares models and tasks across languages and tasks and examines knowledge transfer from English to other languages. |
Copied to clipboard
| Challenge: | Existing benchmarks that focus on knowledge-intensive tasks do not reflect diverse educational scenarios. |
| Approach: | They propose a benchmark that incorporates 9 major scenarios and 4,000 educational contexts. |
| Outcome: | The proposed model performs comparable to state-of-the-art large models on the test set. |
Copied to clipboard
| Challenge: | Existing self-supervised speech encoders contain primarily acoustic rather than semantic information. |
| Approach: | They propose a task-agnostic unsupervised way to incorporate semantic information from large language model (LLM) systems into self-supervised speech encoders without labeled audio transcriptions. |
| Outcome: | The proposed approach improves spoken language understanding (SLU) performance by over 5% on intent classification (IC), with modest gains in named entity resolution (NER) and slot filling (SF), and spoken question answering (SQA) score by over 22%. |
Copied to clipboard
| Challenge: | ECom-Bench is a benchmark framework for evaluating LLM agent with multimodal capabilities in e-commerce customer support domain. |
| Approach: | They introduce a benchmark framework for evaluating LLM agent with multimodal capabilities in the e-commerce customer support domain. |
| Outcome: | The proposed benchmark features dynamic user simulation based on persona information from real e-commerce customer interactions and a realistic task dataset derived from authentic ecommerce dialogues. |
Copied to clipboard
| Challenge: | Semantic similarity modeling is central to many NLP problems such as question answering. |
| Approach: | They propose a pairwise word interaction model with syntactic structure priors to explore their effectiveness. |
| Outcome: | Extensive evaluations on eight benchmark datasets show that incorporating structural information improves over strong baselines. |
Copied to clipboard
| Challenge: | Existing datasets only cover limited relation types at once, which prevents models from taking full advantage of relation interactions. |
| Approach: | They construct a large-scale human-annotated ERE dataset with improved annotation schemes to address these drawbacks. |
| Outcome: | The proposed dataset is larger than existing datasets of all the ERE tasks by at least an order of magnitude. |
Copied to clipboard
| Challenge: | Existing backdoor defense paradigms focus on detecting and removing poisoned samples at pre-training or inference time. |
| Approach: | They propose a new approach where the backdoor attack is directly reversed by incorporating maximum entropy loss into training to neutralize the minimal cross-entropiness loss fine-tuning on poisoned data. |
| Outcome: | The proposed model significantly lowers the attack success rate on classification tasks and reduces the risk of backdoor attacks on clean data. |
Copied to clipboard
| Challenge: | Existing benchmarks designed to evaluate the reasoning capabilities of large models are limited in scope and lack flexibility to adapt difficulty according to evolving reasoning capacities of models. |
| Approach: | They propose a benchmark that incorporates multidisciplinary questions to evaluate the reasoning capabilities of large models and can adjust and update question difficulty based on the reasoning abilities of advanced models. |
| Outcome: | The proposed benchmark incorporates multidisciplinary questions to evaluate the reasoning capabilities of large models and can adjust and update question difficulty based on the reasoning abilities of advanced models. |
Copied to clipboard
| Challenge: | Recent work has shown that feed-forward networks (FFNs) in pre-trained Transformers are a key component, storing various linguistic and factual knowledge. |
| Approach: | They propose to convert a model into its MoE version with the same parameters and build expert routers to decide which experts will be used for each input. |
| Outcome: | The proposed model can use 10% to 30% of FFN parameters while maintaining over 95% original performance. |
Copied to clipboard
| Challenge: | Recent advances in large language models have showcased significant improvements in mathematics, but traditional benchmarks like GSM8k offer a unidimensional perspective. |
| Approach: | MathBench is a benchmark that rigorously assesses the mathematical capabilities of large language models. |
| Outcome: | MathBench spans a wide range of mathematical disciplines, offering a detailed evaluation of both theoretical understanding and practical problem-solving skills. |
Copied to clipboard
| Challenge: | Spectral-normalized identity priors (SNIP) is a structured pruning approach for a Transformer model. |
| Approach: | They propose a structured pruning approach which penalizes an entire residual module toward an identity mapping. |
| Outcome: | The proposed method improves on 5 GLUE benchmark tasks while maintaining comparable performance. |
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: | 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 retrieval-augmented generation methods rely on multiple calls of large language models (LLMs) Large-language models lack knowledge underrepresented in training data and still face hallucinations. |
| Approach: | They propose an efficient retriever for multi-hop question answering that generates new queries iteratively without the need for LLM calls. |
| Outcome: | The proposed method surpasses existing methods on three open-domain multi-hop question-answering datasets. |
Copied to clipboard
| Challenge: | Existing approaches to reduce label noise rely on heuristics and sample losses. |
| Approach: | They propose a method that transfers the noise distribution to a clean set and trains a model to distinguish noisy labels from clean ones using model-based features. |
| Outcome: | Empirically, the proposed approach improves over strong baselines on a wide range of tasks including text classification and speech recognition. |
Copied to clipboard
| Challenge: | Large Language Models often require domain-specific fine-tuning to address targeted tasks, which risks degrading their general capabilities. |
| Approach: | They propose to use self-generated dis-preferred weakness data to enhance model performance with a targeted training approach that minimizes interference with existing knowledge base. |
| Outcome: | The proposed approach ensures no reduction in generic capacity and achieves superior performance on downstream tasks compared to existing methods. |
Copied to clipboard
| Challenge: | Existing evaluation methods for mobile GUI agents rely on static frame assessments or offline static apps. |
| Approach: | They propose an evaluation system that leverages large language models as reward models to verify task completion and process achievement. |
| Outcome: | The proposed system addresses the limitations of traditional function based evaluation methods on online dynamic apps. |
Copied to clipboard
| Challenge: | Existing models for solving math word problems rely on predefined rules or feature engineering. |
| Approach: | They propose to incorporate copy and alignment mechanism into the sequence-to-sequence model to address two shortcomings . they use model output as a feature and incorporate it into the feature-based model to explore the effectiveness . |
| Outcome: | The proposed model outperforms the state-of-the-art models on the problem solving task. |
Copied to clipboard
| Challenge: | Distantly supervised relation extraction is used in knowledge bases but its low quality and noisy sentences are present in sentence bags. |
| Approach: | They propose a multi-layer revision network which emphasizes inner-sentence correlations before extracting relevant information within sentences. |
| Outcome: | The proposed method improves on two New York Times datasets. |
Copied to clipboard
| Challenge: | a recent study shows that process reward models can make mistakes, leading to wrong conclusions. |
| Approach: | They propose a consensus filtering mechanism that integrates MC estimation with LLM-as-a-judge to improve model performance and data efficiency. |
| Outcome: | The proposed model outperforms existing open-source alternatives and provides practical guidelines for future research. |
Copied to clipboard
| Challenge: | chain-of-thought (CoT) prompting has been shown to be effective on complex reasoning tasks, but the naive greedy decoding used in CoT prompting causes the repetitiveness and local optimality. |
| Approach: | They propose a generalizable ensemble-optimization method that uses a set of reasoning paths to prompt a language model one more time to determine the optimal answer. |
| Outcome: | The proposed method can be generalized to almost all scenarios where the type of input questions and answer format of reasoning paths may be unknown. |
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: | Recent studies have focused on integrating commonsense knowledge into chatbots to enhance their ability to understand and generate dialogue responses. |
| Approach: | They propose a framework that integrates commonsense knowledge into chatbots to enable them to elicit more empathetic responses. |
| Outcome: | The proposed framework enables LLMs to uncover the implicit requirements of the conversation, aiming to elicit more empathetic responses. |
Copied to clipboard
| Challenge: | Existing visual relationship detection models only use numeric ids of relation labels for training, but ignore semantic correlation between labels. |
| Approach: | They propose a visual Relationship prediction framework that transfers natural language knowledge from Contrastive Language-Image Pre-training models to enhance the relationship prediction. |
| Outcome: | The proposed framework improves visual relationship prediction by matching semantic correlations with relation triplets. |
Copied to clipboard
| Challenge: | Existing vision-Language-Action models are notoriously brittle to linguistic perturbations. |
| Approach: | They propose a probabilistic framework that disentangles physical affordance from semantic execution. |
| Outcome: | The proposed framework disentangles physical affordance from semantic execution. |
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: | Using code rules improves rule retrieval and application of grammar books in low-resource languages. |
| Approach: | They propose to decompose a grammar rule retrieval and application step into two steps . they propose to represent grammar rules as code functions to facilitate LLM reasoning . |
| Outcome: | The proposed model significantly boosts rule retrieval and application, resulting in 13.1% BLEU improvement. |
Copied to clipboard
| Challenge: | Existing work in vision language cross-modal reasoning uses binary or multi-choice classification based on source image and textual query. |
| Approach: | They propose a task where a textual premise is the background presumption on each source image. |
| Outcome: | The proposed task is based on a dataset of 15,360 movie screenshots and human-curated premise templates from 6 pre-defined categories. |
Copied to clipboard
| Challenge: | Existing studies focus on contrastive learning on the instance level without discriminating the contribution of each word. |
| Approach: | They propose a hierarchical contrastive learning mechanism which can unify semantic meaning in the input text. |
| Outcome: | The proposed model outperforms baselines on storytelling, paraphrasing, dialogue generation, and storytelling tasks. |
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: | Recent advances in multimodal reasoning overlook the audio modality. |
| Approach: | They propose a large-scale audio language model for deep reasoning that leverages a multitask audio dataset. |
| Outcome: | The proposed model performs well across key benchmarks including MMAU-mini, AIR-Bench chat/foundation, and MELD. |
Copied to clipboard
| Challenge: | Argument mining is a thriving task in natural language processing, but its generalization is limited by existing datasets. |
| Approach: | They propose to use a dataset to help model argument mining . the dataset AntCritic supports both argument component detection and argument relation prediction tasks. |
| Outcome: | The proposed model can detect arguments and identify their relationships automatically. |
Copied to clipboard
| Challenge: | Neural sequence models exhibit limited compositional generalization ability in semantic parsing tasks. |
| Approach: | They propose an end-to-end neural model to learn algebraic recombination for compositional generalization. |
| Outcome: | The proposed model is based on two realistic and comprehensive compositional generalization benchmarks. |
Copied to clipboard
| Challenge: | Large Language Models (LLMs) have shown impressive capabilities but a tendency to hallucinate. |
| Approach: | They propose a framework that introduces claim-triplets to represent claims in LLM responses and evaluates them against a reference. |
| Outcome: | The proposed framework outperforms prior methods by 18.2 to 27.2 points on a benchmark spanning various NLP tasks and annotated 11k claim-triplets from 2.1k responses by seven LLMs. |
Copied to clipboard
| Challenge: | Temporal Knowledge Graphs (TKGs) are dynamic structures representing entities and their evolving relationships through time. |
| Approach: | They propose a non-parametric model that encodes subject-centric histories into sequential embeddings. |
| Outcome: | The proposed model encodes subject-centric histories of entities, relations and temporal intervals into sequential embeddings. |
Copied to clipboard
| Challenge: | Low-Rank Adaptation (LoRA) is a key parameter-efficient fine-tuning method . however, its effectiveness is hampered by semantic drift and structural incoherence . |
| Approach: | They propose a low-rank Adaptation framework that tackles semantic drift and structural incoherence by pruning task-irrelevant directions. |
| Outcome: | Experiments on large language models, vision models, and vision models show that the proposed framework outperforms LoRA and advanced dynamic rank allocation and sparsity-based methods. |
Copied to clipboard
| Challenge: | Existing generative language models (LMs) can generate new or reusable theorems, but their ability to generate new theorels is under-explored. |
| Approach: | They propose to use Metamath library to generate new theorems that can be saved as reusable knowledge for future theoretical proving. |
| Outcome: | The proposed benchmark evaluates whether an agent can generate valuable (and possibly brand new) theorems that are applicable for downstream theoretic proving as reusable knowledge. |
Copied to clipboard
| Challenge: | Existing LLM-based agents have strong performance on held-in tasks, but their generalizability to unseen tasks remains poor. |
| Approach: | They propose a reward-based generalizable reward model to guide the policy model for effective test-time search. |
| Outcome: | The proposed agentRM outperforms existing agents on held-in tasks by 8.8 points on average. |
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: | Pre-Trained Models (PTMs) have reshaped the development of natural language processing (NLP) but it is not easy to obtain high-performing PTMs without a large amount of labeled training data and deploy them online with fast inference speed. |
| Approach: | They propose to make it easy to build NLP applications with knowledge-enhanced pre-training and knowledge distillation. |
| Outcome: | EasyNLP supports a comprehensive suite of NLP algorithms and features knowledge-enhanced pre-training, knowledge distillation and few-shot learning functionalities. |
Copied to clipboard
| Challenge: | Existing methods for harmful meme detection are limited due to the dynamic nature of memes . eliciting knowledge-revising behavior within the LMM agent is a key factor in achieving this goal . |
| Approach: | They propose an agency-driven framework for low-resource harmful meme detection . they use annotated memes to leverage label information as auxiliary signals for model . |
| Outcome: | The proposed framework achieves superior performance than state-of-the-art methods on the low-resource harmful meme detection task. |
Copied to clipboard
| Challenge: | Existing methods for labeling relational facts require significant expert labor to write relation-specific patterns, which makes them too sophisticated to generalize quickly. |
| Approach: | They propose a neural pattern diagnosis framework that can summarize and refine relation-specific patterns with human experts in the loop. |
| Outcome: | The proposed framework can summarize and refine high-quality relational patterns from noise data with human experts in the loop. |
Copied to clipboard
| Challenge: | Pre-trained language models (PLMs) can achieve comparable performance to full-parameter fine-tuning by tuning a few soft prompts, but require much more training time than fine-timing. |
| Approach: | They empirically investigate the transferability of soft prompts across different downstream tasks and PLMs to determine what decides prompt transferability. |
| Outcome: | The proposed method can achieve comparable performance to full-parameter fine-tuning by tuning a few soft prompts, but requires much more training time than fine-timing. |
Copied to clipboard
| Challenge: | Large and sparse feed-forward layers (S-FFN) have proven effective in scaling up the model size for pretraining large language models. |
| Approach: | They compare S-FFN architectures for language modeling and compare their performance and efficiency . they found a simpler selection method that selects blocks through their mean aggregated hidden states . |
| Outcome: | The proposed model size and selection method achieve lower perplexity in language model pretraining compared to existing MoE architectures. |
Copied to clipboard
| Challenge: | Prior work has attempted to mitigate this issue by using adaptive reasoning strategies, but these methods overlook a fundamental bottleneck: visual perception failures. |
| Approach: | They propose a meta-reasoning controller that dynamically routes computation among three decision paths at each generation step. |
| Outcome: | The proposed method outperforms slow-thinking methods while producing shorter responses. |
Copied to clipboard
| Challenge: | Existing knowledge injection methods are not suitable for enhancing pre-trained language models with external knowledge bases. |
| Approach: | They propose a plug-and-play knowledge injection method where knowledge bases are injected into frozen existing downstream models by a knowledge plugin. |
| Outcome: | The proposed method improves the performance of knowledge injection on knowledge-driven tasks while keeping model parameters frozen. |
Copied to clipboard
| Challenge: | MLLMs perform poorly on traditional culture images, indicating limitations in understanding high-level semantics and lacking a deep knowledge base of Chinese traditional culture. |
| Approach: | They propose to use Chinese images to assess MLLMs' higher-order perception and understanding of Chinese visual content. |
| Outcome: | The proposed model incorporates images that represent Chinese traditional culture, such as famous Chinese traditional paintings, to ensure the authenticity of the Chinese context. |
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: | Recent studies have shown that biased samples can be brittle for VQA models . however, the improvements on OOD data severely sacrifice the performance on the in-distribution (ID) data. |
| Approach: | They propose a contrastive learning approach that exploits biased samples for unbiased information that contributes to reasoning. |
| Outcome: | The proposed method achieves competitive performance on the OOD dataset while maintaining robustness on the ID dataset. |
Copied to clipboard
| Challenge: | Large Language Model (LLM) agents struggle with ultra-long-horizon tasks requiring hundreds or thousands of interaction steps. |
| Approach: | They propose a framework that reconceptualizes context management as a Next Step Prediction problem. |
| Outcome: | The proposed framework improves task success rates and robust cross-lingual performance. |
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: | Existing methods for low-rank decomposition overlook decomposing errors and suboptimal approximation. |
| Approach: | They propose a low-rank decomposition framework that integrates low-level optimization at column and module levels. |
| Outcome: | The proposed framework outperforms state-of-the-art methods and baselines in SVD and pruning. |
Copied to clipboard
| Challenge: | Existing studies formalize MWP as a generation task but mathematical expressions are prone to minor mistakes. |
| Approach: | They propose a ranking task for math word problem (MWP) that learns from its own mistakes and distinguishes between correct and incorrect expressions. |
| Outcome: | The proposed model outperforms baselines on the classical Math23k dataset and is 7% higher than the state-of-the-art. |
Copied to clipboard
| Challenge: | Large Language Models (LLMs) have improved the open-domain QA’s performance, but how to efficiently handle enterprise-exclusive corpora and build domain-specific QA systems are still not studied for industrial applications. |
| Approach: | They propose a general and comprehensive framework based on Retrieval Augmented Generation (RAG) and facilitate the whole business process of establishing QA systems for IT operations and maintenance. |
| Outcome: | The proposed framework achieves superior results on two kinds of QA tasks. |
Copied to clipboard
| Challenge: | Existing methods to analyze filter bubbles in the static recommendation environment are unable to burst them during user interactions. |
| Approach: | They propose a paradigm to learn multi-grained user preferences during dynamic user-system interactions via natural language conversations to burst filter bubbles. |
| Outcome: | The proposed paradigm achieves state-of-the-art performance and the superior of bursting filter bubbles in the conversational recommendation system. |
Copied to clipboard
| Challenge: | Existing benchmarks for long-form generation assess real-world queries with hard-to-verify metrics or use synthetic setups that overlook real-life intricacies. |
| Approach: | They propose a new approach that balances verifiable and real-world assessment with Target-Anchored Evaluation. |
| Outcome: | The proposed model balances real-world and verifiable assessment with Target-Anchored Evaluation (TAE) it generates queries, textual materials, and anchors based on verifier targets within real-life scenarios . |
Copied to clipboard
| Challenge: | Recent Large Multimodal Models (LMMs) have shown promising potential for performing end-to-end KIE directly from document images. |
| Approach: | They propose a benchmark to evaluate the performance of Large Multimodal Models (LMMs) using a constrained-category KIE track and an open-categorical KIE Track. |
| Outcome: | Experiments on 15 state-of-the-art LMMs show performance degradation under diverse schema definitions, long-tail key fields, and complex layouts, along with pronounced performance disparities across different document types and scenarios. |
Copied to clipboard
| Challenge: | LongInsightBench is the first benchmark designed to assess models’ ability to understand long videos, with a focus on human language, viewpoints, actions, and other contextual elements. |
| Approach: | They propose a benchmark to assess models’ ability to understand long videos with a focus on human language, viewpoints, actions, and other contextual elements. |
| Outcome: | The proposed model excels in three key areas: a) long-duration, human-centric videos; b) diversifying and challenging task scenarios; c) quality assurance pipeline; and d) reliability. |
Copied to clipboard
| Challenge: | Existing research on propaganda detection does not capture the motives behind the content or its broader impact. |
| Approach: | They propose a framework that dissects propaganda into techniques, arousal appeals, and underlying intent. |
| Outcome: | The proposed framework improves performance in a wide range of scenarios and can be used to identify and categorize propaganda techniques. |
Copied to clipboard
| Challenge: | Existing evaluations of LLMs in finance are text-only, monolingual, and largely saturated by current models. |
| Approach: | They propose a multilingual and multimodal benchmark for evaluating LLMs in real financial contexts. |
| Outcome: | The first expert-annotated multilingual and multimodal benchmark is released . it evaluates 21 leading LLMs and shows they perform better in multilingual settings . |
Copied to clipboard
| Challenge: | Recent advances in news summarization have created problems with “hallucinations” that are factually inconsistent with the source text. |
| Approach: | They propose to disentangle LLMs’ propensities to generate faithful and fake content by adopting a probing-based specific training method to improve their capacity of distinguishing two types of propensity. |
| Outcome: | The proposed method disentangles LLMs’ propensities to generate faithful and fake content and improves their ability to distinguish between two types of propensity. |
Copied to clipboard
| Challenge: | Existing methods for obtaining task-specific labels require prior knowledge of clustering categories and uncontrollable clustering centers. |
| Approach: | They propose a framework for supervised clustering using a discrete process and a robust Contrastive Learning module. |
| Outcome: | The proposed framework outperforms state-of-the-art models on a real-world dataset with just one label per class . the proposed framework is based on k-means clustering and a robust Contrastive Learning module . |
Copied to clipboard
| Challenge: | Existing pre-trained language models cannot recall factual knowledge of entities exhibited in large-scale corpora, especially those rare entities. |
| Approach: | They propose to build a pluggable Entity Lookup Table (PELT) on demand by aggregating the entity’s output representations of multiple occurrences in the corpora. |
| Outcome: | The proposed model can transfer entity knowledge from out-of-domain corpora into PLMs with different architectures. |
Copied to clipboard
| Challenge: | Existing approaches to learning-to-rank response selection are suboptimal due to ignorance of diversity of response quality. |
| Approach: | They propose to use off-the-shelf response retrieval models as automatic grayscale data generators to train response selection models. |
| Outcome: | The proposed approach can be automated without human effort on grayscale data. |
Copied to clipboard
| Challenge: | Many group decisions are open-ended, and aggregation approaches suppress minority perspectives . team members must surface hidden assumptions, discuss disagreements, negotiate acceptable trade-offs . |
| Approach: | They propose a multi-agent system that instantiates a proxy agent for each team member . they also conduct a structured discussion to elicit agreements and disagreements . |
| Outcome: | The proposed system outperforms direct aggregation on two teamwork tasks . it can judge how well individual views are represented in team decisions and consensually good deliverables . |
Copied to clipboard
| Challenge: | In-context machine translation (MT) with large language models can take advantage of linguistic resources such as grammar books and dictionaries. |
| Approach: | They propose to use in-context machine translation (MT) with large language models to take advantage of linguistic resources such as grammar books and dictionaries. |
| Outcome: | The proposed approach can take advantage of dictionaries and grammar books, but its performance is poor for many lowresource languages. |
Copied to clipboard
| Challenge: | Existing knowledge graph embedding methods restrict entities on hyper-ellipsoid surfaces, resulting in suboptimal knowledge graph completion. |
| Approach: | They propose a score function that leverages relation-specific translations between head and tail entities to relax constraints on hyper-ellipsoid surfaces. |
| Outcome: | The proposed method achieves state-of-the-art performance on link prediction and generalizes well to datasets in different domains and scales. |
Copied to clipboard
| Challenge: | Open-domain question answering aims to answer questions through text retrieval and reading comprehension . but, the success of these models relies on a massive volume of training data, which is not available in other languages . a new dataset aims at investigating cross-lingual OpenQA . |
| Approach: | They propose to use a dataset for cross-lingual OpenQA research to test models . they use XQA dataset to train models with large volumes of labeled data . |
| Outcome: | The proposed model achieves best results in almost all target languages while the performance is lower than that of English. |
Copied to clipboard
| Challenge: | Parameter-shared pre-trained language models (PLMs) have emerged as a successful approach in resource-constrained environments. |
| Approach: | They propose a method to enhance the inference efficiency of parameter-shared PLMs by pre-training models that can achieve even greater acceleration. |
| Outcome: | The proposed method improves inference efficiency on autoregressive and autoencoding models. |
Copied to clipboard
| Challenge: | Existing numerical MRC models are weak in numerical reasoning, such as addition, subtraction, sorting and counting. |
| Approach: | They propose a numerical MRC model that integrates numerical reasoning into existing MRC models and achieves an EM-score of 64.56% on the DROP dataset. |
| Outcome: | The proposed model outperforms all existing machine reading comprehension models by considering the numerical relations among numbers on the DROP dataset. |
Copied to clipboard
| Challenge: | Existing frameworks that focus on static tools and static assets are ineffective for self-evolving agents. |
| Approach: | They propose a paradigm of co-evolutionary Capability Expansion and Experience Distillation that leverages accumulated experience to guide dynamic creation of assets. |
| Outcome: | The proposed framework improves performance in single-task and cross-task settings by 18.53% over standard LLMs, 11.80% over agents evolving solely through experience, and 6.46% over those evolving solelly through asset creation. |
Copied to clipboard
| Challenge: | Existing graph neural networks can only process multi-hop relational reasoning on pre-defined graphs and cannot be directly applied in natural language relational reasoning. |
| Approach: | They propose a graph neural network with generated parameters using natural language sentences as inputs. |
| Outcome: | The proposed model can process relational reasoning on graphs and in natural language processing tasks. |
Copied to clipboard
| Challenge: | Existing methods for multi-turn, multi-speaker multimodal affect understanding are difficult to maintain conversation-level consistency under within-speaks' emotion shifts. |
| Approach: | They propose a framework that combines appraisal-guided structured generation with graph-structured reinforcement learning to extract triplets from multi-turn multimodal conversations. |
| Outcome: | The proposed framework outperforms baselines on public MECTEC benchmarks and improves structure-aware metrics on emotion shift coherence and core events. |
Copied to clipboard
| Challenge: | Text-to-Image Synthesis (TIS) aims to generate images based on textual inputs . but, current diffusion-based models lack entity knowledge and low inference speed . |
| Approach: | They propose a framework for training and deploying latent diffusion models with rich entity knowledge injected and optimized networks. |
| Outcome: | The proposed framework improves image quality and inference speed and can be used in industrial applications. |
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: | 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: | a recent study has shown that large language models can be useful for cross-lingual applications. |
| Approach: | They propose to annotate Chinese word senses using English WordNet synsets . they examine the relationship between two annotators and find patterns among synset . |
| Outcome: | The proposed method shows that the annotators agree on 38% of the synsets compared with the original synset . the results highlight similarities between the synnotated synset and the WordNet structure . |
Copied to clipboard
| Challenge: | Large language models (LLMs) driven by scaling laws can be developed in large model sizes. |
| Approach: | They propose a pruning-aware pretraining approach that decouples LLM pruning from direct pretraining. |
| Outcome: | The proposed model outperforms pretraining models with 100M 1B parameters in commen sense benchmarks. |
Copied to clipboard
| Challenge: | countless experimental papers lack empirical rigor, disregarding necessities such as statistical significance tests and computational environments. |
| Approach: | They propose to report the expected validation effectiveness of the best-tuned model with respect to the computational budget. |
| Outcome: | The proposed model favors negative errors and yields poor bootstrapped confidence intervals, the authors argue . they find that the proposed model is biased and uses error-prone assumptions . |
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: | Knowledge distillation (KD) has shown great success in BERT compression. |
| Approach: | They propose a knowledge distillation paradigm that extracts the teacher's hidden state knowledge and then compresses it into three dimensions. |
| Outcome: | The proposed paradigm gives rise to training speedup of 2.7x 3.4x for two kinds of student models and computing devices. |
Copied to clipboard
| Challenge: | Existing approaches to Named Entity Recognition focus on identifying non-nested entities, but there is no explicit guidance for boundary detection. |
| Approach: | They propose a Boundary-aware Semantic Differentiation and Filtration Network for nested NER that leverages a biaffine attention mechanism to generate a span representation matrix. |
| Outcome: | Extensive experiments on three benchmark datasets demonstrate the proposed model yields a new state-of-the-art performance. |
Copied to clipboard
| Challenge: | Language model pretraining is the cornerstone of universal language models (LMs), creating generalpurpose representations to excel across a variety of downstream tasks. |
| Approach: | They propose to use multi-granular tokens to sample large-scale language models for domain-specific use cases. |
| Outcome: | The proposed model outperforms random sampled samples on eight benchmarks with 1% of the data and performs on par with the full RefinedWeb data. |
Copied to clipboard
| Challenge: | Existing methods for relation prediction in knowledge graphs (KGs) are limited by the inductive setting because entities in training process are finite. |
| Approach: | They propose a graph convolutional network-based model LogCo with logical reasoning by contrastive representations that extracts subgraphs and relational paths between two entities to supply the entity-independence. |
| Outcome: | The proposed model outperforms existing methods on twelve inductive datasets. |
Copied to clipboard
| Challenge: | Existing work on name-switching focuses on word-level aspects but neglects subword-level characteristics shared across languages. |
| Approach: | They propose hierarchical meta-Embeddings that combine word-level and subword-level embeddings to create language-agnostic lexical representations. |
| Outcome: | The proposed model achieves state-of-the-art in English-Spanish code-switching scenarios. |
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: | Increasing number of people in the world today speak a mixed-language as a result of being multilingual. |
| Approach: | They propose a method to transfer learn on a code-switched speech recognition system by extracting information from high-resource monolingual datasets. |
| Outcome: | The proposed model outperforms baselines on speech recognition and language modeling tasks and is faster to converge. |
Copied to clipboard
| Challenge: | Existing methods for preference optimization of large language models use pairs of positive and negative samples, but the quality of positive samples may become similar during training, complicating preference learning. |
| Approach: | SeaPO introduces error types commonly occurring in large language models to improve preference learning. |
| Outcome: | SeaPO introduces error types into model Preference Optimization to improve model performance . negative samples are more erroneous than positive samples, and preference-based training mitigates errors . |
Copied to clipboard
| Challenge: | Existing benchmarks for conversational machine reading comprehension are inconsistent with real scenarios. |
| Approach: | They propose to use a Chinese CMRC benchmark to evaluate model's generalization ability towards diverse domains by using zero-shot/few-shot settings. |
| Outcome: | The proposed benchmarks are based on 831 hot-topic driven conversations with 4,742 turns and cover 33 domains. |
Copied to clipboard
| Challenge: | Prior work on LLMs focused on models that combine text and one other modality, such as image encoders or proprietary models that are not open sourced. |
| Approach: | They propose a unified model that reasons over diverse input modality signals and generates textual responses. |
| Outcome: | The proposed model performs better on multimodal tasks than industry-leading models . |
Copied to clipboard
| Challenge: | Existing methods to improve k-Nearest neighbor machine translation (kNN-MT) are based on the ability to non-parametrically adapt to new domains. |
| Approach: | They propose a method to boost the datastore retrieval of k-Nearest neighbor machine translation by reconstructing the original datastore. |
| Outcome: | The proposed method boosts the retrieval and translation quality of k-Nearest neighbor machine translation by reconstructing the original datastore. |
Copied to clipboard
| Challenge: | Using multiple sequence alignments (MSA) to extract evolutionary knowledge is limited. |
| Approach: | They propose to use multiple sequence alignments to augment protein representations . they propose to employ Retrieved Sequence Augmentation to enhance protein representation learning . |
| Outcome: | The proposed method surpasses MSA Transformer by 5% in structural and property prediction tasks while being 373 times faster. |
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: | Pre-trained language models capture factual knowledge from massive texts . but they are still quite behind the SOTA KGC models in terms of performance . |
| Approach: | They propose to use open-world assumption to evaluate PLM-based knowledge graph completion models . they propose to convert each triple and its support information into natural prompt sentences . |
| Outcome: | The proposed model is more accurate under the open-world assumption (OWA) this setting manual checks the correctness of knowledge that is not in KGs. |
Copied to clipboard
| Challenge: | Existing studies show that large language models are robust in commonsense reasoning . however, some variations in questions can lead to incorrect responses . |
| Approach: | They propose a large-scale bilingual benchmark consisting of 11,200 cases . they conduct extensive experiments on 41 representative LLMs . |
| Outcome: | The proposed benchmark systematically evaluates the robustness of large language models in commonsense reasoning. |
Copied to clipboard
| Challenge: | Long-form question answering requires two procedures: information retrieval and information synthesis. |
| Approach: | They propose a Chinese long-form question answering dataset called WebCPM . the dataset is based on a web search interface that engages with a search engine in real time . |
| Outcome: | The proposed dataset generates answers that are no worse than human-written ones . the dataset is the first Chinese LFQA dataset . |
Copied to clipboard
| Challenge: | Existing studies treat each transformer encoding layer as a single artificial neuron . layer-level embeddings aggregate multiple types of contextual attention captured by multiple head modules . |
| Approach: | They propose to embed each transformer encoding layer as a single artificial neuron . they propose to couple those ANs with their biological-neuron counterparts in the human brain . |
| Outcome: | The proposed models can be used to link representations to brain activity, the authors say . their results show that the proposed models carry meaningful neurolinguistic information . |
Copied to clipboard
| Challenge: | Large Language Models (LLMs) and Retrieval-augmented Generation (RAG) systems show promise, but their performance on cross-document MEQA remains underexplored due to the lack of tailored benchmarks. |
| Approach: | They propose a scalable multi-document, multi-entity benchmark to evaluate LLMs' capacity to retrieve, consolidate, and reason over scattered and dense information. |
| Outcome: | The proposed benchmarks show that even advanced models achieve only 59% accuracy on MEBench. |
Copied to clipboard
| Challenge: | Existing work on long document visual question answering is based on Retrieval-Augmented Generation (RAG) where textual or visual content is encoded into embeddings and relevance is determined by similarity scores with respect to the original query. |
| Approach: | They propose a framework that employs an agentic, vision-aware workflow to address long document visual question answering through iterative information discovery and synthesis. |
| Outcome: | The proposed framework outperforms existing RL systems by 10.4% on the MMLongbench-Doc benchmark and demonstrates superior training performance over GRPO. |
Copied to clipboard
| Challenge: | Large language models (LLMs) are susceptible to a type of attack known as jailbreaking, which misleads LLMs to output harmful contents. |
| Approach: | They propose to leverage hidden representations into existing jailbreak targets to move the attacks along the acceptance direction. |
| Outcome: | The proposed methods are validated using the objective of existing jailbreak attacks. |
Copied to clipboard
| Challenge: | Text-to-speech (TTS) performance has improved with the advent of denoising Diffusion Probabilistic Models . however, perceived quality of audio depends on content, pitch, rhythm, and energy . |
| Approach: | They propose a visual TTS model with scalable diffusion transformers that complement phoneme sequences with visual information to generate high-perceived audio. |
| Outcome: | The proposed model outperforms existing models regardless of visibility of the scene . it can generate high-perceived audio, opening up new avenues for AR and VR applications . |
Copied to clipboard
| Challenge: | Distantly supervised relation extraction (RE) has attracted much attention in the past few years . previous methods to evaluate models manually or directly on autolabeled data have produced inaccurate evaluations . |
| Approach: | They propose to use distant supervision to generate large-scale autolabeled data . they build manually-annotated test sets for two DS-RE datasets and evaluate models . |
| Outcome: | The proposed method produces 53% wrong labels at the entity pair level in the popular NYT10 dataset. |
Copied to clipboard
| Challenge: | Standard test sets for supervised learning evaluate in-distribution generalization but are misleading when a dataset has systematic gaps. |
| Approach: | They propose a more rigorous annotation paradigm for NLP that helps to close systematic gaps in the test data. |
| Outcome: | The proposed model performs significantly lower on contrast sets than on the original test sets—up to 25% in some cases. |
Copied to clipboard
| Challenge: | Existing logical reasoning tasks are challenging, especially for large language models. |
| Approach: | They propose a logic reasoning task model that transforms each logical sample into reasoning paths and propose an atom extension strategy supported by equivalent logical formulas to form new reasoning paths. |
| Outcome: | The proposed architecture achieves competitive performances on two logical reasoning benchmarks and great generalization abilities. |
Copied to clipboard
| Challenge: | Existing video captioning benchmarks and models produce generic captions for videos that lack specific identification of individuals, locations, or organizations. |
| Approach: | They propose a task of directly summarizing news videos into captions that are entity-aware . they validate the effectiveness of their approach across three video captioning models . |
| Outcome: | The proposed approach is effective across three video captioning models. |
Copied to clipboard
| Challenge: | Existing methods for short video fake news detection ignore the implicit opinions and evolving nature of opinions across modalities. |
| Approach: | They propose a short video fake news model that mines implicit opinions within short videos and promotes the evolution of both explicit and implicit opinions across all modalities. |
| Outcome: | The proposed model outperforms existing methods on a publicly available dataset for short video fake news detection. |
Copied to clipboard
| Challenge: | Fine-tuning requires substantial computational resources and is prone to overfitting when applied to small datasets. |
| Approach: | They propose a parameter-efficient fine-tuning method that integrates a State Space Model (SSM) to interconnect low-rank matrices. |
| Outcome: | The proposed method achieves comparable performance to LoRA on the general language understanding evaluation (GLUE) benchmark while using only half the parameters. |
Copied to clipboard
| Challenge: | Existing studies show that stacking causal self-attention layers alone induces a positional bias in attention scores toward earlier tokens, but this differs from the bias toward later tokens observed in Transformer decoders, known as recency bias. |
| Approach: | They propose to stack causal self-attention layers and layer norm to induce recency bias in Transformer decoders by analyzing the interaction between causal self and other architectural components. |
| Outcome: | The proposed method provides new theoretical insights into how positional information interacts with architectural components and suggests improvements in positional encoding strategies. |
Copied to clipboard
| Challenge: | Recent studies show pre-trained language models contain matching subnetworks that have similar transfer learning performance as the original PLM. |
| Approach: | They propose to prune matching subnetworks using magnitude-based pruning . they propose to optimize the subnetwork structure towards the pre-training objectives . |
| Outcome: | The proposed method is more efficient in searching subnetworks and advantageous when fine-tuning within a range of data scarcity. |
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 for document-level event extraction struggle due to two intrinsic challenges: nested arguments and multiple events. |
| Approach: | They propose a role-interactive multi-event head attention network to solve two challenges . they map different events to multiple subspaces and then determine whether the current event exists . |
| Outcome: | The proposed model improves on two widely used DEE datasets on the Internet. |
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: | Existing evaluation benchmarks do not support arbitrarily interleaved images and text for both inputs and outputs. |
| Approach: | They propose to use a benchmark to evaluate interleaved text-and-image generation . they define five evaluation aspects for InterleavatedEval, a reference-free metric . |
| Outcome: | The proposed benchmarks cover a limited number of domains and use cases and lack comparableity-based metrics. |
Copied to clipboard
| Challenge: | Existing methods generate DocIDs based on textual content, which may result in weak semantic connections for similar documents due to variations in expression. |
| Approach: | They propose a new retrieval paradigm that generates unique document identifiers . they propose to use queries as a bridge to connect documents with varying relevance levels . |
| Outcome: | The proposed approach outperforms existing methods on multilingual e-commerce search datasets. |
Copied to clipboard
| Challenge: | Existing approaches to enzyme–reaction retrieval suffer from poor generalization across tasks and distributions . TIGER is a text-informed generalized enzyme-reaction retrieval framework that bridges enzymes and biochemical reactions. |
| Approach: | They propose a text-informed generalized enzyme-reaction retrieval framework that leverages protein-to-text generation models to distill textual knowledge from enzyme sequences. |
| Outcome: | The proposed framework outperforms state-of-the-art methods in enzyme–reaction retrieval tasks and distributions. |
Copied to clipboard
| Challenge: | Commercial news provides rich semantics and timely information for automated financial risk detection. |
| Approach: | They propose a semi-supervised Semantic-Topological Iteration Network, STINMatch, along with a news-enterprise knowledge graph to endorse the risk detection enhancement. |
| Outcome: | The proposed model outperforms existing models in terms of generalization and semantics and annotation. |
Copied to clipboard
| Challenge: | Currently, neural models for named entity recognition are based on data-driven models, with a strong emphasis on getting rid of the efforts for collecting external resources or designing hand-crafted features. |
| Approach: | They propose to use external gazetteers to efficiently access annotated data to generalize beyond the annotation of entities. |
| Outcome: | The proposed model can access external gazetteers while avoiding the effort to design hand-crafted features. |
Copied to clipboard
| Challenge: | Existing statically compressed pre-trained language models lack spatial and temporal efficiency due to their large size and wide width. |
| Approach: | They propose a spatially and temporally efficient model which retains the major capacity of PLMs. |
| Outcome: | The proposed model retains the major capacity of pre-trained language models at high compression and acceleration rate with 1/8 parameters and 1/19 FLOPs of BERT. |
Copied to clipboard
| Challenge: | Large Language Models (LLMs) have improved search engines and recommendation systems through their text understanding capabilities. |
| Approach: | They propose a token-level proximal policy optimization approach to empower LLMs to perform better in query generation through fine-tuning. |
| Outcome: | The proposed approach outperforms existing LLMs on an open-source and industrial dataset. |
Copied to clipboard
| Challenge: | Existing text data augmentation methods can not ensure the diversity and quality of the generated data, which leads to sub-optimal performance. |
| Approach: | They propose a meta-learning framework with progressive data augmentation for few-shot text classification using prompt-based data augmented by attention-based methods. |
| Outcome: | The proposed framework outperforms state-of-the-art models and shows better robustness on four public few-shot text classification datasets. |
Copied to clipboard
| Challenge: | AutoRegressive Translation models have to generate tokens sequentially during decoding and thus suffer from high inference latency. |
| Approach: | They propose to use hidden states and word alignments to help train NART models. |
| Outcome: | The proposed model improves on the WMT14 En-De and De-En datasets but is faster in inference than the current models. |
Copied to clipboard
| Challenge: | Large language models and diffusion models have opened new possibilities for AI-generated content . personalized cover image generation remains underexplored despite its critical role in boosting user engagement on digital platforms. |
| Approach: | They propose a framework that integrates MLLM-based prompting with personalized preference alignment to generate high-quality, contextually relevant covers. |
| Outcome: | The proposed framework improves image quality, semantic fidelity, and personalization, leading to stronger user appeal and offline recommendation accuracy in downstream tasks. |
Copied to clipboard
| Challenge: | Existing approaches to reinforcement learning (RL) rely on static, in-epoch metrics that overlook training dynamics, often introducing low-utility or outdated data. |
| Approach: | They propose a plug-and-play module that prioritizes cross-epoch ambiguous samples to neutralize the noise from stale experiences. |
| Outcome: | Extensive experiments on nine LLMs show that Adaptive Ambiguity Replay outperforms state-of-the-art baselines on real-world code editing tasks. |
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 diverse NMT models lack translation diversity due to a discrepancy between training and inference . despite the success of diverse NTM, there is still a lack of translation diversity . |
| Approach: | They propose a multi-candidate optimization framework for diverse NMT to deal with this defect. |
| Outcome: | The proposed framework is transparent to basic diverse NMT models, and universally makes better trade-off between diversity and quality. |
Copied to clipboard
| Challenge: | Existing hyperbolic neural networks encode features in the hyperbolical space yet formalize most of their operations in the tangent space. |
| Approach: | They propose a fully hyperbolic framework to build hyperbolical networks based on the Lorentz model by adapting Lorentzer transformations to formalize essential operations of neural networks. |
| Outcome: | The proposed framework has better performance on four NLP tasks compared with existing hyperbolic models . |
Copied to clipboard
| Challenge: | Diffusion large language models generate text through iterative denoising with bidirectional attention, enabling richer contextual dependencies. |
| Approach: | They propose a training-free parallel decoding method that fuses Trace Credit with current logits to boost the confidence of correct but underconfident tokens. |
| Outcome: | The proposed method achieves 5.48 times speedup with +0.48 accuracy on LLaDA-8B and is orthogonal to mainstream inference optimizations. |
Copied to clipboard
| Challenge: | Existing approaches focus on positive paragraphs which contain the answer during training, making it disturbed by similar but irrelevant paragraphs during testing. |
| Approach: | They propose a ranking model leveraging the paragraph-question and the paragraph relevance to compute a confidence score for each paragraph. |
| Outcome: | Experiments on three datasets show that the proposed model advances the state of the art. |
Copied to clipboard
| Challenge: | Extreme multi-label classification (XMC) aims to identify relevant subsets from numerous labels. |
| Approach: | They propose to store a tree model under the assumption of sparse data under the condition that some features may be unused when training binary classifiers in a trees method. |
| Outcome: | The proposed method can save 10% of the size of the standard one-vs-rest method for multi-label classification. |
Copied to clipboard
| Challenge: | Existing frameworks for leveraging background knowledge of narratives are limited. |
| Approach: | They propose a framework to ground free-texts to eventuality-centric KGs for narrative reasoning . their framework is based on a set of probabilistic probabilistic models that are grounded in the real world . |
| Outcome: | The proposed framework outperforms baseline models while providing interpretable evidence. |
Copied to clipboard
| Challenge: | Existing methods to train code LLMs view each programming language in isolation . experimental results show that Qwen2.5-xCoder can bridge the gap between different programming languages . |
| Approach: | They propose a framework that allows agents to collaborate to enhance multilingual instruction tuning for code LLMs. |
| Outcome: | Experimental results show that Qwen2.5-xCoder can transfer knowledge efficiently and effectively between languages. |
Copied to clipboard
| Challenge: | Large language models (LLMs) have been successful on NLP tasks but require huge parameter sizes and computational resources. |
| Approach: | They propose a parameter-efficient acceleration method that enhances computational efficiency through plug-and-play compression plugins. |
| Outcome: | The proposed method saves 53% computational costs using only 0.9% additional parameters with a performance drop of less than 2%. |
Copied to clipboard
| Challenge: | Existing text generation methods use autoregressive (AR) methods, which generate tokens one by one, but are time-consuming. |
| Approach: | They propose an efficient model FMSeq which utilizes flow matching to straighten the generation path, thereby enabling fast sampling for diffusion-based seq2seq text generation. |
| Outcome: | The proposed model generates comparable quality to the SOTA diffusion-based DiffuSeq in just 10 steps, achieving a 200-fold speedup. |
Copied to clipboard
| Challenge: | Recent work has shown that reinforcement learning with simple rule-based reward functions (RLVR) can induce emergent reasoning behaviors and yield gains in challenging domains such as math problem solving. |
| Approach: | They propose a rollout-alignment-quantization-aware RL which aligns training-side forward with the quantized rollout to minimize mismatch. |
| Outcome: | The proposed approach outperforms quantized-rollout training by +5.5 on Qwen3-30B-A3B MoE for math problems while maintaining low-bit throughput. |
Copied to clipboard
| Challenge: | Existing 4-bit training pipelines rely on max-scaling, which causes representation collapse . despite this, there are limitations in the accuracy of 4-bit LLM training . |
| Approach: | They propose a scaling strategy that uses half-scaling as a hardware-friendly default . they propose fp4 support that allows for a faster scaling of large language models . |
| Outcome: | The proposed scaling strategy narrows the gap between theoretical optimum and BF16 while maintaining the efficiency benefits of 4-bit training. |
Copied to clipboard
| Challenge: | Existing frameworks for semi-supervised text mining with lightweight models are limited by label data scarcity. |
| Approach: | They propose a framework for semi-supervised text mining with lightweight models . it incorporates online distillation to train lightweight student models by imitating the Teacher model . |
| Outcome: | The proposed framework exhibits notable performance enhancements over existing frameworks. |
Copied to clipboard
| Challenge: | Word embeddings are used to encode semantic information, but their quality is not consistent across the vocabulary due to the long-tail distribution of word frequency. |
| Approach: | They propose a reliability-aware name tagging model that uses word frequency to indicate word quality . they propose to use word frequency-based reliability signals to dynamically select and compose features . |
| Outcome: | The proposed model outperforms the baseline model on OntoNotes 5.0 and up to 5% gain on cross-genre data sets. |
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: | LLM-as-Judge frameworks provide scalable alternative to human evaluation . but the question of how intrinsic biases manifest in these settings remains unexplored . |
| Approach: | They conduct systematic analysis of four bias types in multi-agent LLM-as-Judge frameworks . they find debate framework amplifies biases sharply after initial debate . |
| Outcome: | The proposed frameworks amplify biases after debate and show they are stronger in meta-judge scenarios. |
Copied to clipboard
| Challenge: | Existing benchmarks for deep search agents rely on blackbox web search APIs . dynamic and opaque web APIs hinder reproducibility and fair comparisons - authors . |
| Approach: | They propose a benchmark that employs a fixed corpus for controlled retrieval for deep search agents. |
| Outcome: | The new benchmark shows that agents that combine large language models with retrieval tools excel at complex, reasoning-intensive queries. |
Copied to clipboard
| Challenge: | supervised learning is a challenging process due to the huge number of parameter combinations. |
| Approach: | They present an example of parameter selection in supervised learning . authors use a set of frequently occurring labels without a parameter tuning . they say this illustrates the seriousness of parameter tuning in a supervised field . |
| Outcome: | The proposed study shows that without adequate attention, the research progress can be uncertain or even illusive. |
Copied to clipboard
| Challenge: | Existing grounding approaches work well for simple queries, but many real-world information needs require synthesizing multiple pieces of evidence. |
| Approach: | They introduce "integrative grounding" to evaluate the ability to ground large language models in external knowledge sources. |
| Outcome: | The proposed approach is robust to redundant evidence, but rationalizes using internal knowledge when information is incomplete. |
Copied to clipboard
| Challenge: | Comparative Opinion Quintuple Extraction (COQE) aims to extract all comparative sentiment quintuples from product review text. |
| Approach: | They propose a model-unaware adaptive chain-of-feedback method to extract quintuples from product review text. |
| Outcome: | The proposed method improves performance on three benchmarks. |
Copied to clipboard
| Challenge: | Large Language Models (LLMs) have remarkable reasoning capabilities in complex tasks such as mathematics and coding. |
| Approach: | They propose an entropy-modulation method that adaptively reweighs tokens based on theoretically-estimated entropic variations. |
| Outcome: | The proposed method outperforms state-of-the-art methods in six mathematical reasoning and three coding benchmarks. |
Copied to clipboard
| Challenge: | Named Entity Recognition and Relation Extraction are key tasks of Information Extraction. |
| Approach: | They propose a causal framework called c ovariance and variance optimization framework (OVO) to optimize feature representations and conduct general debiasing. |
| Outcome: | The proposed framework minimizes characterizing features’ covariance for alleviating selection and distribution bias and enhances feature representation in the feature space. |
Copied to clipboard
| Challenge: | Recent advances in large language models have facilitated the development of intelligent applications like automatic web search (Qin et al., 2023) Several methods exist for generating JSON strings from LLMs, including Prompting but often miss certain schemas. |
| Approach: | They propose to use 40K different JSON schemas to assess models' ability to generate valid JSON outputs. |
| Outcome: | The proposed model improves both in generating JSON outputs and downstream tasks. |
Copied to clipboard
| Challenge: | Recent advances in Large Language Models (LLMs) have demonstrated remarkable success across diverse tasks such as instruction following, code generation, and medical diagnosis. |
| Approach: | They propose a supervised fine-tuning-based auxiliary loss for Q-value estimations during supervised refinement. |
| Outcome: | The proposed method outperforms beam search on GSM8K, MATH, and GAOKAO on reasoning benchmarks. |
Copied to clipboard
| Challenge: | Existing reward models concatenate contexts and responses, but they often ignore crucial segments of the context that are important for evaluating the response quality. |
| Approach: | They propose a reward model that evaluates the response quality based on a given context and assigns a rewards reward. |
| Outcome: | The proposed framework significantly improves preference modeling by increasing attention to relevant information within the context and achieves better generalizability. |
Copied to clipboard
| Challenge: | Existing methods for Temporal Knowledge Graph reasoning capture indeterminacy in future events, but they are limited in capturing it. |
| Approach: | They propose a Temporal Knowledge Graph reasoning process that denoises historical events and introduces Gaussian noise to corrupt target facts. |
| Outcome: | Empirical results show that DiffuTKG outperforms state-of-the-art methods on four real-world datasets. |
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: | Existing pre-training objectives do not explicitly model relational facts in text . Experimental results show that ERICA can improve typical PLMs on several language understanding tasks, including relation extraction, entity typing and question answering. |
| Approach: | They propose a contrastive learning framework ERICA to obtain a deep understanding of entities and relations in text. |
| Outcome: | The proposed framework can improve PLMs on several language understanding tasks, especially under low-resource settings. |
Copied to clipboard
| Challenge: | Existing methods for identifying domain-shifted instances are prone to OOD and adversarial inputs. |
| Approach: | They propose an unsupervised method that separates, extracts, and learns the semantic role labeling guided out-of-distribution Detection (SRLOOD) they propose a self-supervised approach to enhance global-local feature learning by predicting SRL extracted role. |
| Outcome: | The proposed method achieves SOTA performance on four OOD benchmarks. |
Copied to clipboard
| Challenge: | Group Relative Policy Optimization (GRPO) has significantly advanced the reasoning ability of large language models (LLMs). |
| Approach: | They propose a token-level framework that leverages sequence-level likelihood to link group-level rewards with individual tokens via token- level aggregation and introduces a KL-Divergence mask constraint that targets tokens with positive advantages and decreasing entropy to mitigate abrupt policy updates. |
| Outcome: | Experiments show that TEPO achieves state-of-the-art performance on mathematical reasoning benchmarks and reduces convergence time by 50% compared with GRPO/DAPO. |
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: | Weak-to-strong generalization is a promising approach to guide stronger systems, but its effectiveness is constrained by the inherent imperfections of weak model supervision. |
| Approach: | They propose a theoretically grounded approach that replaces forward KL divergence with reverse KL, which prioritizes high-confidence predictions. |
| Outcome: | The proposed approach replaces forward KL divergence with reverse KL, reducing the influence of unreliable weak supervision. |
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: | Generative retrieval (GR) is a transformative paradigm in search and recommender systems . however, data sparsity and long-tailed distribution hinder the full utilization of GR . |
| Approach: | They propose a method to reduce the "Hourglass" phenomenon in RQ-SID where codebook tokens become overly concentrated. |
| Outcome: | The proposed methods improve retrieval efficiency and generalization capabilities. |
Copied to clipboard
| Challenge: | Recent research on text-to-Query has explored using large language models to convert user query intent to executable code. |
| Approach: | They propose a novel semantic parsing task that leverages large language models to generate domain-specific language and post-processing code to support multi-index Elasticsearch queries. |
| Outcome: | The proposed model outperforms DeepSeek-R1 on the large Elasticsearch Dataset (LED) and BirdES datasets. |
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: | Open Information Extraction (OpenIE) is a key NLP task aimed at extracting structured information from unstructured text sources. |
| Approach: | They propose to categorize OpenIE into rule-based, neural, and pre-trained large language models and discuss each within a chronological framework. |
| Outcome: | The paper categorizes OpenIE approaches into rule-based, neural, and pre-trained large language models, discussing each within a chronological framework. |
Copied to clipboard
| Challenge: | Recent work in task-independent graph semantic parsing has shifted from symbolic approaches to neural models, showing strong performance on different types of meaning representations. |
| Approach: | They propose a framework that incorporates prior knowledge from a symbolic parser into a decision criterion for beam search to address these limitations. |
| Outcome: | The proposed framework improves on the in-distribution test set but degrades significantly on long-tail situations while the symbolic parser performs more robustly. |
Copied to clipboard
| Challenge: | Existing evaluation metrics for natural language generation tasks favor text generated by different LMs . human evaluation by experts is the most reliable approach, but it is costly and time-consuming . |
| Approach: | They examine whether language model-driven evaluation metrics exhibit bias toward underlying language models in the context of summarization tasks. |
| Outcome: | The proposed evaluation metrics tend to assign inflated scores to outputs generated by the very model they are based on. |
Copied to clipboard
| Challenge: | Large language models (LLMs) have demonstrated exceptional coding capabilities, but their debugging capabilities remain relatively unexplored. |
| Approach: | They propose a debugging benchmark consisting of 4,253 LLMs with four major bug categories and 18 minor types in C++, Java, and Python. |
| Outcome: | The proposed benchmark covers four major bug categories and 18 minor types in C++, Java, and Python. |
Copied to clipboard
| Challenge: | Current multimodal benchmarks focus on facts within individual images, but neglect associative relations among multiple images. |
| Approach: | They propose a multi-image relational association task and a MMRA benchmark to evaluate LVLMs. |
| Outcome: | The proposed benchmarks show that entity-level multi-image perception tasks pose greater challenges than image-level 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: | stance detection is a task to identify attitudes from opinions towards certain targets, but it is expensive and time-consuming . stance detector is based on labeled data, but unlabeled data can be collected easier . |
| Approach: | They propose a semi-supervised framework for few-shot stance detection that uses unlabeled data to learn more distinguishable representations for different targets. |
| Outcome: | The proposed framework achieves state-of-the-art performance on multiple benchmark datasets. |
Copied to clipboard
| Challenge: | Recent studies have explored transforming user inputs to obfuscated embedded vectors, so that the data will not be eavesdropped by service providers. |
| Approach: | They propose to transform user inputs to obfuscated embedded vectors so that the data will not be eavesdropped by service providers. |
| Outcome: | The proposed inversion attack can recover user input 100% from the obfuscated vectors without a solid and deliberate security design and analysis . |
Copied to clipboard
| Challenge: | Evaluating natural language generation systems is challenging due to the diversity of valid outputs. |
| Approach: | They propose an inversion learning method that learns effective reverse mappings from model outputs back to their input instructions. |
| Outcome: | The proposed method requires only a single evaluation sample and eliminates manual prompt engineering. |
Copied to clipboard
| Challenge: | Xu and Peng, 2025) . . SPUR is a comprehensive benchmark for scientific experimental image perception, understanding, and reasoning, comprising 4,264 question-answering (QA) pairs derived from 1,084 expert-curated images. |
| Approach: | They propose to use 4,264 question-answering (QA) pairs derived from 1,084 expert-curated images to evaluate the visual perception of multimodal large language models (MLLMs) . they also propose to utilize cross-panel relation understanding to evaluate MLLM’s ability to decipher intricate cross-panel relations. |
| Outcome: | The proposed model is based on 4,264 question-answering pairs derived from 1,084 expert-curated images. |
Copied to clipboard
| Challenge: | Large-scale pre-trained language models such as BERT are popular solutions for text classification. |
| Approach: | They argue that large-scale pre-trained language models such as BERT are popular solutions for text classification . authors argue that running a simple baseline like linear classifiers on bag-of-words features is important for text classification . |
| Outcome: | The proposed approach may only sometimes get satisfactory results for some problems. |
Copied to clipboard
| Challenge: | Current frontier models sometimes generate false outputs or answers that are not substantiated by evidence. |
| Approach: | They propose Chinese SimpleQA, a Chinese benchmark to evaluate LLMs' factuality . they focus on Chinese language over 6 major topics with 99 diverse subtopics . |
| Outcome: | The Chinese SimpleQA benchmark evaluates the factuality ability of LLMs . the questions and answers are short and easy-to-evaluate . |
Copied to clipboard
| Challenge: | Existing methods to mitigate lexical bias in toxic language detection (TLD) do not exploit the “useful” and “misleading” impact of the bias. |
| Approach: | They propose a counterfactual Causal Debiasing Framework to mitigate lexical bias in toxic language detection (TLD) it preserves the “useful impact” of lexical bias and eliminates the "misleading impact" they propose to use the same framework to analyze the causal effect of a sentence and bias tokens . |
| Outcome: | The proposed framework preserves the “useful impact” of lexical bias and eliminates the ‘misleading impact’ Empirical evaluations show that the proposed model outperforms current debiased models for out-of-distribution data. |
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: | Current approaches to Reinforcement Learning (RL) rely on massive static datasets, leading to computational inefficiency and redundant gradient updates. |
| Approach: | They propose a data-centric RL framework that dynamically selects the most informative training samples to optimize RL for mathematical reasoning. |
| Outcome: | The proposed framework achieves comparable performance to full-data training methods while requiring only 1.5K samples instead of 220K, reducing training time from 13 days to just 4 hours on 8A800 GPUs. |
Copied to clipboard
| Challenge: | Existing prompts for complex reasoning tasks are limited to specific tasks with few-shot examples due to constraints like context length and information extraction accuracy. |
| Approach: | They propose a method to build structured reasoning processes by injecting human insights into LLMs' training data. |
| Outcome: | The proposed framework outperforms baselines in the analysis of large language models. |
Copied to clipboard
| Challenge: | Existing language modeling methods rely on large-scale text data to learn the sequential patterns of words. |
| Approach: | They propose to use sememes to represent the implicit semantics behind words for language modeling . they propose to employ sememe-driven language models to fine-grained semem-level semantics . |
| Outcome: | Experiments on language modeling and the downstream application of headline generation show the effectiveness of SDLM. |
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 quantization methods for large language models suffer performance degradation at ultra-low bit-widths due to key cache outliers. |
| Approach: | They propose a vector quantization method that suppresses outliers in the key cache and reduces memory access overhead. |
| Outcome: | The proposed method outperforms baseline quantization methods across long-context understanding and mathematical reasoning tasks while minimizing memory access overhead. |
Copied to clipboard
| Challenge: | a holistic review systematically integrating psychology across the LLM lifecycle remains missing. |
| Approach: | They examine how psychological theories can inform stages of LLM development . they highlight current trends and gaps in how psychological theory is applied . |
| Outcome: | The authors highlight current trends and gaps in how psychological theories are applied . they argue that psychological insights have shaped pivotal NLP breakthroughs . |
Copied to clipboard
| Challenge: | Existing large language models struggle to support numerous low-resource languages . Existing models lack sufficient training data for effective parameter updating . |
| Approach: | They propose a framework for adapting LLMs to unseen languages by in-context learning. |
| Outcome: | The proposed framework improves Chinese-to-Zhuang translation performance and Zhuan-to Chinese translation performance. |
Copied to clipboard
| Challenge: | Parameter-Efficient Tuning (PET) fine-tunes pre-trained language models for downstream tasks, but a large reduction in the number of attackable parameters will greatly affect the effectiveness of backdoor attacks, resulting in backdoor forgetting. |
| Approach: | They propose a gradient control method to consolidate the attack effect by freezing most parameters of the pre-trained model and fine-tuning only a small number of parameters. |
| Outcome: | The proposed method improves sentiment classification and spam detection, and can be applied to different tasks. |
Copied to clipboard
| Challenge: | Parameter-efficient fine-tuning (PEFT) is a common method for fine- tuning large language models . however, once updated, PEFT modules suffer performance degradation on newer versions . |
| Approach: | They propose a method that enhances the PEFT module by focusing on the task-specific pattern while reducing its dependence on certain knowledge in the base model. |
| Outcome: | Experiments show that PEFT modules can maintain performance on updated models without re-tuning . the proposed approach can be used in real-world applications with large model sizes . |
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: | Event detection is a key part of event extraction, but there are two issues with word-based models in languages without natural delimiters, such as Chinese. |
| Approach: | They propose a framework that can solve the problem of word- trigger mismatch . they also use an external knowledge base to model polysemous characters and words . |
| Outcome: | The proposed model outperforms state-of-the-art methods on two benchmark datasets and outperformed previous state- of-the art methods significantly. |
Copied to clipboard
| Challenge: | Parameter-efficient fine-tuning (PEFT) is an effective method for adapting pre-trained language models to various tasks efficiently. |
| Approach: | They propose a parameter-efficient fine-tuning framework that captures transferable knowledge as a weighted combination of adapters trained on source tasks. |
| Outcome: | The proposed method yields stable improvements over full fine-tuning and knowledge transferring methods on a broad range of tasks over 17 datasets. |
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: | Existing memory-augmented methods often incorporate full dialog histories without filtering, resulting in information redundancy and inference latency. |
| Approach: | They propose a framework that abstracts conversational context into Episodic Memory Units (EMUs) they propose EMA, MemDecider and a filtering decision module to reduce noise and improve overall performance. |
| Outcome: | The proposed framework reduces token consumption by 11.48% while improving performance on two widely-used benchmarks. |
Copied to clipboard
| Challenge: | Existing methods to learn incessantly emerging novel relations are overfitting the few memorized examples of old relations, causing confusion among existing relations. |
| Approach: | They introduce episodic memory activation and reconsolidation (EMAR) to continual relation learning. |
| Outcome: | The proposed method outperforms state-of-the-art models in catastrophic forgetting old relations. |
Copied to clipboard
| Challenge: | Character-level adversarial attacks preserve semantics but are costly and inefficient . generative LLMs are gaining popularity due to their uncertainty and vulnerability to textual adversarials . |
| Approach: | They propose an end-to-end framework that transforms discrete choices into continuous representations and a conflict resolution strategy that maps them back into discrete insertion operations. |
| Outcome: | The proposed framework improves ASR by 21.45% points and accelerates the attack by 3.66 times compared to baselines. |
Copied to clipboard
| Challenge: | Large language models (LLMs) are used to review academic papers, but are susceptible to textual adversarial attacks. |
| Approach: | They evaluate the robustness of large language models as automated reviewers in the presence of adversarial attacks. |
| Outcome: | The proposed model is robust against textual adversarial attacks, the authors argue . their findings highlight the importance of addressing adversarials to ensure integrity of scholarly communication. |
Copied to clipboard
| Challenge: | Existing methods for matching sentence pairs do not perform well in longer documents . Existing approaches for matching sentences do not work in longer document understanding tasks . |
| Approach: | They propose to model article pairs by comparing sentences that enclose same concept vertex . they propose to use a concept interaction graph to match articles by encoding sentences . |
| Outcome: | The proposed methods show significant improvements over existing methods . the proposed datasets consist of 30K pairs of breaking news articles . |
Copied to clipboard
| Challenge: | Existing approaches to joint entity-relation extraction are limited in their ability to capture the interdependence between the two sub-tasks. |
| Approach: | They propose a synergistic approach to capture interdependence between named entity recognition and relation extraction sub-tasks in a Synergetic Interaction Network. |
| Outcome: | The proposed model achieves significantly better performance on three benchmark datasets. |
Copied to clipboard
| Challenge: | High-quality, diverse data are vital for large language models (LLMs) but remain scarce and costly. |
| Approach: | They define the first HSS domain system covering 14 mainstream fields and introduce HSS-Synth. |
| Outcome: | the proposed pipeline outperforms 14 leading baselines on 16 benchmarks. |
Copied to clipboard
| Challenge: | Existing knowledge embedding tools are available for embeddable knowledge graphs. |
| Approach: | They propose a unified framework and various fundamental models to embed knowledge graphs into a continuous low-dimensional space. |
| Outcome: | The toolkit and pre-trained embeddings are available on http://openke.thunlp.org/. |
Copied to clipboard
| Challenge: | Recent years have witnessed the emergence and growth of many large-scale knowledge bases (KBs) however, there are some issues unsettled towards enriching the KBs. |
| Approach: | They propose a framework that decomposes the discovery problem into several facet components and an auto-encoder component to estimate some facets of the fact. |
| Outcome: | The proposed framework achieves promising results on a benchmark dataset. |
Copied to clipboard
| Challenge: | Large Language Models (LLMs) have revolutionized web search, but their integration is static and cannot handle complex contexts. |
| Approach: | They analyze existing research and analyze existing work from the perspectives of architecture, optimization, application, and evaluation. |
| Outcome: | The proposed models can comprehend user intentions and context and execute multi-turn retrieval with dynamic planning, extending search capabilities far beyond the web. |
Copied to clipboard
| Challenge: | Existing task weighting methods assign weights only based on training losses, while ignoring the gap between the training loss and generalization loss. |
| Approach: | They propose a task weighting algorithm which automatically weights the tasks via a learning-to-learn paradigm and a multi-task text classification paradigm. |
| Outcome: | Extensive experiments show that the proposed method outperforms existing methods in multi-task text classification. |
Copied to clipboard
| Challenge: | PuzzleGPT is a modular and iterative puzzlesolving method for predicting time and location from images. |
| Approach: | They propose to formalize this ability into core skills and implement it using different modules in an expert pipeline called PuzzleGPT. |
| Outcome: | The proposed method outperforms large VLMs and finetuned models on TARA and WikiTilo and rivals or surpasses finetuned models. |
Copied to clipboard
| Challenge: | Empirical evidence suggests that LLMs perform worse than conventional KGC approaches. |
| Approach: | They propose a filter-then-generate paradigm and a multiple-choice question format to harness the capability of LLMs while mitigating the issue casused by hallucinations. |
| Outcome: | The proposed method achieves substantial performance gain compared to existing state-of-the-art methods. |
Copied to clipboard
| Challenge: | Recent studies have shown that AI generated content is more likely to dominate search results, making it difficult to detect when compared to human-produced content. |
| Approach: | They propose a method for generating diverse, validated evidence conflicts to simulate real-world misinformation scenarios. |
| Outcome: | The proposed method enables the detection of conflicting information in real-world scenarios and shows that weaker models struggle with similar answer conflicts while stronger models show robust performance. |
Copied to clipboard
| Challenge: | Existing continuous learning systems are not designed to add new domains and functionalities through time without incurring the high cost of retraining the whole system. |
| Approach: | They propose a first-ever continual learning benchmark for task-oriented dialogue systems . they propose 'architecture' method based on residual adapters to implement continual training . |
| Outcome: | The proposed architectural method performs better than multitask learning while being 20X faster in learning new domains. |
Copied to clipboard
| Challenge: | Existing models of machine reading comprehension (MRC) are based on cloze style questions or crowdworkers given a short passage from well-edited sources. |
| Approach: | They propose a multi-answer multi-task framework that uses multiple reference answers for multiple questions. |
| Outcome: | The proposed model increases the ROUGE-L score on the DuReader dataset from 44.18, the previous state-of-the-art, to 51.09 . |
Copied to clipboard
| Challenge: | Existing studies focus on prompt engineering or framework scheduling of one/multiple LLMs. |
| Approach: | They propose to integrate LLMs as agents into their training corpus by decomposition and redesigning the training corpu . they propose to use LLM-FLAN to effectively fine-tune LANguage models for Agents by reducing hallucinations. |
| Outcome: | The proposed model outperforms prior best models by 3.5% across agent evaluation datasets. |
Copied to clipboard
| Challenge: | Fill-in-the-Middle (FIM) models suffer from performance degradation and prohibitive latency. |
| Approach: | They propose a search-and-replace infilling framework that integrates agentic verification and editing into a single-pass inference process. |
| Outcome: | The proposed framework harmonizes completion tasks with the instruction-following priors of Chat LLMs, extending the paradigm from static infilling to dynamic context-aware editing. |
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: | despite promising results, current cross-lingual models suffer from imperfect cross-linguistic representation alignments between the source and target languages, which makes the performance sub-optimal. |
| Approach: | They propose a regularization approach to align word-level and sentence-level representations across languages without external resources. |
| Outcome: | The proposed model outperforms state-of-the-art models in few-shot and zero-shot scenarios and achieves comparable performance to supervised training with all training data. |
Copied to clipboard
| Challenge: | Existing delta tuning algorithms freeze most of the parameters and only optimize minimal adaptive parameters. |
| Approach: | They propose to decompose DETs into a unified optimization subspace and conduct optimization within the subspace. |
| Outcome: | The proposed DETs achieve comparable performance to the original DET and can be transferred to another DET with non-trivial performance. |
Copied to clipboard
| Challenge: | Low-Rank Adaptation (LoRA) is one of the most efficient parameter-efficient fine-tuning methods. |
| Approach: | They propose to conceptualize each LoRA module as a beam where each rank corresponds to a potential sub-solution. |
| Outcome: | The proposed method improves performance on three base models and 12 datasets. |
Copied to clipboard
| Challenge: | Existing group-based policy optimization methods rely on statistical deviation within discrete batches, misallocating credit when task difficulty fluctuates. |
| Approach: | They propose a framework for multi-turn LLM agents that integrates global context . they propose GRPO, which integrates success-rate-aware modulation and proximity-based soft aggregation . |
| Outcome: | The proposed framework yields performance gains over existing baselines with negligible computational cost. |
Copied to clipboard
| Challenge: | Existing DA-training methods do not explicitly identify what knowledge should be preserved and what should be changed by the domain corpus. |
| Approach: | They propose to use an unlabeled corpus of aparticular domain to train a pre-trained general-purpose language model to adapt the LM so that end-tasks in the domain can give improved performances. |
| Outcome: | The proposed method improves the performance of pre-trained general-purpose language models by contrasting the representations of the general and the full (both general and domain knowledge) to learn an integrated representation with both general and specific knowledge. |
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: | Existing tools and benchmarks often form tool learning (TL) as a single-solution setting . exploring large-scale TG is computationally expensive, especially under constrained context budgets. |
| Approach: | They propose a framework for learning optimal TL policies over large tool graphs . they train a reinforcement learning agent to acquire transferable expansion skills . |
| Outcome: | The proposed framework improves task success and solution optimality by 46.21% and 66.34% on multiSoTLBench. |
Copied to clipboard
| Challenge: | Existing routing strategies rely on heuristics, external predictors, or absolute quality estimation to capture whether the large model provides a worthwhile improvement over the small one. |
| Approach: | They propose a budget allocation problem for routing large model to large model . they propose heuristics, external predictors, or absolute quality estimation to determine the optimal signal for budgeted decisions. |
| Outcome: | The proposed model outperforms heuristics, quality/difficulty estimation baselines and achieves a superior quality–budget Pareto frontier. |
Copied to clipboard
| Challenge: | Large Language Models (LLMs) have greatly enhanced dialogue systems, but evaluation of their capabilities remains a challenge. |
| Approach: | They propose a model to evaluate the fine-grained abilities of Large Language Models in multi-turn dialogues. |
| Outcome: | The proposed model evaluates 21 popular chatbots based on MT-Bench-101 . it includes 3 overarching abilities and 13 distinct tasks within multi-turn dialogue scenarios. |
Copied to clipboard
| Challenge: | Existing pre-trained language models are typically trained with static data, ignoring that streaming data of various sources may continuously grow. |
| Approach: | They propose to use function preserved model expansion to expand existing PLM's width and depth to improve efficiency of knowledge acquisition. |
| Outcome: | The proposed model improves pre-training efficiency and performance over existing models on BERT and GPT. |
Copied to clipboard
| Challenge: | Existing benchmarks for scientific diagram generation rely on image-centric metrics or evaluation of intermediate symbolic representations rather than final rendered images. |
| Approach: | They propose a structure-first benchmark for evaluating scientific diagram generation from pixel-level outputs. |
| Outcome: | The proposed benchmark evaluates scientific diagram generation directly from pixel-level outputs. |
Copied to clipboard
| Challenge: | Existing research on text-based mental health counseling is limited due to the lack of relevant corpora in Chinese language. |
| Approach: | They propose a Chinese dataset of psychological health support in the form of question and answer pair that is crawled from a mental health service platform and contains 22K questions and 56K long and wellstructured answers. |
| Outcome: | The proposed dataset contains 22K questions and 56K long and wellstructured answers. |
Copied to clipboard
| Challenge: | Existing research on the allocation of public scarce resources has limitations due to data scarcity and data scariness. |
| Approach: | They propose a framework that integrates Large Language Models into economic simulations . they conduct extensive policy simulation experiments to verify the framework's effectiveness . |
| Outcome: | The proposed framework bridges the gap between theoretical models and real-world dynamics by integrating large language models into economic simulations. |
Copied to clipboard
| Challenge: | Medical coding is the process of translating unstructured clinical notes into standardized diagnostic and procedural codes. |
| Approach: | They propose a closed-loop framework that treats workflow design as a learning problem. |
| Outcome: | The proposed framework outperforms state-of-the-art workflows on benchmark datasets and produces interpretable, adaptable workflows that better reflect real coding practice. |
Copied to clipboard
| Challenge: | Existing inference-time optimization strategies address the shortsightedness of auto-regressive generation, but the vast search space leads to excessive exploration and insufficient exploitation. |
| Approach: | They propose a decoding strategy that approximates two distributions via foresight and clustering to provide an efficient estimation of step value. |
| Outcome: | The proposed decoding strategy outperforms strong baselines in performance and efficiency. |
Copied to clipboard
| Challenge: | Current researches mainly work on either of two types of targets in a decentralized manner. |
| Approach: | They propose a model to perform sentiment polarity on a target jointly considering its corresponding multiple modalities including text, image, and others. |
| Outcome: | The proposed model performs well on four datasets spanning the above two target types and is prompt-based language modelling. |
Copied to clipboard
| Challenge: | Inference-time scaling of chain-of-thought (CoT) has been demonstrated as a promising approach for addressing multi-modal reasoning tasks. |
| Approach: | They propose to integrate visual and textual modalities within the reasoning process . they adopt a consistency-enhanced verifier to ensure effective guidance for both methods across different thought paradigms. |
| Outcome: | The proposed method outperforms text-only reasoning on 10 tasks spanning diverse domains and requires higher token consumption for processing richer visual inputs. |
Copied to clipboard
| Challenge: | Large language models exhibit intrinsic limitations such as knowledge cutoff, single-threaded reasoning that hinders finer-grained branch and aggregation, and rigid collaboration mechanisms that struggle to coordinate specialized capabilities. |
| Approach: | They propose a taxonomy spanning *Graph-Assisted Knowledge Augmentation*, *Graph Assisted Reasoning and Planning*, and *Graphed LLM Collaboration*. |
| Outcome: | The proposed models show that graphs can augment and correct LLMs and support dynamic coordination among experts and agents in collaborative settings. |
Copied to clipboard
| Challenge: | Intent detection is a fundamental element in task-oriented dialogue systems, usually occurring within the Natural Language Understanding component. |
| Approach: | They propose an in-context data augmentation approach that fine-tunes a pre-trained language model and synthesizes new datapoints that correspond to given intents. |
| Outcome: | The proposed method produces training data that achieves state-of-the-art on three challenging intent detection datasets and performs on par with the state- of-the art in full-shot settings. |
Copied to clipboard
| Challenge: | Existing financial benchmarks suffer from limited language and task coverage, low-quality datasets, and inadequate adaptability for LLM evaluation. |
| Approach: | They propose a bilingual benchmark for financial LLMs that assesses models’ language understanding and generation capabilities. |
| Outcome: | The proposed bilingual benchmark assesses models’ language understanding and generation capabilities. |
Copied to clipboard
| Challenge: | Existing methods for Sequence Labeling require high-quality annotations, but imperfect annotations are relatively easy to obtain from crowdsourcing (noisy labels) Existing approaches to learn a model without knowing the underlying ground truth label sequences in the target domain are expensive and time-consuming. |
| Approach: | They propose a framework Consensus Network that can be trained on annotations from multiple sources. |
| Outcome: | The proposed framework improves on learning with crowd annotations and unsupervised cross-domain model adaptation in two practical settings. |
Copied to clipboard
| Challenge: | In Chinese studies, understanding the nuanced traits of historical figures can be challenging due to the need for domain expertise, specialist knowledge, and context-specific insights. |
| Approach: | They propose a large-scale multi-modal dataset for Chinese officials from the Ming Dynasty that integrates structured and text data to enable investigation of social structures. |
| Outcome: | The proposed dataset could enable exploratory analysis of official identities and significantly boost performance in tasks such as identifying nuance identities from 24.6% to 98.2% F1 score in hold-out test set. |
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: | citation-based QA systems are suffering from two shortcomings . they usually rely only on web as a source of extracted knowledge and external knowledge sources can hamper the efficiency of the system. |
| Approach: | They propose to use a web-based knowledge graph retrieval solution to enrich extracted knowledge fed to a citation-based QA system. |
| Outcome: | The proposed model outperforms open-source state-of-the-art models in 7 quantitative and human evaluation tasks. |
Copied to clipboard
| Challenge: | Large language models (LLMs) have demonstrated impressive reasoning capabilities, yet there is ongoing debate about their capabilities and the potential data contamination problem. |
| Approach: | They propose to evaluate the reasoning capabilities of large language models in solving recent competition-level programming problems in Codeforces. |
| Outcome: | The proposed model has experienced a cliff-like decline in problems after September 2021, which shows the potential data contamination and the challenges for any existing LLM to solve unseen complex reasoning problems. |
Copied to clipboard
| Challenge: | Existing MLLM benchmarks and unified evaluation frameworks cannot accurately and efficiently reflect the ability of MLMLs. |
| Approach: | They propose a semi-automated benchmark curated using a pipeline that filters out uninformative samples and eliminates answer leakage by focusing on tasks that require image-based understanding. |
| Outcome: | The proposed benchmark reduces the number of samples by 76% and evaluation time by 77% while it can more effectively distinguish different models’ abilities. |
Copied to clipboard
| Challenge: | Large language models (LLMs) are used in psychological counseling to provide universal advice. |
| Approach: | They constructed a multi-turn empathetic conversation dataset with 2 million samples . they found that the model's empathy ability is enhanced when finetuning . |
| Outcome: | Experiments show that large language models can be finetuned to provide empathy . but, when applied to mental health or emotional support conversation, there are three main issues . |
Copied to clipboard
| Challenge: | Existing datasets may leak shallow heuristics via entity mentions, thus contributing to the high performance on RE benchmarks. |
| Approach: | They propose an entity-masked contrastive framework for relation extraction to gain a deeper understanding on textual context and type information while avoiding rote memorization of entities. |
| Outcome: | The proposed framework improves the effectiveness and robustness of neural models in different RE scenarios. |
Copied to clipboard
| Challenge: | Existing vision-language models lack fine-grained classification, single-view imagery, and inaccurate metadata. |
| Approach: | They propose a hierarchical, multi-view benchmark to evaluate VLMs across three levels of cognitive complexity. |
| Outcome: | The proposed benchmark evaluates vision-language models across three levels of complexity . it systematically identifies five primary failure modes . the proposed benchmarks are available on https://github.com/meituan/DiningBench. |
Copied to clipboard
| Challenge: | Visual Question Answering (VQA) models are prone to learn the shortcut solution formed by dataset biases rather than the intended solution. |
| Approach: | They propose a dataset that considers varying types of shortcuts by constructing different distribution shifts in multiple OOD test sets. |
| Outcome: | The proposed dataset considers varying types of shortcuts by constructing different distribution shifts in multiple OOD test sets. |
Copied to clipboard
| Challenge: | Large-scale pre-trained models have been widely adopted for document-oriented NLP tasks, such as question answering. |
| Approach: | They propose to decouple document encoding from downstream tasks by introducing a document plugin into the backbone of a PTM. |
| Outcome: | The proposed model can encode documents once and for all across different scenarios. |
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: | End-to-end systems rely on dialogue state tracking and annotations to fulfill user requests . modularized systems require multiple steps, including a direct interaction with the KB . |
| Approach: | They propose a method to embed the KB directly into the model parameters . they evaluate five task-oriented dialogue datasets with small, medium, and large KBs . |
| Outcome: | The proposed model can embed the KB directly into the model parameters without any DST or template responses, nor the kb as input. |
Copied to clipboard
| Challenge: | Existing knowledge graph completion methods ignore inconsistent representation spaces between natural language and graph structures, leading to duplicate works and time-consuming processes. |
| Approach: | They propose a framework that enhances LLMs for KGC via structure-aware alignment-tuning to align graph embeddings with the natural language space through multi-task contrastive learning. |
| Outcome: | The proposed framework outperforms state-of-the-art methods on two KGC tasks across four benchmark datasets. |
Copied to clipboard
| Challenge: | Existing large language models and spoken language models (SLMs) begin thinking and taking actions only after the user has finished their turn. |
| Approach: | They propose a general inference framework that enables SLMs to generate unspoken chain-of-thought reasoning while listening to user input. |
| Outcome: | The proposed framework enhances real-time user–SLM interaction in two scenarios. |
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: | a good translation should implicitly mirror user traits rather than translate the original content semantically. |
| Approach: | They propose a framework that captures user traits from historical inputs . they propose 'user-driven' NMT to model user behavior under a zero-shot learning fashion . |
| Outcome: | The proposed framework can capture user traits from historical inputs under zero-shot learning fashion. |
Copied to clipboard
| Challenge: | Existing methods for text recognition rely on large-scale pretraining on human-annotated or synthetic data. |
| Approach: | They propose a method to transfer multimodal pretrained models to text recognition using image captioning. |
| Outcome: | The proposed method outperforms the baselines and achieves state-of-the-art performance in the Chinese text recognition benchmark. |
Copied to clipboard
| Challenge: | Current document image parsing solutions rely on specialized models or generate content autoregressively. |
| Approach: | They propose a multimodal document image parsing model that integrates specialized models with autogeneous content generation. |
| Outcome: | The proposed model achieves state-of-the-art performance across diverse page-level and element-level settings while ensuring superior efficiency. |
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: | Distant supervision is an important paradigm for automatically extracting relations . but the examples collected can be noisy and pose significant challenge for labeling . |
| Approach: | They propose a method to predict whether two entities participate in a relation at a given time spot. |
| Outcome: | The proposed model performs better in WIKI-TIME and NYT-10 datasets compared with the best existing models . the proposed model is based on a dataset with a valid period of a certain relation of two entities in the knowledge base . |
Copied to clipboard
| Challenge: | Existing approaches lack flexibility to address diverse and ever-evolving user queries in open domains. |
| Approach: | They propose to evaluate LLMs on open-domain knowledge that requires tools to solve diverse and ever-evolving user queries. |
| Outcome: | The proposed system outperforms baselines in the open domain task-solving benchmark. |
Copied to clipboard
| Challenge: | OpenCodeInterpreter-33B provides a high level of performance for code generation, executing, and iterative refinement. |
| Approach: | They propose a family of open-source code systems for generating, executing, and iteratively refining code. |
| Outcome: | The OpenCodeInterpreter-33B performs well on humanEval, MBPP, and EvalPlus benchmarks. |
Copied to clipboard
| Challenge: | Existing studies on VQA models have found that they suffer from dataset biases and inefficient memory footprints. |
| Approach: | They investigate whether a VLP can be compressed and debiased simultaneously by searching sparse and robust subnetworks. |
| Outcome: | The proposed compression and debiasing pipelines outperform the debiased full VLPs on VQA tasks. |
Copied to clipboard
| Challenge: | Recent efforts to train code large language models have been booming recently . however, this will incur significant costs in constructing data and training model considering the countless downstream scenarios. |
| Approach: | They propose a data construction strategy which decouples code LLMs’ abilities into two dimensions and constructs a lightweight training corpus that only covers a subset of target scenarios. |
| Outcome: | The proposed model can train a multilingual multitasking model using less data and training data. |
Copied to clipboard
| Challenge: | Existing RP-LLMs employ only a single role with numerous dialogues, but Crab enables dynamic configuration of desired roles, thereby enhancing related flexibility and adaptability. |
| Approach: | They propose a Configurable Role-Playing LLM with Assessing Benchmark that combines a Role dataset curation, persona-emodying Llm construction, and comprehensive benchmark creation for RP dialogue generation. |
| Outcome: | The proposed model outperforms existing LLMs in performing fine-grained evaluations of RP while keeping dialogue per role minimal. |
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. |
Copied to clipboard
| Challenge: | Customized black-box prompt tuning is a new approach to customize large language models . however, as models grow, the resources required for training and deployment become increasingly expensive . |
| Approach: | They propose a framework that facilitates efficient local customization while preserving bidirectional privacy. |
| Outcome: | The proposed framework facilitates efficient local customization while preserving bidirectional privacy. |
Copied to clipboard
| Challenge: | Large Language Models have been developed to deal with real-world crimes, but it remains unclear whether they internalize authentic knowledge or are forced to simulate toxic language patterns. |
| Approach: | They construct knowledge-intensive Q&A to investigate misuse threats of Large Language Models in terms of dangerous knowledge possession, harmful task planning utility, and harmfulness judgment robustness. |
| Outcome: | The findings raise concerns that jailbreak success is often attributable to a hallucination loop between jailbroken LLM and judger LLM . |
Copied to clipboard
| Challenge: | Large Language Models (LLMs) are increasingly equipped with capabilities of real-time web search and integrated with protocols like the Model Context Protocol (MCP). |
| Approach: | They investigate the vulnerability of Large Language Models to hidden adversarial prompts . they evaluate two critical attack scenarios: malicious content relay and sensitive data leakage . |
| Outcome: | The proposed extension could introduce new security vulnerabilities. |
Copied to clipboard
| Challenge: | Existing approaches to support diverse attention variants trade performance for flexibility . expert-written kernels achieve high efficiency but are difficult to adapt . |
| Approach: | They propose a framework that adapts expert-written attention kernels to GPUs . they use a structured lift–transfer–lower workflow to make execution explicit . |
| Outcome: | The proposed framework outperforms existing frameworks and compilers on diverse variants and GPU platforms. |
Copied to clipboard
| Challenge: | Recent studies show that sequence-to-sequence (seq2sequ) models struggle with compositional generalization (CG) a crucial property of human language learning is its compositional globalization (GC), the algebraic ability to understand and produce a potentially infinite number of novel combinations from known components. |
| Approach: | They propose a sequence-to-sequence (seq2sequ) extension which learns to compose representations of different encoder layers dynamically for different tasks. |
| Outcome: | The proposed model achieves competitive results on two comprehensive and realistic benchmarks, which empirically demonstrates the effectiveness of the proposed model. |
Copied to clipboard
| Challenge: | Existing studies evaluate the tool utilization ability of large language models based on the final output or only consider the single-step tool calling. |
| Approach: | They propose a new approach to evaluate the tool utilization capability of large language models (LLMs) they decompose the tool usage into multiple sub-processes, including instruction following, planning, reasoning, retrieval, understanding, and review. |
| Outcome: | The proposed model exhibits consistency with the outcome-oriented evaluation and provides a more fine-grained analysis of the capabilities of LLMs. |
Copied to clipboard
| Challenge: | Human experts tackle difficult math problems by identifying and executing a few pivotal steps rather than listing every intermediate thought. |
| Approach: | They propose a method for producing training data that mirrors concise human reasoning by rewriting a problem's solution to retain only the essential steps. |
| Outcome: | The proposed method outperforms models trained on 800k long CoT and cuts training and inference costs. |
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. |