Papers by Cheng Yu

183 papers
Towards Self-Evolving Agents: Enabling Autonomy through Interactive Experience Refinement (2026.findings-acl)

Copied to clipboard

Challenge: Large Language Models struggle with complex, multi-step operational tasks because they remain static during inference and cannot learn from past experience.
Approach: They propose a framework that organizes cross-domain insights to facilitate orchestration of long-horizon workflows.
Outcome: The proposed framework outperforms existing methods on the TAC productivity benchmark and shows strong cross-task transferability.
QUITO-X: A New Perspective on Context Compression from the Information Bottleneck Theory (2025.findings-emnlp)

Copied to clipboard

Challenge: Existing methods for compressing context by removing redundant tokens are inconsistent with the objective of retaining the most important tokens when conditioning on a given query.
Approach: They propose a method that uses information bottleneck theory to compress context . they propose to remove redundant tokens using metrics such as self-information or perplexity .
Outcome: The proposed method achieves a 25% increase in compression rate compared to the state-of-the-art .
Lost in Decomposition: Analyzing and Mitigating the Limitations of Long Context Methods via Context Dependency (2026.findings-acl)

Copied to clipboard

Challenge: Existing workflow-based long context methods do not perform well on specific datasets . performance degradation is associated with the indiscriminate application of long context models .
Approach: They propose a training-free adaptive routing strategy to improve long context large language models' robustness.
Outcome: The proposed method can be generalized to all types of datasets, but performance degradation is a concern.
Unified Thinker: A General Reasoning Core for Image Generation (2026.acl-long)

Copied to clipboard

Challenge: generative models struggle with logic-intensive instruction following, exposing a persistent reasoning–execution gap.
Approach: They propose a task-agnostic reasoning architecture for general image generation . they propose pixel-level feedback to ground the Thinker's policy in pixel feedback .
Outcome: The proposed system significantly improves image reasoning and generation quality.
LLMs Assist NLP Researchers: Critique Paper (Meta-)Reviewing (2024.emnlp-main)

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.
On the Universal Truthfulness Hyperplane Inside LLMs (2024.emnlp-main)

Copied to clipboard

Challenge: Recent studies have explored hallucinations through the lens of internal representations, proposing mechanisms to decipher LLMs’ adherence to facts.
Approach: They propose to train a universal truthfulness hyperplane that distinguishes the model’s factually correct and incorrect outputs on a diverse collection of over 40 datasets and examine its cross-task, cross-domain, and in-domain generalization.
Outcome: The proposed model is able to distinguish factual outputs from incorrect outputs on a diverse collection of over 40 datasets.
Annotations Are Not All You Need: A Cross-modal Knowledge Transfer Network for Unsupervised Temporal Sentence Grounding (2023.findings-emnlp)

Copied to clipboard

Challenge: Existing work on temporal sentence grounding rely on expensive video-query paired annotations . despite this, there are no ground-truth annotations in the current work .
Approach: They propose to use paired video-query and segment boundary annotations to generate temporal sentence grounding without training.
Outcome: The proposed model outperforms existing unsupervised methods and beats supervised ones on two challenging datasets.
Pre-training Multi-task Contrastive Learning Models for Scientific Literature Understanding (2023.findings-emnlp)

Copied to clipboard

Challenge: Pre-trained language models (LMs) have shown effectiveness in literature understanding tasks, especially when tuned via contrastive learning.
Approach: They propose a multi-task contrastive learning framework that enables common knowledge sharing across different scientific literature understanding tasks while preventing task-specific skills from interfering with each other.
Outcome: The proposed framework outperforms state-of-the-art pre-trained language models on a comprehensive dataset.
EarlyBERT: Efficient BERT Training via Early-bird Lottery Tickets (2021.acl-long)

Copied to clipboard

Challenge: Large-scale pre-trained language models require enormous computational resources and long training time.
Approach: They propose an algorithm to reduce inference time and train large NLP models by slimming the self-attention and fully-connected sub-layers inside a transformer.
Outcome: The proposed algorithm achieves comparable performance to standard BERT with 35 45% less training time.
Native Hybrid Attention for Efficient Sequence Modeling (2026.acl-long)

Copied to clipboard

Challenge: Experimental results show that NHA surpasses Transformers on recall-intensive tasks.
Approach: They propose a hybrid architecture of linear and full attention that integrates both into a unified layer design.
Outcome: The proposed architecture surpasses Transformers and other hybrid baselines on recall-intensive and commonsense reasoning tasks.
IOPO: Empowering LLMs with Complex Instruction Following via Input-Output Preference Optimization (2025.acl-long)

Copied to clipboard

Challenge: Existing algorithms to improve the ability of LLMs to follow complex instructions are lacking.
Approach: They propose a benchmark to improve the ability to follow complex instructions by using a IOPO alignment method to take input and output preference into consideration.
Outcome: The proposed algorithm shows 8.15%, 2.18% improvements on in-domain data and 5.91%, 2.83% on out-of-domain datasets compared to SFT and DPO respectively.
Dropping Experts, Recombining Neurons: Retraining-Free Pruning for Sparse Mixture-of-Experts LLMs (2025.findings-emnlp)

Copied to clipboard

Challenge: Sparse Mixture-of-Experts (SMoE) architectures require loading all expert parameters . previous work focused on expert pruning and merging but focused on neuron-level structure .
Approach: They propose a task-agnostic framework for expert pruning and reconstruction . it prunes redundant experts using router statistics, then decomposes them into neuron-level expert segments .
Outcome: The proposed framework reduces the number of experts and memory usage, making it easier to deploy.
One Cognitive Loop Is Enough: SODA unlocks Pure-Text Spatial Reasoning in Large Language Models (2026.acl-long)

Copied to clipboard

Challenge: Existing large language models (LLMs) lack visual input, leading to errors in basic numerical comparisons.
Approach: They propose a spatial OODA framework that integrates the OODAC cognitive loop into multiple control tasks and integrates it into LLMs.
Outcome: The proposed model significantly improves the spatial reasoning capabilities of large language models across multiple scenarios including SPOD-Bench, SPACE and applications.
Cooperative or Competitive? Understanding the Interaction between Attention Heads From A Game Theory Perspective (2025.acl-long)

Copied to clipboard

Challenge: a number of attention-based large language models (LLMs) focus on individual head contributions, but the precise interaction mechanisms between attention heads remain poorly understood.
Approach: They propose a game-theoretic attention calibration method that uses the Harsanyi dividend . they selectively retain heads demonstrating significant cooperative gains and apply fine-grained adjustments to remaining heads .
Outcome: The proposed framework is based on the Harsanyi dividend, a concept from cooperative game theory.
Subtle Errors in Reasoning: Preference Learning via Error-injected Self-editing (2025.acl-long)

Copied to clipboard

Challenge: Existing studies to improve mathematical ability typically involve applying preference learning to step-wise solution pairs, but they overlook critical subtle errors.
Approach: They propose a preference learning framework that injects predefined subtle errors into pivotal tokens to construct hard pairs for error mitigation.
Outcome: Extensive experiments show that the proposed framework improves on Qwen2-7B-Instruct and MATH with 4.5K training samples.
Towards Fully Exploiting LLM Internal States to Enhance Knowledge Boundary Perception (2025.acl-long)

Copied to clipboard

Challenge: Large language models (LLMs) exhibit impressive performance across diverse tasks but struggle to accurately gauge their knowledge boundaries.
Approach: They propose Consistency-based Confidence Calibration (C3) which assesses confidence consistency through question reformulation to improve LLMs’ ability to recognize their knowledge gaps.
Outcome: The proposed method improves the unknown perception rate by 5.6% on NQ and 4.9% on HotpotQA.
Cluster-Former: Clustering-based Sparse Transformer for Question Answering (2021.findings-acl)

Copied to clipboard

Challenge: Existing models for encoding long sequences in deep learning suffer from high latency and memory demands.
Approach: They propose a clustering-based sparse Transformer framework to perform attention across chunked sequences.
Outcome: The proposed framework achieves state-of-the-art on several major QA benchmarks.
Robustness Challenges in Model Distillation and Pruning for Natural Language Understanding (2023.eacl-main)

Copied to clipboard

Challenge: Recent studies have focused on compressing pre-trained language models (PLMs) however, few studies have examined the impact of compression on generalizability and robustness of compressed models for out-of-distribution data.
Approach: They propose to use knowledge distillation and pruning to reduce model generalization and generalization on out-of-distribution data.
Outcome: The proposed compression techniques overfit on shortcut samples and generalize poorly on hard ones.
Bit-Flip Error Resilience in LLMs: A Comprehensive Analysis and Defense Framework (2025.emnlp-main)

Copied to clipboard

Challenge: Bit-flip errors (BFEs) are hardware faults where individual bits in memory or processing units are unintentionally flipped.
Approach: They propose a novel defense strategy to mitigate bit-flip errors (BFEs) they propose bfe protection and a self-correction mechanism to minimize performance degradation .
Outcome: The proposed defense strategy minimizes performance degradation while significantly improving robustness against BFEs.
“In-Dialogues We Learn”: Towards Personalized Dialogue Without Pre-defined Profiles through In-Dialogue Learning (2024.emnlp-main)

Copied to clipboard

Challenge: Existing approaches to personalized dialogue generate pre-defined profiles that are time-consuming and labor-intensive to create.
Approach: They propose a framework that leverages dialogue history to characterize personas without pre-defined profiles.
Outcome: The proposed framework improves BLEU and ROUGE scores on three datasets and human evaluations further validate the proposed method.
Distilling Knowledge Learned in BERT for Text Generation (2020.acl-main)

Copied to clipboard

Challenge: Large-scale pre-trained language models such as BERT have revolutionized the state of the art in many language understanding tasks.
Approach: They propose a conditional masked language modeling approach to fine tune BERT on target generation tasks by imposing global sequence-level supervision on conventional Seq2Seq models.
Outcome: The proposed model outperforms strong Transformer baselines on multiple language generation tasks such as machine translation and text summarization.
Formally Specifying the Intended Behavior of the Program: LLM-Driven Neuro-Symbolic Program Specification Synthesis (2026.acl-demo)

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.
The Microsoft Toolkit of Multi-Task Deep Neural Networks for Natural Language Understanding (2020.acl-demos)

Copied to clipboard

Challenge: MT-DNN is an open-source natural language understanding toolkit . it allows researchers and developers to train customized deep learning models .
Approach: They present MT-DNN, an open-source natural language understanding toolkit . it is designed to facilitate rapid customization for a broad spectrum of NLU tasks . MT supports multi-task knowledge distillation, which can substantially compress a deep neural model without significant performance drop.
Outcome: The proposed model can significantly compress a large model without significant performance drop.
ReEval: Automatic Hallucination Evaluation for Retrieval-Augmented Large Language Models via Transferable Adversarial Attacks (2024.findings-naacl)

Copied to clipboard

Challenge: Existing static benchmarks do not guarantee that models can use the provided evidence for answering, which is essential to avoid hallucination when the required knowledge is new or private.
Approach: They propose to automatically perturb existing static one for dynamic evaluation by using a chatGPT framework and a set of open-domain QA datasets.
Outcome: The proposed framework generates new test cases on two open-domain QA datasets and is human-readable and useful to trigger hallucination in LLMs.
CMoralEval: A Moral Evaluation Benchmark for Chinese Large Language Models (2024.findings-acl)

