Papers by Qi Huang
Copied to clipboard
| Challenge: | Existing approaches to hierarchical text classification are limited by lack of domain knowledge, which leads to mistakes in a variety of situations. |
| Approach: | They propose a Knowledge-enabled Hierarchical Text Classification model which integrates knowledge graphs into HTC to address the knowledge limitations of traditional methods. |
| Outcome: | The proposed model integrates knowledge graphs into the hierarchical text classification process, addressing the knowledge limitations of traditional methods. |
Copied to clipboard
| Challenge: | Existing domain-specific knowledge of domain-related tasks is lacking in pre-trained language models. |
| Approach: | They propose a domain-adaptation method which can dynamically select domain-specific tokens and guide the discriminator to emphasize them, without introducing new training parameters. |
| Outcome: | The proposed method can capture domain-specific knowledge of domain-related tasks without introducing new training parameters. |
Copied to clipboard
| Challenge: | Existing methods focus on minimizing the number of questions required to assess ability, lacking clear and reliable explanations for the question selection process. |
| Approach: | They propose to use large language models to enhance computer adaptive testing (CAT) by providing human-like interpretability and explanations. |
| Outcome: | The proposed agent-based CAT performs comparably or superior to traditional CAT methods in accuracy and significantly improves student trust and satisfaction. |
Copied to clipboard
| Challenge: | Existing methods for code retrieval struggle to balance scalability and annotation quality. |
| Approach: | They propose a method that integrates functions called within the repository and information on third-party APIs to enhance the annotation context. |
| Outcome: | The proposed method improves the annotation context by incorporating functions called within the repository and information on third-party API functionalities. |
Copied to clipboard
| Challenge: | Recent commercial systems such as Suno demonstrate strong capabilities in long-form song generation, but academic research remains non-reproducible due to the lack of publicly available training data. |
| Approach: | They propose a system for long-form song generation with fine-grained style conditioning that includes a licensed synthetic dataset and a song generation model, Muse. |
| Outcome: | The proposed system achieves competitive performance on phoneme error rate, text–music style similarity, and audio aesthetic quality while enabling controllable segment-level generation across different musical structures. |
Copied to clipboard
| Challenge: | Recent efforts to extract local subgraph information from click graphs have hindered collaboratively utilizing global click graph information. |
| Approach: | They propose a global-view long chain interests model that models a click graph with neighbor interest to enhance news recommendation. |
| Outcome: | The proposed method surpasses baseline methods on two real-world datasets. |
Copied to clipboard
| Challenge: | Existing methods for solving math word problems ignore numerical values in solving problems. |
| Approach: | They propose a numerically-based approach that explicitly incorporates numerical values into a sequence-to-tree network and uses a mathematical properties prediction mechanism to capture category and comparison information of numerals. |
| Outcome: | The proposed model outperforms existing state-of-the-art models on the Math23K and APE datasets. |
Copied to clipboard
| Challenge: | Existing processes that reward for each step are one-directional and lack a mechanism to model the distance to the final target. |
| Approach: | They propose a process supervision model that evaluates the correctness of previous steps and the probability of future success. |
| Outcome: | The proposed model outperforms existing supervision models like ORM and PRM on reasoning tasks and improves solution re-design. |
Copied to clipboard
| Challenge: | Representative models like LLaVA and MiniGPT-4 have great capabilities in various tasks. |
| Approach: | They propose a unified model to represent various multi-modal tasks using a single representation. |
| Outcome: | The proposed model outperforms existing models in a variety of tasks while maintaining generality and scalability. |
Copied to clipboard
| Challenge: | Existing data synthesis methods rely on static tools to generate queries . this approach fails to capture the implicit, event-driven nature of real-world needs . |
| Approach: | They propose a forward synthesis framework to generate high-quality financial dialogues . they construct a repository of 43,066 tools and synthesize over 148k dialogue instances . |
| Outcome: | Experiments show that models trained on FinToolSyn achieve a 21.06% improvement . the framework is designed to generate high-quality financial dialogues . |
Copied to clipboard
| Challenge: | a number of tools are used to perform complex tasks, but the tool utilization process can cause errors. |
| Approach: | They propose a critique evaluation benchmark for tool learning that analyzes function-calling errors on tool evaluation benchmarks. |
| Outcome: | The proposed critique evaluation benchmark holds diverse tool-use errors with varying complexities, which better reflects real-world scenarios. |
Copied to clipboard
| Challenge: | Existing news recommendation methods rely on centralized storage of user behavior data for model training, which may lead to privacy concerns and risks due to the privacy-sensitive nature of user behaviors. |
| Approach: | They propose a privacy-preserving method where user behavior data is locally stored on user devices to train accurate news recommendation models. |
| Outcome: | The proposed method can train accurate news recommendation models without centralized storage of user behavior data. |
Copied to clipboard
| Challenge: | Existing benchmarks evaluate agents in simplified, idealized settings, relying on pre-packaged tool interfaces, overlooking critical steps, and assume inputs are clean and fully specified. |
| Approach: | They propose a framework that evaluates language agents in simplified, idealized settings . they show that even SOTA systems like Gemini and GPT-5 struggle on AgentGym2 . |
| Outcome: | Experiments on 15 proprietary and open-source models show that even SOTA systems like Gemini and GPT-5 struggle on AgentGym2 . |
Copied to clipboard
| Challenge: | Experimental results show that, as the instruction data increases, LoRAMoE can significantly improve the ability to process downstream tasks, while maintaining the world knowledge stored in the LLM. |
| Approach: | They propose a framework that introduces several low-rank adapters and integrates them by using a router network to freeze the backbone model and force a portion of LoRAs to focus on leveraging world knowledge to solve downstream tasks. |
| Outcome: | The proposed framework freezes the backbone model and forces a portion of LoRAs to focus on leveraging world knowledge to solve downstream tasks, to alleviate world knowledge forgetting. |
Copied to clipboard
| Challenge: | Existing work describes paragraph-level counter-argument generation task as paragraph-based . however, sentence-level generation can be quite different due to its unique constraints and brevity-focused challenges. |
| Approach: | They propose a benchmark framework for sentence-level counter-argument generation . they use an annotated debate forum dataset to generate high-quality counter-argments . |
| Outcome: | The proposed framework and evaluator are competitive in counter-argument generation tasks. |
Copied to clipboard
| Challenge: | Existing methods to debiase samples with biased features obstructs the model in learning from non-biased parts of the samples. |
| Approach: | They propose to eliminate spurious correlations in a fine-grained manner from a feature space perspective by using Random Fourier Features and weighted re-sampling to decorrelate dependencies between features. |
| Outcome: | The proposed method eliminates spurious correlations in a fine-grained manner from a feature space perspective. |
Copied to clipboard
| Challenge: | federated learning approaches are limited by the complexity of large language models and the need for specialized expertise to protect intellectual property. |
| Approach: | They propose a federated learning approach that leverages random masking to obscure a subnetwork of model parameters and applies quantization to the remaining parameters. |
| Outcome: | The proposed approach maintains strong model performance in federated learning settings and achieves enhanced protection of model parameters compared to baseline methods. |
Copied to clipboard
| Challenge: | Existing neural models struggle with implicit sentiment analysis because they latch onto spurious correlations, resulting in poor generalization and robustness. |
| Approach: | They propose a CausaL intervention model for implicit sEntiment ANalysis using instrumental variable to eliminate confounding causal effects and extract the pure causal effect between sentence and sentiment. |
| Outcome: | The proposed model extracts the pure causal effect between sentence and sentiment using instrumental variable. |
Copied to clipboard
| Challenge: | Pre-trained language models (PLMs) are often deployed as cloud services, enabling users to upload textual data and perform inference remotely. |
| Approach: | They propose a privacy-preserving inference framework called MixPi which aims to obfuscate a user's private input by mixing it with multiple other inputs. |
| Outcome: | The proposed framework surpasses existing privacy-preserving methods on token and sentence classification tasks. |
Copied to clipboard
| Challenge: | Context-DPO is the first alignment method specifically designed to enhance contextfaithfulness for large language models. |
| Approach: | They propose a benchmark that simulates Retrieval-Augmented Generation scenarios with knowledge conflicts to evaluate context-faithfulness. |
| Outcome: | The proposed method improves LLMs' context-faithfulness by 35% to 280% over open-source models. |
Copied to clipboard
| Challenge: | Named Entity Recognition models are feature-engineering and machine learning based. |
| Approach: | They propose a new NER learning framework that uses entity mentions to improve model performance. |
| Outcome: | The proposed model achieves better performance on OOV entities on various settings and datasets. |
Copied to clipboard
| Challenge: | Triton is a high-level Python-like programming language for building efficient GPU kernels. |
| Approach: | They propose a TritonBench benchmark that provides a comprehensive evaluation of Tritonic operators on widely deployed GPUs. |
| Outcome: | The proposed benchmarks show that current LLMs struggle to generate efficient Triton operators on widely deployed GPUs aligned with industry applications. |
Copied to clipboard
| Challenge: | Existing studies assume that generated answers integrate all relevant information from the textual graph. |
| Approach: | They propose a novel GraphRAG model that integrates all relevant information from the textual graph into the generated answer. |
| Outcome: | Extensive experiments validate TAONA’s superior performance for both A-side and B-side tasks. |
Copied to clipboard
| Challenge: | Besides Transformers without position encodings, the success of NoPE provides a new way to overcome the challenge of generalizing to longer sentences. |
| Approach: | They propose a parameter-efficient tuning for searching attention heads’ best temperature hyper-parameters, which substantially expands NoPE’s context size. |
| Outcome: | The proposed tuning significantly expands NoPE's context size, allowing it to generalize to longer sentences with state-of-the-art generalization algorithms. |
Copied to clipboard
| Challenge: | MaCP is a new adaptation method for large foundation models that requires minimal parameters and memory for fine-tuning. |
| Approach: | They propose a method that exploits the superior energy compaction and decorrelation properties of cosine projection to improve model efficiency and accuracy. |
| Outcome: | The proposed method improves model efficiency and accuracy across a wide range of single-modality tasks including natural language understanding, natural language generation, text summarization, and multi-modalities such as image classification and video understanding. |
Copied to clipboard
| Challenge: | Chinese named entity recognition models are vulnerable to word ambiguities due to the lack of global semantics and chain structure. |
| Approach: | They propose a lexicon-based graph neural network with global semantics to solve word ambiguities in Chinese named entity recognition (NER) Lexicons are used to construct the graph and provide word-level features. |
| Outcome: | The proposed model improves on four NER datasets on Chinese characters, potential words, and the whole-sentence semantics. |
Copied to clipboard
| Challenge: | Existing methods for generating follow-up questions are limited to shallow contextual questions that are uninspiring and have a large gap to the human level. |
| Approach: | They propose a three-stage external knowledge-enhanced follow-up question generation method which generates questions by identifying contextual topics, building a knowledge graph online, and finally combining these with a large language model to generate the final question. |
| Outcome: | The proposed method generates questions by identifying contextual topics, building a knowledge graph (KG) online, and finally combining these with a large language model to generate the final question. |
Copied to clipboard
| Challenge: | Existing studies on graph learning on text-attributed graphs have been limited by memory cost and underutilization of relationships between nodes and words. |
| Approach: | They propose a Node Representation Update Pre-training Architecture based on Co-modeling text and graph to learn representations of papers and words simultaneously. |
| Outcome: | The proposed model outperforms baselines on the ogbn-arxiv benchmark dataset. |
Copied to clipboard
| Challenge: | Document-level relation extraction (DocRE) aims to extract semantic relations between entities in a document. |
| Approach: | They propose a Document-level distant relation extraction framework with unreliable pseudo labels to denoise DS data. |
| Outcome: | The proposed framework outperforms strong baselines on two public datasets. |
Copied to clipboard
| Challenge: | C-World enables users to build agent environments on demand. |
| Approach: | They propose a system that enables users to build agent environments on demand. |
| Outcome: | The proposed system outperforms baselines on 119k samples and achieves Spearman = 0.883 ranking correlation with real execution. |
Copied to clipboard
| Challenge: | Current LLMs lack systematic compositionality, and therefore cannot serve as reliable cognitive models. |
| Approach: | They propose to introduce logical traps into the original problems of MATH and GSM8K to investigate the compositionality of large language models in mathematical reasoning. |
| Outcome: | The proposed model can generate infinite combinations from finite learned components. |
Copied to clipboard
| Challenge: | Current methods rely on ranking losses to teach reward model to assess preferences, but they are susceptible to noise and ambiguous data, often failing to deeply understand human intentions. |
| Approach: | They propose a method that incorporates contrastive learning into the reward modeling process to enhance generalization and stabilize the reinforcement learning training process. |
| Outcome: | The proposed method enhances generalization of the reward model, stabilizes the reinforcement learning training process, and improves the final alignment with human preferences. |
Copied to clipboard
| Challenge: | Existing literature on mechanistic interpretation (MI) treats it as an observational science, leaving practical applications underexplored. |
| Approach: | They propose a survey structured around the pipeline to identify and improve MI models. |
| Outcome: | The proposed framework enables tangible improvements in Alignment, Capability, and Efficiency. |
Copied to clipboard
| Challenge: | Existing studies highlight that dependency-related issues cause over 40% of observed runtime errors on the generated repository. |
| Approach: | They propose a large-scale benchmark and evaluation framework specifically designed to assess LLMs’ capability on dependency inference. |
| Outcome: | The proposed model achieves only a 48% execution pass rate on Python, indicating room for improvement. |
Copied to clipboard
| Challenge: | Existing approaches to align large language models with human preferences lack flexibility . static alignment preferences lack the ability to correct misaligned behaviors as they emerge . |
| Approach: | They propose a framework that enables dynamic and continuous alignment of large language models with human preferences. |
| Outcome: | The proposed framework improves safety and accuracy of a 7B model with human annotations. |
Copied to clipboard
| Challenge: | Recent work shows that dense hierarchical retrieval (DHR) can outperform dense passage retrieval. |
| Approach: | They propose a framework that applies sparse, dense and a combination of them to document and passage retrieval. |
| Outcome: | The proposed framework can outperform dense hierarchical retrieval (DHR) and sparse retrievers (BM25) on open-domain question answering (ODQA) datasets with an average improvement of 4.69% on recall@100 over DHR. |
Copied to clipboard
| Challenge: | Existing proof generation models focus on generating several proof paths instead of a whole tree. |
| Approach: | They propose a method that generates the proof tree via iterative hierarchical inference . they propose coding the proof as plain text without losing structure information . |
| Outcome: | The proposed proof generation model significantly improves performance on widely-used datasets. |
Copied to clipboard
| Challenge: | Existing news recommendation methods rely on user behavior data to model user interests and user interests. |
| Approach: | They propose a unified news recommendation framework that uses user data locally stored in user clients to train models and serve users in a privacy-preserving way. |
| Outcome: | The proposed framework outperforms baseline methods and effectively protects user privacy. |
Copied to clipboard
| Challenge: | Existing methods to inference knowledge graphs lack ontology information, which is often too sparse. |
| Approach: | They propose a knowledge graph inductive inference method that fuses ontology information to learn the semantic information of entities. |
| Outcome: | The proposed method outperforms large language models like ChatGPT on two benchmark datasets and improves the MRR metrics by 15.4% and 44.1%, respectively. |
Copied to clipboard
| Challenge: | Existing methods for training reward models are vulnerable to context neglect and degraded accuracy. |
| Approach: | They propose distribution-aware reward modeling that augments the RM objective with a conditional mutual information regularizer that maximizes context and the predicted reward conditioned on the response. |
| Outcome: | The proposed model improves performance in RLHF and improves accuracy in other settings. |
Copied to clipboard
| Challenge: | Existing evaluations focus on isolated, short-term interactions, overlooking the inherently long-term nature of learning. |
| Approach: | They propose a benchmark for long-term personalized tutoring based on an annotated learning log . they propose an automated generator–verifier pipeline to enable benchmark expansion . |
| Outcome: | The proposed benchmarks evaluate LLMs across three progressive tasks: evidence acquisition, knowledge state diagnosis, and adaptive teaching action. |
Copied to clipboard
| Challenge: | Large language models (LLMs) are a promising alternative to expensive human evaluations. |
| Approach: | They propose a framework that iteratively aligns LLM-based evaluators with human preference . they decompose a given evaluation task into finer-grained criteria . |
| Outcome: | The proposed framework iteratively aligns LLM-based evaluators with human preference . it decomposes a given evaluation task into finer-grained criteria . the framework is efficient to train and more explainable than relying solely on prompts . |
Copied to clipboard
| Challenge: | Textual adversarial samples are often misrepresented in research on security, evaluation, explainability, and data augmentation. |
| Approach: | They propose to use adversarial samples to evaluate their methods on security tasks to demonstrate the real-world concerns rather than developing impractical methods. |
| Outcome: | The proposed method has higher practical value than the current benchmark. |
Copied to clipboard
| Challenge: | Existing methods to learn user and item representations from review texts do not take into account the user-user and item-item relatedness of the user. |
| Approach: | They propose to use review content and user-item graphs to integrate them as different views. |
| Outcome: | The proposed approach can learn user and item representations from review content and user-item graphs. |
Copied to clipboard
| Challenge: | Current datasets cater to user-led systems and are limited to predefined specific scenarios and slots. |
| Approach: | They propose to use a Chinese dialogue dataset to train a model that authentically simulates human-computer dialogues in 30 popular life service scenarios. |
| Outcome: | The proposed model achieves a joint accuracy of 75.09% in out-of-domain evaluations . it also achieves notable abilities in slot filling and questioning . |
Copied to clipboard
| Challenge: | Existing models for named entity recognition (NER) are based on large-scale labeled datasets, which always obtain using crowdsourcing. |
| Approach: | They propose a CONfidence-based partial Label Learning method to integrate prior and posterior confidences for crowd-annotated named entity recognition models. |
| Outcome: | The proposed model improves on real-world and synthetic datasets compared with baselines. |
Copied to clipboard
| Challenge: | Parallel Coordinated Reasoning (PaCoRe) overcomes a central limitation of contemporary language models: their inability to scale test-time compute (TTC) far beyond sequential reasoning under a fixed context window. |
| Approach: | They propose a training-and-inference framework to overcome a central limitation of language models: their inability to scale test-time compute (TTC) under a fixed context window. |
| Outcome: | The proposed model scales to multi-million-token effective TTC without exceeding context limits. |
Copied to clipboard
| Challenge: | Existing supervised fine-tuning methods struggle to generalize across document types, leading to poor performance. |
| Approach: | They propose layoutRL, a reinforcement learning framework that optimizes layout understanding through composite rewards integrating normalized edit distance, paragraph count accuracy, and reading order preservation. |
| Outcome: | The proposed model outperforms specialized document parsing systems and general-purpose vision-language models on a broad range of document types, languages, and structural complexities. |
Copied to clipboard
| Challenge: | Event argument extraction (EAE) aims to extract arguments with given roles from texts. |
| Approach: | They propose a multi-format transfer learning model with variational information bottleneck to learn from existing datasets. |
| Outcome: | The proposed model improves on three benchmark datasets and obtains state-of-the-art performance on EAE. |
Copied to clipboard
| Challenge: | Existing approaches to reduce dataset bias rely on spurious correlations and obstruct valid feature information while mitigating bias. |
| Approach: | They propose a representation normalization method which disentangles correlations between features of encoded sentences and a kernel approximation method which provides isotropic data distribution. |
| Outcome: | The proposed method eliminates the bias problem by providing isotropic data distribution while maintaining in-distribution accuracy. |
Copied to clipboard
| Challenge: | Existing approaches to improve LLM reasoning are limited in complex domains and lack external grounding makes verifiers unreliable on computation-intensive tasks. |
| Approach: | They propose a framework that transforms reward modeling into a multi-turn, tool-augmented deliberative process. |
| Outcome: | The proposed framework surpasses state-of-the-art ORMs by 25.2% under parallel and sequential TTS. |
Copied to clipboard
| Challenge: | Existing KBQG models focus on the most relevant part of the answer entity, while neglecting the rest of the subgraph. |
| Approach: | They propose a controlled generation framework for Question Generation over Knowledge Bases that generates questions with out-of-vocabulary (OOV) predicates. |
| Outcome: | The proposed framework outperforms existing methods significantly on three widely-used benchmark datasets SimpleQuestion, PathQuestions, and WebQuestIONS. |
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 research seeks to enhance RAG performance by retrieving higher-quality documents or designing RAG-specific LLMs, but internal mechanisms that contribute to RAG’s effectiveness remain underexplored. |
| Approach: | They propose to examine the internal mechanisms within the popular Mixture-of-Expert (MoE)-based LLMs and examine their ability to improve RAG by examining expert activations. |
| Outcome: | The proposed method significantly improved the ability of Large Language Models (LLMs) to solve knowledge-intensive tasks. |
Copied to clipboard
| Challenge: | Existing methods for continual learning in language models suffer catastrophic forgetting when learning sequential tasks. |
| Approach: | They propose an orthogonal low-rank adaptation approach for continual learning in language models that uses orthogons to learn sequentially. |
| Outcome: | The proposed approach outperforms state-of-the-art methods on continual learning benchmarks and preserves generalization ability of LLMs on unseen tasks. |
Copied to clipboard
| Challenge: | Large Language Models (LLMs) have shown remarkable progress in dialogue and reasoning, but they struggle to solve strictly constrained dialogue tasks. |
| Approach: | They construct a dataset that contains 12,705 high-quality Chinese dialogue instructions from 440 flowcharts containing 5,055 process nodes. |
| Outcome: | The proposed model outperforms GPT-4o models on backward transitions and outperformed GPT-42 models on the same dataset. |
Copied to clipboard
| Challenge: | Existing approaches to generating adversarial perturbations scale up the cost of training computational complexity by the number of gradient steps it takes to obtain the adversarials. |
| Approach: | They propose a flood method which aims at better generalization and a criterion to bring hyper-parameter-dependent flooding into effect with a narrowed-down search space by measuring how the gradient steps taken within one epoch affect the loss of each batch. |
| Outcome: | The proposed method improves BERT’s resistance to textual adversarial attacks by a large margin and achieves state-of-the-art robust accuracy on various text classification and GLUE tasks. |
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: | Large Language Models (LLMs) have shown potential in reasoning over structured environments, e.g., knowledge graphs and tables. |
| Approach: | They propose a framework that allows LLMs to efficiently and faithfully reason over structured environments. |
| Outcome: | The proposed framework surpasses state-of-the-art fine-tuned methods on three KGQA and two TableQA datasets and surpasse CWQ and WTQ methods. |
Copied to clipboard
| Challenge: | Existing approaches to domain adaptation fail to generalize well on unknown test data. |
| Approach: | They propose a backdoor adjustment-based causal model to disentangle domain-specific and domain-invariant representations that play essential roles in tackling domain shift. |
| Outcome: | The proposed model disentangles domain-specific and domain-invariant representations that play essential roles in tackling domain shift. |
Copied to clipboard
| Challenge: | Low-rank adaptation (LoRA) has been demonstrated effective in reducing the trainable parameter number when fine-tuning a large foundation model (LLM). |
| Approach: | They propose a low-rank adaptation approach that reduces the number of trainable parameters while enhancing model performance. |
| Outcome: | The proposed approach outperforms existing parameter-efficient fine-tuning methods while achieving substantial reductions in computational cost and memory requirements. |
Copied to clipboard
| Challenge: | Large vision language models have impressive reasoning capabilities across complex multimodal tasks. |
| Approach: | They propose to use distribution-reshaping and trajectory-rebalancing to improve visual reasoning capabilities. |
| Outcome: | Experiments on Qwen2-VL-7B-Instruct and InternVL2.5-4B models show that their methods outperform baselines by 3.86 points. |
Copied to clipboard
| Challenge: | Existing news recommendation methods rely on news click history to model user interest, but data sparsity is a problem . other kinds of user behaviors such as webpage browsing and search queries can provide useful clues of users’ news reading interest. |
| Approach: | They propose to exploit heterogeneous user behaviors to learn news representations from their titles via CNN networks and apply attention networks to select important words. |
| Outcome: | The proposed approach exploits heterogeneous user behaviors on a real-world dataset. |
Copied to clipboard
| Challenge: | Existing methods for inductive reasoning over knowledge graphs lack the ability to model the logical structures of complex queries. |
| Approach: | They propose a structure-modeled textual encoding framework for inductive logical reasoning over KGs that encodes linearized query structures and entities using pre-trained language models to find answers. |
| Outcome: | The proposed framework encodes query structures and entities using pre-trained language models to find answers. |
Copied to clipboard
| Challenge: | Large language models (LLMs) generate solutions themselves and iteratively train on filtered, high-quality rationales, but performance reaches a ceiling after a few iterations. |
| Approach: | They propose a strategy to improve the efficiency of sampling heavy-tailed data by using Socratic-style guidance signals to help LLMs reasoning with complex queries. |
| Outcome: | The proposed approach is effective on difficult queries and on held-out tasks, while requiring human supervision. |
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: | Existing rule-based chunking methods lead to suboptimal splits, where overly large chunks introduce irrelevant information and small chunks lack semantic coherence. |
| Approach: | They propose a method that leverages document summaries as pseudo-instructions to guide chunking by computing semantic similarity between sentences and the summary. |
| Outcome: | Experiments on multiple open-domain question-answering benchmarks show that PIC significantly improves retrieval accuracy (Hits@k) and end-to-end QA performance (Exact Match) without any additional training. |
Copied to clipboard
| Challenge: | Existing deep learning models fail when the test set is systematically different from the training data. |
| Approach: | They propose a method that explicitly models the relations between objects in their contexts while learning their representations. |
| Outcome: | The proposed model outperforms the baseline model and reaches state-of-the-art performance on grounded SCAN (gSCAN), a grounded natural language navigation dataset. |
Copied to clipboard
| Challenge: | Existing prompting methods have been used to enhance multistep reasoning capabilities of large language models, but they have overlooked the potential of formulating higher-quality problems. |
| Approach: | They propose a method that starts from the problem side and refines problems to be more comprehensible and solvable for models. |
| Outcome: | The proposed method achieves notable and consistent effectiveness on five reasoning benchmarks across different models. |
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: | 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: | 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: | Prior work has explored the selection of examples for in-context learning, neglecting the internal relationships between examples and exist an inconsistency between training and inference. |
| Approach: | They propose a sequential-aware method that leverages the LLM’s feedback on varying context, aiding in capturing inter-relationships and sequential information among examples. |
| Outcome: | Experiments on 23 NLP tasks show that Se2 surpasses baselines and achieves 42% relative improvement over random selection. |
Copied to clipboard
| Challenge: | Existing methods for rumor resolution ignore local interactions during the message diffusion which is important for the identification of rumors. |
| Approach: | They propose to model confrontation and reciprocity between message pairs via discrete variational autoencoders which effectively reflects the diversified opinion interactivity. |
| Outcome: | Experiments on a PHEME dataset show that the proposed model achieves higher accuracy than existing methods. |
Copied to clipboard
| Challenge: | Existing rumor detection models neglect the semantic coherence between text and image components in multimodal posts . Existing models neglect incomplete modalities in single modal posts, such as missing text or images . |
| Approach: | They propose a framework for incomplete modality rumor detection that captures semantic consistency between text and image pairs while enhancing model generalization to incomplete modalities within individual posts. |
| Outcome: | The proposed framework outperforms state-of-the-art methods on two English and two Chinese benchmark datasets for rumor detection in social media. |
Copied to clipboard
| Challenge: | Large Reasoning Models have achieved remarkable success on reasoning-intensive tasks, but their enhanced reasoning capabilities do not translate to improved safety performance. |
| Approach: | They propose to use supervised fine tuning to enhance the safety of Large Reasoning Models. |
| Outcome: | The proposed method improves the safety of large reasoning models on reasoning-intensive tasks. |
Copied to clipboard
| Challenge: | Existing methods for finetuning pretrained language models (PLMs) have risks in overfitting the pretraining tasks and data, which may lead to suboptimal performance. |
| Approach: | They propose a method which adds noise to parameters of PLMs before fine-tuning. |
| Outcome: | The proposed method can be used on GLUE English and XTREME multilingual benchmarks. |
Copied to clipboard
| Challenge: | Large language models (LLMs) have demonstrated proficiency in understanding and generating human natural languages. |
| Approach: | They propose a framework for scaling large language models using supervised fine-tuning, RLxF and test-time compute methodologies. |
| Outcome: | The proposed model can be used to understand and generate human natural languages. |
Copied to clipboard
| Challenge: | Existing methods for zero-shot video captioning focus on one key aspect of the scene and ignore the rest of the visual input. |
| Approach: | They propose a novel textual prompting strategy for zero-shot video captioning that uses a category-aware retrieval mechanism to promote prompt diversity while ensuring visual relevance. |
| Outcome: | The proposed method outperforms existing methods on in-domain and cross-domain settings. |
Copied to clipboard
| Challenge: | Existing methods have framed the reasoning problem as a semantic matching task. |
| Approach: | They propose an asynchronous deep interaction network (ADIN) to deconstruct the reasoning process and implement asynchron and multi-step reasoning. |
| Outcome: | The proposed model outperforms strong baselines on three popular benchmarks: SNLI, MultiNLI, and SciTail. |
Copied to clipboard
| Challenge: | Chain-of-Thought (CoT) reasoning has improved the performance of large language models (LLMs) however, the detailed reasoning process in CoT often incurs long generation times and high computational costs due to the inclusion of unnecessary steps. |
| Approach: | They propose a method to identify critical reasoning steps using perplexity as a measure of their importance. |
| Outcome: | The proposed method achieves a better balance between reasoning accuracy and efficiency of CoT. |
Copied to clipboard
| Challenge: | Existing studies suggest key phrase selection is essential for question generation, yet it is difficult to connect disjointed phrases into meaningful questions, especially for long context. |
| Approach: | They propose a QG framework that uses multi-level content planning to generate questions from a given context and an answer. |
| Outcome: | The proposed framework outperforms baselines on two popular QG datasets. |
Copied to clipboard
| Challenge: | Existing research for question generation encodes text as a sequence of tokens without explicitly modeling fact information. |
| Approach: | They propose to incorporate facts in the input text for question generation in a comprehensive way. |
| Outcome: | The proposed model outperforms state-of-the-art models and human evaluation shows it generates relevant and informative questions. |
Copied to clipboard
| Challenge: | Existing multi-domain dialog state tracking models require significant manual effort to define domain relations and collect data. |
| Approach: | They propose a divide-and-conquer (DAC) DST paradigm and a multi-domain dialog synthesis framework to build multi- domain DST models from single-domain dialogues. |
| Outcome: | The proposed paradigm makes building multi-domain DST models easier on unseen domain combinations. |
Copied to clipboard
| Challenge: | Document retrieval techniques are used to compute semantic similarity between a query and documents, but the scalar similarity fails to reflect enough information, hindering the interpretation of retrieval results. |
| Approach: | They propose a method which improves the global document-query similarity through contrastive learning and integrates well-designed fusion and decoding modules. |
| Outcome: | The proposed method improves the global document-query similarity through contrastive learning and integrates well-designed fusion and decoding modules. |
Copied to clipboard
| Challenge: | Existing methods for continual relation extraction (CRE) excel in preserving old knowledge but falter when confronted with contaminated data streams. |
| Approach: | They propose a noise-resistant contrastive framework for continual relation extraction (CRE) that preserves old knowledge while learning incremental corrupted relations. |
| Outcome: | The proposed framework outperforms state-of-the-art methods on various benchmarks with increasing noise rates. |
Copied to clipboard
| Challenge: | Retrieval-augmented generation (RAG) techniques have proven to be effective in integrating up-to-date information, mitigating hallucinations, and enhancing response quality, especially in specialized domains. |
| Approach: | They propose several strategies for deploying RAG that balance performance and efficiency. |
| Outcome: | The proposed approaches can significantly enhance question-answering capabilities and accelerate the generation of multimodal content using a “retrieval as generation” strategy. |
Copied to clipboard
| Challenge: | Existing methods rely on a single high-capacity LLM to represent an entire population of diverse learners. |
| Approach: | They propose an ability-aware student simulation framework that matches students with appropriate LLM backbones through cognitive alignment. |
| Outcome: | The proposed framework significantly reduces simulation bias and outperforms single-model baselines across the entire proficiency spectrum. |
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 methods to train neural machine translation models are data-hungry and low-resource . et al., 2018; Radford e.t., 2019; Yang ee.,2019) proposes a new pre-training method for NMT . |
| Approach: | They propose a new pre-training method which randomly replaces some words in the input sentence with their translation words in target language. |
| Outcome: | The proposed method improves on unsupervised and supervised NMT models by making full use of monolingual corpora. |
Copied to clipboard
| Challenge: | Large language models (LLMs) exhibit impressive emergent abilities in natural language processing, but their democratization is hindered due to huge computation requirements and closed-source nature. |
| Approach: | They propose a tailored learning approach to distill the exclusive reasoning ability to smaller LMs to facilitate democratization. |
| Outcome: | The proposed approach enables the democratization of the exclusive reasoning ability by leveraging the black-box model as a reasoning teacher. |
Copied to clipboard
| Challenge: | Existing methods for integrating spatial layouts with text have limitations . existing methods produce overly long text sequences or lack autoregressive traits of LLMs . |
| Approach: | They introduce Interleaving Layout and Text in a Large Language Model (LayTextLLM) they use OCR-derived text and spatial layouts to integrate with LLMs for document understanding . |
| Outcome: | The proposed model shows an increase in performance in KIE and VQA tasks. |
Copied to clipboard
| Challenge: | Existing research has focused on constraint categories, offering little guidance for improving instruction following abilities. |
| Approach: | They propose a multi-dimensional constraint framework that allows for instruction following . they construct 9,106 code-verifiable samples and evaluate 18 LLMs . |
| Outcome: | The proposed framework improves instruction following performance without compromising general performance. |
Copied to clipboard
| Challenge: | Existing adaptive testing methods face several challenges due to mechanized nature of most algorithms and noisy response data. |
| Approach: | They propose to use large language models to enhance adaptive testing through interactive engagement to capture test-takers’ responses and anomalies. |
| Outcome: | The proposed agent achieves more accurate results with 20% fewer questions than state-of-the-art baselines and testers preferred it in speed, smoothness, and other dimensions. |
Copied to clipboard
| Challenge: | Large language models struggle to process lengthy inputs due to limited length generalization and attention’s quadratic computational demands. |
| Approach: | They propose a training-free framework that allows each head to attend to important context chunks instead of allowing each head a full sentence . |
| Outcome: | The proposed framework unlocks multi-head attention's untapped potential by allowing each head to attend to important context chunks instead of the full sentence. |
Copied to clipboard
| Challenge: | Large Language Models (LLMs) have been widely adopted in real-world dialogue applications, but their robustness is criticized all along. |
| Approach: | They propose to use play-by-play text commentary to build a multi-turn athletic real-world scenario dialogue benchmark to evaluate three critical aspects of multi-turned conversations: ultra multi- turn, interactive multi-twist, and cross-turn tasks. |
| Outcome: | The proposed benchmarks outperform open-source LLMs on three critical aspects of multi-turn conversations: ultra multi-turned, interactive multi- turn, and cross-turn tasks. |
Copied to clipboard
| Challenge: | Recent work on neural machine translation (NMT) has demonstrated impressive performance improvements and became the de-facto standard. |
| Approach: | They propose a dynamic curriculum learning method to reorder training samples in training using a Transformer-based system. |
| Outcome: | The proposed method outperforms baselines on three low-resource machine translation benchmarks and different sized data of WMT’16 En-De. |
Copied to clipboard
| Challenge: | Code large language models (LLMs) are becoming tool-interactive agents . quantity-centric scaling exhibits an early bottleneck that underutilizes trajectory data . et al.: a new approach to scale trajectory diversity improves tool-use generalization . |
| Approach: | They propose a Trajectory Diversity Scaling-based data synthesis framework for code agents that scales performance through diversity rather than raw volume. |
| Outcome: | Experiments on general tool-use benchmarks and code agent tasks show that TDScaling improves tool-user generalization and inherent coding proficiency. |
Copied to clipboard
| Challenge: | Large pre-trained language models (PLMs) have demonstrated superior performance in industrial applications. |
| Approach: | They propose a framework that re-uses existing parameter-efficient methods with a unified classifier. |
| Outcome: | The proposed framework improves the efficiency of existing parameter-efficient methods with a unified classifier. |
Copied to clipboard
| Challenge: | Large language models (LLMs) have been successful in understanding language and processing text, but their cost prohibits their practical applications. |
| Approach: | They propose a multi-agent collaboration method that breaks down lengthy documents into smaller, more manageable chunks and organizes the member agents to read their assigned chunks. |
| Outcome: | The proposed method achieves 16.42% and 1.63% accuracy gains over existing models on single-hop and multi-hop QA settings. |
Copied to clipboard
| Challenge: | Existing benchmarks for document understanding in the wild are based on scanned or digital documents . however, these benchmarks fail to capture the challenges posed by documents in the real world . |
| Approach: | They propose a new benchmark that incorporates a diverse set of manually captured document images reflecting real-world conditions. |
| Outcome: | The proposed model is based on a set of manually captured document images reflecting real-world conditions and is compared with digital or scanned documents. |
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: | Generative retrieval heavily relies on the “preprocessed” document identifiers, thus limiting its retrieval performance and ability to retrieve new documents. |
| Approach: | They propose a fully end-to-end retrieval paradigm that can learn the best docids for existing and new documents automatically via a semantic indexing module. |
| Outcome: | The proposed model outperforms baselines on public and industrial datasets and can handle new documents. |
Copied to clipboard
| Challenge: | Existing evaluation of Large Language Models on static benchmarks is vulnerable to data contamination and leaderboard overfitting. |
| Approach: | LLMEval-Fair framework provides a framework for dynamic evaluation of Large Language Models . evaluators use a proprietary bank of 220k graduate-level questions to analyze model data . |
| Outcome: | LLMEval-Fair provides robust and credible evaluation framework for Large Language Models . it provides a strong empirical validation for the dynamic evaluation paradigm . |
Copied to clipboard
| Challenge: | Current Large Language Models struggle with complex entity taxonomies in open domains and lack NER capabilities. |
| Approach: | They propose a dataset to guide LLMs' generalization in Open NER under a universal entity taxonomy. |
| Outcome: | The proposed model outperforms GPT-4 in 3 out-of-domain benchmarks across 15 datasets and 6 languages. |
Copied to clipboard
| Challenge: | Existing data selection methods for instruction-following large language models rely on unreliable scores or use downstream tasks for selection. |
| Approach: | They propose a method that utilizes the VLM itself as a filter to select high-quality instruction-tuning data. |
| Outcome: | The proposed method can reach better results compared to full data settings with merely about 15% samples and can achieve superior performance against competitive baselines. |
Copied to clipboard
| Challenge: | Existing studies for visually-situated language understanding have shown shallow zero-shot visual text recognition ability when fed a low-resolution image with salient text information. |
| Approach: | They propose a model for universal OCR-free visually-situated language understanding based on the Multimodal Large Language Model (MLLM) their model is jointly finetuned on a wide range of visually situated language understanding tasks via a unified instruction format. |
| Outcome: | The proposed model achieves state-of-the-art ocr-free performance in 8 out of 10 visually-situated language understanding tasks across 5 domains: documents, tables, charts, natural images, and webpage screenshots. |
Copied to clipboard
| Challenge: | Recent progress in large language models is driven by scaling of training compute through pre-training with nexttoken prediction (NTP) or post-training (RL) Pre-training using NTP enables models to acquire extensive knowledge and skills from general data, but it suffers from data inefficiency and catastrophic forgetting in continual learning settings. |
| Approach: | They propose to scale training compute through pre-training with next-token prediction (NTP) or post-training by scaling reinforcement learning (RL) to improve learning from general data. |
| Outcome: | Experiments on multiple benchmarks and models show that the proposed approach improves continual pre-training and provides a strong foundation for post-training on Qwen3-8B-Base. |
Copied to clipboard
| Challenge: | Existing studies have explored various diversity-aware data selection methods to construct high-quality datasets and enhance model performance. |
| Approach: | They propose to use data diversity to measure instruction tuning of large language models. |
| Outcome: | The proposed diversity metric outperforms existing methods on simulated and real-world data and shows that it captures diversity variations and achieves a 0.97 correlation with instruction tuning. |
Copied to clipboard
| Challenge: | Experiments on GPT and other 23 LLMs indicate that tokens widely exist while GPT’s vocabulary behaves the worst: more than 23% long Chinese tokens (i.e., a token with more than two Chinese characters) are either porn or online gambling. |
| Approach: | They propose to locate Polluted Chinese (PoC) tokens in LLMs and build a PoC token detector to label them in vocabularies by considering each token’s semantics and related contents from the search engines. |
| Outcome: | The proposed method predicts that the ratio of “*” related webpages in GPT-4o's training data is around 0.5%. |
Copied to clipboard
| Challenge: | Commercial-scale language models (LMs) have taken APR to unprecedented levels, but they are limited by parameters and humans interact with them through explicit prompts. |
| Approach: | They propose a method that utilizes process supervision to improve program repair by allowing users to input feedback from compilers and test cases. |
| Outcome: | The proposed method outperforms large outcome-based generation methods and is inspired by strategies used in programming competitions. |
Copied to clipboard
| Challenge: | Current models can not ensure the complexity of generated questions, so they may generate shallow questions that can be answered without multi-hop reasoning. |
| Approach: | They propose a controlled framework to generate multi-hop questions that contain key entities in multi- hop reasoning chains and a novel Transformer-based decoder to guarantee that key entities appear in the questions. |
| Outcome: | The proposed model outperforms the state-of-the-art model 25% on HotpotQA. |
Copied to clipboard
| Challenge: | Existing methods for dialogue policy optimization do not provide sufficient supervision signals at the end of dialogues. |
| Approach: | They propose to learn from state-action pairs of an optimal policy to provide turn-by-turn rewards. |
| Outcome: | The proposed approach outperforms competitive policy learning baselines on a benchmark multi-domain dataset. |
Copied to clipboard
| Challenge: | Existing studies try to extract one universal reading order for PDF files, however, some applications, like Retrieval Augmented Generation, require breaking long articles into sections and subsections for better indexing. |
| Approach: | They propose a new task and dataset, PDF-to-Tree, which organizes the text blocks of a PDF into a tree structure. |
| Outcome: | The proposed parser achieves 93.93% accuracy, surpassing baseline methods by 6.72%. |
Copied to clipboard
| Challenge: | Experimental results show that our method significantly improves ELECTRA’s average performance by 2.8% and 3.2% absolute points respectively on GLUE and SQuAD 2.0 benchmarks. |
| Approach: | They propose a multi-perspective course learning method to fetch many degrees and visual angles for sample-efficient pre-training and to fully leverage the relationship between generator and discriminator. |
| Outcome: | The proposed method improves ELECTRA's performance on GLUE and SQuAD 2.0 benchmarks and overshadows recent advanced ELECL-style models under the same settings. |
Copied to clipboard
| Challenge: | Existing Large Language Models struggle to maintain emotionally consistent and psychologically plausible character personalities. |
| Approach: | They propose a framework that enhances LLMs’ ability to generate authentic personality-driven dialogues through stochastic emotional transitions. |
| Outcome: | The proposed framework achieves 93.3% emotional accuracy on the RAPD dataset and significantly outperforms existing approaches. |
Copied to clipboard
| Challenge: | Existing approaches to multihop question generation require extensive data collection and decomposition. |
| Approach: | They propose a generative approach that optimizes the two-phase model without question decomposition data. |
| Outcome: | The proposed approach outperforms baselines on HOTPOTQA, a benchmark multi-hop question answering dataset. |
Copied to clipboard
| Challenge: | Recent work on aspect-level sentiment classification has shown that syntactic information is effective in capturing long-range syntaktic relations that are obscure from the surface form. |
| Approach: | They propose a graph ensemble technique that integrates syntactic structures with GNNs to better leverage syntaktic information in the face of parsing errors. |
| Outcome: | The proposed model outperforms models with single dependency tree and beats other models without adding model parameters. |
Copied to clipboard
| Challenge: | Existing POS tagging methods for Twitter use labeled newswire text . however, Twitter users tend to mimic formal media expressions and develop linguistically informal styles. |
| Approach: | They propose to use newswire text to learn POS tagging for Twitter while twitter users are developing linguistically informal styles. |
| Outcome: | The proposed method achieves better performance than state-of-the-art methods on three different datasets. |
Copied to clipboard
| Challenge: | Existing multi-modal large language models focus on capturing global information while neglecting the fine-grained local information in multimodal inputs. |
| Approach: | They propose an end-to-end language enhanced multi-modal grounding model that performs fine-grained grounding tasks for image, video and audio. |
| Outcome: | The proposed model achieves impressive fine-grained understanding of multi-modal inputs while maintaining or improving its global comprehension capabilities. |
Copied to clipboard
| Challenge: | Existing methods to collect high-quality instruction-response pairs suffer from unaffordable labor costs or severe hallucinations in the self-generation of LLMs. |
| Approach: | They propose a method that trains LLMs to generate instruction-response pairs based on human-written documents rather than relying solely on self-generation without context. |
| Outcome: | The proposed method outperforms existing typical methods on multiple benchmarks and shows that it is 100% scalable. |
Copied to clipboard
| Challenge: | Recent studies show that RLVR training is slow and results plateau as policy entropy collapses . low-probability regularization (Lp-Reg) reduces the number of low-quality exploratory tokens induced by RL training . |
| Approach: | They propose a method to reduce RLVR over-penalization by eliminating low-probability exploratory tokens . they propose 'Low-provability Regularization' to reduce the gradual elimination of low-quality exploratory entropy tokens. |
| Outcome: | The proposed method eliminates low-probability exploratory tokens and prevents suppression of potentially valuable low-property candidates. |
Copied to clipboard
| Challenge: | Current outcome-centric verification paradigms neglect potential errors in the derivation process. |
| Approach: | They propose a process-aware RLVR training paradigm utilizing verifiers selected via **PRIME**. |
| Outcome: | The proposed approach outperforms the baseline verification paradigm on AIME24, AIME25, and Beyond-AIME models. |
Copied to clipboard
| Challenge: | Existing studies have investigated knowledge poisoning attacks in medical RAG systems . knowledge poison attacks can disrupt model outputs and undermine system reliability . |
| Approach: | They propose a knowledge poisoning framework that injects misinformation into textual data . they propose to use paired visual data as a query-agnostic trigger to promote retrieval . |
| Outcome: | The proposed framework produces clinically plausible but incorrect generations on five LLMs and datasets. |
Copied to clipboard
| Challenge: | Existing methods for minimizing the worst-case loss of annotated groups are lacking in practice due to expensive annotations and privacy issues. |
| Approach: | They propose a distributionally robust optimization framework that relaxes group identification into direct parameterization by using an interactive training mode. |
| Outcome: | The proposed method outperforms state-of-the-art methods on synthetic and real-world text classification tasks. |
Copied to clipboard
| Challenge: | Recent techniques such as Generation-Augmented Retrieval (GAR) and Generative Document Retrieleval (GDR) leverage LLMs to enhance retrieval performance but face key challenges: GAR’s generated content may not always align with the target document corpus, while GDR limits the generative capacity of LLM. |
| Approach: | They propose a Context-Aware Generation-Augmented Retrieval approach which integrates corpus information into their generation process. |
| Outcome: | Experimental results show that CA-GAR outperforms existing methods on seven tasks and four non-English languages. |
Copied to clipboard
| Challenge: | Despite the significant contributions to the community, there is still a gap between existing dialogue corpora and real-life human dialogue data. |
| Approach: | They propose to develop Chinese cross-domain wizard-of-oz task-oriented dataset CrossWOZ with rich annotations of dialogue states and dialogue acts on both user and system sides. |
| Outcome: | The proposed dataset contains 6K dialogue sessions and 102K utterances for 5 domains, including hotel, restaurant, attraction, metro, and taxi. |
Copied to clipboard
| Challenge: | Existing pooling methods that use fixed pooling norms may not be optimal for learning text representations in different tasks. |
| Approach: | They propose to learn pooling norms in an end-to-end manner to automatically find the optimal ones for text representation in different tasks. |
| Outcome: | The proposed approach improves on four benchmark datasets on a neural NLP model. |
Copied to clipboard
| Challenge: | Existing studies on how LLMs achieve cross-lingual alignment and generalization have not explored the intrinsic mechanisms of how they achieve crosslingual alignment. |
| Approach: | They propose to remove a core region that corresponds to linguistic competence and set parameters to zero to reduce performance across 30 different languages. |
| Outcome: | The proposed model can be used to perform tasks requiring abstract knowledge and reasoning in complex languages. |
Copied to clipboard
| Challenge: | Existing ODQA datasets consist mainly of Wikipedia corpus, and are insufficient to study models’ generalizability across diverse domains. |
| Approach: | They propose a benchmark to evaluate ODQA's domain robustness using Wikipedia corpus . they annotate QA pairs in retrieval datasets with rigorous quality control . |
| Outcome: | The proposed benchmark improves model performance on annotated QA pairs in retrieval datasets with rigorous quality control. |
Copied to clipboard
| Challenge: | Existing research for argument representation learning treats tokens in sentences equally and ignores the implied structure information of argumentative context. |
| Approach: | They propose to separate tokens into two groups to capture structural information of arguments and to incorporate paragraph-level position information into the model. |
| Outcome: | The proposed model captures structural information of arguments and is able to identify arguments automatically. |
Copied to clipboard
| Challenge: | Existing approaches to multilingual retrieval-augmented generation (MRAG) use a single-turn retrieval and subsequent optimization to acquire and integrate beneficial external knowledge from multilingual collections. |
| Approach: | They propose a multilingual search-augmented reinforcement learning framework that integrates a language-coupled Group Relative Policy Optimization into the policy and reward models. |
| Outcome: | The proposed framework achieves competitive performance and is appropriate for various practical scenarios such as constrained training data and retrieval over collections encompassing a large number of languages. |
Copied to clipboard
| Challenge: | Existing news recommendation methods learn a single user embedding for each user from their previous behaviors to represent their overall interest. Existing methods only learn 'one' embeddable representation vectors to model user interest. |
| Approach: | They propose a news recommendation method with hierarchical user interest modeling that captures user interest in news rather than a single user embedding. |
| Outcome: | The proposed method can better capture multi-grained user interest in news. |
Copied to clipboard
| Challenge: | Recent studies have shown that current TMSC systems rely on textual information, and the progress in tackling this task has slowed down. |
| Approach: | They propose to integrate both visual and textual information to improve the performance of TMSC by considering multimodal information. |
| Outcome: | The proposed model integrates both visual and textual information to improve performance. |
Copied to clipboard
| Challenge: | Recent studies have shown that adversarial examples can be easily fooled by adversarially perturbed examples. |
| Approach: | They propose a pluggable defense module PlugAT to provide robust predictions by adding a few trainable parameters to the model inputs while keeping the original model frozen. |
| Outcome: | The proposed model improves robustness over several strong baselines whilst training only 9.1% parameters. |
Copied to clipboard
| Challenge: | Existing models that extract discrete inputs into fixed-length representations are vulnerable to adversarial attacks that place perturbations on clean inputs to fool DNNs. |
| Approach: | They propose to inspect the subspaces of sample features through spectral analysis to better understand adversarial attacks. |
| Outcome: | The proposed strategy enables the model to inherently suppress adversaries, which boosts model robustness and motivates new directions of effective adversarial defense. |
Copied to clipboard
| Challenge: | Existing RAG systems often underutilize the retrieved documents, authors say . they fail to extract and integrate key clues needed to support faithful and interpretable reasoning . |
| Approach: | a new framework extracts key clues from retrieved content and generates multiple reasoning paths . the framework optimizes the model by selecting the most appropriate reasoning path . |
| Outcome: | Experiments show that ClueAnchor outperforms baseline RAG frameworks in completeness and robustness. |
Copied to clipboard
| Challenge: | Existing studies have shown that adversarial samples are more vulnerable than normal ones to textual adversarials. |
| Approach: | They propose a simple and effective sharpness-based detector that can distinguish adversarial samples by maximizing the loss increment within the region where the inference sample is located. |
| Outcome: | The proposed method outperforms previous detection methods by large margins on three text classification tasks. |
Copied to clipboard
| Challenge: | Existing named entity recognition systems require large scale labeled data to perform, while annotation of NER data is laborious and time-consuming. |
| Approach: | They propose to adjust an existing named entity recognition system to recognize entity types not defined in the system. |
| Outcome: | The proposed method can be quickly adjusted to a named entity recognition system. |
Copied to clipboard
| Challenge: | Mixture-of-Experts (MoE) LLMs achieve higher performance with fewer active parameters, but are still difficult to deploy due to their immense parameter sizes. |
| Approach: | They propose expert-level sparsification techniques to enhance the deployment efficiency of large language models by introducing plug-and-play expert pruning and skipping techniques. |
| Outcome: | The proposed methods reduce model sizes and increase inference speed while maintaining satisfactory performance across a wide range of tasks. |
Copied to clipboard
| Challenge: | Chain-of-Thought (CoT) prompting relies on the initial decisions, causing errors in early steps to accumulate and impact the final answers. |
| Approach: | They propose a divide-and-conquer style algorithm that leverages large language models to raise and answer sub-questions until collecting enough information to tackle the original one. |
| Outcome: | The proposed algorithm is more robust to errors and errors than CoT prompting and Tree-of-Thought prompting methods. |
Copied to clipboard
| Challenge: | End-to-end Speech Translation (E2E ST) encoders lack global context representation, whereas MT encoder lacks it. |
| Approach: | They propose a Stacked Acoustic-and-Textual Encoding method for speech translation . they propose an adaptor module to alleviate representation inconsistency . |
| Outcome: | The proposed method achieves state-of-the-art BLEU scores of 18.3 and 25.2 on two ST tasks. |
Copied to clipboard
| Challenge: | Recent studies have discussed its capability to assist language models for various applications. |
| Approach: | They propose a structure to organize arguments using the **Hi**erarchical **Ar**gumentation **G**raph (Hi-ArG) and propose two approaches to exploit Hi-AarG, including a text-graph multi-modal model GreaseArR and a framework augmented with graph information. |
| Outcome: | The proposed structure supersedes existing language models on two argumentation tasks while incorporating graph information during further training improves vanilla language models. |
Copied to clipboard
| Challenge: | Software version migration and program translation are costly parts of the lifecycle of large codebases. |
| Approach: | They propose a model that captures semantic and structural equivalence of code in a language agnostic intermediate representation. |
| Outcome: | The proposed model achieves state-of-the-art performance on CodeXGLUE and TransCoder GeeksForGeeks translation benchmarks. |
Copied to clipboard
| Challenge: | Existing methods for predicting inter-task transferability are sparse and task-specific. |
| Approach: | They propose a method that uses connectivity patterns of neurons as a unique identifier associated with a task. |
| Outcome: | The proposed method outperforms baselines in predicting inter-task transferability across data regimes and transfer settings while keeping high efficiency in computation and storage. |
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: | Recent research shows that LLM Agents can generate “believable” human behaviors via prompt-only methods, leaving open questions of whether they can accurately generate step-by-step actions in multi-turn interaction tasks. |
| Approach: | They propose to use shopping data to evaluate LLMs' ability to accurately generate step-by-step actions in a multi-turn interaction task. |
| Outcome: | The proposed model achieves 17.26% action generation accuracy and 33.86% F1 score on final purchase prediction, representing improvements of 5.4% and 13.85% over baselines. |
Copied to clipboard
| Challenge: | Reinforcement Learning from Human Feedback (RLHF) is a method for aligning language models with human values. |
| Approach: | They propose a method that automatically adjusts reward modeling based on data quality . they use preference data to train a reward model that is more aligned with human values . |
| Outcome: | The proposed method stabilizes reward model training and significantly improves alignment performance on human preference datasets. |
Copied to clipboard
| Challenge: | Existing studies on integrating online community to solve social problems have not fully utilized these three components and the relationship among them. |
| Approach: | They propose a framework that simultaneously considers communities, users, and texts and can easily connect with a variety of downstream tasks related to social media. |
| Outcome: | The proposed model can be used to perform violation detection, sentiment analysis, and community recommendation across multiple tasks. |
Copied to clipboard
| Challenge: | Existing defense approaches focus on developing new model structures or training algorithms, but they do little to tap the potential of training instances. |
| Approach: | They propose a method that can distinguish between robust and non-robust instances according to the model’s sensitivity to perturbations on individual instances during training. |
| Outcome: | The proposed method can distinguish between robust and non-robust instances according to the model’s sensitivity to perturbations on individual instances during training. |
Copied to clipboard
| Challenge: | Existing supervised relation extraction methods can still misclassify unknown relations into known relations due to the lack of supervision signals. |
| Approach: | They propose a method that regularizes the model by dynamically synthesizing negative instances that can provide the missing supervision signals. |
| Outcome: | The proposed method achieves SOTA unknown relation detection without compromising the classification of known relations. |
Copied to clipboard
| Challenge: | Existing research on monological argumentation covers claims generation, argument structure prediction, and essay scoring. |
| Approach: | They propose to identify argument pairs from two posts with opposite stances to a certain topic. |
| Outcome: | The proposed framework outperforms competing models on a large-scale dataset . it also proves that it is useful for analyzing argument pairs from two posts . |
Copied to clipboard
| Challenge: | Existing training data detectors fail to detect clean samples from contaminated test sets . existing methods fail to identify clean samples due to black-box nature of LLMs . |
| Approach: | They propose a framework that detects and filters contaminated evaluation data . they propose 'failure detection' to reduce the proportion of contaminated samples mistakenly retained . |
| Outcome: | The proposed framework reduces false discovery rate (FDR) under valid FDR control while maintaining evaluation consistency. |
Copied to clipboard
| Challenge: | Existing tools for building TOD systems often lack a user-friendly interface . a toolkit with advanced, easily integrable modules is needed to bridge this gap . |
| Approach: | They propose a multifaceted dialogue system toolkit that integrates diverse datasets and models with a streamlined training process and in-depth evaluation tools. |
| Outcome: | The proposed toolkit combines RL and transfer learning to support the rapid development and evaluation of robust dialogue policies. |
Copied to clipboard
| Challenge: | Existing knowledge graph construction frameworks require predefined schemas, limiting their scalability and domain coverage. |
| Approach: | They propose a framework for fully autonomous knowledge graph construction that eliminates the need for predefined schemas. |
| Outcome: | The proposed framework outperforms state-of-the-art models on multi-hop QA tasks and enhances LLM factuality. |
Copied to clipboard
| Challenge: | Existing methods for integrating knowledge graphs with LLMs suffer from poor generalization or low reasoning efficiency. |
| Approach: | They propose a thought-action Graph (TAG) that decomposes LLM-KG interaction trajectories into fine-grained semantic operators and guides LLM to execute on them. |
| Outcome: | The proposed paradigm outperforms state-of-the-art methods on KGQA benchmarks while reducing the number of LLM calls and generated tokens. |
Copied to clipboard
| Challenge: | Existing attempts to enhance LLM-based world models through prompting or fine-tuning approaches are either requiring human knowledge or computationally extensive. |
| Approach: | They propose a framework that leverages retrieval-augmented generation to integrate external knowledge to LLM-based world models. |
| Outcome: | The proposed framework outperforms baseline models and exhibits strong generalizability. |
Copied to clipboard
| Challenge: | Existing formal proof assistants rely on instruction tuning and lack fine-grained structural and semantic alignment. |
| Approach: | They propose a reinforcement learning framework that enables LLMs to translate natural language into formal language such as Lean 4 . they use a model with basic translation ability to refine the model's reinforcement learning . |
| Outcome: | The proposed method outperforms baseline models on NL-to-Lean 4 tasks. |
Copied to clipboard
| Challenge: | Conditioned response generation for task-oriented dialogues implicitly optimizes task completion and language quality. |
| Approach: | They propose to learn natural language actions that represent utterances as a span of words. |
| Outcome: | The proposed approach outperforms latent action baselines on a multi-domain dataset. |
Copied to clipboard
| Challenge: | Existing research focuses on enhancing LLMs capabilities through tool utilization. |
| Approach: | They propose a framework to investigate safety issues in large language models in tool learning . they propose malicious queries and jailbreak attacks in the input stage . |
| Outcome: | The proposed framework investigates six safety scenarios for LLMs in tool learning . the data will be released upon acceptance of the proposed framework . |
Copied to clipboard
| Challenge: | Mars? - PragmatiCQA |
| Approach: | Mars? - The Paper . |
| Outcome: | The proposed dataset features 6873 QA pairs that explores pragmatic reasoning in conversations over a diverse set of topics. |
Copied to clipboard
| Challenge: | Existing research shows that BERT and RoBERTa are poor in sentence embeddings due to static token embeddable bias and ineffective BERT layers. |
| Approach: | They propose a novel contrastive learning method for better sentence embeddings by using a template denoising technique. |
| Outcome: | The proposed method achieves 2.29 and 2.58 points of improvement compared to SimCSE and RoBERTa in the unsupervised setting. |
Copied to clipboard
| Challenge: | Existing methods for retrieving historical messages are based on similarity-based mechanisms. |
| Approach: | They propose a system that integrates System-1 similarity search with a complementary System-2 mechanism, termed Global Selection. |
| Outcome: | The proposed framework achieves state-of-the-art on long-term memory benchmarks and 93.9 on LoCoMo and 91.6 on LongMemEval-S. |
Copied to clipboard
| Challenge: | Large Language Models (LLMs) and Large Multimodal Models have exceeded general human capabilities in various tasks. |
| Approach: | They present an Olympiad-level bilingual multimodal scientific benchmark featuring 8,476 problems from Olympiad level mathematics and physics competitions. |
| Outcome: | The best performing model, GPT-4V, attains an average score of 17.97% on OlympiadBench, with a mere 10.74% in physics, highlighting the benchmark rigor and the intricacy of physical reasoning. |
Copied to clipboard
| Challenge: | Recent studies have shown that pre-trained language models contain smaller matching subnetworks that are not robust to adversarial examples. |
| Approach: | They propose a method to find robust tickets hidden in pre-trained language models by learning binary weight masks and an adversarial loss objective to guide the search. |
| Outcome: | The proposed method improves on previous work on adversarial robustness evaluation. |
Copied to clipboard
| Challenge: | Recent work addresses this problem by training span-level hallucination detectors using reinforcement learning and chain-of-thought reasoning. |
| Approach: | They propose a framework that explicitly enforces active evidence seeking during CoT reasoning by requiring quotation of relevant source segments at each verification step. |
| Outcome: | The proposed framework improves hallucination span detection performance with limited reasoning overhead and improved robustness in out-of-domain settings. |
Copied to clipboard
| Challenge: | Recent studies have shown that dual encoder models trained with the sentence-level translation ranking task are effective methods for cross-lingual sentence embedding. |
| Approach: | They propose a dual-alignment pre-training framework that incorporates both sentence-level and token-level alignment. |
| Outcome: | The proposed framework improves cross-lingual sentence embedding on three cross-linguistic benchmarks. |
Copied to clipboard
| Challenge: | Pretrained language models are susceptible to subtle perturbations and require multiple adversarial training during fine-tuning to improve their robustness. |
| Approach: | They propose a novel adversarial defense method ORTicket that fine-tunes a model for downstream tasks. |
| Outcome: | The proposed method achieves comparable robustness to other defense methods while maintaining the efficiency of fine-tuning. |
Copied to clipboard
| Challenge: | Existing methods to preserve inference privacy are available as cloud services . however, the risk of privacy leakage remains, according to recent studies . |
| Approach: | They propose a method to preserve inference privacy by fusing token representations in the cloud. |
| Outcome: | The proposed method preserves inference privacy without sacrificing performance on different scenarios. |
Copied to clipboard
| Challenge: | Alignment of large language models (LLM) is a process that ensures the model’s responses to user prompts align with human intentions and social values. |
| Approach: | They propose an alignment method based on a two-agent game consisting of an adversarial agent and a defensive agent. |
| Outcome: | The proposed method improves on a two-agent game with an adversarial agent and a defensive agent. |
Copied to clipboard
| Challenge: | Large Language Models struggle with multilingual reasoning tasks due to resource constraints . a training-free method improves performance on multilingual thinking tasks . |
| Approach: | They propose a training-free method that transforms language-specific semantic information into language-agnostic structured representations. |
| Outcome: | The proposed method outperforms strong baselines on multilingual reasoning tasks. |
Copied to clipboard
| Challenge: | Existing methods for concept-level grounding and instruction-level reasoning use coarse representations and iterative mask filtering. |
| Approach: | They propose an instruction-following extension of the Segment Anything Model 3 family that unifies concept-level grounding and instruction-level reasoning within a single segmentation framework. |
| Outcome: | Experiments show that SAM3-I achieves appealing performance across referring and reasoning-based segmentation while maintaining its strong concept recall ability. |
Copied to clipboard
| Challenge: | Existing approaches to model long documents are difficult due to the quadratic complexity of text length. |
| Approach: | They propose a hierarchical interactive Transformer for efficient long document modeling. |
| Outcome: | Extensive experiments on three benchmark datasets validate the efficiency and effectiveness of Hi-Transformer in long document modeling. |
Copied to clipboard
| Challenge: | Existing pipelines for generating high-quality, ultra-detailed image captions are limited by the scarcity of image caption data. |
| Approach: | They propose a pipeline for generating high-quality, ultra-detailed image captions that integrates both pre-processing and post-processor stages. |
| Outcome: | The proposed pipeline improves LVLMs' perception and cognitive abilities across multiple vision-language benchmarks. |
Copied to clipboard
| Challenge: | Existing methods assess suitability primarily through student likelihood, favoring trajectories that align closely with the student model’s current behavior but overlooking more informative ones. |
| Approach: | They propose a Rank–Surprisal Ratio metric that captures both alignment and informativeness to assess the suitability of a reasoning trajectory. |
| Outcome: | The proposed metric captures both alignment and informativeness to assess the suitability of a reasoning trajectory. |
Copied to clipboard
| Challenge: | Existing news recommender systems conduct news recall and ranking separately with different models, but maintaining multiple models leads to high computational cost and high latency. |
| Approach: | They propose a unified method for recall and ranking in news recommendation that uses historical news click behaviors to extract user embeddings for ranking from the user's attention query. |
| Outcome: | The proposed method improves recall and ranking efficiency and effectiveness on a benchmark dataset. |
Copied to clipboard
| Challenge: | Existing information retrieval models assume a homogeneous structure for knowledge sources and user queries, limiting their applicability in real-world settings. |
| Approach: | They propose a unified instruction-aware heterogeneous knowledge retriever that builds a heterogenous retrieval space for heterogenized knowledge and follows diverse user instructions to retrieve knowledge in specified types. |
| Outcome: | The proposed framework outperforms state-of-the-art methods on CompMix-IR . it achieves 6.36% relative improvements and 54.23% relative improvements . |
Copied to clipboard
| Challenge: | Empirical studies on four public NER datasets demonstrate the effectiveness of our proposed method. |
| Approach: | They propose a method to perform named entity recognition using unlabeled data and named entity dictionaries. |
| Outcome: | The proposed method can estimate task loss as if there is fully labeled data. |
Copied to clipboard
| Challenge: | Existing methods to improve the robustness of pre-trained language models are expensive because of the need to generate adversarial examples via gradient descent. |
| Approach: | They propose an adversarial optimization method that searches for robust tickets with structured sparsity in the early stage and fine-tunes tickets in the remaining time. |
| Outcome: | The proposed method achieves up to 7 13 training speedups while maintaining comparable or even better robustness compared to the most competitive state-of-the-art methods. |
Copied to clipboard
| Challenge: | Existing methods for multi-hop reasoning ignore grounding on supporting facts of each step, which tends to generate inaccurate decompositions. |
| Approach: | They propose an interpretable stepwise reasoning framework that incorporates supporting sentences and questions at each intermediate step and utilizes the inference of the current hop for the next until reasoning out the final result. |
| Outcome: | The proposed model can boost performance and yield a better interpretable reasoning process without decomposition supervision. |
Copied to clipboard
| Challenge: | despite their extensive context window, long-context language models fail in some basic cases . a recent study shows that long-cot methods are not necessary for long-constituency tasks . |
| Approach: | a new study evaluates long-context language models with a large context window . the authors propose a method that can be well addressed with arbitrary reasoning steps . |
| Outcome: | The proposed methods are well addressed with a sufficient number of reasoning steps, guided by specific CoT prompts. |
Copied to clipboard
| Challenge: | Existing knowledge rewriting methods may include irrelevant information, omit crucial details, or fail to align with the question’s semantics. |
| Approach: | They propose a new rewriting method CoTKR for generating reasoning traces and corresponding knowledge in an interleaved manner, thereby mitigating the limitations of single-step knowledge rewrite. |
| Outcome: | The proposed method mitigates the limitations of single-step knowledge rewriting and bridges the preference gap between the knowledge reactor and the question answering (QA) model. |
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: | Existing question generation systems focus on the internal knowledge within the textual passage or the semantic word space for diverse content planning. Existing solutions focus on relying on the knowledge of the text and the semantic words, but have not considered the potential of external knowledge for expression diversity. |
| Approach: | They propose a framework for Retrieval-Augmented Style Transfer that utilizes the style of diverse templates for question generation. |
| Outcome: | The proposed framework outperforms baselines on diversity while being comparable in terms of consistency scores. |
Copied to clipboard
| Challenge: | Low-rank adaptation (LoRA) is one of the most popular parameter-efficient fine-tuning methods. |
| Approach: | They propose a low-rank adaptation method that adds residual paths during training and merges them together during inference to achieve better results. |
| Outcome: | The proposed method achieves 2.5x faster convergence speed and improves performance by 14.3% on NLG, NLU, and text-to-image tasks. |
Copied to clipboard
| Challenge: | Current medical benchmarks have limitations in question design, data sources and evaluation methods. |
| Approach: | They propose a new benchmark covering five core medical areas . it includes 2,996 questions created from real-world electronic health records . |
| Outcome: | The proposed model covers five core medical areas and includes 2,996 questions created from real-world electronic health records and expert-designed clinical scenarios. |
Copied to clipboard
| Challenge: | a new approach to training large language models (LLMs) overlooks task-specific characteristics in tool use, leading to performance bottlenecks. |
| Approach: | They propose a task-feature-based framework that mitigates the effects of suboptimal training data . they use a dataset to train large-scale LLMs and a reward mechanism tailored to error categories . |
| Outcome: | The proposed framework matches or surpasses open- and closed-source LLMs in tool-use performance using only 1,217 training data points. |
Copied to clipboard
| Challenge: | Multi-intent utterances processing remains a persistent challenge due to intricate intent-slot dependencies and semantic ambiguities. |
| Approach: | They propose a label-aware contrastive attention network (LCAN) that integrates label-based attention and contrastive learning strategies to improve semantic understanding and generalization in multi-intent scenarios. |
| Outcome: | The proposed model improves intent recognition and slot filling performance in multi-intent dialogue systems. |
Copied to clipboard
| Challenge: | Existing methods for user modeling cannot exploit useful information in unlabeled data . Existing models only model task-specific user information and do not exploit universal user information encoded in user behaviors. |
| Approach: | They propose to pre-train user models from large-scale unlabeled user behavior data. |
| Outcome: | The proposed method can model relatedness between historical and future behaviors on two real-world datasets. |
Copied to clipboard
| Challenge: | Annotated training data is costly to obtain in many languages . |
| Approach: | They propose a semantic contrastive loss to align parallel sentences that share the same semantics in different languages and a language contrastive gain to leverage parallel sentence pairs to remove language-specific information from non-parallel corpora. |
| Outcome: | The proposed model improves retrieval performance while requiring less computational effort. |
Copied to clipboard
| Challenge: | Existing methods for rationalization use spurious correlations in data to compose rationales and make predictions. |
| Approach: | They propose a method to discover the causal rationales by using a structural causal model. |
| Outcome: | The proposed method is based on the causal theory and validates on three real-world datasets. |
Copied to clipboard
| Challenge: | Existing evaluations of tool learning focus on validation of tools for large language models with expected outcomes, but this focus ignores the complex capabilities required for LLMs to effectively use tools. |
| Approach: | They propose a fine-grained system for evaluation of large language models’ tool learning capabilities in authentic scenarios. |
| Outcome: | The proposed system examines seven real-world scenarios, analyzing five dimensions crucial to LLMs in tool learning: format alignment, intent comprehension, behavior planning, tool selection, and answer organization. |
Copied to clipboard
| Challenge: | Existing datasets are often criticized for their lack of granularity, which can mask deficiencies in basic syntactic elements that humans care about. |
| Approach: | They propose a new program translation metrics that address basic syntax errors . they propose BLUE, CodeBLUE and computation accuracy metrics which address these errors based on a highly interpretable evaluation harness. |
| Outcome: | The proposed model passes the unit tests with a 26.15% pass rate compared to previous models . |
Copied to clipboard
| Challenge: | Reinforcement Learning from Human Feedback (RLHF) relies on complex methodologies like Proximal Policy Optimization (PPO) that require extensive hyper-parameter tuning and pose challenges in sample efficiency and stability. |
| Approach: | They propose an innovative framework that leverages direct preference optimization techniques but extends them by estimating the conditionally optimal policy directly from the model’s responses. |
| Outcome: | The proposed framework matches and exceeds the effectiveness of Proximal Policy Optimization (PPO) in terms of convergence speed and alignment of model responses with human preferences. |
Copied to clipboard
| Challenge: | Using reinforcement learning from human feedback, large language models perform poorly when applied to colloquial subtitle translation tasks. |
| Approach: | They propose an adversarial training framework that iteratively updates the offline reward model and the online LLM to improve training outcomes. |
| Outcome: | The proposed training framework significantly improves upon translation baselines. |
Copied to clipboard
| Challenge: | Existing methods for visual storytelling construct text description independently for each image and roughly concatenate them as a story, which leads to the problem of generating semantically incoherent content. |
| Approach: | They propose a topic description task to detect the global semantic context of an image stream and a story is then constructed with the guidance of the topic description. |
| Outcome: | The proposed framework can generate stories with higher quality compared to state-of-the-art methods on a VIST dataset. |
Copied to clipboard
| Challenge: | Membership inference attacks are a promising tool for auditing training data of LLMs . existing methods rely on the assumption that LLM's assign higher confidence scores to training samples than to non-training ones. |
| Approach: | They propose a membership inference framework that can be robust against adversarial MIAs. |
| Outcome: | The proposed framework can be robust against adversarial MIA methods and AIGT detectors while maintaining the performance of baselines. |
Copied to clipboard
| Challenge: | Recent advances in large language models (LLMs) have led to significant success in using LLMs as agents. |
| Approach: | They propose a cognitive framework that incorporates first-order and second-order perspective transitions into LLMs to enhance their ability to identify and counteract deceptive information. |
| Outcome: | The proposed framework enhances LLMs’ ability to identify and counteract deceptive information without extra fine-tuning and data. |
Copied to clipboard
| Challenge: | Existing methods for sentiment classification focus on learning domain-invariant representations . few of them pay attention to domain-specific information, which should also be informative. |
| Approach: | They propose a method to extract domain specific and invariant representations and train a classifier on each of them. |
| Outcome: | The proposed model can achieve better performance than state-of-the-art methods. |
Copied to clipboard
| Challenge: | Existing personalized news recommendation methods have difficulties in making accurate recommendations to cold-start users. |
| Approach: | They propose to incorporate news popularity information to improve cold-start recommendations . they propose to use a popularity-aware user encoder to eliminate popularity bias . |
| Outcome: | The proposed method improves accuracy and diversity of personalized news recommendation on two real-world datasets. |
Copied to clipboard
| Challenge: | Existing news recommendation methods rank candidate news based on relevance to users’ historical browsed news, but if browsed data is dominated by certain kinds of sentiment, the model may recommend news with the same sentiment. |
| Approach: | They propose a sentiment diversity-aware neural news recommendation approach which can recommend news with more diverse sentiment without performance sacrifices. |
| Outcome: | The proposed approach can improve the sentiment diversity in news recommendation without performance sacrifice. |
Copied to clipboard
| Challenge: | Existing methods for text watermarking ignore strong evidences embedded in low-entropy tokens, causing statistical measures to falsely indicate the absence of a watermark. |
| Approach: | They propose a Bayes' Rule derived watermark Detector which exploits watermark information from every token by leveraging the posterior probability of watermark’s presence. |
| Outcome: | The proposed method achieves 50% and 70% relative improvements over baselines in code generation and math problem-solving tasks. |
Copied to clipboard
| Challenge: | Existing approaches focus on minimizing distances between words in aligned pairs, while suffering from low discriminative capability to distinguish the relative orders between positive and negative candidates. |
| Approach: | They propose a ranking-oriented induction model to learn personalized mapping function for each word. |
| Outcome: | The proposed model can learn personalized mapping function for each word on public datasets including rich-resource and low-resourced languages. |
Copied to clipboard
| Challenge: | Precisely modeling news and users is critical for news recommendation, and capturing the contexts of words and news is important to learn news and user representations. |
| Approach: | They propose a neural news recommendation approach with multi-head self-attention to model the interactions between words and news and use multi-headed self- attention to capture relatedness between the news. |
| Outcome: | The proposed approach can learn representations from news titles by modeling the interactions between words and users and capture relatedness between the news. |
Copied to clipboard
| Challenge: | Existing tagging systems that use sentence-level data are not well understood. |
| Approach: | They propose a larger-context approach to tagging tasks that incorporates contextual information into existing tapping systems. |
| Outcome: | The proposed aggregators improve on four tagging tasks and 13 datasets. |
Copied to clipboard
| Challenge: | Existing work focuses on enabling models to generate natural language chain-of-thought rationales or leverage executable and verifiable code, such as Python. |
| Approach: | They propose a novel training pipeline that integrates sequential P-CoT and N-Co T generation and a subtask hybrid training strategy to facilitate natural language transferability. |
| Outcome: | The proposed training pipeline improves both N-CoT and P-Co T performance over the RL baseline. |
Copied to clipboard
| Challenge: | Current research emphasizes LLMs’ capacity to utilize tools in well-structured environments while overlooking their stability when confronted with the inevitable noise of the real world. |
| Approach: | They propose a multi-level benchmark to evaluate the robustness of large language models in tool learning by establishing five external environments with varying levels of noise. |
| Outcome: | The proposed model outperforms the GPT-4 model in tool learning in three critical phases: tool selection, parameter identification, and content filling. |
Copied to clipboard
| Challenge: | Existing research explores different text features of reply comments on word level and ignores interactions between participants. |
| Approach: | They propose a co-attention mechanism based neural network to capture interactions between participants on argument level to better model dialogical argumentation. |
| Outcome: | The proposed model outperforms state-of-the-art methods on a publicly available dataset showing that it extracts interactive argument pairs from the original post and the reply. |
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 adversarial detection methods require access to training data, which brings noteworthy concerns regarding privacy leakage and generalizability. |
| Approach: | They propose a data-agnostic adversarial detection framework which induces different responses between normal and adversarials to UAPs. |
| Outcome: | The proposed framework achieves competitive detection performance on various text classification tasks, and maintains equivalent time consumption to normal inference. |
Copied to clipboard
| Challenge: | Existing approaches to finding effective predictive signals from financial data are limited by their complexity and low signal-to-noise ratio. |
| Approach: | They propose a framework that combines code-level alpha representation with LLM-driven reasoning and evolutionary search. |
| Outcome: | The proposed framework combines code-level alpha representation with LLM-driven reasoning and evolutionary search. |
Copied to clipboard
| Challenge: | Large Language Models (LLMs) have shown remarkable capabilities in following human instructions and solving NLU tasks. |
| Approach: | They propose to use code style instructions to replace typically natural language instructions to provide more precise instructions and strengthen the robustness of LLMs. |
| Outcome: | The proposed method outperforms natural language models on eight robustness datasets and achieves an improvement of 5.68% in test set accuracy and a reduction of 5.66 points in Attack Success Rate (ASR). |
Copied to clipboard
| Challenge: | Code LLMs lack reproducible data pipelines and training protocols for reproducible advancements in code intelligence. |
| Approach: | They propose a top-tier code LLM that releases model weights and inference code . reproducible data pipelines, rigorous experimental ablation results and training protocols are included . |
| Outcome: | The proposed model achieves comparable performance to leading models and serves as an "open cookbook" reproducible training data, rigorous experimental ablation results, and detailed training protocols are also included in the model. |
Copied to clipboard
| Challenge: | Existing methods for solving math word problems ignore background common-sense knowledge . a novel knowledge-aware sequence-to-tree (KA-S2T) network incorporates external knowledge and global expression information. |
| Approach: | They propose a knowledge-aware sequence-to-tree network that incorporates external knowledge and global expression information into the problem. |
| Outcome: | The proposed model can achieve better performance than previous models on a Math23K dataset. |
Copied to clipboard
| Challenge: | generative AI has created a new way to generate content with humans . varying degrees of human contribution in content generation poses significant challenges for the delineation of originality . |
| Approach: | They propose a framework to measure human contribution in AI-assisted content generation by calculating mutual information between human input and AI-aided output relative to self-information of AI-assist output. |
| Outcome: | The proposed measure discriminates between varying degrees of human contribution across multiple creative domains and is validated in real-world applications. |
Copied to clipboard
| Challenge: | Existing methods that rely on limited demos and out-of-demonstration (OOD) queries fail when faced with out- of-demotion queries. |
| Approach: | They propose a query-aware prompting method that elicits the inherent generalizability of large language models by query-based demo generation. |
| Outcome: | The proposed method outperforms state-of-the-art methods in the OOD setting and two public math benchmarks. |
Copied to clipboard
| Challenge: | Large language models (LLMs) are often customized by fine-tuning for the requirements of different domains. |
| Approach: | They propose a controllable training framework to make undesired behaviors unlearnable during the fine-tuning process. |
| Outcome: | The proposed framework makes undesired behaviors unlearnable during the fine-tuning process while preserving the ability to learn other information. |
Copied to clipboard
| Challenge: | Existing methods for relation extraction use bag labels, which introduce noise, to train the model. |
| Approach: | They propose to use negative training to train a model using complementary labels to separate the noisy data from the training data. |
| Outcome: | The proposed method improves on previous methods on sentence-level evaluation and de-noise effect. |
Copied to clipboard
| Challenge: | Existing studies have incorporated different digital traces to better learn the representations of social media users, limited by overloaded text information and hard-to-collect social network information. |
| Approach: | They propose a Pre-training Architecture for Social Media User Modeling based on Text Graph and combine microblogs to represent social media users based upon the text graph model. |
| Outcome: | The proposed framework can represent users based on text even without social network information on microblogs. |
Copied to clipboard
| Challenge: | Autoregressive models are the de facto choice for sequence generation tasks, but standard approaches treat digits as independent tokens and apply cross-entropy loss, overlooking the coherent structure of numerical sequences. |
| Approach: | They propose a novel approach to entropy loss by extending the Earth Mover’s Distance to preserve ordinal relationships between numerical values and sequence-level to penalize the overall discrepancy between predicted and actual sequences. |
| Outcome: | Extensive experiments show that NTIL improves numerical prediction and integrates effectively with LLMs/MLLMs. |
Copied to clipboard
| Challenge: | ConvLab-2 inherits Convlab's framework but integrates more powerful dialogue models and supports more datasets. |
| Approach: | They present ConvLab-2, an open-source toolkit that enables researchers to build task-oriented dialogue systems with state-of-the-art models and perform an end-to-end evaluation. |
| Outcome: | The new tool inherits ConvLab's framework and extends it by integrating many recently proposed state-of-the-art dialogue models. |
Copied to clipboard
| Challenge: | Existing methods to train a model on a sequence of tasks are not efficient enough to mitigate catastrophic forgetting. |
| Approach: | They propose a parameter-efficient framework that prevents forgetting and enables knowledge transfer between tasks by learning and freezing a pre-trained model. |
| Outcome: | The proposed framework avoids forgetting and enables knowledge transfer between tasks. |
Copied to clipboard
| Challenge: | Existing studies address the problem of translating English data into other languages, but they are limited in form and scale. |
| Approach: | They propose a framework to unify cross-lingual and cross-modal pre-training by using English data. |
| Outcome: | The proposed framework unifies cross-lingual and cross-modal pre-training on different data. |
Copied to clipboard
| Challenge: | Temporal knowledge graphs record entity relations and when they occur in time . previous work fails to address time-related challenges such as time-order issues . paper proposes time-sensitive question answering framework to address these problems . |
| Approach: | They propose a time-sensitive question answering framework that uses temporal KGs to answer natural language questions. |
| Outcome: | The proposed framework outperforms the state-of-the-art on a new benchmark for question answering over temporal knowledge graphs. |
Copied to clipboard
| Challenge: | Named Entity Recognition (NER) models rely on superficial entity patterns for predictions, without considering evidence from the context. |
| Approach: | They propose to de-bias NER datasets by altering entity-context distribution . they also validate the feasibility of the proposed de-bianking techniques . |
| Outcome: | The proposed methods can be applied to different models and improve existing models. |
Copied to clipboard
| Challenge: | Existing work integrates reinforcement learning with compiler feedback to enhance code generation quality but the long code generated by LLMs makes RL exploration ineffective. |
| Approach: | They propose a framework that integrates reinforcement learning and compiler feedback to enhance code generation quality. |
| Outcome: | The proposed framework outperforms state-of-the-art approaches in corresponding benchmarks and integrates reinforcement learning with compiler feedback to improve code generation quality. |
Copied to clipboard
| Challenge: | Entity linking is a fundamental task in Natural Language Processing (NLP), connecting mentions within unstructured contexts to their corresponding entities in a Knowledge Base (KB). |
| Approach: | They propose a dual-encoder framework that can efficiently match mentions to two-encoding frameworks by a global-view. |
| Outcome: | The proposed framework achieves state-of-the-art on several entity linking benchmarks. |
Copied to clipboard
| Challenge: | Named entity recognition (NER) is concerned with the identification of named entities in unstructured text. |
| Approach: | They propose a method for incorporating word lexicon into character representations . experimental results show method can be easily incorporated with pre-trained models . |
| Outcome: | The proposed method achieves 6.15 times faster inference speed and better performance on four benchmark Chinese NER datasets. |
Copied to clipboard
| Challenge: | Existing studies have incorporated contextual information to better learn the representation of political actors for specific tasks. |
| Approach: | They propose to use statements to represent political actors and learn mapping from languages to representations using social networks and behaviors as self-constructed supervision. |
| Outcome: | The proposed model can be generalized to political actors and solve downstream tasks. |
Copied to clipboard
| Challenge: | Modern language models fail to follow human instructions while being faithful . a trade-off exists between instruction following and faithfulness when training LMs . |
| Approach: | They propose a method that relies on Reject-sampling by Self-instruct with Continued Fine-tuning to train LMs to follow human instructions while being faithful. |
| Outcome: | The proposed method outperforms vanilla MTL with high-quality data, but with significantly smaller data. |
Copied to clipboard
| Challenge: | Existing methods to address the "lost-in-the-middle" problem suffer from high latency or suboptimal hand-crafted scaling strategies. |
| Approach: | They propose a layer-specific positional embedding scaling method that assigns distinct scaling factors to each layer. |
| Outcome: | Experiments show that the proposed method mitigates positional attention bias and delivers consistent improvements across multiple long-context benchmarks. |
Copied to clipboard
| Challenge: | Existing studies on human-like behaviors in foundation models do not verify their faithfulness . a simple application of psychological tools cannot faithfully characterize all human-type behaviors . |
| Approach: | They propose a framework to characterize humanoid behaviors in foundation models . they argue that a simple application of psychological tools cannot faithfully characterize all human-like behaviors . |
| Outcome: | The proposed framework assesses the faithfulness of results based on reproducibility, internal consistency, and generalizability. |
Copied to clipboard
| Challenge: | Large language models (LLMs) have implicitly transfer knowledge across languages, but not all languages have such generalization capabilities. |
| Approach: | They propose a meta-learning-based method to learn to align conceptual spaces of different languages to enhance cross-lingual generalization. |
| Outcome: | The proposed method achieves competitive results with state-of-the-art methods and narrows the performance gap between languages. |
Copied to clipboard
| Challenge: | Pretrained sequence-to-sequence (seq2sequ) models have been widely used to solve extractive tasks, where parts of the input are extracted to form the desired output. |
| Approach: | They propose a simple fix to tokenization inconsistency that damages extractive nature of generative models by causing performance drop and hallucination. |
| Outcome: | The proposed model performs better in both in-domain and out-of-domain datasets with a notable average of +1.7 F1 gain when a BART model is trained on SQuAD and evaluated on 8 QA datasets. |
Copied to clipboard
| Challenge: | Large language models (LLMs) acquire substantial world knowledge during pretraining, which is further shaped by post-training techniques such as supervised fine-tuning (SFT). |
| Approach: | They evaluate closed-book question answering (CBQA) performance across five LLMs from the LLaMA-2 and LLama-3 families and examine the impact of supervised fine-tuning on model knowledge. |
| Outcome: | The proposed model performance is 14% worse than models fine-tuned on 1,920 samples and 12% worse on 240 samples. |
Copied to clipboard
| Challenge: | Existing models for large language models lack the ability to calibrate their outputs towards human preference. |
| Approach: | They propose a multi-stage, gradient-free approach to calibrate an LLM-based evaluator toward human preference. |
| Outcome: | The proposed approach improves correlation with expert evaluation on multiple text quality evaluation datasets. |
Copied to clipboard
| Challenge: | Reinforcement Learning (RL) in real-world environments often suffers from ambiguous or incomplete supervision. |
| Approach: | They propose a framework that enhances value modeling for robust RL in LLM post-training by integrating auxiliary losses guided by entropy and perplexity from a frozen language model and variational information bottleneck. |
| Outcome: | The proposed framework outperforms baselines on multi-turn dialogue, math reasoning, and science QA with rule-based and model-based rewards. |
Copied to clipboard
| Challenge: | Large Language Models (LLMs) have impressive capabilities but need for task-specific prompt engineering can hinder their generalization. |
| Approach: | They propose a lightweight and versatile retriever that automatically retrieves prompts for a given zero-shot task input. |
| Outcome: | The proposed model is universally applicable across tasks and models . it mitigates hallucination problem in chatGPT, and it improves even the strongest LLMs. |
Copied to clipboard
| Challenge: | Currently, there are no efficient reinforcement learning (RL) frameworks specifically designed for tool use. |
| Approach: | They propose an automated environment construction pipeline that incorporates scenario decomposition, document generation, function integration, complexity scaling, and localized deployment to enable high-quality training environments without external tools. |
| Outcome: | The proposed framework significantly improves the models’ tool-use performance without degrading their general capabilities. |
Copied to clipboard
| Challenge: | Existing benchmarks focus on simple synthesized queries that do not reflect real-world complexity, thereby offering limited perspectives in evaluating tool utilization. |
| Approach: | They propose a benchmark to evaluate LLMs’ ability in tool utilization within real-world scenarios. |
| Outcome: | The proposed benchmark improves LLMs’ ability in tool utilization within real-world scenarios and eliminates the restriction of pre-defined toolset. |
Copied to clipboard
| Challenge: | Vision–Language Models (VLMs) have demonstrated strong capabilities in tasks that require joint understanding of text and images. |
| Approach: | They propose a strategy that incorporates head-wise attention perturbation via continuous multiplicative noise coupled with a visual-guided loss focused on vision-sensitive text tokens to promote a more balanced attention distribution. |
| Outcome: | The proposed approach outperforms baseline models on three benchmarks and consistently outperformed the baseline model. |
Copied to clipboard
| Challenge: | Existing benchmarks for large language models do not fully evaluate their potential for broad implementation. |
| Approach: | They propose to use a fixed LLM as a user agent to engage with an LLM to collect dialogues first under different tasks. |
| Outcome: | The proposed framework outperforms LLaMA-3-70b-Chat on 18.55% more cases. |
Copied to clipboard
| Challenge: | Existing methods for movie dubbing break phonemes in scripts, resulting in incomplete phoneme pronunciation and poor identity stability. |
| Approach: | They propose a method that switches dubbing learning from frame level to phoneme level . it uses a multimodal style adaptor to learn pronunciation style from audio . |
| Outcome: | The proposed method improves on two benchmarks, V2C and Grid, and is available on github. |
Copied to clipboard
| Challenge: | Experimental results prove that language models can learn from human feedback better, irrespective of sequence length . emergence of length bias often induces the model to favor longer outputs . |
| Approach: | They propose to separate reward modeling from the influence of sequence length by using the Product-of-Experts technique. |
| Outcome: | The proposed approach shows that language models perform better regardless of sequence length . the main expert is focused on understanding human intents, while the biased expert targets the identification and capture of length bias. |
Copied to clipboard
| Challenge: | Experimental results show that the MOS-aware GRM significantly improves fine-grained speech quality discrimination. |
| Approach: | They propose a MOS-aware reward model that incorporates MOS gap into reward function during reinforcement learning. |
| Outcome: | The proposed model significantly improves fine-grained speech quality discrimination. |
Copied to clipboard
| Challenge: | Prompt-based methods have been successfully applied in few-shot learning tasks . however, when applied to token-level labeling tasks, it would be time-consuming to enumerate the template queries over all potential entity spans. |
| Approach: | They propose a method to reformulate NER tasks as LM problems without templates. |
| Outcome: | The proposed method is 30.12 times faster than the template-based method under few-shot settings. |
Copied to clipboard
| Challenge: | Recent years have seen remarkable success in the use of deep neural networks on Chinese word segmentation (CWS) however, the performance of CWS systems has gradually reached a plateau with the rapid development of deep networks. |
| Approach: | They propose a fine-grained evaluation for existing Chinese word segmentation systems that allows us to diagnose the strengths and weaknesses of existing models. |
| Outcome: | The proposed model can diagnose strengths and weaknesses of existing models and alleviate negative transfer problem when doing multi-criteria learning. |
Copied to clipboard
| Challenge: | Existing benchmarks rely on outcome-driven metrics such as profitability and look-ahead bias. |
| Approach: | They propose a diagnostic benchmark for instruction-grounded financial code generation under strict semantic and temporal constraints. |
| Outcome: | The proposed benchmarks show that the models fail under causal, structural, or functional constraints. |
Copied to clipboard
| Challenge: | Conditional random fields (CRF) for label decoding have been a problem for many tasks. |
| Approach: | They propose a two-stage label decoding framework that model long-term label dependencies while being much more computationally efficient. |
| Outcome: | The proposed method outperforms the CRF-based methods and greatly accelerates the inference process. |
Copied to clipboard
| Challenge: | Effective evaluation of multi-hop tool use is critical for analyzing the understanding, reasoning, and function-calling capabilities of large language models. |
| Approach: | They propose a dataset that provides rigorous evaluation of multi-hop tool use. |
| Outcome: | The proposed model achieves 49.04% accuracy across five model families. |
Copied to clipboard
| Challenge: | Existing attention models do not take full advantage of sentiment lexicons, which provide rich sentiment information and play a critical role in sentiment analysis. |
| Approach: | They propose a lexicon-based supervised attention model which allows a neural network to focus on the sentiment content, thus generating sentiment-informative representations. |
| Outcome: | The proposed model outperforms existing models on three large-scale sentiment classification datasets. |
Copied to clipboard
| Challenge: | Multimodal large language models have demonstrated remarkable performance in visual-language tasks, but their authenticity is often compromised by object hallucinations. |
| Approach: | They propose a multi-frequency perturbation method that leverages both low-frequency and high-frequency features of images to perturb visual feature representations and explicitly suppress redundant frequency-domain features during inference. |
| Outcome: | The proposed method significantly mitigates object hallucinations across various model architectures. |
Copied to clipboard
| Challenge: | a new method for generating chart annotations is proposed to improve visual reasoning in multimodal large language models. |
| Approach: | They propose a code-as-intermediary translation method for distilling visual reasoning abilities from LLMs to MLLMs. |
| Outcome: | The proposed method is cost-effective, efficient and scalable. |
Copied to clipboard
| Challenge: | Mandarin Alphabetical Words (MAWs) are a key component of Modern Chinese . they are characterized by unique code-mixing idiosyncrasies influenced by language exchanges . |
| Approach: | They propose to construct a large collection of Mandarin Alphabetic Words from Sina Weibo . they propose to use a web-based technique to identify and validate MAWs . |
| Outcome: | The proposed method identifies 16,207 Mandarin Alphabetic Words (MAWs) using a web-based technique . the results show that the proposed method is useful for linguistic research and inquiries . |
Copied to clipboard
| Challenge: | Existing approaches to enhance sequence labeling models require data heterogeneity and additional modules. |
| Approach: | They propose a dual-stage curriculum learning framework specifically designed for sequence labeling tasks. |
| Outcome: | The proposed model improves training and accelerates training, mitigating the slow training issue of complex models. |
Copied to clipboard
| Challenge: | Multilingual BERT (mBERT) has demonstrated considerable cross-lingual syntactic ability, but it is not well understood what leads to this variation and whether it fairly reflects difference between languages. |
| Approach: | They propose to use multilingual BERT to enable zero-shot cross-lingual transfer of syntactic knowledge between different languages by generating grammatical relations in 24 different languages. |
| Outcome: | The results show that the distance between the distributions of different languages is highly consistent with the syntactic difference in terms of linguistic formalisms. |
Copied to clipboard
| Challenge: | Current methods for instruction generation depend on privileged inputs such as semantic maps, landmark annotations, and panoramic views. |
| Approach: | They propose a task that generates coherent navigation instructions from egocentric visual observations. |
| Outcome: | The proposed task generates coherent navigation instructions from egocentric visual data . the proposed task improves performance over state-of-the-art methods in BLEU-4 and CIDEr scores . |
Copied to clipboard
| Challenge: | Existing methods to augment large-scale task-oriented dialogues rely on annotated data. |
| Approach: | They propose to build a unified dialogue user simulation model by pre-training on publicly available datasets. |
| Outcome: | The proposed model can be tuned on a target domain with few-shot data. |
Copied to clipboard
| Challenge: | Existing knowledge evolution benchmarks are static and fail to capture the evolving nature of LLMs and knowledge. |
| Approach: | They propose an evolving dataset that categorizes information into stable, evolved, and uncharted states. |
| Outcome: | The proposed dataset is auto-updatable and enables evaluation of continuously changing knowledge and newly released LLMs. |
Copied to clipboard
| Challenge: | Existing methods for rumor resolution ignore intrinsic propagation mechanisms of rumors and present poor adaptive ability when unprecedented news emerges. |
| Approach: | They propose to identify triggering posts and exploit their characteristics to facilitate rumor verification. |
| Outcome: | The proposed model and scheme exploits rumor diffusion patterns and linguistic features to facilitate verification. |
Copied to clipboard
| Challenge: | Existing methods for multi-turn self-reflection are limited by the Echo Trap problem . the model is limited by its inherent capabilities and repeats earlier reflections to preserve reward signals . |
| Approach: | They propose a tree-structured extension of GRPO for multi-turn self-reflection which enables more accurate advantage estimation. |
| Outcome: | The proposed method mitigates behavior collapse and improves performance across benchmarks. |
Copied to clipboard
| Challenge: | ConvLab is an open-source multi-domain end-to-end dialog system platform . it allows researchers to quickly set up experiments with reusable components and compare a large set of different approaches in common environments. |
| Approach: | They propose to use an open-source multi-domain end-to-end dialog system platform to train and evaluate dialog bots in common environments. |
| Outcome: | The proposed system enables researchers to quickly set up experiments with reusable components and compare a large set of different approaches in common environments. |
Copied to clipboard
| Challenge: | Existing approaches to textual robustness evaluation focus on slightly modifying the input data, which maintains the original meaning and results in a different prediction. |
| Approach: | They propose a multilingual robustness evaluation toolkit for NLP that integrates universal text transformations, task-specific transformations and adversarial attack. |
| Outcome: | The toolkit includes universal text transformation, task-specific transformation, adversarial attack, subpopulation, and their combinations to provide comprehensive robustness analyses. |
Copied to clipboard
| Challenge: | Existing approaches to pre-training language models rely on verbalizers to translate the predicted vocabulary to task-specific labels. |
| Approach: | They propose a framework that incorporates conceptual knowledge for text classification in the extreme zero-shot setting. |
| Outcome: | The proposed framework outperforms prompt-based approaches on four widely-used datasets for sentiment analysis and topic detection on the same experimental settings. |
Copied to clipboard
| Challenge: | Existing methods for named entity recognition are unsatisfactory for recognizing entities in limited or ambiguous sentence-level contexts. |
| Approach: | They propose a framework to incorporate multi-level contexts for named entity recognition using TagLM as a baseline model and an auxiliary task to mine word-level contextual information. |
| Outcome: | The proposed framework is based on a set of sentence-level contexts and a document-level task to mine word-level contextual information. |
Copied to clipboard
| Challenge: | Existing ABSA test sets cannot be used to distinguish the sentiment of the target aspect from the non-target aspect. |
| Approach: | They propose a simple but effective approach to enrich ABSA test sets by disentangle the confounding sentiments of non-target aspects from the target aspect’s sentiment. |
| Outcome: | The proposed model can distinguish the sentiment of the non-target aspects from the target aspect’s sentiment by using the Aspect Robustness Test Set (ARTS). |
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: | Semantic compositionality (SC) is defined as the phenomenon that the meaning of a complex linguistic unit can be composed of the meanings of its constituents. |
| Approach: | They propose to incorporate sememes into SC models and employ them in learning multiword expressions. |
| Outcome: | The proposed models achieve significant performance boost compared to baseline methods without sememe knowledge. |
Copied to clipboard
| Challenge: | Existing language models are pre-trained and distilled on general corpus like Wikipedia, which has gaps with the news domain and may be suboptimal for news intelligence. |
| Approach: | They propose a method to distill existing language models on Wikipedia to enable efficient news intelligence. |
| Outcome: | The proposed model can be used to build and test a news intelligence application on Wikipedia and Wikipedia. |
Copied to clipboard
| Challenge: | Recent studies show that the Mixture of Experts architecture improves performance of large language models. |
| Approach: | They propose a method to build static experts using LoRA parameters . they propose to use rank-level parameters to build experts based on rank-based parameters based in LoRA module. |
| Outcome: | The proposed method improves task performance across a broader range of tasks. |
Copied to clipboard
| Challenge: | Recent research has focused on smaller, task-specific models enhanced by distilling knowledge from LLMs, but the diversity and quality of negative knowledge remains understudied. |
| Approach: | They propose a quality-guided contrastive rationale distillation framework that aims to enhance reasoning capabilities through contrastive knowledge learning. |
| Outcome: | The proposed method consistently outperforms existing distillation techniques yielding higher-quality rationales. |
Copied to clipboard
| Challenge: | Existing methods to predict performance of large language models are lacking . authors propose a size-dependent mutual information predictor for closed-book question answering accuracy . |
| Approach: | They propose a size-dependent mutual information predictor that integrates knowledge frequency, knowledge specificity, and model size to forecast closed-book question answering accuracy. |
| Outcome: | The proposed method outperforms baseline models and achieves R2 > 0.7 in predicting QA accuracy without additional training. |
Copied to clipboard
| Challenge: | Existing inference services are plagued by privacy concerns, such as sharing sensitive data with service providers. |
| Approach: | They propose a framework for protecting inference privacy by applying random perturbations to clustered representations. |
| Outcome: | The proposed framework protects inference privacy by applying random perturbations to clustered representations. |
Copied to clipboard
| Challenge: | Recent studies have highlighted a tendency among large language models to refuse to answer benign queries. |
| Approach: | They propose a model-agnostic approach to reduce excessive attention to harmful words like ‘kill’ and a method to decode the next-token predictions by contrastive decoding. |
| Outcome: | The proposed approach reduces the refusal rate by 20% while having little impact on safety. |
Copied to clipboard
| Challenge: | Parallel thinking is a promising avenue for scaling test-time compute in Large Language Models . however, coordinating the exploration and aggregation stages remains challenging . |
| Approach: | They propose a parallel thinking framework that explicitly incentivizes coordination between components via end-to-end reinforcement learning. |
| Outcome: | The proposed framework improves accuracy by 6.0% over long chain-of-thought baselines while reducing wall-clock latency by 39.4% under matched token budgets. |
Copied to clipboard
| Challenge: | Existing systems that use memory as an "all-or-nothing" approach to memory usage are often static and rely on experience-following tendencies. |
| Approach: | They propose a framework that allows users to dynamically regulate memory reliance by adding context into the model's prompt. |
| Outcome: | The proposed model outperforms prompting and memory masking strategies in multiple scenarios. |