Papers by Jie Liu
Copied to clipboard
| Challenge: | Continual pre-training is the paradigm where pre-trained language models acquire fresh knowledge and gradually get upgraded. |
| Approach: | They propose to use adapted weights to recycle old PLMs for continual pre-training . they propose to combine initialization and distillation methods to achieve better performance . |
| Outcome: | The proposed method improves the convergence and performance of the upgraded PLM. |
Copied to clipboard
| Challenge: | Large language models (LLMs) have demonstrated remarkable performance, but lack of transparency in their inference logic raises concerns about their trustworthiness. |
| Approach: | They conduct a detailed analysis of the operations of attention heads to understand their in-context learning of LLMs. |
| Outcome: | The proposed analysis of attention heads reveals that they increase the output logits of object tokens and recall objects . the proposed model is a novel approach to understand the in-context learning of large language models. |
Copied to clipboard
| Challenge: | Existing methods for information extraction (IE) focus on training task-specific models, while common knowledge among different IE tasks is not explicitly modeled. |
| Approach: | They propose a regularization-based transfer learning method for IE via an instructed graph decoder which decodes various complex structures into a graph uniformly based on corresponding instructions. |
| Outcome: | The proposed method can learn common knowledge from existing datasets and transfer it to a new dataset with new labels. |
Copied to clipboard
| Challenge: | Knowledge distillation (KD) approaches focus on homogeneous architectures with identical tokenizers, constraining their applicability in cross-architecture scenarios. |
| Approach: | They propose a framework that uses contextual information to enhance sequence alignment precision and dynamically improves vocabulary mapping. |
| Outcome: | The proposed framework shows significant advantages over existing methods for model compression . it can be used across multiple model families and across multiple benchmarks . |
Copied to clipboard
| Challenge: | Existing methods to detect fake news focus on mining lexical and syntactic features. |
| Approach: | They propose a topology imbalance and Relation inauthenticity aware Hierarchical Graph Attention Networks to identify fake news on social media. |
| Outcome: | The proposed method outperforms state-of-the-art methods on real-world datasets. |
Copied to clipboard
| Challenge: | Existing techniques for extending context capabilities in LLMs require additional training procedures and access to datasets with long context (e.g., sequences of 32K tokens). |
| Approach: | They propose a solution to extend context capabilities in Large Language Models by training a single process over a sequence of 4K tokens. |
| Outcome: | The proposed solution significantly reduces the cost of continual-pretraining or fine-tuning over short sequences and improves robustness to diverse relative positions. |
Copied to clipboard
| Challenge: | Experimental results show that pre-trained language model GPT2 can generate better continuations by learning to generate the in the fine-tuning stage. |
| Approach: | They conduct experiments on an English essay dataset using Chinese-GPT2 . they find that the model can generate better continuations by learning to generate the in the fine-tuning stage. |
| Outcome: | The pre-trained language model GPT2 can generate better continuations by learning to generate the in the fine-tuning stage. |
Copied to clipboard
| Challenge: | a comparative analysis of paper (meta-)reviews by large language models (LLMs) aims to identify and distinguish LLMs from human activities . |
| Approach: | They present a comparative analysis to identify and distinguish LLM activities from human activities. |
| Outcome: | The proposed analysis aims to improve recognition of instances when someone implicitly uses LLMs for reviewing activities. |
Copied to clipboard
| Challenge: | Prompting has shown to be sample efficient compared to fine-tuning with pre-trained models. |
| Approach: | They propose a fully automatic prompting method that uses natural language prompts on sequence-to-sequence models and a beam search method to generate a large amount of label sequence candidates. |
| Outcome: | The proposed method significantly outperforms other no-manual-design methods on single label words and generates large amount of label sequence candidates. |
Copied to clipboard
| Challenge: | Large language models (LLMs) have extensive world knowledge, but often generate inaccurate geospatial knowledge. |
| Approach: | They propose a framework for evaluation of large language models to mitigate hallucinations . they use Kahneman-Tversky Optimization to align LLMs with their reality . |
| Outcome: | The proposed evaluation framework uncovers hallucinations in 20 advanced LLMs. |
Copied to clipboard
| Challenge: | Text infilling is an under-explored challenge in the field of text generation. |
| Approach: | They propose an iterative inference algorithm based on gradient search that can be broadly applied to any sequence generative model for text infilling tasks. |
| Outcome: | The proposed method performs well on three different text infilling tasks with different mask ratios and mask strategies compared with five state-of-the-art methods. |
Copied to clipboard
| Challenge: | Existing methods to enhance an LLM's privacy awareness with thousands of samples decrease its fairness awareness. |
| Approach: | They propose a training-free method to Suppress the Privacy and faIrness coupled Neurons (SPIN) which theoretically and empirically decreases the mutual information between fairness and privacy awareness. |
| Outcome: | The proposed method reduces the mutual information between fairness and privacy awareness without compromising general capabilities. |
Copied to clipboard
| Challenge: | Large language models (LLMs) are proving significant potential in healthcare, prompting numerous benchmarks to evaluate their capabilities. |
| Approach: | They propose a framework that deconstructs benchmark development into five stages from design to governance and provides a checklist of 46 medically-tailored criteria. |
| Outcome: | The framework deconstructs benchmark development into five stages from design to governance and provides a comprehensive checklist of 46 medically-tailored criteria. |
Copied to clipboard
| Challenge: | Towards the KV cache efficiency, we propose a new objective that lifts the threshold constraints for robust KV compression. |
| Approach: | They propose a method that adjusts KV cache budgets while preserving full-cache performance. |
| Outcome: | The proposed method can reduce memory consumption while preserving full-cache performance. |
Copied to clipboard
| Challenge: | Existing prototypical networks for named entity recognition suffer from label dependency and tightly distributed prototypes, thus causing misclassifications. |
| Approach: | They propose an Entity-level Prototypical Network enhanced by dispersedly distributed prototypes to build entity-level prototypes and distribute them dispersionally. |
| Outcome: | The proposed system outperforms the previous models on two evaluation tasks and the Few-NERD settings in terms of overall performance. |
Copied to clipboard
| Challenge: | Contract review is labor-intensive, time-consuming, and costly . a benchmark is proposed to detect potential legal conflicts . |
| Approach: | They propose a benchmark for legal provision recommendation and conflict detection for contract auto-reviewing which aims to recommend the legal provisions related to contract clauses and detect possible legal conflicts. |
| Outcome: | The proposed task recommends legal provisions related to contract clauses and detects legal conflicts. |
Copied to clipboard
| Challenge: | OpenWebAgent integrates large language models and large multimodal models to improve web automation. |
| Approach: | They propose to integrate large language models and large multimodal models into an open toolkit to optimize web automation. |
| Outcome: | The open toolkit integrates both large language models (LLMs) and large multimodal models (LMMs) it enables the development of powerful, task-oriented web agents, significantly enhancing user experience and operational efficiency on the web. |
Copied to clipboard
| Challenge: | Typical approaches to training large language models rely on limited contrasting patterns . contrasting data is limited and models are susceptible to harmful response tendencies . |
| Approach: | They propose a framework that integrates contrasting patterns across the prompt, model, and pipeline levels. |
| Outcome: | The proposed framework outperforms existing methods in the comparison of RQ1 and RQ2 . the proposed framework significantly outperformed existing methods, leading to more comprehensive alignment. |
Copied to clipboard
| Challenge: | Large-scale conversational AI agents such as Alexa, Siri, and Google Assistant are becoming increasingly popular in real-world applications to assist users in daily life. |
| Approach: | They propose a unified contextual query rewriting model that unifies QR for friction reduction and contextual carryover . they leverage the text-to-text unified framework which uses independent tasks with weighted loss to account for task importance . |
| Outcome: | The proposed model reduces friction and contextual carryover by using multiple auxiliary tasks. |
Copied to clipboard
| Challenge: | *entity-centric question generation (ECQG) is a task motivated by real-world applications such as topic-specific learning, assisted reading, and fact-checking. |
| Approach: | They propose a PLM-based framework GenCONE with two modules: content focusing and question verification. |
| Outcome: | The proposed framework outperforms baselines and is effective and complementary in generating high-quality questions. |
Copied to clipboard
| Challenge: | Experimental results show that our model significantly outperforms existing multimodal MT and text-only MT. |
| Approach: | They propose a stable diffusion-based imagination network into a multimodal large language model to generate an image for each source sentence. |
| Outcome: | The proposed model outperforms existing multimodal and text-only MT and achieves an average improvement of 14 BLEU points on Multi30K and MSCOCO multimodal MT benchmarks. |
Copied to clipboard
| Challenge: | Existing studies suggest that failures of large language models in social contexts are not due to limited linguistic competence, but to inappropriate recognition. |
| Approach: | They propose a framework that decomposes social adaptation into three orthogonal dimensions and conduct controlled comparisons across multiple Chinese LLMs under implicit and explicit conditions. |
| Outcome: | The proposed framework decomposes social adaptation into three orthogonal dimensions and conducts controlled comparisons across multiple Chinese LLMs under implicit and explicit conditions. |
Copied to clipboard
| Challenge: | Existing approaches attribute hallucinations to a binary conflict between internal knowledge stored in FFNs and the retrieved context. |
| Approach: | They propose a framework which mathematically attributes each next-token probability to seven distinct sources and aggregates source attributions by POS tags to quantify contribution of each model component to the generation of specific linguistic categories within a response. |
| Outcome: | Extensive experiments show that the proposed framework achieves state-of-the-art performance. |
Copied to clipboard
| Challenge: | Recent years have witnessed the prevalent application of pre-trained language models (PLMs) in NLP. From the perspective of parameter space, PLMs provide generic initialization, starting from which high-performance minima could be found. |
| Approach: | They investigate the geometric connections of different minima through the lens of mode connectivity, which measures whether two minima can be connected with a low-loss path. |
| Outcome: | The proposed model can be used to find low-loss paths between two minima, and to understand how their mode connectivity affects their task knowledge. |
Copied to clipboard
| Challenge: | Existing approaches to improve neural machine translation use token-level adaptive training . however, standard models make predictions on condition of previous contexts . |
| Approach: | They propose a target-context-aware metric which can be supplemented by statistical metrics . they propose an adaptive training approach based on token- and sentence-level CBMI . |
| Outcome: | The proposed model outperforms the Transformer baseline and other similar approaches on English-German and Chinese-English tasks. |
Copied to clipboard
| Challenge: | Existing large-scale pre-trained language models are mainly trained from scratch individually, ignoring that many well-taught PLMs are available. |
| Approach: | They propose a pre-training framework called knowledge inheritance and propose auxiliary supervision to efficiently learn larger PLMs. |
| Outcome: | The proposed framework can be used to train large-scale language models with huge parameters and a large dataset can be adapted to domain adaptation and knowledge transfer. |
Copied to clipboard
| Challenge: | Existing datasets exhibit data scarcity and limited coverage of general-domain events. |
| Approach: | They present a MAssive eVENt detection dataset which contains 4,480 Wikipedia documents and 168 event types. |
| Outcome: | The proposed dataset shows that existing methods cannot achieve promising results on the small datasets. |
Copied to clipboard
| Challenge: | Existing datasets for event understanding have limited coverage due to complexity of tasks. |
| Approach: | They propose a dataset that augments MAVEN datasets with event argument annotations . they propose 98,591 events and 290,613 arguments obtained with laborious human annotation . |
| Outcome: | The proposed dataset is the first all-in-one dataset supporting event detection, event argument extraction, and event relation extraction. |
Copied to clipboard
| Challenge: | a number of information extraction tasks require task-specific training. |
| Approach: | They propose a text-to-triple translation framework for information extraction tasks . they propose enabling task-agnostic translation by leveraging latent knowledge of a pre-trained language model . |
| Outcome: | The proposed framework outperforms the existing methods on open information extraction tasks. |
Copied to clipboard
| Challenge: | Existing methods for mapping monaural audio to binaural signals lack flexibility and interactive control needed in complex multi-object user-interactive environments. |
| Approach: | They propose a text-guided audio spatialization framework that utilizes diverse text prompts to evaluate binaural audio models. |
| Outcome: | The proposed framework learns binaural differences guided by 3D spatial location and relative position prompts, enhanced with flipped-channel audio. |
Copied to clipboard
| Challenge: | Rhetoric is a vital element in modern Chinese poetry, and plays an essential role in improving its aesthetics. however, to date, it has not been considered in research on automatic poetry generation. |
| Approach: | They propose a rhetorically controlled encoder-decoder for modern Chinese poetry generation . their model captures various rhetorical patterns in an encoder and incorporates mixtures . |
| Outcome: | The proposed model outperforms state-of-the-art methods in terms of fluency, coherence, meaningfulness, and rhetorical aesthetics. |
Copied to clipboard
| Challenge: | Existing methods to enhance performance of Large language models are limited due to the cost of training data and privacy concerns. |
| Approach: | They propose a method that enhances a finetuned model with its inferior version and adopts contrastive decoding to reduce predicted errors. |
| Outcome: | The proposed method outperforms existing methods in data-scarcity scenarios across three domains and shows that it is more robust and robust. |
Copied to clipboard
| Challenge: | Formal verification typically requires developers to write detailed formal specifications . a formal verification system that generates candidate specifications is costly and error-prone . |
| Approach: | They propose an LLM-driven neuro-symbolic demonstration system that reframes specification writing as constrained structured synthesis. |
| Outcome: | The proposed system reduces hallucinations and produces proof-ready annotations. |
Copied to clipboard
| Challenge: | Large Language Models have shown remarkable potential as autonomous agents, but their effectiveness in knowledge-intensive tasks remains limited by passive knowledge utilization. |
| Approach: | They propose a framework that enables LLM agents to dynamically explore structured knowledge sources through multi-turn interactions. |
| Outcome: | The proposed framework outperforms existing retrieval-augmented approaches on knowledge graph and database tasks while maximizing tool-use behaviors end-to-end. |
Copied to clipboard
| Challenge: | Existing methods for extending the maximum context lengths of language models are lacking a strong baseline for in-context few-shot classification and on more challenging Chain-of-Thought reasoning, such as HotpotQA, deteriorate question miscomprehension and false inference. |
| Approach: | They propose to harness window-wise attention and positional embedding techniques to extend the maximum context lengths of language models. |
| Outcome: | The proposed method is able to extend the maximum context lengths of language models, e.g., 2048 for LLaMA, by harnessing window-wise attention and positional embedding techniques. |
Copied to clipboard
| Challenge: | Existing methods for extracting relational facts from text have been successful . but with explosion of Web text, human knowledge is increasing drastically . |
| Approach: | They propose to improve relation extraction methods to extract relational facts from text . they analyze existing methods and show promising directions towards more powerful RE . |
| Outcome: | The proposed methods can extract relational facts from text, but they are still lacking in the current field. |
Copied to clipboard
| Challenge: | Current language model-driven agents lack mechanisms for effective user participation, which is crucial given the vagueness commonly found in user instructions. |
| Approach: | They propose a benchmark to inspect users’ implicit intentions through explicit queries and a model expert as the upstream in agent design to enhance user-agent interaction. |
| Outcome: | The proposed approach excels at identifying vague user tasks, recovering and summarizing critical missing information, setting precise and necessary agent execution goals, and minimizing redundant tool usage, thus boosting overall efficiency. |
Copied to clipboard
| Challenge: | Existing studies decompose complex tasks into intermediate steps by prompting strategies, such as Chain-of-Thought and its variants. |
| Approach: | They propose to use code comments as natural logic pivot between natural language and code language to boost the code generation ability of code LLMs. |
| Outcome: | The proposed method significantly improves the code pass rate on humanEval and MBPP, while the robustness of the logical comment decoding strategy is higher than the Chain-of-thoughts prompting. |
Copied to clipboard
| Challenge: | Multi-modal Large Language Models (MLLMs) exhibit limited generality and often fall short when compared to specialized models. |
| Approach: | They propose a multi-modal medical agent that picks the most suitable medical tools based on user inputs. |
| Outcome: | The proposed agent performs better than open-source models and the closed-source model, GPT-4o. |
Copied to clipboard
| Challenge: | Existing pretraining frameworks do not perform well for all tasks of three main categories, such as natural language understanding (NLU), unconditional generation, and conditional generation. |
| Approach: | They propose a general language model based on autoregressive blank infilling to address this challenge. |
| Outcome: | The proposed model outperforms BERT, T5, and GPT on a wide range of tasks across NLU, conditional and unconditional generation tasks. |
Copied to clipboard
| Challenge: | Generating high-quality long-form survey articles poses significant challenges to AI Agent systems. |
| Approach: | They propose a hierarchically modular agent system for long-form survey generation . they use atomic models to implement skeleton initialization, digest construction, and skelet refinement . human evaluations demonstrate system surpasses representative baselines . |
| Outcome: | The proposed system surpasses representative baselines in both content depth and length, highlighting the strength of MCP-based modular planning. |
Copied to clipboard
| Challenge: | Existing language models that use discrete representations for unified processing of various modalities are limited to text generation and do not include multimodal output. |
| Approach: | They propose a multimodal language model that utilizes discrete representations for unified processing of various modalities. |
| Outcome: | The proposed model can be trained stably without any alterations to existing models or training paradigms. |
Copied to clipboard
| Challenge: | Large language models (LLMs) have advanced the automation of data science workflows, yet it remains unclear whether they can critically leverage external domain knowledge as human data scientists do in practice. |
| Approach: | They propose a benchmark to evaluate how large language models handle external domain knowledge in tabular prediction tasks. |
| Outcome: | The proposed model evaluates whether it can critically leverage external domain knowledge as human data scientists do in practice. |
Copied to clipboard
| Challenge: | Existing studies focus on partial aspects of knowledge abstraction, concretization, and completion (KACC). |
| Approach: | They propose a unified knowledge graph benchmark to improve existing benchmarks . they collect new datasets that contain larger concept graphs and cross-view links . |
| Outcome: | The proposed benchmark improves existing benchmarks in terms of dataset scale, task coverage, and difficulty. |
Copied to clipboard
| Challenge: | Existing studies have focused on specialized BERT-variants and recent LLMs to reason inconsistencies. |
| Approach: | They propose to incorporate task-specific taxonomy into inferences to facilitate both zero-shot and supervised paradigms. |
| Outcome: | The proposed model outperforms specialized non-LLM and recent LLM models in a number of domains. |
Copied to clipboard
| Challenge: | Existing evaluation frameworks for audio foundation models are heavily reliant on English, making it difficult to objectively assess models’ performance on Chinese. |
| Approach: | They propose a unified framework that supports 10 languages, 14 task categories, 24 models, and 36 benchmarks with one-command evaluation and real-time leaderboards. |
| Outcome: | The proposed framework supports 10 languages, 14 task categories, 24 models, and 36 benchmarks with one-command evaluation and real-time leaderboards. |
Copied to clipboard
| Challenge: | Chinese Search Query Spell Correction is a task designed to identify and correct typographical errors within queries. |
| Approach: | They propose a large-scale benchmark specifically developed for Chinese Query Spell Correction. |
| Outcome: | The proposed benchmark covers a broad range of topics, including formal entities, everyday colloquialisms and idiomatic expressions. |
Copied to clipboard
| Challenge: | Large Language Models (LLMs) exhibit significant but subtle weaknesses, such as mistakes in instruction-following or coding tasks. |
| Approach: | They propose a framework to automatically expose weaknesses in Large Language Models (LLMs) they use three LLM-powered agents to perform comprehensive weakness identification . |
| Outcome: | The proposed framework shows that it is more effective than untargeted data augmentation methods like Self-Instruct to identify weaknesses in LLMs. |
Copied to clipboard
| Challenge: | Low-resource multilingual OCR models struggle with complex script structures and data scarcity. |
| Approach: | They propose a framework for multilingual character recognition that integrates visual and linguistic backbones with a novel glyph-aware interface. |
| Outcome: | The proposed framework improves on high-resolution visual and language backbones with glyph-aware interface. |
Copied to clipboard
| Challenge: | Existing benchmarks for insurance claims adjudication are limited to information retrieval or simple multiple-choice setups. |
| Approach: | They propose a benchmark that provides complete reasoning traces linking factual inputs, relevant policy clauses, and final verdicts. |
| Outcome: | The proposed benchmark shows that models often produce correct decisions but fail to provide precise justifications, highlighting a critical discrepancy between decision accuracy and logical reasoning capabilities. |
Copied to clipboard
| Challenge: | Existing methods of content moderation are infeasible due to over-editing and compromise the advertiser’s original semantic intent. |
| Approach: | They propose a framework to harmonize compliance with original intent preservation that integrates a data-driven framework and a curriculum to enforce compliance while maximizing semantic consistency. |
| Outcome: | The proposed framework outperforms state-of-the-art baselines on industrial datasets and on online A/B testing on industrial video. |
Copied to clipboard
| Challenge: | Existing methods for MAS suffer from high token consumption and inefficiency due to frequent generation and communication among multiple agents. |
| Approach: | They propose a multi-agent system based on large language models that identifies redundant agents and communication across different communication rounds by optimizing the adjacency matrices of the communication graphs and eliminates them to enhance both token efficiency and task performance. |
| Outcome: | The proposed method reduces prompt token consumption and completion token consumption by 18.4% and improves task performance by 1.14. |
Copied to clipboard
| Challenge: | Empirical evaluations conducted on eight benchmark datasets underscore the compelling advantages offered by DiffusionABSA when compared against robust baseline models. |
| Approach: | They propose a diffusion model which extracts aspects step by step and learns a denoising process that progressively restores them in a reverse manner. |
| Outcome: | Empirical evaluations on eight benchmark datasets underscore the compelling advantages offered by DiffusionABSA when compared against robust baseline models. |
Copied to clipboard
| Challenge: | Existing approaches to lifelong model editing apply parameter perturbations to static and dense layers for all instances. |
| Approach: | They propose a hierarchical reinforcement learning framework that identifies the most knowledge-relevant layers for each editing instance. |
| Outcome: | The proposed framework boosts the performance of the competitive RLEdit by 8.48% with perturbing only half of the layers per edit. |
Copied to clipboard
| Challenge: | Existing approaches to speech-to-text generation tasks are limited by the lack of extensive labeled datasets. |
| Approach: | They propose to use interpolation augmentation to construct virtual training samples by transforming inputs and labels to enhance generalization in other domains. |
| Outcome: | The proposed approach significantly improves performance across diverse tasks, architectures, and data scales, offering a promising avenue for more robust S2T systems in resource-constrained settings. |
Copied to clipboard
| Challenge: | Existing algorithms for achieving optimal alignment are mostly unidirectional . a recent study suggests that large language models can be ground with evident preferences . |
| Approach: | They propose to ground large language models with evident preferences . they propose to use controllable preference optimization to specify different objectives . |
| Outcome: | The proposed models can provide responses that match various preferences among the ”3H” desiderata. |
Copied to clipboard
| Challenge: | Long-context inference is crucial for advancing large language models, but its prefill speed remains a bottleneck. |
| Approach: | They propose an efficient long-context inference framework that leverages multi-host approximate attention to enhance prefill speed. |
| Outcome: | The proposed framework achieves speedups of 9.2, 4.2, and 1.6 without any degradation in performance. |
Copied to clipboard
| Challenge: | Existing methods for generating large language models rely on student-generated outputs, which introduce generation errors and misguide the distillation process. |
| Approach: | They propose a multi-granularity semantic revision method for LLM distillation that corrects errors using teacher-generated tokens and re-generates the sequence to minimize errors. |
| Outcome: | The proposed method reduces errors and misguides distillation on student models and improves consistency between teacher and student outputs. |
Copied to clipboard
| Challenge: | Existing methods to extract information from evidence are unable to grasp relational and logical information among the evidence. |
| Approach: | They propose a graph-based evidence aggregating and reasoning framework to integrate evidence from multiple pieces of evidence. |
| Outcome: | The proposed framework achieves significant performance improvements on a large-scale benchmark dataset. |
Copied to clipboard
| Challenge: | Large Language Models (LLMs) are efficient assistants to humans in software development tasks, but they can cause errors during the development process. |
| Approach: | They propose an intention aligned multi-agent framework that ensures that all agents work based on a consensus. |
| Outcome: | The proposed framework reduces errors and improves the quality of generated software code. |
Copied to clipboard
| Challenge: | Existing benchmarks on punchline comprehension suffer from language shortcuts that allow models to rely on text, lack of question diversity, and narrow focus on a specific domain of multimodal content. |
| Approach: | They propose a multimodal punchline comprehension benchmark to assess models' ability to comprehend punchlines. |
| Outcome: | The proposed model surpasses in-context learning and chain-of-thought in punchline comprehension. |
Copied to clipboard
| Challenge: | GUI automation is a key challenge in dynamic environments. |
| Approach: | They propose a training-free GUI agent that integrates two mechanisms to explore trajectories in GUIs. |
| Outcome: | The proposed GUI-explorer shows significant improvements over existing agents. |
Copied to clipboard
| Challenge: | retrieval-augmented generation (RAG) is a powerful tool for NLP applications . but it is challenging to encode large knowledge bases as compact offline structures . |
| Approach: | They propose a coarse-to-fine hierarchical graph inference method that uses random walks to retrieve information from a corpus of documents. |
| Outcome: | The proposed method reduces offline indexing costs and accelerates retrieval. |
Copied to clipboard
| Challenge: | Abstractive summarization models are typically evaluated using test data that is identically distributed as training data. |
| Approach: | They propose a method to detect and remove input noise from documents to be summarized without extra training or auxiliary models. |
| Outcome: | The proposed method recovers a large fraction of the loss in performance, sometimes as large as 11 ROUGE-1 points, without extra training, auxiliary models, or prior knowledge of the type of noise. |
Copied to clipboard
| Challenge: | Existing methods for generating adversarial code examples face challenges such as limted availability of substitute variables and the creation of adversarials with noticeable perturbations. |
| Approach: | They propose a search seed based on historical attacks to find adversarial substitutes . they employ a pre-trained variable name encoder to map the search seed to a continuous vector space . |
| Outcome: | The proposed approach outperforms baseline methods in terms of ASR and QT. |
Copied to clipboard
| Challenge: | Effective evaluation of alignment for emerging Chinese LLMs is still significantly lacking, calling for real-scenario grounded, open-ended, challenging and automatic evaluations tailored for alignment. |
| Approach: | They propose a multi-dimensional benchmark for evaluating LLMs’ alignment in Chinese with 8 main categories, 683 real-scenario rooted queries and corresponding human verified references. |
| Outcome: | The benchmark uses a human-in-the-loop data curation pipeline, 683 real-scenario rooted queries and human verified references. |
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 event argument extraction cannot adequately model the correlation between event arguments and their roles. |
| Approach: | They propose a Bayesian model to jointly extract event arguments using Gibbs sampling . they train two neural networks to model prior distribution and conditional distribution over event arguments . |
| Outcome: | The proposed model can achieve comparable results to existing methods on two widely-used datasets. |
Copied to clipboard
| Challenge: | Existing LT strategies cannot indicate the desired target language on zero-shot translation, i.e., the off-target issue. |
| Approach: | They propose a language converter strategy that embeds the target language into the top encoder layers to mitigate confusion in the encoder and ensures stable language indication for the decoder. |
| Outcome: | The proposed language converter strategy significantly mitigates off-target issue on multiUN, TED, and OPUS-100 datasets. |
Copied to clipboard
| Challenge: | Open large language models (LLMs) with great performance in various tasks are far inferior to commercial models such as ChatGPT and GPT-4 when acting as agents to tackle complex tasks in the real world. |
| Approach: | They propose a method to enhance the agent capabilities of LLMs while maintaining their general abilities. |
| Outcome: | The AgentLM-70B is comparable to GPT-3.5-turbo on unseen agent tasks, demonstrating generalized agent capabilities. |
Copied to clipboard
| Challenge: | Video Content Discovery (VCD) is to identify specific videos defined by a pre-specified text policy. |
| Approach: | They propose a Vision-Language Large Model-driven video content discovery system called VENUS to solve these problems. |
| Outcome: | The proposed system generates high-quality, VCD-specific data for model training and extends it to support it better. |
Copied to clipboard
| Challenge: | Existing benchmarks for agentic programming in long-horizon command-line interface tasks are limited by short task horizons, data contamination from GitHub scraping, and a lack of fine-grained evaluation metrics. |
| Approach: | They propose a benchmark to evaluate agentic capabilities across long-horizon command-line interface tasks. |
| Outcome: | The proposed benchmarks cover four engineering categories: from scratch, feature addition, bug fixing, and refactoring. |
Copied to clipboard
| Challenge: | Existing studies use synthetic speech to train and evaluate SpeechRE models, hindering their development . modality gap issue limits performance of existing models, limiting future researches . |
| Approach: | They propose to use speech data to train and evaluate SpeechRE models by using real speech . they propose to train a cross-modal alignment model to bridge the modality gap . |
| Outcome: | The proposed model can train to bridge the modality gap between speech encoder and text decoder . the proposed model is based on two real SpeechRE datasets . |
Copied to clipboard
| Challenge: | Existing approaches to constraint-aware planning fail to enhance the model’s intrinsic focus on constraints. |
| Approach: | They propose a constraint-aware reinforcement learning framework that encourages constraint focus and penalizes neglect of LLMs. |
| Outcome: | The proposed framework outperforms existing frameworks and state-of-the-art reasoning models in a number of real-world applications. |
Copied to clipboard
| Challenge: | Large Language Models (LLMs) demonstrate their utility in character simulations, but they pose a risk of generating unsafe content. |
| Approach: | They propose a method which dynamically adjusts safety-utility preferences based on the degree of risk coupling and guides the model to generate responses biased toward utility or safety. |
| Outcome: | The proposed method improves safety metrics while maintaining utility. |
Copied to clipboard
| Challenge: | Existing test-time methods are limited in specialized or novel domains where supervision is prohibitively expensive or unavailable. |
| Approach: | They propose a framework that augments training stream from unlabeled test queries. |
| Outcome: | Extensive experiments show TTVS outperforms state-of-the-art RL-based techniques on unlabeled test-time data. |
Copied to clipboard
| Challenge: | Existing approaches to generate accurate and different-appearing paraphrases require massive parallel samples for training. |
| Approach: | They propose a novel approach that accomplishes Unsupervised Paraphrasing by Simulated Annealing by performing local editing. |
| Outcome: | The proposed approach outperforms existing models in automatic and human evaluations on Quora, Wikianswers, MSCOCO, and Twitter. |
Copied to clipboard
| Challenge: | Existing methods for tuning pre-trained language models ignore the running cost and only optimize the terminal cost. |
| Approach: | They propose to use stochastic bridges to regularize intermediate states and use regularization as running cost of PETs. |
| Outcome: | The proposed methods can be used to tune large pre-trained language models . they can be compared to full-parameter fine-tuning by tuning a small number of parameters . |
Copied to clipboard
| Challenge: | Existing unsupervised paraphrase generation methods require large-scale, manually annotated paraphrase datasets, which are labor-intensive to build. |
| Approach: | They propose a self-supervised pseudo-data construction method that generates diverse pseudo-paraphrases in distinct surface structures for a given sentence. |
| Outcome: | The proposed method generates diverse pseudo-paraphrases in distinct surface structures for a given sentence. |
Copied to clipboard
| Challenge: | Neural machine translation models are trained to maximize the likelihood of the next token given previous golden tokens as inputs, but at the inference stage, golden token is unavailable. |
| Approach: | They propose a scheduled sampling method that randomly replaces groundtruth tokens with predicted ones during training, ignoring real-time model competence. |
| Outcome: | The proposed method outperforms the Transformer and vanilla scheduled sampling on large-scale translations. |
Copied to clipboard
| Challenge: | Existing methods for concept expansion in MOOCs are inefficient because of the diversity of MOOC courses and rapid updates. |
| Approach: | They propose an end-to-end hierarchical reinforcement learning (HRL) model for concept expansion in MOOCs that employs a two-level mechanism of seed selection and concept expansion. |
| Outcome: | The proposed model improves on nine real MOOC datasets and maintains competitive performance under different settings. |
Copied to clipboard
| Challenge: | Neural Machine Translation models are based on partial translation and a language model that predicts the next token based only on partial. |
| Approach: | They propose a Margin-based Token-level Objective and a Sentence-level Goal to maximize the Margin . they propose to model the next token based on partial translation . |
| Outcome: | The proposed approach improves translation adequacy and fluency on English-to-German, Chinese-to English and French translation tasks. |
Copied to clipboard
| Challenge: | Existing studies focus on pre-trained LLMs to better understand and improve their trustworthiness. |
| Approach: | They apply linear probing to LLMs to explore five key dimensions of trustworthiness: reliability, privacy, toxicity, fairness, and robustness. |
| Outcome: | The proposed model can distinguish concepts in each trustworthiness dimension, suggesting that it can be trained in early pre-training. |
Copied to clipboard
| Challenge: | Existing datasets for dialogue summarization are limited to their small sizes and are built from a narrow domain. |
| Approach: | They propose a large-scale media interview dataset consisting of 463.6K transcripts with abstractive summaries. |
| Outcome: | The proposed dataset is larger and contains multi-party conversations from multiple domains. |
Copied to clipboard
| Challenge: | Existing benchmarks focus on isolated abilities, lacking a holistic framework for assessing LLM capabilities. |
| Approach: | They propose a Cognition-Domain-Task framework which measures a model’s capabilities across three dimensions. |
| Outcome: | The proposed framework improves performance on dataset evaluation and data selection, while achieving higher scores on general and specific benchmarks. |
Copied to clipboard
| Challenge: | Existing graph embedding methods overlook streaming nature of incoming data in real-world applications. |
| Approach: | They propose a disentangle-based continual graph representation learning framework inspired by the human’s ability to learn procedural knowledge. |
| Outcome: | The proposed framework outperforms state-of-the-art continual graph representation learning framework and alleviate catastrophic forgetting problem. |
Copied to clipboard
| Challenge: | Recent research shows strong empirical advantages of dense retrieval in various information access scenarios, such as openQA. |
| Approach: | They propose a method which accumulates momentum negatives from past iterations and approximates future iteration with lookahead negatives as "teleportations" on web search and OpenQA, ANCE-Tele outperforms previous state-of-the-art systems of similar size and eliminates the dependency on sparse retrieval negatives. |
| Outcome: | The proposed method outperforms previous state-of-the-art systems on web search and OpenQA and is competitive among systems with significantly more parameters. |
Copied to clipboard
| Challenge: | Existing studies on pre-trained Transformers show that they learn fine-grained neuron functions. |
| Approach: | They examine the presence of modularity in pre-trained Transformers . they focus on Mixture-of-Experts, a promising candidate for modularity . |
| Outcome: | The proposed structure stabilizes at the early stage, which is faster than neuron stabilization. |
Copied to clipboard
| Challenge: | a test suite to evaluate commonsense reasoning capability of neural machine translation is presented . language models pretrained on large-scale corpora achieve a commonsensing accuracy of lower than 72% on target translations of this test suite. |
| Approach: | They propose a test suite to evaluate the commonsense reasoning capability of neural machine translation. |
| Outcome: | The proposed test suite performs poorly on commonsense reasoning of the three ambiguity types in terms of reasoning accuracy and reasoning consistency. |
Copied to clipboard
| Challenge: | Existing methods for event prediction are incomplete and noisy. |
| Approach: | They propose to use news-related event schemas to extract newsworthy events . they build a demo website and include a video demonstrating the framework . |
| Outcome: | The proposed framework can be applied to a wide variety of newsworthy scenarios. |
Copied to clipboard
| Challenge: | Existing studies have shown that pre-trained langauge models tend to memorize and regenerate segments of their pre-training corpus when prompted appropriately. |
| Approach: | They conduct the first comprehensive analysis to explore language models’ memorization during fine-tuning across tasks. |
| Outcome: | The proposed analysis shows that memorization presents a strong disparity among different fine-tuning tasks. |
Copied to clipboard
| Challenge: | Large language models (LLMs) traditionally represent text as sequences of discrete tokens . a long-context scaling problem requires processing more tokens more efficiently . |
| Approach: | They propose a framework that renders long texts into compact visual pages and processes them with a vision-language model. |
| Outcome: | The proposed framework renders long texts into compact visual pages and processes them with a vision-language model. |
Copied to clipboard
| Challenge: | Retrieval-augmented generation (RAG) is a powerful technique to facilitate language model generation with proprietary and private data, where data privacy is . a privacy issue that is currently under-explored, is posed by RAG. |
| Approach: | They propose to use retrieval-augmented generation (RAG) to facilitate language model generation with proprietary and private data where data privacy is a pivotal concern. |
| Outcome: | The proposed attack methods demonstrate that RAG can mitigate the old risks, i.e., leakage of the LLMs’ training data. |
Copied to clipboard
| Challenge: | Existing EE methods do not model event characteristics from large unsupervised data. |
| Approach: | They propose a contrastive pre-training framework for event extraction to better learn event knowledge from large unsupervised data and their semantic structures. |
| Outcome: | The proposed framework improves on ACE 2005 and MAVEN datasets on event extraction tasks. |
Copied to clipboard
| Challenge: | Existing methods for assessing review quality are unscalable across domains and fail to adapt to evolving content patterns. |
| Approach: | They propose an LLM-based agent framework that automates the discovery of interpretable features. |
| Outcome: | The proposed framework improves on a large-scale online platform with a billion-level user base. |
Copied to clipboard
| Challenge: | Recent Large Reasoning Models (LRMs) excel at complex reasoning tasks but often suffer from overthinking. |
| Approach: | They propose a two-stage fine-tuning strategy that progressively inspires LRMs’ difficulty cognition and redundancy cognition of LRM. |
| Outcome: | The proposed model significantly reduces inference costs by over 70% on easy tasks and 40% on complex ones without compromising performance. |
Copied to clipboard
| Challenge: | Pretrained language models (PLMs) provide strong semantic representations but are costly and opaque. |
| Approach: | They propose a framework that transfers pretrained language models into symbolic form and integrates them into symbolic models. |
| Outcome: | The proposed framework improves interpretability and accuracy across multiple text classification tasks while remaining fully symbolic and efficient. |
Copied to clipboard
| Challenge: | Large language models (LLMs) have shown excellent mastering of human language but struggle in real-world applications that require mathematical problem-solving. |
| Approach: | They propose a pipeline to train a general Math-Critique model from the LLM itself to provide feedback signals and employ rejective fine-tuning and direct preference optimization over the Llm's own generations for data collection. |
| Outcome: | The proposed pipeline outperforms existing LLMs that could be two times larger. |
Copied to clipboard
| Challenge: | Large Language Models (LLMs) have demonstrated notable capabilities across various tasks, showcasing complex problem-solving abilities. |
| Approach: | They propose a benchmark to evaluate the rule-based logical reasoning capabilities of Large Language Models (LLMs) they create simulated scenarios in which models execute or plan operations to achieve specific outcomes. |
| Outcome: | The proposed benchmark evaluates the performance of large language models on a variety of scenarios with varying difficulty levels. |
Copied to clipboard
| Challenge: | Low-Rank Adaptation (LoRA) for large language models has been successful in various domains. |
| Approach: | They propose to perform low-rank updates within clustered parameter subspaces . they group rows/columns of update matrix into locally coherent, uncorrelated subspace blocks . |
| Outcome: | Empirical results show that low-rank Adaptation (LoRA) is better than global adaptations in various domains. |
Copied to clipboard
| Challenge: | Existing knowledge editing methods retain outdated responses for reasoning questions . naively retraining LLMs can be computationally intensive and can lead to catastrophic forgetting . |
| Approach: | They propose a simple yet effective decoding strategy to enhance edited models on reasoning questions. |
| Outcome: | The proposed method outDates ISsue aware deCOding (DISCO) to improve models on reasoning questions. |
Copied to clipboard
| Challenge: | Existing methods for hierarchical text classification are limited and lack holistic structural information. |
| Approach: | They propose a hierarchy-aware global model with two variants that learn hierarchy-based label embeddings through an encoder and conduct inductive fusion of label-alike text features. |
| Outcome: | The proposed model improves on three benchmark datasets. |
Copied to clipboard
| Challenge: | Currently, studies on bias and fairness in natural language processing focus on a single language and/or across few attributes (e.g. gender, race). However, biases can manifest differently across languages for individual attributes. |
| Approach: | They adapt existing sentiment bias templates in English to Italian, Chinese, Hebrew, and Spanish for race, religion, nationality, and gender. |
| Outcome: | The proposed model favors groups that are dominant in each language's culture, indicating bias amplification, after multilingual finetuning. |
Copied to clipboard
| Challenge: | Generative commonsense reasoning requires models to synthesize coherent narratives that satisfy lexical constraints and commonsensical logic. |
| Approach: | They propose a framework that allows for deep semantic diversity rather than surface-level lexical variation. |
| Outcome: | The proposed framework achieves over 10% improvement in overall accuracy on NoRa and SPICE score on CommonGen-Lite. |
Copied to clipboard
| Challenge: | Recent research shows a weak correlation between n-gram-based metrics and human evaluations in machine translation tasks. |
| Approach: | They propose to use multiple references generated by LLMs to improve alignment between automatic metrics and human evaluations. |
| Outcome: | The proposed approach improves the alignment between automatic metrics and human evaluations on the WMT22 benchmark with 4 languages and achieves a maximum accuracy gain of 9.5%. |
Copied to clipboard
| Challenge: | Existing corpora with unconventional entities serving as event arguments lack rich multi-events and shared arguments. |
| Approach: | They develop an open event template that includes 21 event argument roles and an open corpus supporting open event extraction. |
| Outcome: | The proposed corpus includes 17,469 events, 44,221 arguments, 3,644 complex arguments, and 5,898 shared arguments. |
Copied to clipboard
| Challenge: | a framework that leverages the visual-language model to select key knowledge retrieved by DPR and answer questions improves performance of the baseline on the open-domain Knowledge-based VQA benchmark, OK-VQA. |
| Approach: | They propose a framework that leverages visual-language models to retrieve related knowledge . they use dense passage retrieval to retrieve knowledge related to visual-linguistics . |
| Outcome: | The proposed framework significantly improves the baseline on the open-domain Knowledge-based VQA benchmark, OK-VQA. |
Copied to clipboard
| Challenge: | Recent years, pre-trained language models (PLMs) have achieved promising results on various NLP tasks. |
| Approach: | They propose an open-source toolkit for big model inference and tuning which can support big model tuning at extremely low computation cost. |
| Outcome: | The proposed toolkit can support big model inference and tuning at extremely low computation cost. |
Copied to clipboard
| Challenge: | Massive open online courses (MOOCs) are a popular educational platform for advanced research. |
| Approach: | They propose to use MOOCCube to build a large-scale data repository of over 700 MOOC courses, 100k concepts, 8 million student behaviors with an external resource. |
| Outcome: | The proposed datasets show that they can facilitate research in MOOCs. |
Copied to clipboard
| Challenge: | Existing approaches to remove copyrighted and privacy-sensitive data from Large Language Models (LLMs) have been proposed to remove specific data from LLMs without requiring full retraining. |
| Approach: | They propose a general framework that enhances the utility of fine-tuning-based methods by distinguishing target data and suppressing related generations. |
| Outcome: | The proposed framework improves the unlearning and utility of fine-tuning-based methods by distinguishing the target data and suppressing related generations. |
Copied to clipboard
| Challenge: | Recent approaches to language model alignment assume homogeneous human preferences, but actual human preferences vary widely and are hard to satisfy with a single language model. |
| Approach: | They propose an RL-free extension of Direct Preference Optimization (DPO) that folds language modeling directly into reward modeling and trains language models as collective reward models that combine all objectives with specific weights. |
| Outcome: | The proposed method matches or outperforms existing methods in safety alignment and long-form question answering. |
Copied to clipboard
| Challenge: | Few-shot domain adaptation and NOTA detection are two real-world challenges for few-shot relation classification models. |
| Approach: | They propose a task to investigate two aspects of few-shot relation classification models . they build upon the FewRel dataset by adding a new test set in a different domain . |
| Outcome: | The proposed task can evaluate few-shot domain adaptation and few- shot none-of-the-above detection on a new domain and NOTA relation choice. |
Copied to clipboard
| Challenge: | Large language models are often not well aligned with human intents, which requires additional training. |
| Approach: | They propose to use Black-Box Prompt Optimization (BPO) to perform alignments on large language models that are not well aligned with human intents. |
| Outcome: | The proposed model outperforms existing models and is model-agnostic. |
Copied to clipboard
| Challenge: | Existing routers generalize poorly in cold-start scenarios where in-domain training data is unavailable. |
| Approach: | They propose a task-type–aware router approach that models query-conditioned cost and performance via latent task-like variables with prior regularization derived from the synthesized task taxonomy. |
| Outcome: | The proposed framework improves performance and cost under cold-start and in-domain settings and enables efficient routing. |
Copied to clipboard
| Challenge: | Speculative sampling is an efficient way to accelerate the auto-regressive generation process of large language models. |
| Approach: | They propose a frequency-ranked speculative sampling framework that optimizes draft candidate selection through vocabulary space compression. |
| Outcome: | Experiments show that FR-Spec reduces LM Head computation overhead by 75% while ensuring the equivalence of the final output distribution. |
Copied to clipboard
| Challenge: | Existing methods for automatic essay scoring fail to learn trait representations and ignore correlations between trait scores. |
| Approach: | They propose a multi-trait essay scoring method based on Trait-Aware Mix-of-Experts Representation Learning. |
| Outcome: | The proposed method improves on existing methods and improves in computational efficiency. |
Copied to clipboard
| Challenge: | Existing datasets only cover limited relation types at once, which prevents models from taking full advantage of relation interactions. |
| Approach: | They construct a large-scale human-annotated ERE dataset with improved annotation schemes to address these drawbacks. |
| Outcome: | The proposed dataset is larger than existing datasets of all the ERE tasks by at least an order of magnitude. |
Copied to clipboard
| Challenge: | Existing research lacks systematic analysis of the applicability and methodology of cross-modal skill injection. |
| Approach: | They investigate the applicability and methodology of cross-modal skill injection by integrating a domain-expert LLM into a VLM. |
| Outcome: | The proposed method enables transfer of domain-specific expertise from Large Language Models (LLMs) to VLMs without incurring additional training data requirements or significant computational overhead. |
Copied to clipboard
| Challenge: | Existing approaches to multi-hop question answering focus on generating simple questions and neglecting the integration of essential knowledge, such as relevant sentences within documents. |
| Approach: | They propose a framework to expand the diversity of generated multi-hop questions by sampling varied knowledge compositions within a given context. |
| Outcome: | The proposed framework improves the overall accuracy of knowledge composition selection by 3.9% on hotpotQA and 2WikiMultihopQA datasets. |
Copied to clipboard
| Challenge: | Large-scale conversational AI agents such as Alexa, Siri and Google Assistant help millions of users to perform a lot of tasks. |
| Approach: | They propose a Constrained Generation Framework for query rewriting at global and personalized levels. |
| Outcome: | The proposed framework significantly boosts the query rewriting performance. |
Copied to clipboard
| Challenge: | Recent work has shown that feed-forward networks (FFNs) in pre-trained Transformers are a key component, storing various linguistic and factual knowledge. |
| Approach: | They propose to convert a model into its MoE version with the same parameters and build expert routers to decide which experts will be used for each input. |
| Outcome: | The proposed model can use 10% to 30% of FFN parameters while maintaining over 95% original performance. |
Copied to clipboard
| Challenge: | Despite LLMs' impressive capabilities in musical knowledge, music reasoning remains an unsolved task. |
| Approach: | They propose an open-source large language model (LLM) that integrates intrinsic musical abilities into LLaMA2 and GPT-3.5. |
| Outcome: | The proposed model can understand and generate music with a pure text tokenizer without external multi-modal neural structures or tokenizers. |
Copied to clipboard
| Challenge: | Existing LoRA selection methods rely on a few task samples, making it difficult to capture full scope of task-relevant information. |
| Approach: | They propose a framework that selects appropriate LoRA modules and aggregates them using a convolutional LoRA aggregator. |
| Outcome: | The proposed framework bridges the knowledge gap between selected modules and target task . it ensures comprehensive coverage of task-relevant LoRA modules . |
Copied to clipboard
| Challenge: | Existing work on lifelong learning requires incremental memory space to learn a model . existing work on experience replay or elastic weighted consolidation requires incremental space . |
| Approach: | They propose a framework that leverages a recall optimization mechanism to memorize parameters of previous tasks via regularization and a domain drift estimation algorithm to compensate the drift between different domains in the embedding space. |
| Outcome: | The proposed framework outperforms SOTA models on paraphrase and dialog response generation tasks. |
Copied to clipboard
| Challenge: | Existing methods to verify factuality of claims do not provide sufficient evidence for explainable fact-checking systems. |
| Approach: | They propose a method to automatically retrieve and summarize evidence from the Web and a novel multilingual explainable fact-checking dataset on the Russia-Ukraine conflict in 2022. |
| Outcome: | The proposed method can retrieve and summarize evidence from the Web and generate explanations in 16 languages. |
Copied to clipboard
| Challenge: | Existing evaluation methods overlook the distinction between factoid and non-factoidic questions. |
| Approach: | They propose a method that distinguishes open-ended questions and ranks candidate answers . they propose QA requires longer answer statements and nuanced reasoning processes . |
| Outcome: | The proposed method better aligns with human annotations and offers more interpretable results. |
Copied to clipboard
| Challenge: | LLaVA-7B demonstrated a decline in safety alignment ability on multi-modal inputs compared to its LLM backbone. |
| Approach: | They propose a method to recover alignment ability from LLM backbone while preserving functional capabilities of VLMs. |
| Outcome: | The proposed framework recovers alignment ability that is inherent in the LLM backbone with minimal impact on fluency and linguistic capabilities of pre-trained VLMs. |
Copied to clipboard
| Challenge: | Existing systems that generate ads manually are not effective in generating ad copy and generating millions of ads for large businesses. |
| Approach: | They propose a system that generates fluent ads from advertiser’s web pages in an abstractive fashion and solves practical issues such as factuality and inference speed. |
| Outcome: | The proposed system generates fluent ads from advertiser’s web pages in an abstractive fashion and solves practical issues such as factuality and inference speed. |
Copied to clipboard
| Challenge: | Existing models that describe concepts in everyday situations are difficult to summarize in a single sentence. |
| Approach: | They propose DimonGen, which generates sentences describing concept relationships in everyday scenarios. |
| Outcome: | The proposed model outperforms baseline models in terms of quality and diversity of generated sentences. |
Copied to clipboard
| Challenge: | Existing tuning methods for medical AI models are monologue-based . existing benchmarks are based on licensing exams or research articles . |
| Approach: | They propose a benchmark to expose limitations of monologue-based tuning for medical AI models . they use a large dialogue dataset to capture stepwise diagnostic reasoning . |
| Outcome: | The proposed model outperforms monologue-tuned models on a medical question answering task and improves accuracy on standard medical QA benchmarks. |
Copied to clipboard
| Challenge: | Neural information retrieval models have shown advanced results in many ranking scenarios where massive relevance labels or clickthrough data are available. |
| Approach: | They propose a domain adaptive learning method that generalizes Neu-IR models from label-rich source domains to few-shot target domains. |
| Outcome: | The proposed method improves the few-shot ranking accuracy of Neu-IR models on three TREC benchmarks in the web, news, and biomedical domains. |
Copied to clipboard
| Challenge: | Pre-trained language models (PLMs) can achieve comparable performance to full-parameter fine-tuning by tuning a few soft prompts, but require much more training time than fine-timing. |
| Approach: | They empirically investigate the transferability of soft prompts across different downstream tasks and PLMs to determine what decides prompt transferability. |
| Outcome: | The proposed method can achieve comparable performance to full-parameter fine-tuning by tuning a few soft prompts, but requires much more training time than fine-timing. |
Copied to clipboard
| Challenge: | Large Language Models (LLMs) have advanced machine translation (MT) a meta-evaluation dataset focused on non-literal translations is lacking . experimental results show the inaccuracies of traditional MT metrics and the limitations of LLM-as-a-Judge. |
| Approach: | They propose a meta-evaluation framework that leverages sub-agents to evaluate machine translation metrics. |
| Outcome: | The proposed framework improves on the knowledge cutoff and score inconsistency problem. |
Copied to clipboard
| Challenge: | Recent studies have highlighted the potential of Large Language Models (LLMs) as zero-shot relevance rankers. |
| Approach: | They propose to use a ranking loss to transfer ranking knowledge from LLMs to smaller models like BERT. |
| Outcome: | The proposed model has been successfully integrated into a commercial web search engine as of February 2024. |
Copied to clipboard
| Challenge: | Existing knowledge injection methods are not suitable for enhancing pre-trained language models with external knowledge bases. |
| Approach: | They propose a plug-and-play knowledge injection method where knowledge bases are injected into frozen existing downstream models by a knowledge plugin. |
| Outcome: | The proposed method improves the performance of knowledge injection on knowledge-driven tasks while keeping model parameters frozen. |
Copied to clipboard
| Challenge: | Recent studies have shown that biased samples can be brittle for VQA models . however, the improvements on OOD data severely sacrifice the performance on the in-distribution (ID) data. |
| Approach: | They propose a contrastive learning approach that exploits biased samples for unbiased information that contributes to reasoning. |
| Outcome: | The proposed method achieves competitive performance on the OOD dataset while maintaining robustness on the ID dataset. |
Copied to clipboard
| Challenge: | Existing approaches to grounding large language models in external knowledge are constrained by a decoupled architecture: retrieval and reasoning operate as separate stages, with retrieved text merely prepended as passive context. |
| Approach: | They propose an end-to-end Neuralized RAG framework that unifies knowledge retrieval and fusion through Hyper-Neurons. |
| Outcome: | Extensive experiments across multiple datasets and LLMs demonstrate NeuRAG’s strong and consistent performance as a promising novel RAG paradigm. |
Copied to clipboard
| Challenge: | Existing studies on Android agents lack systematic research on open-source and closed-source models. |
| Approach: | They propose a framework for Android agents that includes an operation environment and a reproducible benchmark. |
| Outcome: | The proposed framework lifts the success rate of open-source LLMs and LMMs from 4.59% to 21.50% for LLM and 1.93% to 13.28% for LMM. |
Copied to clipboard
| Challenge: | Recent years have witnessed remarkable advancements in large language models (LLMs) many researchers argue that LLMs may not * Equal contribution. |
| Approach: | They propose a task that summarises the memorization issue by using grid inputs that abstractly describe physical phenomena. |
| Outcome: | The proposed task alleviates the memorization issue by using grid-format inputs that abstractly describe physical phenomena. |
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: | Large Multimodal Models (LMMs) can process text, images, and audio, but they introduce privacy vulnerabilities. |
| Approach: | They propose a compositional structured prompt attack to exploit MRAG privacy vulnerabilities . they show that LMMs can generate outputs resembling retrieved content . |
| Outcome: | The proposed approach generates outputs resembling retrieved content and exposes sensitive information. |
Copied to clipboard
| Challenge: | Existing methods to detect LLM-generated content use simple hashes of precedent tokens to partition vocabulary. |
| Approach: | They propose a semantics-based watermark framework to enhance the robustness against paraphrase. |
| Outcome: | The proposed framework is robust under different paraphrases and the semantic meaning of the sentences will be likely preserved under paraphrase. |
Copied to clipboard
| Challenge: | et al., 2013) show that dialog policy learning is an important component of the task-oriented dialogue system. |
| Approach: | They propose a framework that integrates curriculum learning and policy optimization . they propose to train dialog agents from easy dialogues to complex ones . |
| Outcome: | The proposed framework outperforms the state-of-the-art model on multi-task dialogues. |
Copied to clipboard
| Challenge: | Multi-task benchmarks focus on a range of Natural Language Understanding (NLU) tasks without considering the Natural Language Generation (NLG) models. |
| Approach: | They propose a multi-task benchmark for evaluating the generalization capabilities of NLG models across eight language generation tasks. |
| Outcome: | The proposed benchmarks are based on GLUE and Su-perGLUE for English and several other languages. |
Copied to clipboard
| Challenge: | Existing studies focus on aspect-opinion relation detection, but neglect to recognize the relations between aspects and opinion expressions. |
| Approach: | They propose a Synchronous Double-channel Recurrent Network to deal with AOPE task . they propose an opinion entity extraction unit, a relation detection unit, and a synchronization unit . |
| Outcome: | The proposed system achieves state-of-the-art in opinion entity extraction . it is based on three datasets based upon SemEval 2014 and 2015 benchmarks . |
Copied to clipboard
| Challenge: | Parameter-shared pre-trained language models (PLMs) have emerged as a successful approach in resource-constrained environments. |
| Approach: | They propose a method to enhance the inference efficiency of parameter-shared PLMs by pre-training models that can achieve even greater acceleration. |
| Outcome: | The proposed method improves inference efficiency on autoregressive and autoencoding models. |
Copied to clipboard
| Challenge: | Existing models lack multimodal understanding capabilities, resulting in closed-source model that does not support multimodal interleaved sequences. |
| Approach: | They propose a foundation model built on multimodal tokens capable of understanding and generating speech, text, images, and videos in an end-to-end, autoregressive manner. |
| Outcome: | The proposed model is able to understand speech, text, images, and videos in an end-to-end, autoregressive manner. |
Copied to clipboard
| Challenge: | Existing numerical MRC models are weak in numerical reasoning, such as addition, subtraction, sorting and counting. |
| Approach: | They propose a numerical MRC model that integrates numerical reasoning into existing MRC models and achieves an EM-score of 64.56% on the DROP dataset. |
| Outcome: | The proposed model outperforms all existing machine reading comprehension models by considering the numerical relations among numbers on the DROP dataset. |
Copied to clipboard
| Challenge: | Existing length control methods focus on a simple control type of “equal to” a target length. |
| Approach: | They propose a prompt-based method to achieve length controlled generation under different control types with high accuracy by using reinforcement learning and sample filtering with the reward signal given by rule-based reward models. |
| Outcome: | The proposed method significantly improves the accuracy of prompt-based length control on popular summarization datasets like CNNDM and NYT under multiple control types. |
Copied to clipboard
| Challenge: | Existing models for slot filling and intent detection fail to fully utilize cooccurrence relations between slots and intents, which restricts their potential performance. |
| Approach: | They propose a novel Collaborative Memory Network (CM-Net) that captures slot-specific and intent-specific features in a collaborative manner. |
| Outcome: | The proposed network outperforms existing models on two benchmarks and a self-collected corpus. |
Copied to clipboard
| Challenge: | Existing graph neural networks can only process multi-hop relational reasoning on pre-defined graphs and cannot be directly applied in natural language relational reasoning. |
| Approach: | They propose a graph neural network with generated parameters using natural language sentences as inputs. |
| Outcome: | The proposed model can process relational reasoning on graphs and in natural language processing tasks. |
Copied to clipboard
| Challenge: | Using Wikipedia pages to answer open-domain questions remains challenging in natural language understanding. |
| Approach: | They propose a model which reads Wikipedia pages for natural question answering . it uses a dynamic paragraph dual-attention reader and a cascaded answer predictor . |
| Outcome: | The proposed model outperforms the human model on the Natural Questions dataset . it achieves 74.3 F1 and 57.9 F1 on long-answer and short-answer tasks . |
Copied to clipboard
| Challenge: | Existing methods for QA in industrial environments are inherently relational and often updated. |
| Approach: | They propose a framework that optimizes retrieval and generation through two components: Graph-aware Retrieval and evidence-constrained reinforcement learning. |
| Outcome: | Experiments on an internal advertising QA dataset show consistent gains across expert-judged dimensions including accuracy, completeness, safety, and URL validity. |
Copied to clipboard
| Challenge: | Knowledge distillation (KD) has shown great success in BERT compression. |
| Approach: | They propose a knowledge distillation paradigm that extracts the teacher's hidden state knowledge and then compresses it into three dimensions. |
| Outcome: | The proposed paradigm gives rise to training speedup of 2.7x 3.4x for two kinds of student models and computing devices. |
Copied to clipboard
| Challenge: | Existing methods for table-to-text generation use encoder-decoder framework, but lack of large parallel data is a problem for many domains. |
| Approach: | They propose a model to separate table-to-text generation into two stages: key fact prediction and surface realization. |
| Outcome: | The proposed model achieves 27.34 BLEU score with only 1,000 parallel data, while the baseline model only achieves 9.71 BLUE score. |
Copied to clipboard
| Challenge: | Existing studies have shown that LoRA introduces substantial parameter redundancy, which not only increases the number of trainable parameters but also hinders the effectiveness of fine-tuning. |
| Approach: | They propose a method that leverages importance information from the pretrained model’s weights to mitigate LoRA redundancy. |
| Outcome: | The proposed method significantly reduces the number of trainable parameters required for task adaptation while providing a task-aligned perspective for LoRA redundancy reduction. |
Copied to clipboard
| Challenge: | Large Language Models (LLMs) are pre-trained on vast datasets composed of billions of tokens harvested from diverse text sources. |
| Approach: | They propose a data engineering method to refine the pretraining corpus through data rating, tagging and editing. |
| Outcome: | The proposed method improves the quality of the pretraining corpus by enhancing 100 billion tokens of the training corpus. |
Copied to clipboard
| Challenge: | Existing studies show that training-based methods are ineffective to detect LLM generated texts from unseen tasks or topics which are not collected during training. |
| Approach: | They propose to train classification models to distinguish LLMs from human texts by a distribution shift caused by prompts, text lengths, topics, and language tasks. |
| Outcome: | The proposed methods can detect LLMs from black-box models, but they suffer from distribution shifts due to a wide range of factors, including prompts, text lengths, topics, and language tasks. |
Copied to clipboard
| Challenge: | Existing work on how to effectively capture multi-document relationships remains an open question . Existing techniques to mitigate this problem include hierarchical summarization of semantically related chunks or integrating Knowledge Graphs (KGs). |
| Approach: | They propose a method which constructs a local knowledge graph from retrieved documents . they use propositional claims to construct a knowledge graph and contextualize a small language model . |
| Outcome: | The proposed method outperforms RAG on biomedical benchmarks and is generalizable and effective. |
Copied to clipboard
| Challenge: | Pre-trained language models capture factual knowledge from massive texts . but they are still quite behind the SOTA KGC models in terms of performance . |
| Approach: | They propose to use open-world assumption to evaluate PLM-based knowledge graph completion models . they propose to convert each triple and its support information into natural prompt sentences . |
| Outcome: | The proposed model is more accurate under the open-world assumption (OWA) this setting manual checks the correctness of knowledge that is not in KGs. |
Copied to clipboard
| Challenge: | Recent research on fluid intelligence assessments has highlighted significant deficiencies in LLMs’ abilities. |
| Approach: | They analyze the challenges LLMs face in demonstrating fluid intelligence through controlled experiments using the most representative ARC task as an example. |
| Outcome: | The proposed model shows that it lacks the ability to combine skill composition and abstract input formats and lacks left-to-right decoding. |
Copied to clipboard
| Challenge: | Long-form question answering requires two procedures: information retrieval and information synthesis. |
| Approach: | They propose a Chinese long-form question answering dataset called WebCPM . the dataset is based on a web search interface that engages with a search engine in real time . |
| Outcome: | The proposed dataset generates answers that are no worse than human-written ones . the dataset is the first Chinese LFQA dataset . |
Copied to clipboard
| Challenge: | Existing reconstruction attacks on text sanitization are not able to accurately assess their effectiveness. |
| Approach: | They propose to use ASR to measure the effectiveness of reconstruction attacks to evaluate sanitization performance. |
| Outcome: | The proposed reconstruction attacks achieve a 46.4% improvement in ASR over the state-of-the-art baseline with a privacy budget of =4.0 on the SST-2 dataset. |
Copied to clipboard
| Challenge: | Existing methods for supervised fine-tuning focus on unit test feedback to construct preference pairs. |
| Approach: | They propose a preference alignment framework that mimics human iterative debugging to refine Code LLMs. |
| Outcome: | Experiments show that Preference Learning improves on BigCodeBench and BigCodeBind tasks. |
Copied to clipboard
| Challenge: | Distantly supervised relation extraction (RE) has attracted much attention in the past few years . previous methods to evaluate models manually or directly on autolabeled data have produced inaccurate evaluations . |
| Approach: | They propose to use distant supervision to generate large-scale autolabeled data . they build manually-annotated test sets for two DS-RE datasets and evaluate models . |
| Outcome: | The proposed method produces 53% wrong labels at the entity pair level in the popular NYT10 dataset. |
Copied to clipboard
| Challenge: | Existing rankers excel in lexical-matching scenarios, while they struggle with complex queries requiring deep reasoning. |
| Approach: | They propose a new paradigm that balances flexibility and context awareness to unlock the full potential of groupwise reranking. |
| Outcome: | The proposed approach achieves a state-of-the-art 65.2 NDCG@10 on BRIGHT and surpasses baselines by 2.1 points on R2MED while delivering a 6.4 inference speedup. |
Copied to clipboard
| Challenge: | Recent studies show pre-trained language models contain matching subnetworks that have similar transfer learning performance as the original PLM. |
| Approach: | They propose to prune matching subnetworks using magnitude-based pruning . they propose to optimize the subnetwork structure towards the pre-training objectives . |
| Outcome: | The proposed method is more efficient in searching subnetworks and advantageous when fine-tuning within a range of data scarcity. |
Copied to clipboard
| Challenge: | Existing Chinese preference datasets suffer from limited scale, restricted domain coverage, and insufficiently rigorous data validation. |
| Approach: | They propose an LLM-based data annotation pipeline with no human intervention to annotate Chinese preference datasets. |
| Outcome: | The proposed pipeline outperforms existing Chinese preference datasets on AlignBench and Chinese Reward Benchmark. |
Copied to clipboard
| Challenge: | Large Language Models (LLMs) have shown remarkable capabilities in automating code generation, but they suffer from insufficient exploration of the vast solution space. |
| Approach: | They propose a large-scale LLM-driven code generation framework that efficiently finds high-quality solutions in only a few iterations. |
| Outcome: | The proposed framework outperforms baselines while maintaining reasonable time and computational costs. |
Copied to clipboard
| Challenge: | Neural machine translation models are trained to maximize the likelihood of next token given previous golden tokens as inputs, but at the inference stage, golden token is unavailable. |
| Approach: | They propose to use scheduled sampling to replace ground-truth tokens with predicted tokens to bridge the gap between training and inference. |
| Outcome: | The proposed methods outperform the Transformer baseline and vanilla scheduled sampling on three large-scale WMT tasks. |
Copied to clipboard
| Challenge: | Existing approaches to generate agentic workflows using large language models are limited by high manual design costs, inefficient agentic search, and poor dynamic adaptability to new tasks and human preferences. |
| Approach: | They propose an evolutionary framework for generating agentic workflows through human-agent collaboration using evolutionary algorithms that mutate and cross over their structures, prompts, and LLM backbones. |
| Outcome: | The proposed framework surpasses other automated baselines by 27.34% while achieving comparable performance to o1-preview at only one-fourth of the cost. |
Copied to clipboard
| Challenge: | Existing medical dialogue systems have significant potential to simplify diagnostic procedure and reduce the cost of collecting information from patients. |
| Approach: | They analyze 325 papers from well-known computer science, natural language processing conferences and journals to find out the major challenges of medical dialog systems. |
| Outcome: | The proposed systems have been surveyed in the medical community but have not been evaluated from a technical perspective. |
Copied to clipboard
| Challenge: | Existing evaluation platforms are complex and poorly modularized, hindering seamless incorporation into researcher’s workflows. |
| Approach: | They propose a lightweight evaluation framework characterized by lightweight, comprehensiveness, modularity, and efficiency that integrates models, data, and metrics into a unified evaluation workflow. |
| Outcome: | The proposed evaluation framework is lightweight, comprehensive, modular, and efficient. |
Copied to clipboard
| Challenge: | Large language models (LLMs) generate code for productive activities, but current benchmarks for code synthesis are oriented towards introductory tasks on algorithm and data science. |
| Approach: | They propose a code benchmark to mirror the complexity and variety of scenarios in real-world coding tasks. |
| Outcome: | The proposed benchmark improves on 39 large language models with close HumanEval scores and achieves an efficiency increase of more than 4 times. |
Copied to clipboard
| Challenge: | Existing hyperbolic neural networks encode features in the hyperbolical space yet formalize most of their operations in the tangent space. |
| Approach: | They propose a fully hyperbolic framework to build hyperbolical networks based on the Lorentz model by adapting Lorentzer transformations to formalize essential operations of neural networks. |
| Outcome: | The proposed framework has better performance on four NLP tasks compared with existing hyperbolic models . |
Copied to clipboard
| Challenge: | Large language models (LLMs) have been successful on NLP tasks but require huge parameter sizes and computational resources. |
| Approach: | They propose a parameter-efficient acceleration method that enhances computational efficiency through plug-and-play compression plugins. |
| Outcome: | The proposed method saves 53% computational costs using only 0.9% additional parameters with a performance drop of less than 2%. |
Copied to clipboard
| Challenge: | Recent work on DeepNorm scales Transformers into extremely deep (1000 layers) due to the training instability of Transformers, the depths of these SOTA models are still relatively shallow. |
| Approach: | They propose a branch-rescaled model which dynamically rescales the non-residual branch of Transformer in accordance with the training period. |
| Outcome: | The proposed approach significantly outperforms existing shallow models on multiple translation tasks and achieves better training stability and convergent performance. |
Copied to clipboard
| Challenge: | Existing dynamic vocabulary approaches struggle to generalize to novel or out-of-vocabulary words, limiting their flexibility in handling diverse token combinations. |
| Approach: | They propose an open-source framework for training, evaluation, and visualization of dynamic vocabulary-augmented language models. |
| Outcome: | The proposed framework validates the effectiveness of dynamic vocabulary-augmented language models on modern LLMs and shows support for batch inference significantly improving inference throughput. |
Copied to clipboard
| Challenge: | Multimodal large language models (MLLMs) have achieved remarkable progress in recent years, yet their ability to perform left–right reasoning in mirror contexts remains underexplored. |
| Approach: | They propose a benchmark to evaluate MLLMs' ability to distinguish left from right from a subject-centered perspective. |
| Outcome: | The proposed benchmarks show that even the best performing models achieve only 65.40% accuracy, far below the 99.28% accuracy of humans. |
Copied to clipboard
| Challenge: | Existing event extraction methods classify each argument role independently, ignoring conceptual correlations between different argument roles. |
| Approach: | They propose a Hierarchical Modular Event Argument Extraction model to provide inductive bias from the concept hierarchy of event argument roles. |
| Outcome: | The proposed model outperforms existing methods on real-world datasets and shows that it leverages useful knowledge from the concept hierarchy. |
Copied to clipboard
| Challenge: | Existing research on reinforcement learning for LLMs under data scarcity has not been unified. |
| Approach: | They propose a top-up hierarchical framework built around three complementary perspectives: data-centric, training-centric and framework-centric. |
| Outcome: | The proposed framework provides a clear conceptual foundation for understanding the design space of data-efficient RL for large language models and to guide researchers working in this emerging area. |
Copied to clipboard
| Challenge: | Existing studies on in-context learning have focused on quantifying the uncertainty associated with the model's response, but they neglect the complexity of the LLM and the uniqueness of in-constitut learning. |
| Approach: | They propose a method to quantify the uncertainty associated with in-context learning and propose corresponding estimation method to quantify both types of uncertainties. |
| Outcome: | The proposed method offers an unsupervised way to understand the prediction of in-context learning in a plug-and-play fashion. |
Copied to clipboard
| Challenge: | Existing datasets for open-domain dialogue modeling limited to a single language . absence of multilingual datasets hinders development of robust open- domain dialog systems . |
| Approach: | They propose a multilingual parallel open-domain dialog dataset to explore multilingual and cross-lingual open- domain dialog. |
| Outcome: | The proposed model can be used to explore multilingual and cross-lingual open-domain dialogs in other languages. |
Copied to clipboard
| Challenge: | Existing approaches to enhance LLMs' performance in machine translation are unable to fully exploit their instruction-following capabilities. |
| Approach: | They propose a framework for translating through self-reflection that involves two stages of inference . they propose to use the framework to refine LLMs' preliminary translations . |
| Outcome: | The proposed framework can produce translation outputs that match the quality of NMT systems. |
Copied to clipboard
| Challenge: | Existing literature suggests that RAG systems may face privacy issues when the retrieval process involves private data. |
| Approach: | They propose a two-stage synthetic data generation paradigm that uses attributes to preserve contextual information from the original data. |
| Outcome: | The proposed approach preserves key contextual information from the original data while reducing privacy risks. |
Copied to clipboard
| Challenge: | Existing approaches to token-level adaptive training only use static word frequency information without considering the source language. |
| Approach: | They propose a bilingual mutual information based adaptive objective that assigns weights to target tokens with higher BMI . they propose to use this approach to improve token-level adaptive training . |
| Outcome: | The proposed method improves token-level adaptive training on two languages. |
Copied to clipboard
| Challenge: | Initial studies have focused on task-specific, independent LLM-empowered agents, but the potential of LLMs within a multi-agent collaborative framework for classroom simulation with real user participation remains unexplored. |
| Approach: | They propose a multi-agent classroom simulation teaching framework that recognizes representative class roles and introduces a novel class control mechanism for automatic classroom teaching. |
| Outcome: | The proposed framework can simulate dynamic learning environment for users with active teacher-student and student-studente interactions. |
Copied to clipboard
| Challenge: | Retrieval-Augmented Generation (RAG) enhances large language models by incorporating external knowledge, yet traditional singleround retrieval struggles with complex multistep reasoning. |
| Approach: | They propose a framework that introduces path-centric reward shaping for agentic RAG training. |
| Outcome: | The proposed framework improves on existing methods with an average accuracy gain of 7.7 points. |
Copied to clipboard
| Challenge: | Large Language Models (LLMs) have paved the way for complex tasks such as role-playing. |
| Approach: | They propose a framework to benchmark, elicit, and enhance role-playing abilities in Large Language Models. |
| Outcome: | The proposed framework improves role-playing abilities with 168,093 samples. |
Copied to clipboard
| Challenge: | Large Language Models (LLMs) have demonstrated impressive capabilities across a wide range of tasks, but their proficiency and reliability in the specialized domain of financial data analysis remain uncertain. |
| Approach: | FinDABench is a benchmark designed to evaluate the financial data analysis capabilities of Large Language Models (LLMs) it comprises 15,200 training instances and 8,900 test instances, all meticulously crafted by human experts. |
| Outcome: | FinDABench measures the financial data analysis capabilities of large language models (LLMs) across three dimensions: 1) Core Ability; 2) Analytical Ability; 3) Technical Ability. |
Copied to clipboard
| Challenge: | Large language models (LLMs) can perform conditional sequence generation tasks, such as translation or summarization, through instruction fine-tuning. |
| Approach: | They propose to shift the position of task instructions after the input sentences to enhance the model's instruction-following capability. |
| Outcome: | The proposed method outperforms traditional settings across various model scales (1B / 7B & 13B) and different sequence generation tasks (translation and summarization) without any additional data or annotation costs. |
Copied to clipboard
| Challenge: | Large language models (LLMs) are generalist agents capable of operating within complex environments. |
| Approach: | They propose a class of tools that can serve as a middleware layer shielding LLMs from environmental complexity. |
| Outcome: | The proposed tool can shield the LLM from environmental complexity in two representative complex environments. |
Copied to clipboard
| Challenge: | Large language models (LLMs) can only handle texts a few thousand tokens long, limiting their applications on longer sequence inputs, such as books, reports, and codebases. |
| Approach: | They propose a bilingual, multi-task benchmark for long context understanding that extends context windows and more sophisticated memory mechanisms to improve models' long context capabilities. |
| Outcome: | The proposed model outperforms open-source models but struggles on longer contexts. |
Copied to clipboard
| Challenge: | Existing pre-training objectives do not explicitly model relational facts in text . Experimental results show that ERICA can improve typical PLMs on several language understanding tasks, including relation extraction, entity typing and question answering. |
| Approach: | They propose a contrastive learning framework ERICA to obtain a deep understanding of entities and relations in text. |
| Outcome: | The proposed framework can improve PLMs on several language understanding tasks, especially under low-resource settings. |
Copied to clipboard
| Challenge: | 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: | Prompt tuning is a technique that updates few parameters in pre-trained models for language understanding and generation tasks. |
| Approach: | They propose to leverage prompt tuning for neural text retrieval to improve generalization and cross-domain generalization. |
| Outcome: | The proposed approach can mitigate the two issues faced by fine-tuning retrieval methods and improve the out-of-domain zero-shot generalization of the retrieval models. |
Copied to clipboard
| Challenge: | Existing relation extraction methods focus on extracting relational facts between entity pairs within single sentences or documents. |
| Approach: | They present a problem of cross-document relation extraction (CRE) using human annotations. |
| Outcome: | The proposed dataset is the first human-annotated cross-document RE dataset . it shows that it is challenging to existing RE methods including strong BERT-based models. |
Copied to clipboard
| Challenge: | TKGF is a technique that requires experience during testing and relying on a single short-term history. |
| Approach: | They propose a framework that integrates dynamic causal rule mining and dual history augmented generation to enhance event prediction. |
| Outcome: | The proposed framework shows significant performance improvements across diverse datasets and significantly improves Hit@k. |
Copied to clipboard
| Challenge: | Using pretrained language models, we propose an error-annotated dataset for text generation . we use carefully selected prompt words to guide GPT-2 to generate candidate sentences . |
| Approach: | They propose an error-annotated dataset with multiple benchmark tasks for text generation from pretrained language models. |
| Outcome: | The proposed dataset covers 24 types of errors according to common sense and linguistics. |
Copied to clipboard
| Challenge: | Modern deep models for summarization generate miscalibrated predictive uncertainty, compromising reliability and trustworthiness in real-world applications. |
| Approach: | They propose to use probabilistic methods to improve the uncertainty quality of neural summarization models by using three large-scale benchmarks with varying difficulty. |
| Outcome: | The proposed methods consistently improve the model’s generation and uncertainty quality, leading to improved selective generation performance (i.e., abstaining from low-quality summaries) in practice. |
Copied to clipboard
| Challenge: | Large Language Models (LLMs) have redefined the role of AI in software engineering . current benchmarks focus on localized code generation, but neglect dynamic, full-process requirements of real-world engineering. |
| Approach: | They propose a benchmark to evaluate agentic backend coding within a realistic, executable workflow. |
| Outcome: | The ABC-Bench benchmark evaluates agentic backend coding within a realistic, executable workflow. |
Copied to clipboard
| Challenge: | Recent advances in large multimodal models have encouraged the development of large multi-modal models . however, it is unclear how to extend these models to the more complex video domain . |
| Approach: | They propose a visual instruction tuning framework to address temporal video-language tasks . they collect a dataset and fine-tune the framework on instruction-following data . |
| Outcome: | The proposed model can perform better on established temporal video-language tasks without training objectives and intensive pre-training. |
Copied to clipboard
| Challenge: | Existing models for NLP evaluations lack the ability to generate informative critiques in pointwise grading and pairwise comparison especially without references. |
| Approach: | They propose a method which can acquire pointwise grading critiques with pseudo references and revise these critiques via multi-path prompting to obtain informative evaluation data in different tasks and settings. |
| Outcome: | The proposed method outperforms all open-source models and even GPT-4 in system-level correlations of pointwise grading. |
Copied to clipboard
| Challenge: | Existing prompts for complex reasoning tasks are limited to specific tasks with few-shot examples due to constraints like context length and information extraction accuracy. |
| Approach: | They propose a method to build structured reasoning processes by injecting human insights into LLMs' training data. |
| Outcome: | The proposed framework outperforms baselines in the analysis of large language models. |
Copied to clipboard
| Challenge: | Existing mitigation strategies for Text-to-Speech systems require excessive training resources or inference latency. |
| Approach: | They propose a GFlOwNet-guided distribution AlignmenT framework that mitigates hallucinations without relying on massive resources or inference latency. |
| Outcome: | The proposed framework reduces over 50% character error rates and lowers uncertainty by up to 58% on challenging test cases. |
Copied to clipboard
| Challenge: | Existing methods to generate human-aligned content with a “jailbreak prompt” are inefficient and repetitive, causing inefficiency and a lack of experience. |
| Approach: | They propose a framework that integrates past attack experiences to aid current jailbreak attempts. |
| Outcome: | The proposed framework improves both attack effectiveness and efficiency compared to the current black-box jailbreak method. |
Copied to clipboard
| Challenge: | Existing approaches to training document conversion models with manual annotation are costly and time-consuming, and training student models by distilling outputs from teacher models can significantly limit their performance in real-world applications. |
| Approach: | They propose a fully automated framework for constructing high-quality document extraction datasets and models capable of handling diverse document formats and layouts. |
| Outcome: | The proposed model outperforms existing models and improves on annotated documents. |
Copied to clipboard
| Challenge: | Existing methods to learn incessantly emerging novel relations are overfitting the few memorized examples of old relations, causing confusion among existing relations. |
| Approach: | They introduce episodic memory activation and reconsolidation (EMAR) to continual relation learning. |
| Outcome: | The proposed method outperforms state-of-the-art models in catastrophic forgetting old relations. |
Copied to clipboard
| Challenge: | Existing methods for news headline generation focus on producing a single short sentence . et al., 2017; Gehrmann e.t., 2018; Zhong ee., 2019) focus on single-headline generation. |
| Approach: | They propose a method to generate multiple headlines with keyphrases of user interests . they propose generating multiple keyphrase-relevant headlines using a transformer decoder . |
| Outcome: | The proposed method achieves state-of-the-art in terms of quality and diversity. |
Copied to clipboard
| Challenge: | Existing methods for large language models (LLMs) are coarse-grained and fail to distinguish between direct quotes and complex reasoning. |
| Approach: | They propose a framework that combines supervised fine-tuning and group relative policy optimization to generate fluent answers while simultaneously producing sentence-level provenance triples. |
| Outcome: | The proposed framework outperforms 14 strong large language models in joint evaluation. |
Copied to clipboard
| Challenge: | Existing benchmarks fail to evaluate egocentric clinical intent understanding of medical multimodal large language models. |
| Approach: | They propose a benchmark leveraging clinician gaze as a Cognitive Cursor to assess intent understanding across surgery, emergency simulation and diagnostic interpretation. |
| Outcome: | The proposed benchmark addresses challenges of visual homogeneity of anatomical structures, strict temporal-causal dependencies in clinical workflows, and implicit adherence to safety protocols. |
Copied to clipboard
| Challenge: | ConceptMath evaluates concept-wise mathematical reasoning of Large Language Models (LLMs) Existing benchmarks that evaluate general mathematical reasoning with an average accuracy fail to probe the fine-grained failure modes of mathematical reasoning on specific datasets. |
| Approach: | They introduce a bilingual, fine-grained benchmark that evaluates concept-wise mathematical reasoning of Large Language Models. |
| Outcome: | The proposed benchmarks evaluate concept-wise mathematical reasoning of Large Language Models with concept-based accuracies. |
Copied to clipboard
| Challenge: | Existing LLMs lack high-quality data sources and lack robust data filtration strategies. |
| Approach: | They develop a framework to enhance the capabilities of LLM-based agents under data scarcity. |
| Outcome: | The proposed framework improves the capabilities of LLM-based agents under data scarcity. |
Copied to clipboard
| Challenge: | Existing benchmarks focus on well-structured tables and fail to reflect irregular structures and complex reasoning commonly encountered in real-world scenarios. |
| Approach: | They propose a benchmark to evaluate TableQA under complex reasoning and irregular table conditions. |
| Outcome: | The proposed framework improves generalization and realism of large language models under complex and irregular table conditions. |
Copied to clipboard
| Challenge: | Existing delta tuning algorithms freeze most of the parameters and only optimize minimal adaptive parameters. |
| Approach: | They propose to decompose DETs into a unified optimization subspace and conduct optimization within the subspace. |
| Outcome: | The proposed DETs achieve comparable performance to the original DET and can be transferred to another DET with non-trivial performance. |
Copied to clipboard
| Challenge: | Existing methods to expand course concepts in MOOCs suffer from semantic drifts and lack of knowledge guidance. |
| Approach: | They propose to use a boundary search method to search for new concepts via external knowledge base and then use heterogeneous features to verify the results. |
| Outcome: | The proposed method improves on the datasets from Coursera and XuetangX. |
Copied to clipboard
| Challenge: | Existing methods of prompt tuning cannot handle hard sequence labeling tasks. |
| Approach: | They propose to optimize prompt tuning to tune continuous prompts with a frozen language model. |
| Outcome: | The proposed method matches finetuning with prompt tuning while having only 0.1%-3% tuned parameters. |
Copied to clipboard
| Challenge: | Existing datasets for Chinese instruction tuning are not well-aligned with Chinese users’ interaction patterns. |
| Approach: | They propose to use Chinese instruction tuning datasets to improve instruction fine-tuning for Chinese users. |
| Outcome: | The proposed dataset shows that Chinese models achieve competitive performance in diverse benchmarks. |
Copied to clipboard
| Challenge: | Creating job requirements is a crucial step in the recruiting process, but it is difficult to specify the level of education, experience, relevant skills per the job description. |
| Approach: | They propose a conditional text generation task to generate job requirements based on job descriptions . they use a hierarchical decoder to label the job description with multiple skills . a skill knowledge graph is constructed to capture the global prior knowledge about skills based upon the model . |
| Outcome: | The proposed method is evaluated on real-world job posting data. |
Copied to clipboard
| Challenge: | Existing benchmarks focus on single agentic capability, failing to capture long-horizon real-world scenarios. |
| Approach: | They propose a benchmark that evaluates 6 agentic capabilities across 32 real-world scenarios. |
| Outcome: | Experiments show that closed-source models outperform open-source model (48.4% vs 32.1%) integrating models with advanced scaffolds to form autonomous agents is a paradigm shift. |
Copied to clipboard
| Challenge: | Large Language Models (LLMs) have greatly enhanced dialogue systems, but evaluation of their capabilities remains a challenge. |
| Approach: | They propose a model to evaluate the fine-grained abilities of Large Language Models in multi-turn dialogues. |
| Outcome: | The proposed model evaluates 21 popular chatbots based on MT-Bench-101 . it includes 3 overarching abilities and 13 distinct tasks within multi-turn dialogue scenarios. |
Copied to clipboard
| Challenge: | Existing pre-trained language models are typically trained with static data, ignoring that streaming data of various sources may continuously grow. |
| Approach: | They propose to use function preserved model expansion to expand existing PLM's width and depth to improve efficiency of knowledge acquisition. |
| Outcome: | The proposed model improves pre-training efficiency and performance over existing models on BERT and GPT. |
Copied to clipboard
| Challenge: | Existing methods to fix non-compliant images suffer from over-editing, destroying original intent and perceptual similarity. |
| Approach: | They propose a framework for the minimalist rectification of non-compliant image ads. |
| Outcome: | The proposed framework outperforms state-of-the-art baselines in both compliance and preservation of visual and commercial consistency. |
Copied to clipboard
| Challenge: | Prior work has explored step-level supervision using Shannon-entropy-based uncertainty signals, which conflate inherent state complexity with agent confidence. |
| Approach: | They propose a hierarchical group-based RL framework that leverages normalized entropy to locate outlier steps associated with trajectory neglect and optimizes them via a mechanism of trajectory-aware reward and trajectory-independent penalty. |
| Outcome: | Experiments on ALFWorld, WebShop, and Search-Augmented QA show that STAPO achieves state-of-the-art performance while substantially alleviating trajectory neglect. |
Copied to clipboard
| Challenge: | Existing models for long contexts struggle to handle long inputs due to limited context window and memory usage. |
| Approach: | They propose a graph-based agent system that analyzes long texts into a graphical graph . GraphReader consistently outperforms GPT-4-128k across context lengths from 16k to 256k . |
| Outcome: | The proposed model outperforms existing models on four challenging benchmarks. |
Copied to clipboard
| Challenge: | Pre-trained language models (PLMs) are robust in contextual understanding but their considerable size incurs significant computational and storage costs. |
| Approach: | They propose a Sparse-Dense-Sparse pruning framework to prune PLMs . they prune less critical connections using conventional pruning methods . |
| Outcome: | The proposed pruning framework outperforms SparseGPT and Wanda under identical sparsity. |
Copied to clipboard
| Challenge: | Existing methods for automatic comment generation generate common and meaningless comments for music. |
| Approach: | They propose a multi-perspective strategy to enhance automatic music comment generation by combining different perspectives on a music comment dataset. |
| Outcome: | The proposed model outperforms state-of-the-art models on two music comment datasets and outperformed existing models by a substantial margin. |
Copied to clipboard
| Challenge: | Medical Multi-Modal Large Language Models (Med-MLLMs) are a promising new form of artificial general intelligence due to their ability to tackle complex tasks. |
| Approach: | They propose a new benchmark that comprehensively assesses medical multi-modal large language models in terms of distinct medical specialties and different diagnostic capacities. |
| Outcome: | The proposed model covers 15 medical specialties and different diagnostic capacities, and excludes overlap with existing VQA dataset. |
Copied to clipboard
| Challenge: | Current approaches to addressing knowledge outdating in LLMs struggle with retrieval and generation aspects when handling outdated information. |
| Approach: | They propose a benchmark to evaluate the impact of outdated information on RAG . they use token-level diff algorithms and LLM pipelines to create a large-scale QA dataset . |
| Outcome: | The proposed benchmark analyzes the impact of outdated information on RAG performance. |
Copied to clipboard
| Challenge: | Existing embedding models are not well-equipped to encode situated context effectively, i.e., situating a chunk’s meaning within its context. |
| Approach: | They propose to represent short chunks in a way that is conditioned on a broader context window to enhance retrieval performance. |
| Outcome: | The proposed model outperforms state-of-the-art embedding models on a book-plot retrieval dataset. |
Copied to clipboard
| Challenge: | Existing systems for sequence labeling are limited by shallow connections between consecutive hidden states and insufficient modeling of global information. |
| Approach: | They propose a global context enhanced deep transition architecture for sequence labeling . they deepen the state transition path at each position in a sentence and assign tokens with global representations . |
| Outcome: | The proposed architecture outperforms the best reported results on two standard sequence labeling tasks. |
Copied to clipboard
| Challenge: | Existing datasets may leak shallow heuristics via entity mentions, thus contributing to the high performance on RE benchmarks. |
| Approach: | They propose an entity-masked contrastive framework for relation extraction to gain a deeper understanding on textual context and type information while avoiding rote memorization of entities. |
| Outcome: | The proposed framework improves the effectiveness and robustness of neural models in different RE scenarios. |
Copied to clipboard
| Challenge: | Visual Question Answering (VQA) models are prone to learn the shortcut solution formed by dataset biases rather than the intended solution. |
| Approach: | They propose a dataset that considers varying types of shortcuts by constructing different distribution shifts in multiple OOD test sets. |
| Outcome: | The proposed dataset considers varying types of shortcuts by constructing different distribution shifts in multiple OOD test sets. |
Copied to clipboard
| Challenge: | Existing regulatory policies create label inconsistencies and reasoning ambiguities in historical datasets. |
| Approach: | They propose a policy-adaptive governance system that enables evolving reinforcement through multi-agent adversarial umpiring. |
| Outcome: | The proposed system outperforms fine-tuning baselines on industrial and public datasets . it enables evolving reinforcement through multi-agent adversarial umpiring . |
Copied to clipboard
| Challenge: | Existing large-scale large-context models suffer from performance degradation when processing long numerical sequences. |
| Approach: | They propose a framework to mitigate attention dispersion by strategically inserting separator tokens into the model to recalibrat attention to local segments while preserving global context. |
| Outcome: | The proposed framework improves accuracy and reduces inference token consumption by 16.4% on 9 widely-adopted LLMs. |
Copied to clipboard
| Challenge: | Pretrained language models perform structural understanding tasks that focus on understanding one aspect of the text. |
| Approach: | They propose a method for improving the structural understanding abilities of language models by pretraining them to generate structures from the text on task-agnostic corpora. |
| Outcome: | The proposed model performs state-of-the-art on 21 of 28 datasets. |
Copied to clipboard
| Challenge: | Existing memory frameworks provide limited support for temporally structured information across hierarchical levels, leading to fragmented memories and unstable long-horizon personalization. |
| Approach: | They propose a temporal–hierarchical memory framework that organizes conversations through a Temporal Memory Tree. |
| Outcome: | The proposed framework outperforms baselines while reducing the recalled memory length by 52.20%. |
Copied to clipboard
| Challenge: | Existing methods treat each span token equally important, ignoring significant features. |
| Approach: | They propose a span-based joint extraction framework with attention-based semantic representations that utilizes span-specific and contextual representations. |
| Outcome: | The proposed model outperforms existing models on ACE2005, CoNLL2004 and ADE. |
Copied to clipboard
| Challenge: | OpenCodeInterpreter-33B provides a high level of performance for code generation, executing, and iterative refinement. |
| Approach: | They propose a family of open-source code systems for generating, executing, and iteratively refining code. |
| Outcome: | The OpenCodeInterpreter-33B performs well on humanEval, MBPP, and EvalPlus benchmarks. |
Copied to clipboard
| Challenge: | Large Language Models (LLMs) can expand their capabilities by integrating external tools. |
| Approach: | They propose a training framework that prepares LLMs for diverse generalization challenges in tool utilization. |
| Outcome: | The proposed framework improves the tool-usage capabilities of LLMs by up to 8B parameters, surpassing GPT-4o. |
Copied to clipboard
| Challenge: | Existing security models rely on open-ended communication, but the collaborative process itself can be exploited and disrupted. |
| Approach: | They propose a new threat class, called Denial-of-Collaboration, which corrupts collaborative structure and transforms communication topology into self-sabotage. |
| Outcome: | The proposed attacks bypass conventional safety alignments that are not designed to detect behavioral or systemic attacks. |
Copied to clipboard
| Challenge: | Existing retrievers suffer from temporal-semantic misalignment and outdated-document interference . Existing frameworks suffer from both temporal validity and outdated factual versions . |
| Approach: | They propose a framework that mitigates temporal hallucinations by embedding heterogeneous temporal signals into the semantic space to ensure retrieval fidelity. |
| Outcome: | Experiments show that Re3 outperforms baselines by 9.7% in generation accuracy . the framework outperformed strongest baselines on challenging dynamic tasks . |
Copied to clipboard
| Challenge: | Existing relation extraction methods focus on extracting intra-sentence relations for single entities. |
| Approach: | They propose a relation extraction dataset from Wikipedia and Wikidata with three features . document-level relation extraction is a task to identify relational facts between entities . |
| Outcome: | The proposed dataset is the largest human-annotated dataset for document-level RE from plain text. |
Copied to clipboard
| Challenge: | Existing data augmentation techniques for natural language processing tasks are difficult to design. |
| Approach: | They propose a controllable rewriting based question data augmentation method for machine reading comprehension, question generation and question-answering natural language inference tasks. |
| Outcome: | The proposed method generates high-quality, high-quality question data samples on machine reading comprehension, question generation, and question-answering natural language inference tasks. |