Copied to clipboard

Challenge: Recent years have witnessed remarkable progress achieved by large language models in both natural language understanding and generation.
Approach: They propose a large benchmark CMoralEval for moral evaluation of Chinese LLMs . they use a Chinese TV program discussing Chinese moral norms and Chinese moral anomies based on various sources .
Outcome: The proposed dataset is characterized by diversity and authenticity.
Decomposition for Enhancing Attention: Improving LLM-based Text-to-SQL through Workflow Paradigm (2024.findings-acl)

Copied to clipboard

Challenge: In-context learning of large-language models has achieved remarkable success in the field of natural language processing . however, the single-step chain-of-thought prompting approach faces challenges such as attention diffusion and inadequate performance in complex tasks like text-to-SQL.
Approach: They propose a workflow paradigm method to enhance the attention and problem-solving scope of large-language models through decomposition.
Outcome: The proposed method outperforms existing methods on three datasets and improves the upper limit of LLM-based approaches.
Uncertainty-Aware Test-Time Search for Optimization Problem Solving (2026.acl-long)

Copied to clipboard

Challenge: Language model hallucinations and limited availability of labeled datasets often result in misaligned formulations, code errors and feasibility failures.
Approach: They propose a Monte Carlo Tree Search framework that automates optimization problems from natural language descriptions with efficiency and reliability.
Outcome: The proposed framework achieves state-of-the-art solution accuracy and reduces token usage.
Continuous Speech Tokenizer in Text To Speech (2025.findings-naacl)

Copied to clipboard

Challenge: Autoregressive modeling is a common method for processing language sequences and is effective in token prediction.
Approach: They propose a text-to-speech model based on continuous speech tokens and a continuous tokenizer for speech compression.
Outcome: The proposed model has better continuity and higher estimated Mean Opinion Scores (MoS) this is attributed to better information preservation rate across low and high frequencies in the frequency domain.
INSET: Sentence Infilling with INter-SEntential Transformer (2020.acl-main)

Copied to clipboard

Challenge: Missing sentence generation fosters a wide range of applications in natural language generation . Developing models for sentence infilling can potentially facilitate many text generation applications .
Approach: They propose a framework to decouple the problem from natural language processing . they propose generating missing sentences that can syntactically and semantically bridge context .
Outcome: The proposed model learns a sentence representation and generates 'missing sentences' the proposed model can be used for document auto-completion and meeting note expansion .
ALiiCE: Evaluating Positional Fine-grained Citation Generation (2025.naacl-long)

Copied to clipboard

Challenge: Existing research on citation generation is limited to sentence-level statements . positional fine-grained citations can appear anywhere within sentences .
Approach: They propose a framework that allows LLMs to generate citations from sentences . they use dependency tree-based methods to parse sentence-level claims into atomic claims .
Outcome: The proposed framework evaluates citation quality using three metrics including positional fine-grained citation recall, precision, and coefficient of variation of citation positions.
Distilling Large Embeddings via Hyperspherical Householder Quantization (2026.acl-long)

Copied to clipboard

Challenge: Existing methods for quantizing large embeddings rely on Euclidean quantization, which is poorly aligned with the angular geometry induced by contrastive embeddment training.
Approach: They propose a geometry-aware distillation method that compresses large embeddings into short discrete representations via iterative Householder transformations on the unit hypersphere.
Outcome: The proposed method reduces decoding cost and maintains strong semantic retrieval accuracy.
Judge as A Judge: Improving the Evaluation of Retrieval-Augmented Generation through the Judge-Consistency of Large Language Models (2025.findings-acl)

Copied to clipboard

Challenge: Existing evaluation metrics cannot fairly evaluate the outputs of RAG models during training and evaluation.
Approach: They propose a method which prompts LLMs to generate different judgments based on various combinations of judgment dimensions and utilizes the judge-consistency to evaluate these judgments.
Outcome: The proposed method generates more accurate evaluations for RAG models across different RAG model and datasets.
Two Streams, One Sarcasm: Orthogonal Expert Tuning for Holistic Multimodal Sarcasm Understanding (2026.acl-long)

Copied to clipboard

Challenge: Existing benchmarks for multimodal satirical cognition hinder evaluation of multimodal Sarcasm Understanding . lack of a unified benchmark for holistic satire cognition hampers evaluation of MSU .
Approach: They propose a framework to decouple experts into orthogonal shared perception and private execution streams to physically block gradient interference between tasks.
Outcome: The proposed framework achieves superior performance on DocMSU-PLUS.
Contrastive Distillation on Intermediate Representations for Language Model Compression (2020.emnlp-main)

Copied to clipboard

Challenge: Existing methods to compress language models use a simple L_2 loss to distill knowledge in the intermediate representations of a large BERT model to a smaller one.
Approach: They propose a method that uses knowledge distillation to distill knowledge through intermediate layers of the teacher via a contrastive objective.
Outcome: The proposed method outperforms state-of-the-art methods on the GLUE benchmark.
One Refiner to Unlock Them All: Inference-Time Reasoning Elicitation via Reinforcement Query Refinement (2026.acl-long)

Copied to clipboard

Challenge: Existing alignment methods for Large Language Models (LLMs) are expensive and lack the flexibility to fully activate their latent reasoning capabilities.
Approach: They propose a modular framework that treats reasoning elicitation as an inference-time alignment task.
Outcome: The proposed framework outperforms baselines by 2.1% on average across diverse architectures and benchmarks.
Beyond Sequences: Two-dimensional Representation and Dependency Encoding for Code Generation (2025.acl-long)

Copied to clipboard

Challenge: Existing code generation approaches represent code as a linear sequence of tokens, but positional encodings compromise generalization . explicit positional encoders sacrifice permutation invariance, imposes a strict order on the input sequence .
Approach: They propose to represent code snippets as two-dimensional entities with explicit encodings . they propose to use dictionary learning to perform semantic matching between code lines .
Outcome: The proposed model captures the hierarchical and spatial structure of code, especially the dependencies between code lines.
SRF: Enhancing Document-Level Relation Extraction with a Novel Secondary Reasoning Framework (2024.emnlp-main)

Copied to clipboard

Challenge: Existing methods for document-level relation extraction ignore bidirectional mention interaction when generating relational features for entity pairs.
Approach: They propose a document-level relation extraction model that incorporates bidirectional mention fusion and a simple yet effective evidence extraction module for relation prediction.
Outcome: The proposed model achieves SOTA performance and the proposed method is effective and general when integrated into existing models.
Curriculum Consistency Learning for Conditional Sentence Generation (2024.emnlp-main)

Copied to clipboard

Challenge: Consistency learning (CL) has proven to be a valuable technique for improving the robustness of conditional sentence generation models.
Approach: They propose a strategy that guides models to learn consistency in alignment with their current capacity to differentiate between features.
Outcome: The proposed strategy delivers +2.0 accuracy point improvement compared with vanilla IT and +0.7 COMET scores over traditional CL methods in MT tasks.
TabularMath: Understanding Math Reasoning over Tables with Large Language Models (2026.findings-acl)

Copied to clipboard

Challenge: Mathematical reasoning has long been a key benchmark for evaluating large language models.
Approach: They propose a framework that transforms math word problems into scalable tabular reasoning tasks.
Outcome: The proposed framework transforms math word problems into scalable and verified tabular reasoning tasks.
Spatial-Agent: Agentic Geo-spatial Reasoning with Scientific Core Concepts (2026.acl-long)

Copied to clipboard

Challenge: Existing LLM-based agents lack inherent spatial awareness, relying on web search or text matching while hallucinating spatial relationships.
Approach: They propose a spatial-based agent that can perform real-world geospatial computations . they use natural-language questions to parse into executable workflows based on geoFlow Graphs - directed acyclic graphs with nodes corresponding to spatial concepts and edges representing transformations.
Outcome: The proposed agent outperforms existing baselines on MapEval-API and MapQA benchmarks while producing interpretable and executable geospatial workflows.
Mitigating Boundary Ambiguity and Inherent Bias for Text Classification in the Era of Large Language Models (2024.findings-acl)

Copied to clipboard

Challenge: a new text classification framework for large language models addresses the problem of boundary ambiguity and inherent biases in LLMs.
Approach: They propose a two-stage classification framework for large language models to mitigate bottlenecks . their approach uses pairwise comparisons to efficiently narrow down options .
Outcome: The proposed framework reduces the number of options and improves on four datasets.
Exploiting Contextual Information via Dynamic Memory Network for Event Detection (D18-1)

Copied to clipboard

Challenge: Existing methods for event detection only process context once . a multi-hop mechanism to capture contextual information improves performance .
Approach: They propose to use dynamic memory network to capture contextual information . they propose to model event triggers by identifying word or phrase which most represents it .
Outcome: The proposed model achieves best F1 score compared to the state-of-the-art models.
Retaining Key Information under High Compression Ratios: Query-Guided Compressor for LLMs (2024.acl-long)

Copied to clipboard

Challenge: Existing methods to compress long contexts have degraded dramatically as compression ratios increase, sometimes even falling to the closed-book level.
Approach: They propose a query-guided compression method that preserves key information within the compressed context.
Outcome: The proposed method can consistently perform well even at high compression ratios, and offers significant benefits in terms of inference cost and throughput.
Discourse-Aware Neural Extractive Text Summarization (2020.acl-main)

Copied to clipboard

Challenge: Recent studies have shown that sentence-based extractive models result in redundant or uninformative phrases in the extracted summaries.
Approach: They propose a discourse-aware neural summarization model that extracts sub-sentential discourse units as candidates for extractive selection on a finer granularity.
Outcome: Experiments show that the proposed model outperforms state-of-the-art models on popular summarization benchmarks.
MPTc-Bench: Measuring Cross-market Generative Ability of Vision-Language Models via Movie Poster Transcreation (2026.findings-acl)

Copied to clipboard

Challenge: Recent work adapts textual transcreation to image editing and formulates image transcreations to better match a target audience while preserving meaning.
Approach: They propose a two-stage planner-editor pipeline in which an VLM planner specifies executable edits and an image editor renders them.
Outcome: The proposed model can transcreate a visual asset for a different market while preserving its identity while matching market-specific design preferences and multilingual typography.
Detoxification for LLM: From Dataset Itself (2026.acl-long)

Copied to clipboard

Challenge: Existing methods for large language models focus on post-training stage or inference time, while few tackle the source of toxicity, namely, the dataset itself.
Approach: They propose to localize and rewrite toxic spans in raw corpora with SoCD, which guides an LLM to localized and preserving semantics while preserving toxicity.
Outcome: The proposed method reduces TP from 0.42 to 0.18 and Expected Maximum Toxicity (EMT) from 0.43 to 0.20 on three LLMs.
SPIDE: Serial and Parallel Intertwined Speculative Decoding (2026.findings-acl)

Copied to clipboard

Challenge: Speculative decoding (SD) is a training-free SD framework that orchestrates dynamic alternation combining serial dynamic drafting with parallel draft verification.
Approach: They propose a serial and parallel intertwined speculative DEcoding framework that orchestrates dynamic alternation combining serial dynamic drafting and parallel draft verification.
Outcome: The proposed framework accelerates inference while reducing the LLM usage costs.
Reinforcement Learning with Token-level Feedback for Controllable Text Generation (2024.findings-naacl)

