Papers by Ding Chen
Copied to clipboard
| Challenge: | Hallucination is a significant barrier to the effective application of Large Language Models (LLMs). |
| Approach: | They propose an Attention-Guided SElf-Reflection approach for hallucination detection in Large Language Models. |
| Outcome: | The proposed method significantly outperforms existing methods in zero-shot hallucination detection on four widely-used LLMs across three different halluciation benchmarks. |
Copied to clipboard
| Challenge: | Existing classification and regression models that only extract finer-grained information from magnetic resonance imaging (MRI) may not be effective for Alzheimer's disease (AD). |
| Approach: | They propose to use a 3D Adapter in a Vision Transformer to extract the patient's EHR information and questions related to the disease as text prompts. |
| Outcome: | The proposed model can discriminate and predict the corresponding MMSE score based on the extracted brain structural information and textual content . |
Copied to clipboard
| Challenge: | Existing methods fine-tune pre-trained models on cognitive data, ignoring the semantic gap between texts and cognitive signals. |
| Approach: | They propose a framework that can induce fine-grained cognitive features from cognitive data and incorporate them into pre-trained language models by adaptively adjusting the weight of cognitive features for different NLP tasks. |
| Outcome: | The proposed framework can induce fine-grained cognitive features from cognitive data and incorporate them into BERT by adaptively adjusting weight of cognitive features for different NLP tasks. |
Copied to clipboard
| Challenge: | GUARD is a self-adaptive decoding method that balances coherence with diversity in open-ended text generation. |
| Approach: | They propose a self-adaptive decoding method that balances coherence and diversity . they combine global entropy estimates with local entropic deviations to integrate uncertainty . |
| Outcome: | GUARD achieves a good balance between diversity and coherence while exhibiting significant improvements in generation speed. |
Copied to clipboard
| Challenge: | Existing adaptive methods focus on a single axis, overlooking evidence need and reasoning depth are only partially correlated. |
| Approach: | They propose a dual-axis routing framework that separates retrieval necessity from reasoning necessity under a user-defined cost–quality trade-off. |
| Outcome: | The proposed framework reduces token usage and latency while improving answer quality over strong baselines. |
Copied to clipboard
| Challenge: | Existing methods for fine-tuning pre-trained large language models in a parameter-efficient manner are gaining traction within the research community. |
| Approach: | They propose a method of low-rank adaptation that enables dynamic adjustments to the intrinsic rank during the adaptation process. |
| Outcome: | The proposed approach outperforms the current method with a fixed and unalterable intrinsic rank and a low-rank adaptation process. |
Copied to clipboard
| Challenge: | Large language models (LLMs) are proving significant potential in healthcare, prompting numerous benchmarks to evaluate their capabilities. |
| Approach: | They propose a framework that deconstructs benchmark development into five stages from design to governance and provides a checklist of 46 medically-tailored criteria. |
| Outcome: | The framework deconstructs benchmark development into five stages from design to governance and provides a comprehensive checklist of 46 medically-tailored criteria. |
Copied to clipboard
| Challenge: | Existing studies focus on improving the performance of domain-specific models based on the target dataset. |
| Approach: | They propose a Large Language Model-based Continual Learning (LLM-CL) model for ABSA that learns the target domain’s ability while maintaining the history domains’ abilities. |
| Outcome: | The proposed model obtains new state-of-the-art over 19 datasets. |
Copied to clipboard
| Challenge: | PromptPrism is a linguistically-inspired taxonomy that enables prompt analysis across three hierarchical levels. |
| Approach: | They propose a linguistically-inspired taxonomy that enables prompt analysis across three hierarchical levels: functional structure, semantic component, and syntactic pattern. |
| Outcome: | The proposed taxonomy bridges traditional language understanding with modern LLM research . it improves prompt quality and improves model performance across tasks . |
Copied to clipboard
| Challenge: | Existing methods for intent classification fail to distinguish new intents due to intertwined centers . a novel framework that learns geometry-aware representations to maximally separate all intents is proposed . |
| Approach: | They propose a new intent discovery framework that learns geometry-aware representations to maximally separate all intents. |
| Outcome: | The proposed framework achieves a new state-of-the-art performance on three benchmarking datasets. |
Copied to clipboard
| Challenge: | Recent advances in multimodal large language models (MLLMs) have shown remarkable capabilities in scene understanding. |
| Approach: | They propose a framework that combines viewpoint-aware and temporal-based retrieval to identify relevant frames, along with cross-view reasoning that reconciles inconsistent evidence from multiple viewpoints. |
| Outcome: | Extensive experiments show that the proposed framework outperforms baseline approaches across multiple MLLMs. |
Copied to clipboard
| Challenge: | Existing models that use English and local languages have a multilingual gap . a language-informed co-reasoning framework can be used to improve multilingual reasoning . |
| Approach: | They propose a language-informed co-reasoning framework that elicits parallel English and local-language reasoning and abstracts them into structured concepts. |
| Outcome: | Experiments show that Med-CoReasoner improves multilingual reasoning performance by 5% . the framework produces clinically sound and culturally grounded reasoning traces . |
Copied to clipboard
| Challenge: | Prompt-learning is a new paradigm in natural language processing, adapting pre-trained language models to cloze-style prediction, autoregressive modeling, or sequence to sequence generation. |
| Approach: | They propose a framework for prompt-learning that integrates pre-trained language models with a unified framework. |
| Outcome: | The proposed framework is easy to use and flexible enough to integrate with other frameworks. |
Copied to clipboard
| Challenge: | Existing approaches to text generation often neglect event structures that shape real-world narratives. |
| Approach: | They propose a framework that integrates structured event semantics with iterative retrieval and inference to enhance text generation. |
| Outcome: | Experiments on UltraDomain and MultiHopRAG show that the proposed framework outperforms baseline RAG systems in generation effectiveness, logical consistency, and multi-hop reasoning accuracy. |
Copied to clipboard
| Challenge: | Empirical studies show that learning multiple training objectives in a single model makes the learned language representation barely converge to the desired optimum. |
| Approach: | They propose a meta-learning-based adaptive sampler which learns latent sampling pattern on arbitrary pre-training objectives. |
| Outcome: | Empirical studies show that learning multiple objectives in a single model makes it difficult to achieve the desired optimum. |
Copied to clipboard
| Challenge: | Recent research on temporal fact extraction fails to establish time-to-fact correspondences in complex sentences. |
| Approach: | They propose a timeline-based sentence decomposition strategy using large language models with in-context learning to extract temporal facts from natural language text. |
| Outcome: | The proposed method achieves state-of-the-art on a complex temporal fact extraction dataset. |
Copied to clipboard
| Challenge: | Existing studies have found that the test loss of LLMs scales as power-laws with model size, computational budget, and dataset size. |
| Approach: | They propose a concept of Temporal Scaling Law to study test loss of LLMs . they break down test loss into fine-grained token positions and develop a dynamic hyperbolic-law . |
| Outcome: | The proposed model predicts the test loss of LLMs as the training steps scale up. |
Copied to clipboard
| Challenge: | Large Language Models (LLMs) are increasingly using multimodality to augment their generation ability, but there is no unified perception of at which stage and how to incorporate different modalities. |
| Approach: | They propose to use multimodality to augment Large Language Models (LLMs) this will provide scholars with a deeper understanding of the methods' applications and encourage them to adapt existing techniques to the fast-growing field of LLMs. |
| Outcome: | The proposed methods improve factuality, reasoning, interpretability, and robustness of the generated content. |
Copied to clipboard
| Challenge: | Existing benchmarks for recommendation explanation evaluation lack item diversity and user preferences data. |
| Approach: | They propose a model-agnostic recommendation explanation evaluation benchmark based on Amazon e-commerce categories with implicit preferences . they propose two novel automatic evaluators that enable scalable and human-preference aligned evaluation of explanations . |
| Outcome: | The proposed model-agnostic evaluation benchmark outperforms existing methods in a variety of domains. |
Copied to clipboard
| Challenge: | Existing approaches to training dialogue models have low diversity in open-domain contexts . prior art suggests that naive MLE objective is not effective enough . |
| Approach: | They propose to incorporate contrastive learning into dialogue generation by using a pretrained baseline model as a reference. |
| Outcome: | The proposed framework is suited for training a wide range of dialogue generation models with favorable performance over baseline training approaches. |
Copied to clipboard
| Challenge: | Existing methods for ultra-low bit quantization cause severe accuracy drops . a novel Dual-Binarization method is proposed for efficient Large Language Models . |
| Approach: | They propose a Dual-Binarization method that takes 2-bit-width and binarization into account . they propose DB-LLM, which uses a 2-bit binarized weighted model to represent weights efficiently . |
| Outcome: | The proposed method surpasses the current State-of-the-Art in ultra-low bit quantization and achieves 20% reduction in computational consumption compared to the SOTA method under the same bit-width. |
Copied to clipboard
| Challenge: | Recent advances in large language models have achieved promising performances across various applications, but the challenge of integrating long-tail knowledge continues to impede the seamless adoption of LLMs in specialized domains. |
| Approach: | They propose a dynamic co-augmentation framework for the refinement of large language models and knowledge graphs in the context of Alzheimer's Disease. |
| Outcome: | The proposed framework can be used to study Alzheimer's Disease (AD) using LLMs and KGs. |
Copied to clipboard
| Challenge: | Large language models (LLMs) have been attracting much attention due to their impressive performance in all kinds of downstream tasks. |
| Approach: | They propose a mix-of-experts model that allows the model size to grow without raising training costs. |
| Outcome: | The proposed model outperforms existing models in perplexity and robustness tests. |
Copied to clipboard
| Challenge: | Recent advances in prompt engineering have created impediments for end users to adopt . however, prompt engineering remains an impedance due to rapid advances in models, tasks, and associated best practices. |
| Approach: | They propose to define APO as a 5-part unifying framework and categorize all relevant works based on their salient features. |
| Outcome: | The proposed framework aims to improve the performance of large language models on various tasks. |
Copied to clipboard
| Challenge: | Existing methods for fewshot learning use embeddings in space, but they lack expressivity and are difficult to perform statistically. |
| Approach: | They propose a method where class information is represented by hyperspheres with dynamic sizes with two sets of learnable parameters: the hypersphere’s center and the radius. |
| Outcome: | The proposed method is much more expressive than embeddings and performs better than statistical modeling. |
Copied to clipboard
| Challenge: | Existing alignment methods struggle to cover diverse safety scenarios and remain vulnerable to adversarial attacks. |
| Approach: | They propose a framework for 'S**afety' alignment via e**F**ficient' E**x-Ante-R**easoning that instantiates structured Ex-Ance reasoning and embeds predefined safety rules. |
| Outcome: | The proposed framework enhances safety performance while maintaining usefulness and efficiency. |
Copied to clipboard
| Challenge: | Existing approaches to program repair are based on correctness alone. |
| Approach: | They propose a framework that mitigates over-editing and improves repair accuracy by generating buggy programs and re-edits. |
| Outcome: | The proposed framework improves repair precision by 31.4% under fix1@1, a metric that considers repair correctness and extent, and significantly increases decoding throughput when combined with speculative editing. |
Copied to clipboard
| Challenge: | Existing approaches to optimize pre-trained language models are expensive and slow to scale. |
| Approach: | They propose to search for instance-level lottery prompts and generalize them to unseen data . they validate the assumption that for every instance, there is almost always a lottery prompt that induces the correct prediction from the PLM . |
| Outcome: | The proposed method can achieve comparable results with other gradient-free and optimization-free baselines. |
Copied to clipboard
| Challenge: | PRISM-DUEL is a black-box framework that formalizes prompt optimization as Automatic Prompt Engineering (APE) PRIMS-DUEl is motivated by advertising workflows requiring low-latency, diverse variants faithful to a human-designed ad. |
| Approach: | They propose a black-box framework that formalizes prompt optimization as Automatic Prompt Engineering (APE) they obtain label-free pairwise preferences and rationales from an LLM judge over pairs of generated images and use a dueling-bandit optimizer to optimize a prompt for generating controlled variations while matching the reference ad's visual content. |
| Outcome: | The proposed framework preserves visual similarity and semantic faithfulness while increasing diversity. |
Copied to clipboard
| Challenge: | Existing approaches to few-shot named entity recognition (NER) focus on coarse-grained entities with few examples, while most unseen entities are fine-grounded. |
| Approach: | They present a human-annotated few-shot named entity recognition dataset . they construct benchmark tasks to assess the generalization capability of models . |
| Outcome: | The proposed model is the first few-shot NER dataset and the largest human-crafted NER data set. |
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) are promising foundations to build generally-capable agents . however, the community lacks a unified interactive framework that covers diverse environments for comprehensive evaluation of agents. |
| Approach: | They propose a framework that features 7 real-world scenarios, 14 environments, and 89 tasks for unified, real-time, and concurrent agent interaction. |
| Outcome: | The proposed framework features 7 real-world scenarios, 14 environments, and 89 tasks for unified, real-time, and concurrent agent interaction. |
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: | Existing methods to unlearning large reasoning models do not remove unwanted knowledge from CoT traces or interfere with the reasoning process. |
| Approach: | They propose a framework that targets the CoT reasoning in Large Reasoning Models by generating a valid counterfactual reasoning trace for preference tuning. |
| Outcome: | Experiments on large LRMs show that CiPO completely removes knowledge from the intermediate CoT steps and the final answer while preserving the reasoning abilities of LRM. |
Copied to clipboard
| Challenge: | Existing benchmarks for reinforcement learning for large language models do not accurately assess generalization. |
| Approach: | They propose three core principles for designing more faithful benchmarks: sufficient difficulty, balanced evaluation, and distributional robustness. |
| Outcome: | The proposed benchmarks do not accurately assess generalization across distribution shifts, difficulty levels, and counterfactual scenarios. |
Copied to clipboard
| Challenge: | Existing approaches to vocal separation are optimized for signal-level reconstruction, but they overlook structural disentanglement required for downstream generation tasks. |
| Approach: | They propose a structure-aware learning framework to disentangle vocals, harmonies, and accompaniment . they combine global vocal identity conditioning with ranking-based objectives . |
| Outcome: | The proposed framework disentangles lead vocals, harmonies, and accompaniment while enforcing role consistency across long-form audio. |
Copied to clipboard
| Challenge: | Existing preference-based reward modeling methods face a recursive dependency where each verifier requires a meta-verifier, leading to continuous and costly dependence on human annotation. |
| Approach: | They propose a dual RM that couples discriminative and generative reward models under a non-parametric meta-reward. |
| Outcome: | The proposed model achieves strong performance across major preference benchmarks and even when trained exclusively on language modality, it exhibits robust cross-modal transfer on Omni-RewardBench. |
Copied to clipboard
| Challenge: | Chinese geographic re-ranking task aims to find the most relevant addresses among retrieved candidates. |
| Approach: | They propose a framework to integrate Chinese geographic semantics into re-ranking pipelines. |
| Outcome: | The proposed framework improves on two Chinese benchmark datasets. |
Copied to clipboard
| Challenge: | Existing SOTA methods for normalization rely on expert-designed rules or grammars . current methods are domain sensitive and not sufficient on emerging corpora . |
| Approach: | They propose a method that generates normalization rules from annotated data without expert intervention. |
| Outcome: | The proposed method surpasses existing rule-based methods on the Tweets benchmark and on the TempEval-3 benchmark. |
Copied to clipboard
| Challenge: | Traditional attempts to enhance the logical reasoning abilities of language models often rely on supervised fine-tuning, limiting their generalization to new tasks or domains. |
| Approach: | They propose a framework for integrating logical reasoning capabilities into LLMs and activating them via in-context learning. |
| Outcome: | The proposed framework achieves comparable results to existing models on three language understanding benchmarks. |
Copied to clipboard
| Challenge: | Large Language Models excel in general domains but lack real-world practical capabilities. |
| Approach: | They propose a benchmark for Chinese taxation practice that combines 10 traditional application tasks with 3 pioneering real-world scenarios. |
| Outcome: | The proposed benchmark combines 10 traditional tasks with 3 pioneering real-world scenarios. |
Copied to clipboard
| Challenge: | Recent advances in large language models (LLMs) have focused on test-time scaling to improve reasoning quality but at the cost of efficiency. |
| Approach: | They propose a training-free framework that enhances reasoning accuracy and stability with minimal overhead. |
| Outcome: | The proposed framework yields consistent gains across general, coding, and STEM tasks while remaining highly efficient. |
Copied to clipboard
| Challenge: | Existing Parameter-Efficient Fine-Tuning (PEFT) strategies that focus on specialized experts are not effective for Mixture-of-Experts (MoE). |
| Approach: | They propose to integrate a dynamic routing mechanism among specialized experts in Mixture-of-Experts (MoE) . |
| Outcome: | Extensive experiments on commonsense and math reasoning tasks validate the performance and efficiency of the proposed routed approach. |
Copied to clipboard
| Challenge: | Existing methods for temporal question answering ignore intrinsic connections between events that can make them temporally related. |
| Approach: | They propose a temporal question answering method that generates query graphs by exploring relevant facts of mentioned entities. |
| Outcome: | The proposed method outperforms existing methods on two benchmarks over different knowledge graphs. |
Copied to clipboard
| Challenge: | Visual Question Answering (VQA) has benefited from increasingly sophisticated models, but has not enjoyed the same level of engagement in terms of data creation. |
| Approach: | They propose a method that automatically derives VQA examples at volume by leveraging existing image-caption annotations combined with neural models for textual question generation. |
| Outcome: | The proposed method improves state-of-the-art zero-shot accuracy by double digits and achieves robustness that lacks in the same model trained on human-annotated VQA data. |
Copied to clipboard
| Challenge: | Existing systems require users to manually select models or employ rigid routing rules that fail to capture the continuous spectrum of query complexity. |
| Approach: | They propose a quality-constrained intelligent prompt routing framework that automatically selects optimal models based on predicted response quality and user-specified tolerance levels. |
| Outcome: | The proposed framework achieves 43.9% cost reduction while maintaining quality parity with strongest model in the Claude family and processes requests with sub-150ms latency. |
Copied to clipboard
| Challenge: | Large Language Models (LLMs) provide a data-centric solution to alleviate limitations of real-world data with synthetic data generation. |
| Approach: | They propose a generic workflow for LLM-driven synthetic data generation. |
| Outcome: | The proposed workflows highlight gaps in existing research and outline avenues for future studies. |
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: | Existing zero-shot cross-lingual transfer methods rely on parallel corpora or bilingual dictionaries . however, its effect is limited by the gap between embedding clusters of different languages . |
| Approach: | They propose Embedding-Push, Attention-Pull, and Robust targets to transfer English embeddings to virtual multilingual embedders without semantic loss. |
| Outcome: | Experimental results show that the proposed method outperforms existing methods on cross-lingual tasks and can achieve a better multilingual alignment. |
Copied to clipboard
| Challenge: | Existing models that focus on language, programming code, and mathematical symbols are not able to achieve mastery of all three domains simultaneously. |
| Approach: | They propose to fuse highly-specialized models that are already sufficiently trained on different domains to achieve a highly-specific model. |
| Outcome: | The proposed model could achieve mastery of the three crucial domains simultaneously. |
Copied to clipboard
| Challenge: | Existing knowledge-grounded dialogue models lack fine-grained control over knowledge selection and integration with dialogues. |
| Approach: | They propose to explicitly model the knowledge transition in sequential multi-turn conversations by abstracting knowledge into topic tags. |
| Outcome: | The proposed model outperforms baseline models on knowledge-grounded dialogue benchmarks. |
Copied to clipboard
| Challenge: | Existing methods to handle label noise in text classification tasks are limited to visual data. |
| Approach: | They propose a method to handle label noise in text classification tasks using a Gaussian Mixture Model. |
| Outcome: | The proposed method outperforms baselines on three types of text classification tasks on visual and textual data. |
Copied to clipboard
| Challenge: | Existing methods for topic modeling learn topics with a flat structure . however, such methods have data scalability issues . |
| Approach: | They propose to use nonparametric neural variational inference to extract a tree-structured topic model with reasonable structure, low redundancy, and adaptable widths. |
| Outcome: | The proposed model extracts a tree-structured topic hierarchy with reasonable structure, low redundancy, and adaptable widths. |
Copied to clipboard
| Challenge: | Existing methods for continual knowledge editing focus on single edits or preventing knowledge forgetting. |
| Approach: | They propose a meta-learning method that preserves specificity for continual knowledge editing by capturing relationships between different single edits within the trajectory. |
| Outcome: | Experiments show that TamEdit outperforms baselines in continual editing while preserving general capabilities. |
Copied to clipboard
| Challenge: | Social graphs are mathematical structures stem from pairwise interactions between entities through nodes and edges. |
| Approach: | They propose a framework for dynamic, text-attributed social graph generation that simulates the temporal node and edge generation processes for zero-shot social graphs. |
| Outcome: | The proposed framework improves macroscopic graph structure metrics by 11% . the proposed model can generate graphs with up to 100,000 nodes or 10 million edges . |
Copied to clipboard
| Challenge: | Prompt optimization is an important technique for adapting Large Language Models (LLMs) to specific tasks. |
| Approach: | They propose a zeroth-order approach which enables efficient prompt tuning solely via inference APIs. |
| Outcome: | The proposed approach outperforms existing black-box prompt tuning methods in terms of performance and convergence speed. |
Copied to clipboard
| Challenge: | Multi-modal large language models (MLLMs) generate plausible but incorrect content, resulting in hallucinations . recent advances in MLLM technology have demonstrated their outstanding performance in a variety of visual tasks, such as object detection. |
| Approach: | They propose a plug-and-play method which leverages MLLMs’ internal representations to mitigate hallucinations by analyzing input and output tokens. |
| Outcome: | The proposed method exploits MLLMs’ internal representations to mitigate hallucinations. |
Copied to clipboard
| Challenge: | Existing methods for inference use heuristics to determine which positions to unmask and which tokens to commit . MEDAL is an inference-time scaling framework that integrates Monte Carlo Tree SEarch initialization for Diffusion Language Model inference. |
| Approach: | They propose a framework that integrates Monte Carlo Tree SEarch initialization for Diffusion Language Model inference. |
| Outcome: | The proposed framework achieves 22.0% improvement over existing inference strategies across multiple benchmarks. |
Copied to clipboard
| Challenge: | Data augmentation (DA) is a key technique for enhancing model performance by diversifying training examples without the need for additional data collection. |
| Approach: | They examine various strategies that utilize LLMs for data augmentation, including a novel exploration of learning paradigms where LLM-generated data is used for diverse forms of further training. |
| Outcome: | The proposed approach addresses the primary open challenges faced by LLMs in the field of large language models and aims to serve as a comprehensive guide for researchers and practitioners. |
Copied to clipboard
| Challenge: | Large Language Models (LLMs) have demonstrated impressive capabilities across various tasks but are vulnerable to meticulously crafted jailbreak attacks. |
| Approach: | They propose a training-free defense strategy to align LLMs’ strong safety discrimination performance with their relatively weaker safety generation ability. |
| Outcome: | The proposed strategy achieves an average 99% success rate against numerous complex and covert jailbreak methods while maintaining helpfulness on general benchmarks. |
Copied to clipboard
| Challenge: | Recent advances in large language models have significantly improved automated code generation . however, the translation of complex mobile UI designs into high-fidelity front-end code remains a challenge . |
| Approach: | They propose a collaborative multi-agent system to reconstruct static single-page apps from mockups. |
| Outcome: | The proposed system outperforms existing methods in reconstructing complex app pages . the code and data will be released upon paper acceptance . |
Copied to clipboard
| Challenge: | Large Language Models (LLMs) have demonstrated remarkable capabilities in reasoning and tool use, but their ability to continuously refine solutions in response to dynamic environmental feedback remains underexplored. |
| Approach: | They propose a benchmark to evaluate self-improvement capabilities in large-scale search spaces by combining 20 machine learning tasks with 10 classic NP-hard problems. |
| Outcome: | The proposed framework emulates human-like cognitive adaptation and operates via a general perception–memory–reasoning loop, iteratively refining solutions based on environmental feedback. |
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 approaches to financial report generation are insufficient to handle dynamic uncertainties of real-world financial environments. |
| Approach: | They propose a cognitively grounded agentic framework for professional financial report generation that is driven by Dynamic Graph of Thoughts and a social collaboration mechanism to facilitate coordinated agent interaction. |
| Outcome: | The proposed framework is based on a dynamic reasoning model and social collaboration mechanism. |
Copied to clipboard
| Challenge: | Large language models possess remarkable capacity for processing language, but it remains unclear whether they can further generate creative content. |
| Approach: | They utilize the divergent association task (DAT) to examine the creative thinking of large language models through a cognitive perspective. |
| Outcome: | The proposed model outperforms the greedy search strategy while outperforming the average human level. |
Copied to clipboard
| Challenge: | Existing neural dialogue models only capture syntactic and semantic information, but fail to model the logical consistency between the dialogue history and the generated response. |
| Approach: | They propose a fine-grained comparison model to capture syntactic and semantic information and then compare each candidate's representation with the whole history to obtain a history consistency representation. |
| Outcome: | The proposed model obtains higher ranking scores than baseline models on two public dialogue datasets. |
Copied to clipboard
| Challenge: | Protein language models pose significant risks of generating harmful sequences, e.g., viral transmissibility, drug resistance, environmental imbalances, public health crises, etc. |
| Approach: | They propose a protein-based model that integrates prior knowledge via a Protein Safety Knowledge Graph to minimize the risk of generating harmful sequences. |
| Outcome: | The proposed framework reduces the likelihood of producing hazardous sequences while maintaining high functionality. |
Copied to clipboard
| Challenge: | Existing long-context training data is scarce and requires substantial GPU resources for training. |
| Approach: | They propose a training-free plug-and-play method to enhance long-context understanding in existing large language models. |
| Outcome: | The proposed method outperforms existing LLMs on various tasks and surpasses baseline methods. |
Copied to clipboard
| Challenge: | Existing methods to train student models on the generated outputs of teacher models are not efficient for ICL. |
| Approach: | They propose to align the output of smaller (student) models with that of larger (teacher) models by incorporating a ranking loss and aligning the token-level output distribution. |
| Outcome: | The proposed model outperforms baseline models on a variety of tasks involving language understanding, reasoning, and coding. |
Copied to clipboard
| Challenge: | Existing work on instruction tuning has focused on task level, without considering that tasks are artificially defined and, to LLMs, merely consist of tokens and representations. |
| Approach: | They propose a training data arrangement framework that allows for continual learning and loss reduction. |
| Outcome: | The proposed framework promotes continual learning and loss reduction on unseen tasks. |
Copied to clipboard
| Challenge: | Existing code-related benchmarks focus on single modality rather than visual game development. |
| Approach: | They propose a multimodal benchmark for evaluating code large language models in visual game generation that integrates a clustering-based curation methodology and a pipeline for visual code synthesis. |
| Outcome: | The proposed framework assesses code generation and visual game generation using a sandbox environment. |
Copied to clipboard
| Challenge: | a new framework for multi-hop reading comprehension question answering is needed to cross the chasm of reading comprehension between machine and human. |
| Approach: | They propose a CogQA framework for multi-hop reading comprehension question answering in web-scale documents that builds a cognitive graph in an iterative process by coordinating an implicit extraction module and an explicit reasoning module. |
| Outcome: | The proposed framework outperforms the best competitor in the hotpotQA dataset in F1 . it provides explainable reasoning paths and accurate answers, while giving accurate answers . |
Copied to clipboard
| Challenge: | Knowledge distillation is a technique of transferring knowledge from large, complex models to smaller ones. |
| Approach: | They propose a method utilizing chain-of-thought distillation to transfer knowledge from large, complex models to smaller ones by maximizing mutual information of the representation features of the two tasks. |
| Outcome: | The proposed method outperforms the state-of-the-art knowledge distillation method on four datasets. |
Copied to clipboard
| Challenge: | Experimental results show that our model can achieve a significant improvement in terms of metric-based evaluation and human evaluation compared with the state-of-the-art exposure bias approaches. |
| Approach: | They propose a novel adaptive switching mechanism which automatically transits between ground-truth learning and generated learning regarding the word-level matching score. |
| Outcome: | The proposed model improves on Chinese and English reddit datasets compared with state-of-the-art models on the word-level matching score. |
Copied to clipboard
| Challenge: | Existing methods for data valuation rely on gradient computations, making them prohibitive for billion-parameter models. |
| Approach: | They propose a forward-only data valuation framework that enables efficient batch-scalable value estimation while maintaining effectiveness. |
| Outcome: | The proposed framework matches or outperforms gradient-based baselines in detecting influential data and mislabeled data while achieving significant efficiency improvements. |
Copied to clipboard
| Challenge: | Graphical User Interface (GUI) agents powered by Vision-Language Models (VLMs) have demonstrated human-like computer control capability. |
| Approach: | They propose a GUI data synthesis pipeline that reverse engineers GUI trajectory construction process by executing pre-defined tasks. |
| Outcome: | The proposed GUI data synthesis pipeline overcomes the bottlenecks of previous methods that rely on pre-defined tasks and limited data diversity. |
Copied to clipboard
| Challenge: | NICT participated in the 6th Workshop on Asian Translation (WAT-2019) shared translation task, specifically Myanmar (My) - English task in both translation directions. |
| Approach: | They present the participation of the NICT in the 6th Workshop on Asian Translation (WAT-2019) shared translation task, specifically Myanmar (Burmese) - English task in both translation directions. |
| Outcome: | The proposed systems perform the third in English-to-Myanmar and the second in Myanmar-to English according to BLEU score. |
Copied to clipboard
| Challenge: | Large Language Models have achieved impressive performance across a range of tasks, but further gains require more than scaling up model sizes or training data. |
| Approach: | They propose a method that gradually reduces the number of thought tokens . this method allows models to internalize more abstract reasoning processes . |
| Outcome: | The proposed framework preserves the benefits of token-level reasoning while reducing computational cost. |
Copied to clipboard
| Challenge: | Existing benchmarks focus on image-based question answering (QA) but ignore the fundamental challenges of efficient retrieval, comprehension, and reasoning within dense visual documents. |
| Approach: | They propose a novel multi-agent RAG framework tailored for complex reasoning across visual documents that employs a Gaussian Mixture Model (GMM)-based hybrid strategy to handle multi-modal retrieval. |
| Outcome: | The proposed framework outperforms existing methods by over 10% on the competitive ViDoSeek benchmark. |
Copied to clipboard
| Challenge: | Large language models (LLMs) have shown remarkable capabilities in code translation, yet their performance deteriorates in low-resource programming domains such as Fortran and emerging frameworks like CUDA . |
| Approach: | They propose a dual-LLM Questioner–Solver pipeline that integrates external knowledge from compilers and runtime feedback to generate verified translations and multi-turn dialogues. |
| Outcome: | The proposed model outperforms proprietary models on key metrics like compilation success and accuracy. |
Copied to clipboard
| Challenge: | Existing continual learning methods use data replay, parameter isolation and regularization to mitigate catastrophic forgetting. |
| Approach: | They propose a parameter-efficient continual learning framework that updates parameters offline and then trains using an online regularization method. |
| Outcome: | The proposed framework reduces catastrophic forgetting and saves the model with the changed parameters instead of all parameters. |
Copied to clipboard
| Challenge: | Large Language Models (LLMs) excel at various tasks but are vulnerable to jailbreak attacks that induce harmful content generation. |
| Approach: | They propose a reinforcement learning framework that leverages the model’s own discrimination capabilities as a reward signal to enhance generation safety through iterative self-improvement. |
| Outcome: | The proposed framework improves model safety by iterative self-improvement without additional annotated data or external models during training phase. |
Copied to clipboard
| Challenge: | Existing approaches to theorem proving in large language models rely on value functions and/or Monte Carlo Tree Search (MCTS), but the potential of simpler methods like Best-First Tree Search remains underexplored. |
| Approach: | They propose a scalable expert iteration framework that implements strategic data filtering at each expert iteration round, excluding problems solvable via beam search node expansion to focus on harder cases. |
| Outcome: | The proposed framework achieves a state-of-the-art score of 72.95 on the MiniF2F test set and challenges the perceived necessity of complex tree search methods. |
Copied to clipboard
| Challenge: | Experimental results show that PromptST can improve speech-to-text translation by capturing richer linguistic knowledge. |
| Approach: | They propose a plug-in prompt-enhanced S2T model that captures richer linguistic knowledge . they use a 10GB linguistic probing benchmark to investigate the fusion of speech and text features . |
| Outcome: | The proposed model can improve on a strong baseline by capturing richer linguistic knowledge. |
Copied to clipboard
| Challenge: | Large Reasoning Models benefit from generating intermediate reasoning steps alongside final answers. |
| Approach: | They propose a framework to introduce thinking-rubric supervision into intermediate reasoning. |
| Outcome: | The proposed framework outperforms outcome-only RL baselines on reasoning-intensive and open-ended tasks. |
Copied to clipboard
| Challenge: | Existing prompt engineering techniques are limited to producing single flow instructions, struggling with handling diverse patterns. |
| Approach: | They propose an automatic prompt optimization method that iteratively develops a multi-branched prompt using failure cases as feedback. |
| Outcome: | The proposed method achieves the best results across five tasks and demonstrates significant optimization efficiency due to adoption of a minimal search strategy. |
Copied to clipboard
| Challenge: | Existing rerankers are mainly trained on well-edited texts, but stylistic features can be misled by reranked models. |
| Approach: | They propose a style-augmented multi-task framework that prioritizes effective knowledge over stylistic perturbations by using an LLM to derive passage-level supervision on whether a passage helps or harms answer correctness. |
| Outcome: | Extensive experiments show that SARK improves generation performance across multiple LLMs under mixed-style conditions. |
Copied to clipboard
| Challenge: | Recent studies explore approaches to synthesize instruction data with open-sourced LLMs but require high-quality human-crafted seed data. |
| Approach: | They propose an end-to-end framework to synthesize high-quality instruction data with open-sourced LLMs and sampled unlabeled documents, eliminating the need for seed data. |
| Outcome: | The proposed framework synthesizes high-quality instruction data with open-sourced LLMs and sampled unlabeled documents, eliminating the need for seed data. |
Copied to clipboard
| Challenge: | Existing models for LLM role-playing lack high-quality datasets with explicit reasoning traces and reliable reward signals aligned with human preferences. |
| Approach: | They propose a unified framework for cognitive-level persona simulation that strictly distinguishes characters’ first-person thinking processes from LLMs’ third-person reasoning. |
| Outcome: | The proposed framework outperforms the Qwen3-32B baseline model and achieves a 30.26% and 14.97% performance on the minimax benchmarks. |
Copied to clipboard
| Challenge: | Existing methods for evaluation of large language models are inefficient and inefficient due to inaccuracy of standard metrics in human perception of text quality and inefficiency in sampling informative test examples. |
| Approach: | They propose a sample-efficient human evaluation method for large language models based on the principle of MAximum Discrepancy (MAD) competition. |
| Outcome: | The proposed method achieves the “golden” ranking of LLMs with a minimum set of input instructions, which in turn reveal their relative strengths and weaknesses. |
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: | Existing benchmarks focus on correctness, overlooking optimality . large language models excel at math, coding, logic and puzzles . |
| Approach: | They propose a framework for training and evaluating Large Language Models on NP-hard optimization problems through quality-aware RLVR. |
| Outcome: | The proposed framework outperforms existing benchmarks on math, coding, logic and puzzles. |
Copied to clipboard
| Challenge: | Effective medical text retrieval requires high accuracy and low latency. |
| Approach: | They propose a benchmark for medical text retrieval in Chinese using a symmetric architecture . CARE is a lightweight encoder with an LLM-based encoder for offline document encoding . |
| Outcome: | The proposed benchmark surpasses state-of-the-art symmetric models on CMedTEB . it matches high retrieval quality without increasing latency, and it performs well on a single GPU . |
Copied to clipboard
| Challenge: | Large language models (LLMs) are widely deployed as domain-specific agents, but evaluation of their capabilities in such contexts has not been fully explored. |
| Approach: | They propose a benchmark to evaluate LLMs' ability to follow instructions and make decisions in real-world scenarios. |
| Outcome: | The proposed benchmark is constructed from real-world business data and adapted into 23 complex SOP scenarios. |
Copied to clipboard
| Challenge: | Recent studies show that Large language models struggle with handling long token sequences due to limited training context size. |
| Approach: | They propose a single-stage continual pretraining method to equip LLMs with long context modeling capabilities. |
| Outcome: | The proposed method outperforms existing methods on 4 language modeling benchmarks. |
Copied to clipboard
| Challenge: | Extensive experiments on fine-grained entity typing under fully supervised, few-shot, and zero-shot settings show the effectiveness of prompt-learning. |
| Approach: | They propose a prompt-learning pipeline that stimulates versatile knowledge of pre-trained language models (PLMs) by constructing entity-oriented verbalizers and templates and conducting masked language modeling. |
| Outcome: | The proposed approach can be applied to fine-grained entity typing in fully supervised, few-shot, and zero-shot scenarios. |
Copied to clipboard
| Challenge: | Textual Attributed Graphs (TAGs) are crucial for modeling complex real-world systems, yet leveraging large language models (LLMs) for TAGs presents unique challenges due to the gap between sequential text processing and graph-structured data. |
| Approach: | They propose a novel approach that leverages In-Context Learning to integrate graph data and task-specific information into large language models (LLMs) they employ a Graph Neural Network-powered structure-enhanced retriever to select labeled nodes across graphs, incorporating complex graph structures and their supervision signals. |
| Outcome: | Experiments on three tasks and seven LLMs show that AskGNN performs better than existing methods. |
Copied to clipboard
| Challenge: | Molecular structure elucidation involves deducing a molecule’s structure from various types of spectral data, which is crucial in chemical experimental analysis. |
| Approach: | They propose a Knowledge-enhanced reasoning framework for Molecular Structure Elucidation that leverages Monte Carlo Tree Search for test-time scaling as a plugin to extend the LLMs’ coverage of the chemical structure space. |
| Outcome: | The proposed framework significantly improves on both GPT-4o-mini and GPT4o, and a specialized molecule-spectrum scorer improves performance. |
Copied to clipboard
| Challenge: | The paper extends the Data Movement Distance (DMD) metric defined to measure the locality in computer memory to text by defining a new term designed to better characterize low-frequency tokens. |
| Approach: | They propose to define a normalized version of the Data Movement Distance (nDMD) term is designed to better characterize low-frequency tokens. |
| Outcome: | The proposed normalized version outperforms baselines and improves performance on the English subset of the M4 dataset and the GenAI detection shared task. |
Copied to clipboard
| Challenge: | Existing sparsification methods like pruning can lose model knowledge through parameter removal. |
| Approach: | They propose a novel approach that achieves sparsification by partitioning pre-trained FFN layers into computational blocks. |
| Outcome: | The proposed approach achieves superior performance across language modeling and downstream tasks under equivalent computational constraints. |
Copied to clipboard
| Challenge: | Recent advances in Large Language Models (LLMs) generate plausible but factually incorrect outputs, posing serious risks to patient safety and clinical decision-making. |
| Approach: | They propose a benchmark for medical hallucination detection using 10,000 question-answer pairs derived from PubMedQA. |
| Outcome: | The proposed model achieves an F1 score as low as 0.625 for detecting 'hard' category hallucinations. |
Copied to clipboard
| Challenge: | End-to-end speech translation (ST) models require simultaneous crossmodal and crosslingual transformations to be effective. |
| Approach: | They propose a homophone-aware contrastive learning approach that integrates a speech-text masking strategy to reduce ambiguity. |
| Outcome: | The proposed approach achieves SOTA results on BLEU scores on different MuST-C and CoVoST ST tasks, underlining its effectiveness in reducing speech sense ambiguity. |
Copied to clipboard
| Challenge: | Recent work has noted that due to the extremely high cost of iterative updates of LLMs, they are often unable to answer dynamic questions well. |
| Approach: | They propose a Chinese Dynamic QA benchmark containing question-answer pairs related to the latest dynamic questions on the Chinese Internet. |
| Outcome: | The proposed benchmark will be one of the key data resources for improving LLMs’ Chinese question-answering ability in the future. |
Copied to clipboard
| Challenge: | Existing work merely predicts the total prison term, but in reality a defendant is often charged with multiple crimes. |
| Approach: | They propose a charge-based prison term prediction task that better fits real needs and makes it more accurate and interpretable. |
| Outcome: | The proposed method achieves state-of-the-art performance for charge-specific feature selection and aggregation. |
Copied to clipboard
| Challenge: | Multi-tenant Model-as-a-Service (MaaS) workloads exhibit non-stationarity across multiple time scales . existing request schedulers often rely on a fixed policy that remains unchanged at runtime . |
| Approach: | They propose a hierarchical multi-agent scheduler that operates in a layered closed loop . they propose to maintain 1.2–3.0 higher Goodput than SGLang and vLLM . |
| Outcome: | Experiments show that H-MAS achieves 1.2–3.0 higher Goodput than SGLang and vLLM . it maintains more stable QoS under diverse request lengths and heterogeneous SLO targets . |
Copied to clipboard
| Challenge: | Existing methods for acquiring large-scale intentions generate product-centric intentions without product images and incur high costs for scalability. |
| Approach: | They propose a multimodal framework that allows Large Vision-Language Models to infer purchase intentions from multimodal product metadata and prioritize human-centric ones. |
| Outcome: | The proposed framework shows that it is robust to different prompts and superior to previous methods. |
Copied to clipboard
| Challenge: | Existing studies fine-tune discriminative models on specific defined intent classes, preventing them from being directly adopted to new intent domains. |
| Approach: | They propose to use a pre-trained generative intent model to detect new intents from different domains with no parameter updates. |
| Outcome: | The proposed model outperforms baselines that need further fine-tuning or domain-specific samples. |
Copied to clipboard
| Challenge: | Existing methods for generating 'jailbreaks' suffer from manual design or require optimization on other white-box models, which compromises either generalization or efficiency. |
| Approach: | They propose a framework that leverages LLMs to generate effective jailbreak prompts and a generalized framework that can be used to generate prompts. |
| Outcome: | The proposed framework improves the attack success rate while reducing the time cost compared to baselines. |
Copied to clipboard
| Challenge: | Large Language Models (LLMs) are a promising new approach to understanding biological sequences such as proteins. |
| Approach: | They propose an LLM that can generate protein sequences in human and protein languages by pre-training an Lm on protein and natural language corpora and supervised instruction tuning to facilitate alignment. |
| Outcome: | The proposed model outperforms state-of-the-art LLMs on protein-text generation tasks by a large margin. |
Copied to clipboard
| Challenge: | Existing methods for conditional inference on joint textual and visual clues lack multimodal context reasoning capability. |
| Approach: | They propose a multi-modal context reasoning approach that embeds textual semantics and objective image information into the pretrained language model to perform context reasoning. |
| Outcome: | The proposed approach improves on two data sets and shows 4.8% gain on the PMR. |
Copied to clipboard
| Challenge: | generative models may produce molecules with toxic, reactive, or otherwise hazardous characteristics. |
| Approach: | They propose a benchmark to evaluate and analyze the safety risks of molecular generation. |
| Outcome: | The proposed benchmark aims to evaluate and analyze the safety risks of molecular generation. |
Copied to clipboard
| Challenge: | Existing generative language models neglect an inherent challenge in text corpus during training, i.e., the imbalance between frequent tokens and infrequent ones. |
| Approach: | They propose a function to mitigate the imbalance between frequent and infrequent tokens . authors propose 'MiLe Loss' function to assess learning difficulty of tokens during training . |
| Outcome: | Experiments show that models with proposed model can improve on downstream benchmarks. |
Copied to clipboard
| Challenge: | Existing work probes when biased outputs appear, but gives little insight into the mechanisms that generate them, leaving existing mitigations largely fragile. |
| Approach: | They propose a lightweight debiasing framework that detects bias heads and selectively masks only those heads that activate under DA and CoT. |
| Outcome: | The proposed framework reduces unfairness by 391.9%- 534.5% in both one- and two-turn dialogues. |
Copied to clipboard
| Challenge: | Existing visual token compression methods rely on attention scores but have inherent biases . global and local attention biased scores cause excessive computational overhead . |
| Approach: | They propose a token pruning pipeline that targets global and local attention biases . the pipeline is designed to reduce computational overhead of Video Large Language Models based on visual tokens compiled from multiple video frames . |
| Outcome: | The proposed method significantly reduces the computational overhead of Video Large Language Models while retaining the performance of vanilla models. |
Copied to clipboard
| Challenge: | Analogical reasoning is a unique ability of humans to address unfamiliar challenges by transferring strategies from relevant past experiences. |
| Approach: | They propose to use self-generated random examples to improve performance on a variety of reasoning tasks by incorporating relevant examples from relevant past experiences. |
| Outcome: | The proposed methods achieve comparable or even better performance on GSM8K with random biological examples. |
Copied to clipboard
| Challenge: | Existing reinforcement learning methods are expensive due to high latency and sample inefficiency . Currently, RL is limited to one-to-one state-action pairs . |
| Approach: | They propose a framework that shifts the training paradigm to Single State Multiple Actions and introduce a group-wise advantage estimator based on the averaged critic outputs. |
| Outcome: | The proposed framework achieves 7.5% and 8.3% success rate improvements on AndroidLab and AndroidWorld over UI-TARS-1.5-7B and attains 1.4x higher training efficiency than existing methods. |
Copied to clipboard
| Challenge: | Existing frameworks that only provide information about user preferences can be inaccurate in e-commerce recommender systems. |
| Approach: | They propose a framework which integrates the recommender system and dialog generation system by introducing information about users’ preferences. |
| Outcome: | The proposed framework can achieve better performance in both dialog generation and recommendation compared with baselines. |
Copied to clipboard
| Challenge: | Existing approaches that distill intentions from LMs fail to generate meaningful and human-centric intentions applicable in real-world E-commerce contexts. |
| Approach: | They propose a double-task multiple-choice question answering benchmark to evaluate LMs' comprehension of purchase intentions in E-commerce. |
| Outcome: | The proposed benchmark consists of 4,360 carefully curated problems across three difficulty levels, constructed using an automated pipeline to ensure scalability on large E-commerce platforms. |
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: | a recent study validates the effectiveness of chat language models by fine-tuning instruction data. |
| Approach: | They propose to use a large-scale dataset of instructional conversations to fine-tune a conversational model on instruction data. |
| Outcome: | The proposed model outperforms open-source models in key metrics including scale, average length, diversity, coherence, etc. |
Copied to clipboard
| Challenge: | Conventional wisdom in pruning Transformer-based language models is that it reduces model expressiveness, but new research shows pruning increases risk of overfitting when performed at the fine-tuning phase. |
| Approach: | They propose to reduce pruning risk under pretrain-and-finetune paradigm . they propose to use knowledge distillation to improve pruning performance . |
| Outcome: | The proposed method outperforms the leading competitors on the GLUE benchmark. |
Copied to clipboard
| Challenge: | Retrieval-Augmented Generation (RAG) frameworks struggle with identifying whether retrieved documents meaningfully contribute to answer generation. |
| Approach: | They propose a document-related metric to quantify the contribution of retrieved documents to correct answer generation. |
| Outcome: | The proposed framework outperforms existing approaches on both single and multiple retrieval paradigms. |
Copied to clipboard
| Challenge: | Existing text-to-SQL LLMs are computationally expensive and difficult to deploy in real-world applications. |
| Approach: | They propose to distill a larger teacher model into a smaller student model by using imperfect data to improve the KD. |
| Outcome: | The proposed method achieves the best tradeoff between performance and efficiency on 5 text-to-SQL benchmarks. |
Copied to clipboard
| Challenge: | a library to facilitate the development, use, and evaluation of large language models (LLMs) is presented. |
| Approach: | They propose a unified library to facilitate the development, use and evaluation of large language models (LLMs). |
| Outcome: | The proposed library is based on extensive experiments in a variety of evaluation settings. |
Copied to clipboard
| Challenge: | Existing recommendation system invites experts to write marketing themes and select relevant commodities, which suffer from difficulty in mass production, poor timeliness and low online indicators. |
| Approach: | They propose to use pretrained language model to generate marketing themes and commodity consistency module to select relevant commodities for the generative theme. |
| Outcome: | The proposed system can generate popular marketing themes and select relevant commodities automatically and improve theme online effectiveness compared with state-of-the-art methods. |
Copied to clipboard
| Challenge: | Existing evaluation methods for large language models rely on static benchmarks and standardized evaluation protocols. |
| Approach: | They propose an adaptive evaluation framework that integrates dynamic domain knowledge modeling with progressive reasoning assessment to improve evaluation fidelity. |
| Outcome: | Empirical results show that the framework distinguishes LLMs in terms of domain knowledge coverage and reasoning chain completeness. |
Copied to clipboard
| Challenge: | Sentiment analysis is an increasingly popular natural language processing task in academia and industry. |
| Approach: | They propose to use category name encoding network to weaken catastrophic forgetting problem . they set both encoder and decoder shared among all categories to weaker the catastrophic forgetting problem a . |
| Outcome: | The proposed model achieves state-of-the-art on two (T)ACSA benchmark datasets. |
Copied to clipboard
| Challenge: | Recent studies on fine-grained intent detection have focused on collecting large-scale and high-quality samples via crowdsourcing resulting in data scarcity. |
| Approach: | They propose an iterative differential generation framework with contrastive feedback to generate high-quality pseudo samples and accurately capture the crucial nuances in target class distribution. |
| Outcome: | The proposed framework generates high-quality pseudo samples and captures crucial nuances in target class distribution. |
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: | generative models have been used for various NLP tasks but their application in the field of input methods remains under-explored. |
| Approach: | They propose a novel Generative Input paradigm that uses prompts to handle all input scenarios and other intelligent auxiliary input functions, optimizing the model with user feedback. |
| Outcome: | The proposed paradigm achieves state-of-the-art in the Full-mode Key-sequence to Characters task and surpasses GPT-4 in the other input methods. |
Copied to clipboard
| Challenge: | evolving generic Large Language Models into specialized Large Reasoning Models requires effective post-training. |
| Approach: | They propose a plasticity-ceiling framework to harness expert trajectories . they establish the Sequential SFT-then-RL pipeline as the superior standard . |
| Outcome: | The proposed framework overcomes stability and premature convergence deficits in synchronized approaches. |
Copied to clipboard
| Challenge: | Large Language Models (LLMs) have demonstrated their effectiveness in human-guided dialogues, but tasks in the real world are more complex and require greater autonomy from LLMs. |
| Approach: | They propose to characterize LLM-guided conversation into three fundamental components: Goal Navigation, Context Management, Empathetic Engagement and implement an interviewing environment for the evaluation of LLMs. |
| Outcome: | The proposed LLM outperforms baseline LLMs in interviewing quality and autobiography generation quality. |
Copied to clipboard
| Challenge: | Existing rumor detection methods rarely consider fairness issues inherent in the model . this can lead to biased predictions across stakeholder groups, undermining their detection effectiveness . |
| Approach: | They propose a framework to address fairness issues inherent in rumor detection models . they perform unsupervised partitioning to dynamically identify potential unfair data patterns . then, they apply invariant learning to these partitions to extract fair and informative feature representations . |
| Outcome: | The proposed method outperforms strong baselines regarding detection and fairness performance . it also shows robust performance on out-of-distribution samples . |
Copied to clipboard
| Challenge: | Named entity recognition (NER) is well studied for the general domain, but the performance is still moderate for specialized domains. |
| Approach: | They propose to explicitly connect entity mentions based on global coreference relations and local dependency relations to build better entity mention representations. |
| Outcome: | The proposed system improves the NER performance even with a tiny amount of labeled data. |
Copied to clipboard
| Challenge: | Large Language Models (LLMs) aligned via outcome-based Reinforcement Learning (RL) exhibit a critical failure mode: they exhibit brittle reasoning capabilities on out-of-distribution tasks. |
| Approach: | They propose a framework bridging Structural Causal Models and the Information Bottleneck principle to explain this paradox. |
| Outcome: | The proposed framework bridges the framework between SCM and IB principles to explain the problem. |
Copied to clipboard
| Challenge: | Recent advances in Large Vision Language Models (LVLMs) show promise for pathological diagnosis, yet their application in clinical settings faces critical challenges of multimodal hallucination and biased responses. |
| Approach: | They propose a framework that integrates medical expertise into preference alignment. |
| Outcome: | The proposed framework outperforms existing pathological LVLMs while maintaining pathological accuracy. |
Copied to clipboard
| Challenge: | a new benchmark for multilingual foundation models is being developed . brittleness of foundation models in the dimensions of semantics and multilinguality is a key limitation . |
| Approach: | They propose a benchmark for multilingual foundation models, SeaEval . they examine how well these models comprehend cultural practices, nuances, and values . |
| Outcome: | The proposed model can be used to evaluate multilingual and multicultural scenarios. |
Copied to clipboard
| Challenge: | Existing models focus more on the structure of summary, not on the personal and logical inconsistency problem. |
| Approach: | They propose a model to solve the problem of personal and logical inconsistency . they use an utterance rewriter to complete the ellipsis content of dialogue content . |
| Outcome: | The proposed model outperforms baseline models on both SAMSum and DialSum datasets. |
Copied to clipboard
| Challenge: | Existing personalized dialogue systems struggle to reconcile unbounded interactions with finite context constraints. |
| Approach: | They propose a framework that utilizes a globally maintained PersonaTree as the carrier of long-term user profiling. |
| Outcome: | The proposed framework outperforms existing systems in suppressing contextual noise and persona inconsistency. |
Copied to clipboard
| Challenge: | Existing studies on multi-label intent detection are confused by the identical representation of the utterance with multiple labels and overlook the intrinsic intra-class and inter-class relations. |
| Approach: | They propose a dual class knowledge propagation network to learn well-separated representations for utterances with multiple intents. |
| Outcome: | The proposed method outperforms baselines on two multi-label intent datasets by a large margin. |
Copied to clipboard
| Challenge: | Existing methods to abstractly summarize dialogues are limited to two or more interlocutors. |
| Approach: | They propose to use existing document summarization models to capture the various topic information of a conversation and outline salient facts for the captured topics. |
| Outcome: | The proposed method significantly outperforms baselines and achieves new state-of-the-art performance on benchmark datasets. |
Copied to clipboard
| Challenge: | a preference evaluation metric is often biased towards longer responses, revealing a reliability problem . a decomposition of the preference evaluation into two components is needed to understand this bias. |
| Approach: | They propose to decompose the preference evaluation metric into two key components . the first component is length-dependent and related to trustworthiness . |
| Outcome: | The proposed evaluation metric is based on two components: desirability and information mass. |
Copied to clipboard
| Challenge: | Existing open-source multi-modal large language models (MLLMs) focus on enhancing foundational capabilities, leaving a significant gap in human preference alignment. |
| Approach: | They propose a dataset of 200K high-quality training samples featuring diverse images, complex questions, and varied response formats to improve MLLMs’ alignment with human preferences. |
| Outcome: | The proposed dataset of 200K high-quality training samples improves human preference alignment while maintaining or enhancing performance on standard VQA benchmarks. |
Copied to clipboard
| Challenge: | Existing datasets are limited due to the difficulty of collecting precise molecule-description pairs. Existing approaches to enhance large language models include a data augmentation framework and a new dataset called SAPubChem-41. |
| Approach: | They propose a framework that interweaves model fine-tuning and data augmentation to overcome the scarcity of high-quality labeled data. |
| Outcome: | The proposed framework interweaves model fine-tuning and data augmentation to overcome the scarcity of high-quality labeled data. |