Copied to clipboard

Challenge: Existing methods for controllable text generation are guided by coarse-grained feedback, which may lead to suboptimal performance owing to semantic twists or progressions within sentences.
Approach: They propose a reinforcement learning algorithm which formulates TOken-LEvel rewards for controllable text generation and employs a "first-quantize-then-noise" paradigm to enhance the robustness of the RL algorithm.
Outcome: The proposed algorithm can achieve superior performance on single-attribute and multi-attract control tasks.
Enhancing Long-Chain Reasoning Distillation through Error-Aware Self-Reflection (2026.findings-acl)

Copied to clipboard

Challenge: Existing studies treat SLMs as student models and use long-form Chains-of-Thought (CoTs) as supervision signals for Supervised Fine-Tuning (SFT). Existing research focuses on distilling reasoning ability from LLMs to enhance the mathematical reasoning performance of small-scale models.
Approach: They propose a framework that refines teacher CoTs through an error-aware reflection process to enable the student model to construct more tailored teacher Cots.
Outcome: Experiments on multiple mathematical reasoning benchmarks show that ORION improves performance by more than 2% over all baselines.
SEE: Continual Fine-tuning with Sequential Ensemble of Experts (2025.findings-acl)

Copied to clipboard

Challenge: Continual fine-tuning of large language models suffers from catastrophic forgetting . some approaches use routers to assign tasks to experts, but continual learning often requires retraining .
Approach: They propose a framework that integrates routing and response mechanisms within each expert . it eliminates the need for an additional router and allows each expert to decide whether a query should be handled .
Outcome: The proposed framework outperforms previous approaches in continual fine-tuning . it can handle learning tasks and out-of-distribution instances, paving the way for distributed model ensembling.
Agent-in-the-Loop: A Data Flywheel for Continuous Improvement in LLM-based Customer Support (2025.emnlp-industry)

Copied to clipboard

Challenge: Existing offline approaches to improve an LLM-based customer support system rely on batch annotations.
Approach: They propose an agent-in-the-loop framework that integrates four key types of annotations directly into live customer operations: (1) pairwise response preferences, (2) agent adoption and rationales, (3) knowledge relevance checks, and (4) identification of missing knowledge.
Outcome: The proposed framework reduces retraining cycles from months to weeks by integrating four key types of annotations directly into live customer operations.
Multi-LLM Collaborative Search for Complex Problem Solving (2026.findings-acl)

Copied to clipboard

Challenge: Large language models (LLMs) often struggle with complex reasoning tasks due to the vast reasoning space inherent in the complexity and inherent ambiguities of natural languages.
Approach: They propose a mixture-of-search-agents paradigm that integrates diverse reasoning pathways by combining independent exploration and iterative refinement among multiple LLMs.
Outcome: The proposed approach improves performance over single-agent and multi-agend baselines in complex mathematical and commonsense reasoning tasks.
On Commonsense Cues in BERT for Solving Commonsense Tasks (2021.findings-acl)

Copied to clipboard

Challenge: Pre-trained language models can capture syntactic features, semantic information and factual knowledge, but structured commonsense knowledge is not captured well.
Approach: They quantitatively investigate the presence of structural commonsense cues in BERT when solving commonsensense tasks and the importance of such cue for the model prediction.
Outcome: The presence of commonsense knowledge is positively correlated to the model accuracy.
CoTEvol: Self-Evolving Chain-of-Thoughts for Data Synthesis in Mathematical Reasoning (2026.findings-acl)

Copied to clipboard

Challenge: Existing methods to improve LLMs' reasoning abilities suffer from diminishing returns or high computing overhead.
Approach: They propose a genetic evolutionary framework that casts CoT generation as a population-based search over reasoning trajectories.
Outcome: The proposed framework improves correct-CoT synthesis success by over 30% and enhances structural diversity with markedly improved efficiency.
Training a Utility-based Retriever Through Shared Context Attribution for Retrieval-Augmented Language Models (2025.emnlp-main)

Copied to clipboard

Challenge: Utility-based retrieval has emerged as a promising topic for downstream tasks . however, capturing passage utility accurately remains unexplored due to insufficient understanding .
Approach: They propose a framework for training utility-based retrievers in Retrieval-Augmented Language Models . it incorporates multi-task generalization and inter-passage interaction to improve performance .
Outcome: The proposed framework improves performance on ten datasets across different tasks.
CompileAgent: Automated Real-World Repo-Level Compilation with Tool-Integrated LLM-based Agent System (2025.acl-long)

Copied to clipboard

Challenge: CompileAgent is the first LLM-based agent framework dedicated to repo-level compilation.
Approach: They propose a LLM-based agent framework dedicated to repo-level compilation.
Outcome: The proposed method significantly improves compilation success rate, ranging from 10% to 71%.
AutoPKG: An Automated Framework for Dynamic E-commerce Product-Attribute Knowledge Graph Construction (2026.findings-acl)

Copied to clipboard

Challenge: Product attribute extraction in e-commerce is bottlenecked by ontologies that are inconsistent, incomplete, and costly to maintain.
Approach: They propose a multi-agent Large Language Model framework that constructs a Product-attribute Knowledge Graph from multimodal product content.
Outcome: The proposed framework achieves 0.953 WKE for product types, 0.724 WKEs for attribute keys, and 0.531 edge-level accuracy for value assertions after canonicalization on a large real-world marketplace catalog dataset from Lazada (Alibaba).
MARCH: Multi-Agent Reinforced Check for Hallucination (2026.acl-long)

Copied to clipboard

Challenge: Existing methods to detect hallucinations suffer from inherent confirmation bias, where the verifier inadvertently reproduces the errors of the original generation.
Approach: They propose a framework that enforces rigorous factual alignment by leveraging deliberate *information asymmetry* by combining a pipeline of three specialized agents: a Solver, a Proposer, and a Checker.
Outcome: Extensive experiments across hallucination benchmarks demonstrate that MARCH substantially reduces hallucinism rates.
TestAgent: An Adaptive and Intelligent Expert for Human Assessment (2025.findings-acl)

Copied to clipboard

Challenge: Existing adaptive testing methods face several challenges due to mechanized nature of most algorithms and noisy response data.
Approach: They propose to use large language models to enhance adaptive testing through interactive engagement to capture test-takers’ responses and anomalies.
Outcome: The proposed agent achieves more accurate results with 20% fewer questions than state-of-the-art baselines and testers preferred it in speed, smoothness, and other dimensions.
Unified Language Representation for Question Answering over Text, Tables, and Images (2023.findings-acl)

Copied to clipboard

Challenge: Existing approaches to answer complex questions are limited to text or structured data.
Approach: They propose a paradigm that transforms images and tables into unified language representations to simplify QA problems.
Outcome: The proposed framework outperforms existing methods on two datasets and the WebQA leaderboard.
On Large Language Models’ Hallucination with Regard to Known Facts (2024.naacl-long)

Copied to clipboard

Challenge: Large language models are successful in answering factoid questions but are also prone to hallucination.
Approach: They propose self-reporting to the model when faced with such limitations.
Outcome: The proposed classifier can detect hallucinations with an 88% success rate and can be used to answer factoid questions with correct answer knowledge.
Unsupervised Information Refinement Training of Large Language Models for Retrieval-Augmented Generation (2024.acl-long)

Copied to clipboard

Challenge: Existing studies show that LLMs face challenges in effectively using retrieved information . authors propose a method that considers LLM as "Information Refiner"
Approach: They propose a method that considers LLMs as "Information Refiners" they propose INFO-RAG, which is low-cost and general across various tasks .
Outcome: The proposed method improves performance of LLaMA2 by 9.39% relative points . it is low-cost and general across various tasks, and is robust and in-context learning is possible .
Training Language Model to Critique for Better Refinement (2025.findings-acl)

Copied to clipboard

Challenge: Large language models (LLMs) have remarkable evaluation and critique capabilities, providing insightful feedback and identifying flaws in various tasks.
Approach: They propose a framework to train critic models using refinement signals to generate feedback loops where critiques guide the model in refining its responses.
Outcome: The proposed framework outperforms traditional methods and open-source models in terms of critique quality and refinement outcomes.
A Good Prompt Is Worth Millions of Parameters: Low-resource Prompt-based Learning for Vision-Language Models (2022.acl-long)

Copied to clipboard

Challenge: Recent few-shot learning models such as GPT3 are expensive and slow to deploy for real-world applications.
Approach: They propose a prompt-based low-resource learning method for VL tasks with a few examples . they pre-train a sequence-to-sequence transformer model with prefix and masked language modeling .
Outcome: The proposed method outperforms Frozen on vision-language tasks with prompt-based learning by 18.2% point.
Training LLMs to be Better Text Embedders through Bidirectional Reconstruction (2025.emnlp-main)

Copied to clipboard

Challenge: Existing text embedding approaches often leverage the embeddment of the final token, typically a reserved special token such as ‘[EOS]‘.
Approach: They propose to add a new training stage before contrastive learning to enrich the semantics of the final token embedding.
Outcome: The proposed training stage improves performance on the Massive Text Embedding Benchmark (MTEB), achieving new state-of-the-art results across different LLM base models and scales.
Adversarial Category Alignment Network for Cross-domain Sentiment Classification (N19-1)

Copied to clipboard

Challenge: Existing methods for cross-domain sentiment classification focus on aligning marginal distribution without taking category-specific decision boundaries into consideration.
Approach: They propose an adversarial category alignment network to enhance category consistency . experimental results show the proposed method can achieve state-of-the-art performance .
Outcome: The proposed method achieves state-of-the-art performance and produces more discriminative features on benchmark datasets.
MetaMem: Evolving Meta-Memory for Knowledge Utilization through Self-Reflective Symbolic Optimization (2026.findings-acl)

Copied to clipboard

Challenge: Existing memory systems can support long-horizon human-LLM interactions by persisting historical interactions beyond limited context windows.
Approach: They propose a framework that augments memory systems with a self-evolving meta-memory . meta-meso is iteratively distilling transferable knowledge utilization experiences . results show MetaMem outperforms strong baselines by over 3.6% .
Outcome: The proposed framework outperforms baselines by over 3.6% in the long-horizon human-LLM interaction.
Feature Structure Matching for Multi-source Sentiment Analysis with Efficient Adaptive Tuning (2024.lrec-main)

Copied to clipboard

Challenge: Existing domain matching methods tend to pull all feature instances close, but they are expensive and expensive to update.
Approach: They propose to extract multi-layer features from a large pre-trained model and propose a dynamic parameter fusion module to exploit them for efficient and adaptive tuning.
Outcome: The proposed framework is more robust and generalizable in the multi-source scenario.
SpeechIQ: Speech-Agentic Intelligence Quotient Across Cognitive Levels in Voice Understanding by Large Language Models (2025.acl-long)

Copied to clipboard

Challenge: SIQ quantifies voice understanding abilities and provides unified comparisons between cascaded methods and end-to-end models.
Approach: They propose a human cognition-inspired evaluation pipeline for voice understanding large language models (LLM_Voice) that quantifies voice understanding abilities and provides unified comparisons between cascaded methods and end-to-end models.
Outcome: The proposed framework quantifies voice understanding abilities and provides unified comparisons between cascaded methods and end-to-end models, identifies annotation errors in existing benchmarks, and detects hallucinations in LLM_Voice.
Intent-Driven Semantic ID Generation for Grounded Conversational News Recommendation (2026.acl-industry)

Copied to clipboard

Challenge: a new approach to news recommendation grounds each suggestion in a rapidly evolving article corpus while addressing implicit user intents that lack explicit retrievable keywords.
Approach: They propose an intent-driven Semantic ID generation paradigm to address these challenges . they map diverse intents to hierarchical SID prefixes and then fuzzy-match them to current news pool .
Outcome: The proposed model achieves 0% hallucination and 12.4% L1 match on a mainstream Chinese news platform.
OmniFlatten: An End-to-end GPT Model for Seamless Voice Conversation (2025.acl-long)

Copied to clipboard

Challenge: Full-duplex spoken dialogue systems allow simultaneous bidirectional communication . low latency and natural interactions in full-duplice systems remains a challenge .
Approach: They propose a multi-stage post-training scheme that adapts a text large language model into a speech-text dialogue LLM.
Outcome: The proposed model can model human conversation behaviors with low latency and natural interactions with low delay.
Breaking the Generator Barrier: Disentangled Representation for Generalizable AI-Text Detection (2026.acl-long)

Copied to clipboard

Challenge: a rapid proliferation of large language models (LLMs) generate text that increasingly resembles human writing . this makes it difficult to capture subtle cues that distinguish AI-generated content from human-written content .
Approach: They propose a framework that disentangles AI-detection semantics from generator-aware artifacts by latent encoding and perturbation-based regularization.
Outcome: The proposed framework disentangles AI-detection semantics from generator-aware artifacts on 20 representative LLMs across 7 categories.
Natural-Language Policies to Executable Decisions: An Interpretable Large Language Model Framework (2026.acl-industry)

Copied to clipboard

Challenge: a production-grade pricing system for tourism is challenging due to unstructured nature of travel orders and ever-evolving pricing policies.
Approach: They propose a production-grade pricing system with a strict decision boundary . they propose to combine structured extraction and bounded policy/path selection with interpretable condition trees .
Outcome: The proposed system processed 3,960 orders in six months and reduced the order management team from 15-20 to 3 . the system reduced the per-order handling time from 10 minutes to 2 minutes.
MoE-I2: Compressing Mixture of Experts Models through Inter-Expert Pruning and Intra-Expert Low-Rank Decomposition (2024.findings-emnlp)

Copied to clipboard

Challenge: emergence of Mixture of Experts (MoE) LLMs has significantly advanced the development of language models.
Approach: They propose a two-stage compression method tailored for Mixture of Experts to reduce the model size and decrease the computational cost.
Outcome: The proposed method reduces model size and improves inference efficiency while maintaining performance in various zero-shot tasks.
Geometric Signatures of Compositionality Across a Language Model’s Lifetime (2025.acl-long)

Copied to clipboard

Challenge: linguistic compositionality allows atoms to locally combine to create global meaning . a rich array of meanings at the level of a phrase may be explained by simple rules of composition.
Approach: They propose to relate the degree of compositionality in a dataset to the intrinsic dimension of its representations under an LM, a measure of feature complexity.
Outcome: The proposed model is based on a geometric view of the compositionality of a dataset and the intrinsic dimension of its representations under an LM.
ProphetNet-X: Large-Scale Pre-training Models for English, Chinese, Multi-lingual, Dialog, and Code Generation (2021.acl-demo)

Copied to clipboard

Challenge: Existing models for pre-training are not convenient for users to find and set them up.
Approach: They propose to extend ProphetNet into other domains and languages by pre-training models . they pre-train a cross-lingual generation model ProphetNet-Multi and a Chinese generation model .
Outcome: The proposed models achieve new state-of-the-art on 10 benchmarks.
APT: Improving Specialist LLM Performance with Weakness Case Acquisition and Iterative Preference Training (2025.findings-acl)

Copied to clipboard

Challenge: Large Language Models often require domain-specific fine-tuning to address targeted tasks, which risks degrading their general capabilities.
Approach: They propose to use self-generated dis-preferred weakness data to enhance model performance with a targeted training approach that minimizes interference with existing knowledge base.
Outcome: The proposed approach ensures no reduction in generic capacity and achieves superior performance on downstream tasks compared to existing methods.
Text2Sql: Pure Fine-Tuning and Pure Knowledge Distillation (2025.naacl-industry)

Copied to clipboard

Challenge: Text2Sql is a task that translates natural language questions and database schemas into SQL queries.
Approach: They employ pure fine-tuning strategy to reduce redundancy by using only 53% of the baseline prompt length to fine- tune the model.
Outcome: The model outperforms the baseline model by 8.2% and 8.6% in Test-suite accuracy (TS) and exact-set-match accuracy (EM) under the most refined Spider dev set of prompts, the model achieves 73.5% and 75.4%, respectively, approaching state-of-the-art (SOTA) levels.
Understanding the Behaviors of Environment-aware Information Retrieval (2026.acl-long)

Copied to clipboard

Challenge: Recent retrieval-augmented generation approaches have demonstrated strong capability in handling complex queries.
Approach: They propose a branching-based rollout technique that improves training stability . they find different retrievers exhibit distinct optimal query styles .
Outcome: The proposed method improves training stability and improves retrieval-aware systems.
Entity Pair-guided Relation Summarization and Retrieval in LLMs for Document-level Relation Extraction (2025.findings-naacl)

Copied to clipboard

Challenge: Document-level relation extraction (DocRE) aims to extract relations between entities in a document.
Approach: They propose an entity pair-guided relation summarization and retrieval model for DocRE . the model uses entity pairs to guide relation summaries and retrievals .
Outcome: The proposed model achieves state-of-the-art (SOTA) performance on three datasets.
IAM: A Comprehensive and Large-Scale Dataset for Integrated Argument Mining Tasks (2022.acl-long)

Copied to clipboard

Challenge: Argument mining (AM) is a computational process that is used to analyze information in a debating system.
Approach: They propose to use a large dataset to automate the manual process of debating . they propose to integrate claim extraction, stance classification and evidence extraction tasks .
Outcome: The proposed tasks can extract claims, stances, evidence and more from a large dataset . the proposed tasks are highly efficient and can be applied to argument mining tasks .
Refining Sample Embeddings with Relation Prototypes to Enhance Continual Relation Extraction (2021.acl-long)

Copied to clipboard

Challenge: Existing methods to extract relationships from texts depend on memory size and replay these memorized samples in subsequent tasks.
Approach: They propose to use a model to extract relations between entities from texts where the samples of different relations are delivered into the model continuously.
Outcome: The proposed model outperforms the state-of-the-art models and avoids catastrophic forgetting.
OS-Symphony: A Holistic Framework for Robust and Generalist Computer-Using Agents (2026.acl-long)

Copied to clipboard

Challenge: Vision-Language Models (VLMs) lack visual-aware tutorial retrieval and historical visual context curation and pruning.
Approach: They propose a framework that integrates an orchestrator and a Reflection-Memory Agent for robust automation.
Outcome: Experimental results show that OS-Symphony delivers substantial performance gains across model scales.
Cross-Thought for Sentence Encoder Pre-training (2020.emnlp-main)

Copied to clipboard

Challenge: Existing models to pretrain sentence encoders with large unlabeled corpus are lacking in linguistic information retrieval.
Approach: They propose a novel approach to pre-training sequence encoder using transformers . they propose to train a Transformer-based sequence encoded over a large set of short sequences based on a set of masked words .
Outcome: The proposed approach outperforms state-of-the-art encoders on hotpotQA by improving intermediate information retrieval performance.
Safety in Large Reasoning Models: A Survey (2025.findings-emnlp)

Copied to clipboard

Challenge: Large Reasoning Models (LRMs) have a high level of advanced reasoning capabilities, but they are vulnerable and vulnerable.
Approach: This paper presents the first comprehensive survey of Large Reasoning Models . it explores the new safety risks, attacks, and defense strategies specific to LRMs based on reasoning .
Outcome: The proposed study examines the safety and security risks of large reasoning models.
Chain-of-Skills: A Configurable Model for Open-Domain Question Answering (2023.acl-long)

Copied to clipboard

Challenge: Using customized retrieval models, model transferability and scalability are limited.
Approach: They propose a modular retrieval model where individual modules correspond to key skills that can be reused across datasets.
Outcome: The proposed model outperforms self-supervised retrievers in zero-shot evaluations and achieves state-of-the-art fine-tuned retrieval performance on NQ, HotpotQA and OTT-QA.
A Visual Attention Grounding Neural Model for Multimodal Machine Translation (D18-1)

Copied to clipboard

Challenge: Existing approaches to multimodal machine translation do not integrate visual information into the translation process.
Approach: They propose a multimodal machine translation model that utilizes parallel visual and textual information.
Outcome: The proposed model outperforms existing methods on the Multi30K and Ambiguous COCO datasets.
How do autoregressive transformers solve full addition? (2025.emnlp-main)

Copied to clipboard

Challenge: Large pre-trained language models have demonstrated impressive capabilities, but there is still much to learn about how they operate.
Approach: They investigate the ability of the autoregressive transformer to perform basic addition operations by using causal analysis to find that a few different attention heads in the middle layers control the addition carry . they found that due to the lack of global focus on the sequence within these attention heads, the model struggles to handle long-sequence addition tasks.
Outcome: The model performs basic addition tasks, but it still faces challenges with length generalization.
AndroidLab: Training and Systematic Benchmarking of Android Autonomous Agents (2025.acl-long)

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.
Linking Knowledge to Care: Knowledge Graph-Augmented Medical Follow-Up Question Generation (2026.findings-eacl)

Copied to clipboard

Challenge: Existing large language models (LLMs) fail to identify information gaps across diverse symptoms.
Approach: They propose a Knowledge Graph-augmented LLM with active in-context learning to generate relevant and important follow-up questions.
Outcome: The proposed framework outperforms state-of-the-art methods by 5% - 8% on relevant benchmarks.
Living in the Moment: Can Large Language Models Grasp Co-Temporal Reasoning? (2024.acl-long)

Copied to clipboard

Challenge: Current temporal reasoning datasets are limited to questions about single or isolated events, falling short in mirroring the realistic temporal characteristics involving concurrent nature and intricate temporal interconnections.
Approach: They propose a co-temporal Question Answering benchmark that contains four co-time scenarios with 4,748 samples for evaluating the co-timing abilities of large language models.
Outcome: The proposed benchmarks show that current LLMs struggle on CoTempQA tasks even when enhanced with Chain of Thought methodologies.
Auto-Stega: An Agent-Driven System for Lifelong Strategy Evolution in LLM-Based Text Steganography (2026.findings-acl)

Copied to clipboard

Challenge: prevailing methods rely on hand-crafted or pre-specified strategies and struggle to balance efficiency, imperceptibility, and security, particularly at high embedding rates.
Approach: They propose an agent-driven self-evolving framework that is the first to realize self-changing steganographic strategies by automatically discovering, composing, and adapting strategies at inference time.
Outcome: The proposed framework achieves 42.2% perplexity and 1.6% anti-steganalysis performance over SOTA methods at high embedding rates.
Learning to Evolve: A Self-Improving Framework for Multi-Agent Systems via Textual Parameter Graph Optimization (2026.findings-acl)

Copied to clipboard

Challenge: Existing methods for designing and optimizing multi-agent systems are static and do not learn from experience.
Approach: They propose a framework that enables a multi-agent system to learn to evolve . they use "textual gradients" to pinpoint failures and suggest granular modifications .
Outcome: a new framework enables a multi-agent system to learn to evolve . it learns from historical optimization experiences to improve its performance .
OS-Genesis: Automating GUI Agent Trajectory Construction via Reverse Task Synthesis (2025.acl-long)

Copied to clipboard

Challenge: Graphical User Interface (GUI) agents powered by Vision-Language Models (VLMs) have demonstrated human-like computer control capability.
Approach: They propose a GUI data synthesis pipeline that reverse engineers GUI trajectory construction process by executing pre-defined tasks.
Outcome: The proposed GUI data synthesis pipeline overcomes the bottlenecks of previous methods that rely on pre-defined tasks and limited data diversity.
Look, Compare, Decide: Alleviating Hallucination in Large Vision-Language Models via Multi-View Multi-Path Reasoning (2025.coling-main)

Copied to clipboard

Challenge: Large Vision-Language Models (LVLMs) have impressive capabilities in multi-modal context comprehension, but they still suffer from hallucination problems due to inconsistent outputs with the image content.
Approach: They propose a training-free framework MVP to reduce hallucinations in Large Vision-Language Models . they propose multi-view information-seeking strategy to perceive the comprehensive information in the image .
Outcome: The proposed framework reduces hallucinations in large vision-language models by combining multi-view multi-path reasoning with multi-vision multi-path reasoning.
RepoShapley: Shapley-Enhanced Context Filtering for Repository-Level Code Completion (2026.findings-acl)

Copied to clipboard

Challenge: Large language models have strong reasoning, coding, and generation capabilities, but retrieval-augmented generation remains difficult under fixed context budgets.
Approach: They propose a coalition-aware context filtering framework supervised by Shapley-style marginal contributions that captures sign effects via teacher-forced probing and computes exact Shaply values for small retrieval sets.
Outcome: Experiments show that RepoShapley improves completion quality while reducing harmful context and unnecessary retrieval.
InfuserKI: Enhancing Large Language Models with Knowledge Graphs via Infuser-Guided Knowledge Integration (2024.findings-emnlp)

Copied to clipboard

Challenge: Large Language Models have exceptional capabilities in open generation, yet they encounter difficulties with tasks that require intensive knowledge.
Approach: They propose a framework that integrates unknown knowledge into LLMs without overlap . they propose integrating domain-specific knowledge graphs into Llms to reduce knowledge forgetting .
Outcome: The proposed framework outperforms state-of-the-art baselines in integrating new knowledge into LLMs.
Language-aware Interlingua for Multilingual Neural Machine Translation (2020.acl-main)

Copied to clipboard

Challenge: Existing multilingual neural machine translation models fail to capture diversity and specificity of different languages, resulting in inferior performance against individual models that are sufficiently trained.
Approach: They propose to integrate a language-aware interlingua into an Encoder-Decoder architecture to learn a semantic representation from the semantic spaces of different languages while allowing for language-specific specialization of a particular language pair.
Outcome: The proposed model achieves remarkable improvements over state-of-the-art multilingual NMT models and produces comparable performance with strong individual models.
PRMBench: A Fine-grained and Challenging Benchmark for Process-Level Reward Models (2025.acl-long)

Copied to clipboard

Challenge: Recent large language models (LLMs) have achieved significant performance in complex reasoning tasks such as mathematics and code generation.
Approach: They propose a process-level benchmark specifically designed to assess the fine-grained error detection capabilities of PRMs.
Outcome: The proposed model measures the accuracy, soundness, and sensitivity of 25 models across open-source and closed-source large language models.
Multi-step Reasoning via Recurrent Dual Attention for Visual Dialog (P19-1)

Copied to clipboard

Challenge: Existing models for visual dialog infer the answer through multiple reasoning steps.
Approach: They propose a model for visual dialog that uses multi-step reasoning to answer questions about an image.
Outcome: The proposed model achieves a new state-of-the-art of 64.47% on the VisDial v1.0 dataset .
Position Really Matters: Towards a Holistic Approach for Prompt Tuning (2025.findings-naacl)

Copied to clipboard

Challenge: Prompt tuning is effective in extracting knowledge from foundation models, but its effectiveness is uncertain.
Approach: They propose a parametric prompt tuning strategy that dynamically determines different factors of prompts based on specific tasks or instances.
Outcome: The proposed approach improves performance across a wide range of tasks including NLP, vision recognition, and vision-language tasks.
Investigating Hallucinations in Simultaneous Machine Translation: Knowledge Distillation Solution and Components Analysis (2025.naacl-long)

Copied to clipboard

Challenge: Existing methods to mitigate hallucinations in siMT generate fluency but unfaithful translation.
Approach: They propose a method that utilizes the OMT model to mitigate hallucinations in SiMT.
Outcome: The proposed method reduces hallucinations and improves the SiMT performance.
Language Model Based Text-to-Audio Generation: Anti-Causally Aligned Collaborative Residual Transformers (2025.emnlp-main)

Copied to clipboard

Challenge: Autoregressive language models excel in text-to-audio generation, but lag behind diffusion models by a non-trivial margin.
Approach: They propose a framework that integrates multiple isolated transformers with causal conditioning and anti-causal alignment via reinforcement learning.
Outcome: The proposed framework outperforms existing LM-based and diffusion-based systems in audio synthesis.
Confidence is not Timeless: Modeling Temporal Validity for Rule-based Temporal Knowledge Graph Forecasting (2024.acl-long)

Copied to clipboard

Challenge: Existing literature on temporal knowledge Graph Forecasting lacks in-depth investigation into how confidence evolves with time.
Approach: They propose a framework to model the temporal validity of rules for Temporal Knowledge Graph Forecasting (TKGF) they propose rule-adversarial negative sampling and time-aware negative sampling strategies to facilitate TempValid learning.
Outcome: The proposed framework outperforms state-of-the-art (SOTA) rule-based methods on six TKGF datasets.
A Symmetric Local Search Network for Emotion-Cause Pair Extraction (2020.coling-main)

Copied to clipboard

Challenge: Existing methods for Emotion-cause pair extraction are not effective because of their lack of annotation.
Approach: They propose a new task which aims at extracting the potential clause pairs of emotions and corresponding causes in a document.
Outcome: The proposed method outperforms existing state-of-the-art methods on the ECPE corpus.
SeaPO: Strategic Error Amplification for Robust Preference Optimization of Large Language Models (2025.findings-emnlp)

Copied to clipboard

Challenge: Existing methods for preference optimization of large language models use pairs of positive and negative samples, but the quality of positive samples may become similar during training, complicating preference learning.
Approach: SeaPO introduces error types commonly occurring in large language models to improve preference learning.
Outcome: SeaPO introduces error types into model Preference Optimization to improve model performance . negative samples are more erroneous than positive samples, and preference-based training mitigates errors .
UltraIF: Advancing Instruction Following from the Wild (2025.emnlp-main)

Copied to clipboard

Challenge: a lack of transparency has resulted in a gap between research community and leading companies . large language models have demonstrated remarkable capabilities in following complex instructions .
Approach: They propose a method to build large language models that can follow complex instructions with open-source data.
Outcome: The proposed approach can synergize complex instructions and filter responses with evaluation questions.
VocalNet: Speech LLMs with Multi-Token Prediction for Faster and High-Quality Generation (2025.emnlp-main)

Copied to clipboard

Challenge: Experimental results show VocalNet outperforms existing open-source speech LLMs despite limited training data.
Approach: They propose a scalable and model-agnostic training framework and a novel multi-token prediction paradigm for speech generation.
Outcome: The proposed model outperforms open-source speech LLMs while outperforming existing open-sourced models.
HumT DumT: Measuring and controlling human-like language in LLMs (2025.acl-long)

Copied to clipboard

Challenge: Human-like language might improve user experience, but might also lead to deception, overreliance, and stereotyping.
Approach: They introduce HumT and SocioT, metrics for human-like tone in LLM outputs . HumT measures human-type tone and other dimensions of social perceptions in text data .
Outcome: The proposed method reduces human-like tone while preserving model performance.
Enabling Agents to Communicate Entirely in Latent Space (2026.acl-long)

Copied to clipboard

Challenge: Natural language is the de facto communication medium for LLM-based agents, but it presents a fundamental constraint . natural language downsampling limits the depth and nuance of information that can be transmitted . et al.: inter-agent latent space communication is a promising paradigm for solving complex tasks .
Approach: They propose a paradigm that leverages the last hidden states of an LLM as a representation of its thought for direct communication.
Outcome: The proposed paradigm outperforms fine-tuned chain-of-thought prompting and single-agent baselines even across heterogeneous models.
DSEE: Dually Sparsity-embedded Efficient Tuning of Pre-trained Language Models (2023.acl-long)

Copied to clipboard

Challenge: Conventional fine-tuning works through updating all of the parameters in the pre-trained model, but as the size of pre-train models grows, it can be time-consuming and computationally expensive.
Approach: They propose a framework for resource- and parameter-efficient fine-tuning by leveraging the sparsity prior in both weight updates and the final model weights.
Outcome: The proposed framework saves 25% inference FLOPs while maintaining competitive downstream performance.
Clues Before Answers: Generation-Enhanced Multiple-Choice QA (2022.naacl-main)

Copied to clipboard

Challenge: Multiple-choice question answering (MCQA) uses text-to-text framework . but, there is an under-utilization of the decoder and knowledge that can be decoded .
Approach: They propose a generative multiple-choice question answering model which generates a clue from the question and leverages it to enhance a reader for MCQA.
Outcome: The proposed model outperforms text-to-text models on multiple MCQA datasets.
Leave No Document Behind: Benchmarking Long-Context LLMs with Extended Multi-Doc QA (2024.emnlp-main)

Copied to clipboard

Challenge: Existing benchmarks for evaluating long-context language models employ irrelevant noise texts to artificially extend the length of test cases, diverging from the real-world scenarios of long-constituency applications.
Approach: They propose a long-context benchmark, Loong, aligning with realistic scenarios through extended multi-document question answering (QA) .
Outcome: The proposed model can scale up the context window of large language models to perform in-depth analysis of multiple long documents.
Projecting Out the Malice: A Global Subspace Approach to LLM Detoxification (2026.acl-long)

Copied to clipboard

Challenge: Large language models (LLMs) exhibit exceptional performance but pose inherent risks of generating toxic content.
Approach: They propose a method that removes toxic subspaces from FFN parameters . they propose to use a lightweight method to eliminate toxic subespaces .
Outcome: The proposed method achieves SOTA detoxification while preserving general capabilities without large-scale retraining.
Multimodal Instruction Tuning with Conditional Mixture of LoRA (2024.acl-long)

Copied to clipboard

Challenge: Multimodal Large Language Models (MLLMs) have demonstrated proficiency in diverse tasks across different domains.
Approach: They propose a method that integrates multimodal instruction tuning with Conditional Mixture-of-LoRA.
Outcome: Experimental results show that MixLoRA outperforms LoRA with the same or higher ranks . MLLMs have demonstrated remarkable proficiency in diverse tasks across domains .
Interactive Evolution: A Neural-Symbolic Self-Training Framework For Large Language Models (2025.acl-long)

Copied to clipboard

Challenge: Existing methods to fine-tune Large Language Models without human annotations are lacking in the field of natural language training.
Approach: They propose an environment-guided neural-symbolic self-training framework to overcome two main challenges: the scarcity of symbolic data and the limited proficiency of LLMs in processing symbolic language.
Outcome: The proposed framework overcomes two main challenges: the scarcity of symbolic data, and the limited proficiency of LLMs in processing symbolic language.
EnAnchored-X2X: English-Anchored Optimization for Many-to-Many Translation (2025.emnlp-main)

Copied to clipboard

Challenge: Large language models (LLMs) have demonstrated strong machine translation capabilities for English-centric language pairs but underperform in direct non-English (x2x) translation.
Approach: They propose a synthetic data generation framework that leverages models’ established English-to-x (en2x) capabilities by extending English parallel corpora into omnidirectional datasets and developing an English-referenced quality evaluation proxy.
Outcome: The proposed framework achieves significant improvement across 72 x2x directions while generalizing to enhance en2x performance.
Don’t Eclipse Your Arts Due to Small Discrepancies: Boundary Repositioning with a Pointer Network for Aspect Extraction (2020.acl-main)

Copied to clipboard

Challenge: Existing aspect extraction methods suffer from boundary errors, but they hurt performance severely.
Approach: They propose to use a pointer network to reposition the boundaries of extracted aspects . they conduct experiments on laptop and restaurant benchmark datasets .
Outcome: The proposed method outperforms state-of-the-art methods on benchmark datasets . it achieves substantial improvements over baseline and outperformed existing methods .
APo-VAE: Text Generation in Hyperbolic Space (2021.naacl-main)

Copied to clipboard

Challenge: Existing models that learn embeddings only in Euclidean vector space do not account for such structural property of language.
Approach: They propose a Poincare Variational Autoencoder to capture latent hierarchies in hyperbolic space . they propose enabling adversarial learning procedures to empower robust model training .
Outcome: The proposed model outperforms existing models in a hyperbolic latent space . it captures latent language hierarchies in hyperbolical space and is robust to training .
TLUE: A Tibetan Language Understanding Evaluation Benchmark (2025.emnlp-main)

Copied to clipboard

Challenge: Low-resource languages, like Tibetan, remain underrepresented in large language models' evaluations.
Approach: They propose a Tibetan Language Understanding Evaluation Benchmark to assess LLMs' proficiency in Tibetan . they use a multi-task understanding benchmark and a safety benchmark to evaluate models .
Outcome: The proposed benchmark shows that most large language models perform below the random baseline, especially in Tibetan language processing.
Hanfu-Bench: A Multimodal Benchmark on Cross-Temporal Cultural Understanding and Transcreation (2025.emnlp-main)

Copied to clipboard

Challenge: Existing studies on cultural understanding with vision-language models primarily emphasize geographic diversity, often overlooking the critical temporal dimensions.
Approach: They propose a multimodal vision-language model that examines temporal features and cultural image transcreation.
Outcome: The novel model performs better than non-experts on visual cutural understanding but falls short to human experts on cultural image transcreation task.
DeepSieve: Information Sieving via LLM-as-a-Knowledge-Router (2026.findings-eacl)

Copied to clipboard

Challenge: Existing RAG methods lack fine-grained control over query and source sides, resulting in noisy retrieval and shallow reasoning.
Approach: They propose an agentic RAG framework that integrates information sieving via LLM-as-a-knowledge-router.
Outcome: Experiments on multi-hop QA tasks across heterogeneous sources demonstrate improved reasoning depth, retrieval precision, and interpretability over conventional approaches.
Bacteria Biotope Relation Extraction via Lexical Chains and Dependency Graphs (D19-57)

Copied to clipboard

Challenge: In this paper, we describe our approach for the Bacteria Biotopes relation extraction subtask in the BioNLP Shared Task 2019 .
Approach: They propose a novel approach for dependency graph construction based on lexical chains . they then propose 'neuro network' model which uses short-term memories and syntax information .
Outcome: The proposed approach achieves the best F1 (66.3%) in the official evaluation participated by 7 teams.
Serial Lifelong Editing via Mixture of Knowledge Experts (2025.acl-long)

Copied to clipboard

Challenge: Existing Lifelong Knowledge Editing methods struggle to overwrite outdated knowledge with the latest one.
Approach: They propose a new Mixture-of-Knowledge-Experts scheme with an ARM . ARM ensures that each update completely overwrites old information with the latest one . Experimental results show that ARM performs favorably against SOTA knowledge editing methods .
Outcome: The proposed scheme overwrites old knowledge with the latest data on a benchmark . it performs favorably against existing knowledge editing methods on the same concept .
Conversational Semantic Parsing for Dialog State Tracking (2020.emnlp-main)

Copied to clipboard

Challenge: Language understanding for task-based dialog systems is often termed "dialog state tracking" (DST) whereas semantic parsing is the task of converting a single-turn utterance to a graphstructured meaning representation, DST is more complex.
Approach: They propose a framework for dialog state tracking that incorporates semantic compositionality, cross-domain knowledge sharing and co-reference.
Outcome: The proposed framework improves on state-of-the-art approaches for dialog state tracking (DST) it incorporates semantic compositionality, cross-domain knowledge sharing and co-reference.
Domain Adaptive Text Style Transfer (D19-1)

Copied to clipboard

Challenge: Text style transfer without parallel data is a promising method for learning, but in the scenario where less data is available, it may yield poor performance.
Approach: They propose to leverage available data to learn domain-adaptive text style transfer models . they evaluate two style transfer tasks where only limited non-parallel data is available .
Outcome: The proposed models learn from the source domain to: (i) distinguish stylized information and generic content information; (ii) maximally preserve content information and (iv) adaptively transfer the styles in a domain-aware manner.
Improving Domain Generalization for Prompt-Aware Essay Scoring via Disentangled Representation Learning (2023.acl-long)

Copied to clipboard

Challenge: Existing AES models are either prompt-specific or prompt-adaptive and cannot generalize well on “unseen” prompts.
Approach: They propose a prompt-aware neural AES model to extract comprehensive representation for essay scoring, including both prompt-invariant and prompt-specific features.
Outcome: The proposed model extracts comprehensive representation for essay scoring, including both prompt-invariant and prompt-specific features.
Hierarchical Reinforcement Learning with Augmented Step-Level Transitions for LLM Agents (2026.acl-long)

Copied to clipboard

Challenge: Existing Large language model agents rely on increasingly long interaction histories, resulting in high computational cost and limited scalability.
Approach: They propose a hierarchical reinforcement learning framework that enables step-level learning by conditioning only on single-step transitions rather than full interaction histories.
Outcome: The proposed framework outperforms baselines on ScienceWorld and ALFWorld benchmarks in terms of performance and generalization while reducing token usage.
Rethinking the Video Sampling and Reasoning Strategies for Temporal Sentence Grounding (2022.findings-emnlp)

Copied to clipboard

Challenge: Existing methods for temporal sentence grounding ignore two crucial issues . 1) Boundary-bias: the video downsampling process may lose these two frames . 2) Reasoning-biases: such incorrect new boundary frames lead to the reasoning bias .
Approach: They propose a siamese sampling mechanism to generate additional contextual frames . they use a reasoning strategy to learn the inter-relationship among these frames a .
Outcome: Extensive experiments demonstrate the effectiveness of a new siamese sampling network on three challenging datasets.
Towards Robust Temporal Activity Localization Learning with Noisy Labels (2024.lrec-main)

Copied to clipboard

Challenge: Existing methods for temporal activity localization are expensive and difficult to satisfy due to subjective labeling.
Approach: They propose a new TAL setting where a TAL model should be robust to mixed training data with noisy moment boundaries.
Outcome: The proposed method is significantly more robust to noisy training data than existing methods.
E-ABSA20K: A Dataset and Propose-and-Verify for Aspect-Based Sentiment Analysis in Long E-commerce Reviews (2026.findings-acl)

Copied to clipboard

Challenge: Aspect-based Sentiment Analysis (ABSA) is critical for extracting actionable product insights from e-commerce reviews.
Approach: They propose a framework that decomposes ABSA into two stages to extract review-level quadruple reviews from 20K reviews from four product categories.
Outcome: The proposed framework outperforms existing benchmarks and single-stage prompting and competitive ABSA extraction baselines.
Multi-Agent Procedural Graph Extraction with Structural and Logical Refinement (2026.findings-eacl)

Copied to clipboard

Challenge: Recent advances in large language models (LLMs) show potential for graph extraction, but often yield ill-formed structures or misinterpret logical constructs such as gateways.
Approach: They propose a framework that treats procedural graph extraction as a multi-round reasoning process with structural and logical refinement agents.
Outcome: The proposed framework achieves significant improvements in structural correctness and logical consistency over strong baselines.
TRANS-ZERO: Self-Play Incentivizes Large Language Models for Multilingual Translation Without Parallel Data (2025.findings-acl)

Copied to clipboard

Challenge: Large Language Models (LLMs) have reshaped machine translation, but multilingual MT still relies heavily on parallel data for supervised fine-tuning.
Approach: They propose a framework that leverages only monolingual data and the intrinsic multilingual knowledge of Large Language Models (LLMs).
Outcome: The proposed framework matches models trained on large-scale parallel data and excels in non-English translation directions.
Evaluating the Expressive Appropriateness of Speech in Rich Contexts (2026.acl-long)

Copied to clipboard

Challenge: Existing methods for evaluating expressive speech focus on word accuracy, naturalness, signal quality, or emotional intensity at the utterance level.
Approach: They propose a framework for Evaluating Expressive Appropriateness in speech that assesses whether a speech sample aligns with the underlying communicative intent implied by its discourse-level narrative context.
Outcome: The proposed framework outperforms existing speech evaluation and analysis systems on a human-annotated test set.
Patient Knowledge Distillation for BERT Model Compression (D19-1)

Copied to clipboard

Challenge: Pre-trained language models such as BERT have proven to be highly effective for natural language processing tasks, but the high demand for computing resources hinders their application in practice.
Approach: They propose to compress an original large model (teacher) into an equally-effective lightweight shallow network (student) Empirically, this translates into improved results on multiple NLP tasks with a significant gain in training efficiency, without sacrificing model accuracy.
Outcome: The proposed model reduces the computational cost of training models using the teacher model into a lightweight shallow network.
TSPO: Breaking the Double Homogenization Dilemma in Multi-turn Search Policy Optimization (2026.findings-acl)

Copied to clipboard

Challenge: Large Language Models (LLMs) can solve complex tasks through iterative information retrieval.
Approach: They propose a turn-level stage-aware policy optimization approach to solve this problem . they introduce a first-occurrence latent reward mechanism to allocate partial rewards .
Outcome: Experiments show that TSPO outperforms state-of-the-art models on Qwen2.5-3B and 7B models.
AlignMMBench: Evaluating Chinese Multimodal Alignment in Large Vision-Language Models (2025.acl-long)

Copied to clipboard

Challenge: Existing benchmarks focus on basic abilities using nonverbal methods, such as yes-no and multiple-choice questions.
Approach: They propose a benchmark that provides more nuanced evaluations of alignment capabilities for large Vision-Language Models (VLMs) they use a rule-calibrated evaluator that exceeds GPT-4's evaluation ability and a “alignment score” to assess the robustness and stability of models across diverse prompts.
Outcome: The proposed benchmark covers 13 tasks across three categories and includes both single-turn and multi-turn dialogue scenarios.
SemAttack: Natural Textual Attacks via Different Semantic Spaces (2022.findings-naacl)

Copied to clipboard

Challenge: Existing approaches to attack pre-trained language models suffer from low success rates or fail to search efficiently in the exponentially large perturbation space.
Approach: They propose an efficient framework to generate natural adversarial text by constructing different semantic perturbation functions.
Outcome: The proposed framework generates natural adversarial texts for different languages with high success rates.
Vision-Flan: Scaling Human-Labeled Tasks in Visual Instruction Tuning (2024.findings-acl)

Copied to clipboard

Challenge: Recent vision-language models (VLMs) have shown impressive capabilities as general visual assistants, but there are two challenges to their performance: (1) lacking task diversity in pretraining and visual instruction tuning; (2) annotation error and bias in GPT-4 synthesized instruction tuning data.
Approach: They propose a two-stage instruction tuning framework that fine tunes VLMs firstly and further tuned on GPT-4 synthesized data.
Outcome: The proposed framework outperforms the traditional single-stage visual instruction tuning framework and achieves state-of-the-art performance across a wide range of multi-modal evaluation benchmarks.
Does DetectGPT Fully Utilize Perturbation? Bridging Selective Perturbation to Fine-tuned Contrastive Learning Detector would be Better (2024.acl-long)

Copied to clipboard

Challenge: Existing methods to detect MGT from human-written texts are inadequate . existing methods are fine-tuned and zero-shot metric-based, but they can be more accurate.
Approach: They propose a novel fine-tuned detector that can detect MGT from human-written texts by contrastive learning on selective perturbation.
Outcome: The proposed method outperforms the state-of-the-art by 1.20% on four public datasets.
Dynamic Data Mixing Maximizes Instruction Tuning for Mixture-of-Experts (2025.naacl-long)

Copied to clipboard

Challenge: Mixture-of-Experts (MoE) models are constrained by their fixed model capacities when the number of tasks grows in instruction tuning.
Approach: They propose to combine all training tasks and apply fixed sampling weights without considering the importance of different tasks as the model training state changes.
Outcome: The proposed method can be used on knowledge & reasoning tasks and open-ended queries with limited training budget.
Learning to Align Multi-Faceted Evaluation: A Unified and Robust Framework (2025.findings-acl)

Copied to clipboard

Challenge: Existing methods for fine-tuning open-source LLMs are limited to text-based analysis under predefined general criteria.
Approach: They propose a framework that fine-tunes LLMs to replicate the evaluation explanations and judgments of proprietary models.
Outcome: The proposed evaluation framework outperforms existing fine-tuned evaluation methods in effectiveness and robustness.
Unveiling Attractor Cycles in Large Language Models: A Dynamical Systems View of Successive Paraphrasing (2025.acl-long)

Copied to clipboard

Challenge: Dynamical systems theory provides a framework for understanding iterative processes and evolution over time.
Approach: They propose to apply this perspective to large language models which iteratively map input text to output text and re-express meaning with linguistic variation.
Outcome: The proposed model reveals that paraphrases re-express meaning with linguistic variation limiting linguistic diversity .
Grounded-VideoLLM: Sharpening Fine-grained Temporal Grounding in Video Large Language Models (2025.findings-emnlp)

Copied to clipboard

Challenge: Video Large Language Models (VLMs) have been praised for their performance in coarse-grained video understanding but still face ineffective temporal grounding and inadequate timestamp representations.
Approach: They propose a novel Video-LLM that senses and reasoned over specific video moments with fine-grained temporal precision.
Outcome: The proposed model surpasses existing models in fine-grained video understanding tasks and exhibits strong potential as a general video understanding assistant.
Local Byte Fusion for Neural Machine Translation (2023.acl-long)

Copied to clipboard

Challenge: Existing NLP models rely on a pre-built subword tokenizer to tokenize a sentence . this can be rigid and subwords from low-resource languages are under-represented .
Approach: They propose a method for byte-based machine translation that aggregates local semantic information.
Outcome: The proposed method improves on multilingual translation and cross-lingual transfer . it is parameter-efficient and performs competitively to subword models, it is shown .
RuleArena: A Benchmark for Rule-Guided Reasoning with LLMs in Real-World Scenarios (2025.acl-long)

Copied to clipboard

Challenge: RuleArena assesses the ability of large language models (LLMs) to follow complex, real-world rules in reasoning.
Approach: They propose a benchmark to evaluate the ability of large language models (LLMs) to follow complex, real-world rules in reasoning.
Outcome: The proposed benchmark covers airline baggage fees, NBA transactions, and tax regulations.
Scaling Reasoning, Losing Control: Evaluating Instruction Following in Large Reasoning Models (2026.acl-long)

Copied to clipboard

Challenge: Recent advances in reasoning-oriented models have demonstrated impressive capabilities in mathematical reasoning, but their ability to adhere to user directives remains underexplored.
Approach: They propose a benchmark to evaluate instruction-following in mathematical reasoning tasks.
Outcome: The proposed model degrades in instruction adherence when generation length increases, but can partially recover obedience, despite increasing generation length.
Large Language Models Can Be Contextual Privacy Protection Learners (2024.emnlp-main)

Copied to clipboard

Challenge: Large Language Models (LLMs) have demonstrated remarkable linguistic comprehension and generation capability, but when applied to specialized industries, they face challenges such as hallucination, insufficient domain knowledge, and failing to incorporate the latest domain knowledge.
Approach: They propose a paradigm for fine-tuning LLMs that effectively injects domain-specific knowledge while safeguarding inference-time data privacy.
Outcome: The proposed model protects private data while enhancing the model's knowledge.
AceGPT, Localizing Large Language Models in Arabic (2024.naacl-long)

Copied to clipboard

Challenge: Significant concerns emerge when addressing cultural sensitivity and local values.
Approach: They propose a localized Large Language Model (LLM) specifically for Arabic, a language imbued with unique cultural characteristics inadequately addressed by current mainstream models.
Outcome: The proposed model sets the state-of-the-art standard for open Arabic LLMs across various benchmarks.
SURf: Teaching Large Vision-Language Models to Selectively Utilize Retrieved Information (2024.emnlp-main)

Copied to clipboard

Challenge: Existing studies focus on the text modality or are limited to specific tasks.
Approach: They propose a framework to teach Large Vision-Language Models to selectively utilize retrieved information and improve their robustness against irrelevant or misleading references.
Outcome: The proposed framework improves LVLMs’ ability to utilize retrieved multimodal references and their robustness against irrelevant or misleading information.
Posterior Differential Regularization with f-divergence for Improving Model Robustness (2021.naacl-main)

Copied to clipboard

Challenge: Recent studies show that pre-trained models suffer catastrophic degradation in out-of-domain generalization to datasets with domain shift or adversarial scenarios.
Approach: They propose to regularize the posterior difference between clean and noisy inputs by using a Jacobian regularization framework and a virtual adversarial training framework.
Outcome: The proposed framework can improve model robustness in fully supervised and semi-supervised settings.
MixLLM: Dynamic Routing in Mixed Large Language Models (2025.naacl-long)

Copied to clipboard

Challenge: Large Language Models (LLMs) exhibit potential artificial generic intelligence, however, their usage is costly with high response latency.
Approach: They develop a dynamic contextual-bandit-based routing system for query-LLM assignment that leverages query tags to enhance query embeddings.
Outcome: The proposed model maximizes response quality and minimizes cost and latency.
MMRA: A Benchmark for Evaluating Multi-Granularity and Multi-Image Relational Association Capabilities in Large Visual Language Models (2026.findings-eacl)

Copied to clipboard

Challenge: Current multimodal benchmarks focus on facts within individual images, but neglect associative relations among multiple images.
Approach: They propose a multi-image relational association task and a MMRA benchmark to evaluate LVLMs.
Outcome: The proposed benchmarks show that entity-level multi-image perception tasks pose greater challenges than image-level tasks.
Batch Prompting: Efficient Inference with Large Language Model APIs (2023.emnlp-industry)

Copied to clipboard

Challenge: Performing inference on large volumes of samples can be computationally and financially costly.
Approach: They propose a prompting approach that enables large language models to run inference in batches instead of one sample at a time.
Outcome: The proposed prompting reduces both token and time costs while retaining downstream performance.
Cross-Utterance Conditioned VAE for Non-Autoregressive Text-to-Speech (2022.acl-long)

Copied to clipboard

Challenge: Experimental results show that the proposed model improves naturalness and prosody diversity with clear margins.
Approach: They propose a cross-utterance conditional VAE to estimate posterior probability distribution of latent prosody features for each phoneme by conditioning on acoustic features, speaker information, and text features from past and future sentences.
Outcome: The proposed model improves naturalness and prosody diversity with clear margins.
Conformal Event Prediction with Temporal Knowledge Graph (2026.findings-acl)

Copied to clipboard

Challenge: Current event prediction methods lack rigorous uncertainty quantification, which limits their reliability for decision-making.
Approach: They propose a conformal prediction framework that applies conformal predictions to event prediction to address this challenge.
Outcome: The proposed framework guarantees coverage while improving efficiency on three public datasets.
Conditional Memory via Scalable Lookup: A New Axis of Sparsity for Large Language Models (2026.acl-long)

Copied to clipboard

Challenge: Mixture-of-Experts (MoE) scales capacity via conditional computation, but lacks knowledge lookup primitive.
Approach: They propose a conditional memory instantiated via Deep Sparse Embedding (DSE) they propose 'u-shaped scaling law' that identifies optimal balance between MoE experts and DSE memory .
Outcome: The proposed model outperforms an iso-parameter and isoFLOPs MoE baseline across knowledge and reasoning benchmarks and is infrastructure-efficient.
DocHieNet: A Large and Diverse Dataset for Document Hierarchy Parsing (2024.emnlp-main)

Copied to clipboard

Challenge: Existing methods for document hierarchy parsing are limited due to the small scale and inconsistency of datasets.
Approach: They propose a document hierarchy parsing dataset to compensate for the data scarcity problem and propose 'dHP' framework to grasp fine-grained text content and coarse-grounded pattern at layout element level.
Outcome: The proposed framework grasps both fine-grained text content and coarse-grounded pattern at layout element level, enhancing the capacity of pre-trained text-layout models in handling multi-page and multi-level challenges.
RASAT: Integrating Relational Structures into Pretrained Seq2Seq Model for Text-to-SQL (2022.emnlp-main)

Copied to clipboard

Challenge: Experimental results show RASAT can leverage a variety of relational structures while inheriting the pretrained parameters from the T5 model.
Approach: They propose a Transformer seq2seq architecture augmented with relation-aware self-attention that leverages relational structures while inheriting pretrained parameters from the T5 model.
Outcome: The proposed model can leverage relational structures while inheriting pretrained parameters from the T5 model effectively.
The Law of Knowledge Overshadowing: Towards Understanding, Predicting and Preventing LLM Hallucination (2025.findings-acl)

Copied to clipboard

Challenge: Hallucination is a persistent challenge in large language models where even with rigorous quality control, models often generate distorted facts.
Approach: They propose a new framework to quantify factual hallucinations by modeling knowledge overshadowing.
Outcome: The proposed framework improves model factuality on Overshadow (27.9%), MemoTrap (13.1%) and NQ-Swap (18.3%).
Enrich, Aggregate, and Generate: Three-stage Biomedical Data-to-Text Generation Using Large Language Models in Low-resource Scenarios (2026.findings-acl)

Copied to clipboard

Challenge: Biomedical data-to-text generation is a branch of Natural Language Generation, aiming at generating textual natural language descriptions that can fluently and precisely describe the structured data.
Approach: They propose an LLM framework that can be used to generate textual natural language descriptions using in-context learning.
Outcome: The proposed framework provides good interpretability and superior performance on the BioLeaflets dataset.
Rethinking the Role of LLMs for Document-level Relation Extraction: a Refiner with Task Distribution and Probability Fusion (2025.naacl-long)

Copied to clipboard

Challenge: Document-level relation extraction (DocRE) provides a broad context for extracting relations for entities.
Approach: They propose a method that utilizes LLMs as a refiner and task distribution and probability fusion to refine LLM-based relation extraction methods.
Outcome: The proposed method outperforms existing LLM-based methods without fine-tuning by 25.2% F1.
Plot Retrieval as an Assessment of Abstract Semantic Association (2024.acl-srw)

Copied to clipboard

Challenge: Existing information retrieval datasets cannot capture abstract semantic associations well.
Approach: They propose a task that retrieves relevant plots from the book for a query using a labeled dataset.
Outcome: The proposed task can be used to evaluate the performance of IR models on the novel task Plot Retrieval.
Contextual Text Style Transfer (2020.findings-emnlp)

Copied to clipboard

Challenge: Existing methods for text style transfer are limited by the lack of parallel data.
Approach: They propose a task to translate a sentence into a desired style with its surrounding context taken into account.
Outcome: The proposed model outperforms state-of-the-art methods across style accuracy, content preservation and contextual consistency metrics.
LLaMA-MoE: Building Mixture-of-Experts from LLaMA with Continual Pre-Training (2024.emnlp-main)

Copied to clipboard

Challenge: Mixture-of-Experts (MoE) has gained increasing popularity as a framework for scaling up large language models.
Approach: They investigate how to build Mixture-of-Experts (MoE) models from existing large language models . they use expert construction, Continual pre-training and data sampling strategies .
Outcome: The proposed model outperforms existing models with similar parameters on a wide range of tasks.
Calibrating Verbal Uncertainty as a Linear Feature to Reduce Hallucinations (2025.emnlp-main)

Copied to clipboard

Challenge: LLMs often use assertive language when making false claims, resulting in harm and loss of trust.
Approach: They find that a mismatch between semantic and verbal uncertainty is a better predictor of hallucinations than semantic uncertainty alone.
Outcome: a new study shows that mismatch between semantic and verbal uncertainty is better predictor of hallucinations than semantic uncertainty alone.
Nirvana: A Specialized Generalist Model With Task-Aware Memory Mechanism (2026.acl-long)

Copied to clipboard

Challenge: Existing models lack task-guided specialized memory mechanisms . specialized generalist models excel at general language tasks but struggle in specialized domains.
Approach: They propose a specialized generalist model with specialized memory and updater that can optimize for specialized domains.
Outcome: The proposed model matches or surpasses baselines on general benchmarks and achieves lowest perplexity across specialized domains.
Intention Knowledge Graph Construction for User Intention Relation Modeling (2026.eacl-long)

Copied to clipboard

Challenge: Existing knowledge graphs focus on connecting intentions but lacks the ability to model the relationships between different intentions.
Approach: They propose a framework to automatically generate an intention knowledge graph, capturing connections between user intentions.
Outcome: The proposed model outperforms state-of-the-art methods and shows its utility.
Few-Shot Text Classification with Triplet Networks, Data Augmentation, and Curriculum Learning (2021.naacl-main)

Copied to clipboard

Challenge: a few-shot text classification task requires a large number of output classes, with few training examples per class.
Approach: They propose a data augmentation technique suitable for training with limited data for few-shot, highly-multiclass text classification scenarios.
Outcome: The proposed technique improves performance on four classification tasks by 3.0% on average.
The Best of Both Worlds: Combining Parallel and Sequential Inference Scaling via Aggregation Fine-Tuning (2026.findings-acl)

Copied to clipboard

Challenge: Empirical results show that AFT-trained models achieve substantial gains with test-time scaling.
Approach: They introduce a supervised fine-tuning paradigm where models synthesize multiple draft responses into a single, refined answer.
Outcome: Empirical results show that AFT-trained models outperform baseline models while eliminating external guidance.
CLIP-MoE: Towards Building Mixture of Experts for CLIP with Diversified Multiplet Upcycling (2025.emnlp-main)

Copied to clipboard

Challenge: Recent studies found that CLIP can only encode one aspect of the feature space, leading to substantial information loss and indistinctive features.
Approach: They propose a model-agnostic approach that fine-tunes complementary CLIP models and transforms them into a CLIP-MoE.
Outcome: The proposed framework fine-tunes a series of complementary CLIP models and transforms them into a CLIP-MoE.
Enhancing Distractor Generation for Multiple-Choice Questions with Retrieval Augmented Pretraining and Knowledge Graph Integration (2024.findings-acl)

Copied to clipboard

Challenge: Existing LMs undergo task-agnostic pertaining, but task-specific pretraining has gained prominence.
Approach: They propose retrieval augmented pretraining and task-specific pretraining for DG . they propose to refine language model pretraining to align it more closely with downstream task .
Outcome: The proposed method improves the performance of multiple-choice questions by integrating knowledge graphs and language models.
Bridging Kernel Drivers and Virtual Device Models with LLM-Powered Automation (2026.acl-demo)

Copied to clipboard

Challenge: Linux kernel device drivers are tightly coupled with hardware, making them difficult to execute and test without physical devices.
Approach: They present a tool that generates QEMU-based virtual devices directly from Linux driver source code.
Outcome: The proposed tool generates QEMU-based virtual devices directly from Linux driver source code.
LogToP: Logic Tree-of-Program with Table Instruction-tuned LLMs for Controlled Logical Table-to-Text Generation (2026.findings-eacl)

Copied to clipboard

Challenge: Existing LLMs are difficult to achieve satisfactory results in table-related tasks.
Approach: They propose to develop a specialized logical table-to-text generation model that can be used for table-related tasks.
Outcome: The proposed model achieves state-of-the-art on a Logic2Text dataset.
Multi-Fact Correction in Abstractive Text Summarization (2020.emnlp-main)

Copied to clipboard

Challenge: Existing abstractive summarization systems generate incorrect facts with respect to the source text.
Approach: They propose a suite of two factual correction models that leverages question-answering knowledge to make corrections in system-generated summaries via span selection.
Outcome: The proposed model improves factuality of news summarization without sacrificing summary quality.
APE: Argument Pair Extraction from Peer Review and Rebuttal via Multi-task Learning (2020.emnlp-main)

Copied to clipboard

Challenge: Argument mining is an important research field that attracts growing attention in recent years.
Approach: They propose a new task to extract argument pairs from peer review and rebuttal . they use an open review platform to analyze the contents, structure and connections .
Outcome: The proposed task is based on a dataset of 4,764 fully annotated review-rebuttal passage pairs . it is able to detect argumentative propositions and extract argument pairs from the corpus .
HERO: Hierarchical Encoder for Video+Language Omni-representation Pre-training (2020.emnlp-main)

Copied to clipboard

Challenge: HERO is a framework for large-scale video+language omni-representation learning.
Approach: They propose a framework for large-scale video+language omni-representation learning that encodes multimodal inputs in a hierarchical structure and uses Masked Language Modeling and Masked Frame Modeling to train models.
Outcome: The proposed framework achieves state-of-the-art on multiple benchmarks over text-based video/video-moment retrieval, video question answering (QA), Video-and-language Inference and video Captioning tasks across different domains.
Can Large Language Models Act as Ensembler for Multi-GNNs? (2025.emnlp-main)

Copied to clipboard

Challenge: Existing graph neural networks lack the inherent semantic understanding capability of rich textual attributes, limiting their effectiveness in applications.
Approach: They propose a model that integrates multiple GNNs and LLMs to provide an ensemble for multi-GNNs.
Outcome: The proposed model outperforms existing models in terms of semantic understanding of graph structures and graph structures.
An Exploration of Mamba for Speech Self-Supervised Models (2026.acl-long)

Copied to clipboard

Challenge: Mamba-based SSL models are promising for long-sequence modeling, speech unit extraction, and speech self-supervised learning.
Approach: They propose to use Mamba-based HuBERT models as an alternative to Transformer-based SSL architectures.
Outcome: The proposed models outperform Transformer-based models in language modeling tasks while showing superior performance on streaming ASR.
Enhancing Open-Domain Task-Solving Capability of LLMs via Autonomous Tool Integration from GitHub (2025.acl-long)

Copied to clipboard

Challenge: Existing approaches lack flexibility to address diverse and ever-evolving user queries in open domains.
Approach: They propose to evaluate LLMs on open-domain knowledge that requires tools to solve diverse and ever-evolving user queries.
Outcome: The proposed system outperforms baselines in the open domain task-solving benchmark.
Improving Long-Context Translation via Self-Supervised Dual Learning (2026.acl-long)

Copied to clipboard

Challenge: Large language models with long context windows suffer from catastrophic information distortion, undermining the strict faithfulness required for translation.
Approach: They propose a self-supervised post-training framework that improves long-document translation reliability via round-trip consistency.
Outcome: The proposed framework improves long-document translation reliability via round-trip consistency.
Diverse Few-Shot Text Classification with Multiple Metrics (N18-1)

Copied to clipboard

Challenge: Existing methods for few-shot learning are insufficient to capture task variations in natural language domains.
Approach: They propose an adaptive metric learning approach that automatically determines the best weighted combination from a set of metrics obtained from meta-training tasks for a newly seen few-shot task.
Outcome: The proposed method performs favorably against state-of-the-art few shot learning algorithms on real-world sentiment analysis and dialog intent classification datasets.
Parameter-Efficient Fine-Tuning via Circular Convolution (2025.findings-acl)

Copied to clipboard

Challenge: Low-Rank Adaptation (LoRA) has gained popularity for fine-tuning large foundation models, but its intrinsic low-rank characteristic may limit its performance.
Approach: They propose a low-rank adaptive method that uses low-ranked matrices to represent weight changes.
Outcome: The proposed method reduces trainable parameters and mitigates heavy memory consumption associated with full delta matrices by sequentially multiplying mathbf A and mathbb B with the activation.

What is GenGO?

GenGO is an NLP powered publication search system. It currenctly indexes 30k+ papers from ACL Anthology, and implements multi-aspect summarization, semantic search, and more!

Information

About
Limitations