Papers by Yu Liang

124 papers
Verified Critical Step Optimization for LLM Agents (2026.findings-acl)

Copied to clipboard

Challenge: Critical Step Optimization (CSO) focuses preference learning on verified critical steps where alternative actions demonstrably flip task outcomes from failure to success.
Approach: They propose a method which focuses preference learning on verified critical steps where alternative actions demonstrably flip task outcomes from failure to success.
Outcome: The proposed method outperforms the existing methods on GAIA-Text-103 and XBench-DeepSearch while requiring supervision at only 16% of trajectory steps.
Backdoor Collapse: Eliminating Unknown Threats Via Known Backdoor Aggregation In Language Models (2026.acl-long)

Copied to clipboard

Challenge: Existing defenses rely on impractical assumptions about trigger settings to mitigate backdoor attacks . a recent study found that small amounts of training data can systematically induce harmful behaviors in large language models.
Approach: They propose a backdoor defense framework that requires no prior knowledge of trigger settings . they use a two-stage process to aggregate backdoor representations and fine-tune recovery .
Outcome: The proposed defense reduces the average Attack Success Rate to 4.41% across multiple benchmarks . the proposed framework generalizes across different types of backdoors, confirming its robustness in practical deployment scenarios.
Multi-modal Stance Detection: New Datasets and Model (2024.findings-acl)

Copied to clipboard

Challenge: Existing methods for stance detection for pure texts have limited results to multi-modal content.
Approach: They propose a multi-modal stance detection framework that leverages target information to learn multi-modal stance features from textual and visual modalities.
Outcome: The proposed framework achieves state-of-the-art in multi-modal stance detection on five datasets based on Twitter .
PaddleSpeech: An Easy-to-Use All-in-One Speech Toolkit (2022.naacl-demo)

Copied to clipboard

Challenge: PaddleSpeech is an open-source speech toolkit that supports speech-to-text and text-to speech tasks.
Approach: They describe the design philosophy and core architecture of PaddleSpeech to support several essential speech-to-text and text-to speech tasks.
Outcome: The proposed framework achieves competitive or state-of-the-art performance on various speech datasets and implements the most popular methods.
Are Large Language Models Reliable Reviewers? A Benchmark for Error Detection in Financial Documents (2026.findings-acl)

Copied to clipboard

Challenge: Existing LLMs struggle to identify errors in financial documents, a study shows . 18% of financial practitioners make errors daily, one-third make errors several times weekly, and 59% make errors multiple times monthly.
Approach: They introduce FinED-Bench, a publicly available Benchmark for financial error detection . it covers nine real-world financial scenarios and includes over 900 documents in 2025 . supervised fine-tuning can significantly improve the performance of weaker LLMs, they show .
Outcome: The proposed benchmark covers nine real-world financial scenarios and includes over 900 documents reported in 2025 that are unseen by existing language models.
MultiCMET: A Novel Chinese Benchmark for Understanding Multimodal Metaphor (2023.findings-emnlp)

Copied to clipboard

Challenge: Existing research on multimodal metaphors does not address categorizing the source and target domains in metaphors beyond the English language.
Approach: They propose a Cascading Domain Knowledge Integration benchmark to detect metaphors by introducing domain-specific lexical features.
Outcome: The proposed dataset includes 13,820 text-image pairs of advertisements with manual annotations of the occurrence of metaphors, domain categories, and sentiments metaphors convey.
SEGMENT+: Long Text Processing with Short-Context Language Models (2024.emnlp-main)

Copied to clipboard

Challenge: Existing frameworks that increase context window do not guarantee robust performance across long input tasks.
Approach: They propose a framework that enables language models to handle extended inputs within limited context windows efficiently.
Outcome: The framework improves performance on long-document question-answering and Needle-in-a-Haystack tasks.
Order Doesn’t Matter, But Reasoning Does: Training LLMs with Order-Centric Augmentation (2025.emnlp-main)

Copied to clipboard

Challenge: Logical reasoning is essential for large language models (LLMs) to ensure accurate and coherent inferences.
Approach: They propose an order-centric data augmentation framework based on commutativity in logical reasoning that randomly shuffles independent premises to introduce condition order augmentation.
Outcome: The proposed framework improves LLMs’ reasoning performance and adaptability to diverse logical structures.
UnCo: Uncertainty-Driven Collaborative Framework of Large and Small Models for Grounded Multimodal NER (2025.emnlp-main)

Copied to clipboard

Challenge: Existing methods to identify unseen multimodal entities struggle with limited knowledge and generalization.
Approach: They propose a framework that leverages the strengths of small fine-tuned models and MLLMs to generate unambiguous predictions.
Outcome: Extensive experiments show that the proposed framework retains the in-domain knowledge of small models while utilizing the capabilities of MLLMs to handle unseen entities.
CLOMO: Counterfactual Logical Modification with Large Language Models (2024.acl-long)

Copied to clipboard

Challenge: Existing studies on evaluating model reasoning are limited in both form and content.
Approach: They propose a task to cultivate counterfactual thought processes within large language models and an evaluation metric to evaluate their natural language output instead of modeling the task as a multiple-choice problem.
Outcome: The proposed evaluation metric aligns well with human preference.
SocAoG: Incremental Graph Parsing for Social Relation Inference in Dialogues (2021.acl-long)

Copied to clipboard

Challenge: Existing studies focus on identifying entities' relations from the semantics of dialogues-they utilize either the attention mechanism or a refined token graph to locate informative words.
Approach: They propose a sequential structure prediction task to incrementally parse SocAoG for dynamic inference upon any incoming utterance.
Outcome: Empirical results show that the proposed model infers social relations more accurately than the state-of-the-art methods.
Task-Oriented Dialogue as Dataflow Synthesis (2020.tacl-1)

Copied to clipboard

Challenge: Existing approaches to task-oriented dialogue represent dialogue state as a dataflow graph . microsoft's SMCalFlow dataset features complex dialogues about events, weather, places, and people .
Approach: They propose a dataflow graph-based dialogue agent that maps each user utterance to a program that extends this graph.
Outcome: The proposed framework improves representability and predictability in natural dialogues . it uses dataflow graphs and metacomputation to map user intents to a program .
Self-Powered LLM Modality Expansion for Large Speech-Text Models (2024.emnlp-main)

Copied to clipboard

Challenge: Large language models exhibit remarkable performance across diverse tasks . however, these methods require significant resource demands and tend to overfit specific tasks.
Approach: They propose a self-powered LSM that leverages augmented automatic speech recognition data generated by the model itself for more effective instruction tuning.
Outcome: The proposed model mitigates speech anchor bias and improves the fusion of speech and text modalities in large language models.
Optimizing Question Semantic Space for Dynamic Retrieval-Augmented Multi-hop Question Answering (2025.acl-long)

Copied to clipboard

Challenge: Existing retrieval-augmented generation methods are insufficient for multi-hop question answering . however, they tend to generate hallucinations due to semantic mismatching .
Approach: They propose to optimize question semantic space for dynamic retrieval-augmented multi-hop question answering by optimizing the semantic embeddings.
Outcome: The proposed method outperforms existing RAG methods in both in- and out-of-domain settings.
Interpretable Proof Generation via Iterative Backward Reasoning (2022.naacl-main)

Copied to clipboard

Challenge: Existing proof generation tasks require reasoning capabilities, but they usually just request for an answer without the reasoning procedure that would make it interpretable.
Approach: They propose an iterative backward reasoning model to solve the proof generation tasks on rule-based Question Answering.
Outcome: The proposed model improves in-domain performance and cross-domain transferability over existing models.
Rethinking Text-to-SQL: Dynamic Multi-turn SQL Interaction for Real-world Database Exploration (2026.findings-acl)

Copied to clipboard

Challenge: Structured Query Language (SQL) is the cornerstone for data-driven decision-making.
Approach: They propose a benchmark to rigorously evaluate Large Language Models within a dynamic interaction framework.
Outcome: The proposed benchmark aims to rigorously evaluate LLMs within a dynamic interaction framework.
Beta Distribution Guided Aspect-aware Graph for Aspect Category Sentiment Analysis with Affective Knowledge (2021.emnlp-main)

Copied to clipboard

Challenge: Existing methods for aspect category sentiment analysis do not necessarily occur in a sentence.
Approach: They propose a Beta Distribution-guided aspect-aware graph construction based on external knowledge . they use aspect-related words as the pivots to derive aspect-relevant weights .
Outcome: The proposed approach outperforms the state-of-the-art methods on 6 benchmark datasets.
Locate, Steer, and Improve: A Practical Survey of Actionable Mechanistic Interpretability in Large Language Models (2026.findings-acl)

Copied to clipboard

Challenge: Existing literature on mechanistic interpretation (MI) treats it as an observational science, leaving practical applications underexplored.
Approach: They propose a survey structured around the pipeline to identify and improve MI models.
Outcome: The proposed framework enables tangible improvements in Alignment, Capability, and Efficiency.
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.
TransBench: Breaking Barriers for Transferable Graphical User Interface Agents in Dynamic Digital Environments (2025.findings-acl)

Copied to clipboard

Challenge: Existing GUI agents struggle to adapt to dynamic and interconnected nature of real-world digital environments, authors show .
Approach: They propose a benchmark to evaluate the transferability of GUI agents across three key dimensions . transBench includes 15 app categories with diverse functionalities .
Outcome: The proposed benchmark shows that existing GUI agents struggle to adapt to dynamic, interconnected environments.
ChemReason-Bench: Benchmarking Large Language Models for Procedural Reasoning in Experimental Chemistry (2026.acl-long)

Copied to clipboard

Challenge: Experimental protocols in organic synthesis specify not only the intended transformation, but also an executable sequence of operations and conditions.
Approach: They propose a human-validated benchmark for verifiable experimental procedure reasoning . they instantiate 7306 benchmark tasks across six complementary formats .
Outcome: The proposed benchmarks show that the evaluations are less diagnostic of procedure-level decision making.
EXPLAIN: Enhancing Retrieval-Augmented Generation with Entity Summary (2025.acl-industry)

Copied to clipboard

Challenge: Existing document question answering methods reduce inference costs and input tokens.
Approach: They propose a retrieval-augmented generation method that automatically extracts useful entities and generates summaries from documents.
Outcome: The proposed method surpasses baseline retrieval-augmented generation (RAG) and long-context question answering (LC) methods achieve higher accuracy by processing entire documents, but at the cost of increased computational Corresponding authors.
ALICE: Active Learning with Contrastive Natural Language Explanations (2020.emnlp-main)

Copied to clipboard

Challenge: Annotating a large dataset with annotations is costly and infeasible.
Approach: They propose an expert-in-the-loop training framework that utilizes contrastive natural language explanations to improve data efficiency in learning.
Outcome: The proposed framework outperforms baseline models trained with 40-100% more training data on bird species classification and social relationship classification tasks.
Low-Hallucination and Efficient Coreference Resolution with LLMs (2025.findings-emnlp)

Copied to clipboard

Challenge: Large Language Models have shown promising results in coreference resolution, but they face a critical issue: hallucinations.
Approach: They propose a low-hallucination and efficient solution to the problem of hallucinations . they propose efficient constrained decoding for coreference resolution .
Outcome: The proposed approach achieves better performance on the English OntoNotes development set.
Self-Supervised Prompt Optimization (2025.findings-emnlp)

Copied to clipboard

Challenge: Existing prompt optimization methods rely heavily on external references such as ground truth or by humans, limiting their applicability in real-world scenarios where such data is unavailable or costly to obtain.
Approach: They propose a cost-efficient framework that discovers effective prompts for both closed and open-ended tasks without external reference.
Outcome: The proposed framework outperforms state-of-the-art prompt optimization methods with significantly lower costs and fewer samples.
DeepSeekMoE: Towards Ultimate Expert Specialization in Mixture-of-Experts Language Models (2024.acl-long)

Copied to clipboard

Challenge: Mixture-of-Experts (MoE) architectures face challenges in ensuring expert specialization . despite the promising performance, scaling language models to an extremely large scale is associated with exceedingly high computational costs.
Approach: They propose an architecture that allows for ultimate expert specialization by segmenting experts into mN ones and activating mK from them.
Outcome: The proposed architecture achieves comparable performance with GShard with 2B parameters and computation.
Parameter Importance is Not Static: Evolving Parameter Isolation for Supervised Fine-Tuning (2026.acl-long)

Copied to clipboard

Challenge: Recent approaches to fine-tuning of large language models suffer from task interference and catastrophic forgetting.
Approach: They propose a fine-tuning framework that adapts isolation decisions based on online estimates of parameter importance.
Outcome: The proposed framework reduces interference and forgetting while releasing outdated parameters to recover plasticity.
Why Supervised Fine-Tuning Fails to Learn: A Systematic Study of Incomplete Learning in Large Language Models (2026.acl-long)

Copied to clipboard

Challenge: Incomplete learning is widespread and heterogeneous in large language models . authors identify five recurrent sources of incomplete learning: missing prerequisite knowledge, conflicts between SFT supervision and pre-training knowledge, internal inconsistencies within SFT data, left-side forgetting during sequential fine-tuning, and insufficient optimization for rare or complex patterns.
Approach: They propose a diagnostic-first framework that maps incomplete learning to causes . they identify five recurrent sources of incomplete learning: missing prerequisite knowledge, conflicts between supervision and pre-training knowledge, internal inconsistencies, left-side forgetting during sequential fine-tuning, and insufficient optimization for rare or complex patterns.
Outcome: The proposed framework maps incomplete learning to causes using observable training and inference signals.
SAGE : A Top-Down Bottom-Up Knowledge-Grounded User Simulator for Multi-turn Agent Evaluation (2026.findings-eacl)

Copied to clipboard

Challenge: Existing evaluation methods rely on static benchmarks or narrow task-specific datasets that fail to capture the open-ended nature of real-world interactions.
Approach: They propose a user Simulation framework for multi-turn AGent Evaluation that integrates top-down knowledge from business contexts and bottom-up knowledge from agent infrastructure.
Outcome: The proposed framework produces interactions that are more realistic and diverse while identifying up to 33% more agent errors.
LayoutDIT: Layout-Aware End-to-End Document Image Translation with Multi-Step Conductive Decoder (2023.findings-emnlp)

Copied to clipboard

Challenge: Existing methods struggle to capture the visual layout in complex document images.
Approach: They propose to integrate layout knowledge into document image translation by using a layout-aware encoder and a multi-step conductive decoder to achieve the translation step by step.
Outcome: The proposed model outperforms state-of-the-art methods with better parameter efficiency.
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.
Taxonomy-Guided Zero-Shot Recommendations with LLMs (2025.coling-main)

Copied to clipboard

Challenge: Existing approaches to deploy large language models (LLMs) into RecSys have limited prompt length, unstructured item information, and un-constrained generation of recommendations.
Approach: They propose a taxonomy-guided recommendation framework that empowers LLMs with category information in a systematic approach.
Outcome: The proposed framework significantly improves recommendation quality compared to zero-shot approaches.
Examining False Positives under Inference Scaling for Mathematical Reasoning (2025.emnlp-main)

Copied to clipboard

Challenge: Recent advances in language models have led to significant improvements in mathematical reasoning across benchmarks.
Approach: They analyze the prevalence of false positives in language models by using heuristic evaluation methods . they find that false positive models produce correct final answers but with flawed deduction paths .
Outcome: The proposed model performance improvements are based on the proposed model and its evaluation metrics.
Spatial-RAG: Spatial Retrieval Augmented Generation for Real-World Geospatial Reasoning Questions (2026.findings-acl)

Copied to clipboard

Challenge: Existing large language models lack spatial computing capabilities and access to up-to-date geospatial data.
Approach: They propose a Retrieval-Augmented Generation framework for geospatial question answering . it integrates structured spatial databases with LLMs via a hybrid spatial retriever .
Outcome: Experiments show that Spatial-RAG significantly improves over baselines.
Can Language Models Follow Multiple Turns of Entangled Instructions? (2025.findings-emnlp)

Copied to clipboard

Challenge: Despite of significant achievements in improving instruction-following capabilities of large language models, the ability to process multiple potentially entangled or conflicting instructions remains a considerable challenge.
Approach: They construct multi-turn instruction with 1.1K high-quality multi-turned conversations using the human-in-the-loop approach and examine their capabilities.
Outcome: The proposed model shows that it is difficult to integrate multiple turns and balance competing objectives when instructions intersect or conflict.
SLAM-Omni: Timbre-Controllable Voice Interaction System with Single-Stage Training (2025.findings-acl)

Copied to clipboard

Challenge: a new spoken dialogue system with single-stage training is demonstrating its low latency and high quality . SLAM-Omni achieves zero-shot timbre control by modeling spoken language with semantic tokens .
Approach: They propose a timbre-controllable, end-to-end voice interaction system with single-stage training.
Outcome: The proposed system outperforms previous models on 4 GPUs with limited data.
Learning Invariant Representation Improves Robustness for MRC Models (2022.findings-emnlp)

Copied to clipboard

Challenge: Existing approaches to improve machine reading comprehension models are vulnerable and not robust to adversarial examples.
Approach: They propose to construct positive example pairs which have same answer by augmentation and then introduce stability and contrastive loss to improve invariance of representation.
Outcome: The proposed approach boosts the robustness of QA models across different tasks and attack sets significantly and consistently.
Wasserstein Distance Regularized Sequence Representation for Text Matching in Asymmetrical Domains (2020.emnlp-main)

Copied to clipboard

Challenge: Asymmetrical text matching is a fundamental problem in information retrieval and natural language processing.
Approach: They propose a method that regularizes features vectors projected from different domains . WD-Match can be used to improve different text matching methods .
Outcome: The proposed method outperforms existing methods and benchmarks on four datasets.
LLM Agents for Education: Advances and Applications (2025.findings-emnlp)

Copied to clipboard

Challenge: Large Language Model (LLM) agents are transforming education by automating complex tasks and enhancing both teaching and learning processes.
Approach: This survey analyzes recent advances in applying Large Language Model agents to educational settings . it highlights ethical issues, hallucination and overreliance, and integration with existing ecosystems .
Outcome: The authors analyze the technologies enabling LLM agents and highlight key challenges in deploying them in educational settings.
Mixup-Transformer: Dynamic Data Augmentation for NLP Tasks (2020.coling-main)

Copied to clipboard

Challenge: Recent work on data augmentation techniques that interpolate inputs and labels shows strong effectiveness in image classification.
Approach: They propose to integrate mixup to transformer-based pre-trained architecture for NLP tasks while keeping the whole end-to-end training system.
Outcome: The proposed framework improves on GLUEbenchmark and transformer-based learning models while keeping the whole end-to-end training system.
Identifying Cellular Niches in Spatial Transcriptomics: An Investigation into the Capabilities of Large Language Models (2025.acl-long)

Copied to clipboard

Challenge: Spatial transcriptomic technologies allow measuring gene expression profile and spatial information of cells in tissues simultaneously.
Approach: They propose a spatial transcriptomic approach to identify spatial niches using a zero-shot large language models by transforming spatial transcriptomics data into spatial context prompts.
Outcome: The proposed model improves performance by leveraging gene expression of neighboring cells/spots, cell type composition, tissue information, and external knowledge.
Semantic Relation-aware Difference Representation Learning for Change Captioning (2021.findings-acl)

Copied to clipboard

Challenge: Existing methods to describe semantic change in images with distractors are difficult to learn .
Approach: They propose a semantic relation-aware difference representation learning network to explicitly learn the difference representation in the existence of distractors.
Outcome: The proposed network achieves state-of-the-art performance on CLEVR-Change and Spot-the -Diff datasets.
Skeletons Matter: Dynamic Data Augmentation for Text-to-Query (2025.emnlp-main)

Copied to clipboard

Challenge: Existing studies focus on a single query language, resulting in limited generalizability . a new task paradigm is proposed to unify semantic parsing tasks across different query languages .
Approach: They propose a task paradigm that unifies parsing tasks across query languages . they identify query skeletons as a shared optimization target of Text-to-Query tasks .
Outcome: The proposed method achieves state-of-the-art performance using only a small amount of synthesized data.
CLUE: A Chinese Language Understanding Evaluation Benchmark (2020.coling-main)

Copied to clipboard

Challenge: Existing language evaluation benchmarks for English are limited to English . lack of such benchmarks makes it difficult to replicate success in other languages .
Approach: They introduce a large-scale Chinese language understanding evaluation benchmark . the benchmark uses a set of current state-of-the-art pre-trained Chinese models .
Outcome: The first large-scale Chinese Language Understanding Evaluation (CLUE) benchmark is released . the benchmark evaluates models across a wide range of tasks on original Chinese text . existing language evaluation benchmarks are mostly limited to English .
Generating Hashtags for Short-form Videos with Guided Signals (2023.acl-long)

Copied to clipboard

Challenge: Short-form video hashtag recommendation (SVHR) is a classification or ranking problem that selects hashtags from a set of limited candidates.
Approach: They propose a short-form video hashtag recommendation task that better represents how hashtags are created naturally by retrieving relevant hashtags from a large-scale hashtag pool as extra guidance signals.
Outcome: The proposed model outperforms strong classification baselines on two short-form video datasets and the guidance signals boost the performance by 8.11 and 2.17 absolute ROUGE-1 scores on average.
DAGN: Discourse-Aware Graph Network for Logical Reasoning (2021.naacl-main)

Copied to clipboard

Challenge: Recent QA with logical reasoning questions requires passage-level relations among the sentences.
Approach: They propose a discourse-aware graph network that aggregates passage-level clues for QA by using discourse-based information.
Outcome: The proposed model achieves competitive results on two logical reasoning QA datasets.
Too Correct to Learn: Reinforcement Learning on Saturated Reasoning Data (2026.acl-short)

Copied to clipboard

Challenge: Strong base models saturate benchmarks, resulting in weaker performance, a paradox . a new approach to Reinforcement Learning (RL) is needed to improve performance .
Approach: They propose a method that uses constrained uniform top-k sampling to flatten the local optimization landscape by sampling uniformly from constrained high-confidence candidates.
Outcome: Experiments show that the proposed approach prevents policy degeneration and boosts out-of-domain generalization.
PAD-Net: An Efficient Framework for Dynamic Networks (2023.acl-long)

Copied to clipboard

Challenge: Dynamic networks can significantly improve the model’s representation power with acceptable computational cost.
Approach: They propose a partially dynamic network to transform redundant dynamic parameters into static ones and iterative mode partition to partition dynamic and static parameters efficiently.
Outcome: The proposed network surpasses fully dynamic networks by +0.7% top-1 acc with only 30% dynamic parameters for DY-Conv and +1.9% average score in language understanding with only 50% dynamic parameters.
Second Language (Arabic) Acquisition of LLMs via Progressive Vocabulary Expansion (2025.acl-long)

Copied to clipboard

Challenge: In the evolving landscape of large language models, the predominant focus has been on English and Chinese.
Approach: They propose to utilize Arabic-specific vocabulary in the tokenizer to accelerate decoding.
Outcome: The proposed model achieves decent performance comparable to the best Arabic LLMs across various Arabic benchmarks.
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 .
From Specific-MLLMs to Omni-MLLMs: A Survey on MLLMs Aligned with Multi-modalities (2025.findings-acl)

Copied to clipboard

Challenge: MLLMs are able to integrate multiple modalities into a single model to tackle complex tasks in real-world scenarios.
Approach: They propose a comprehensive survey of Omni-MLLMs to address the challenges and opportunities of multimodal modeling.
Outcome: The proposed model can integrate multiple modalities into a single model and provide novel perspectives.
Don’t Tell the Answer, Truly Guide the Reasoning During RL Rollouts (2026.findings-acl)

Copied to clipboard

Challenge: Existing methods such as GRPO often break down when task difficulty exceeds the model’s capacity, resulting in sparse rewards and inefficient training.
Approach: They propose to measure the compatibility between external guidance and a model's intrinsic policy by introducing an adaptive framework to enhance reasoning performance while explicitly preserving high Affinity.
Outcome: The proposed framework outperforms baseline models while maintaining high Affinity.
Reason Only When Needed: Efficient Generative Reward Modeling via Model-Internal Uncertainty (2026.findings-acl)

Copied to clipboard

Challenge: Existing approaches to generating reward models rely on voting-based mechanisms to evaluate CoT outputs.
Approach: They propose an efficient generative reward modeling framework grounded in model-internal uncertainty.
Outcome: The proposed framework reduces inference cost while improving answer accuracy.
COPR: Continual Human Preference Learning via Optimal Policy Regularization (2025.findings-acl)

Copied to clipboard

Challenge: Reinforcement Learning from Human Feedback (RLHF) is effective for aligning Large Language Models with human preferences, but its complex process limits its ability to continually learn human feedback.
Approach: They propose a non-RL offline method to convert historical optimal policies into optimization constraints when continually learning new preferences.
Outcome: The proposed method outperforms strong CL baselines in terms of reward-based evaluations and human assessment.
Selection Bias Explorations and Debias Methods for Natural Language Sentence Matching Datasets (P19-1)

Copied to clipboard

Challenge: Natural Language Sentence Matching (NLSM) is a popular NLP task.
Approach: They propose to use QuoraQP to train and evaluate NLSM models using a selection bias framework.
Outcome: The proposed framework can improve generalization ability of trained models and give more trustworthy evaluation results for real-world adoptions.
Your Reasoning Model is Secretly a Reward Model - Optimization-Free Verification from Experience (2026.acl-long)

Copied to clipboard

Challenge: Existing verifiers operate on the surface text or on confidence proxies derived from token probabilities, which can be brittle.
Approach: They propose a training-free, non-parametric verifier that summarizes each reasoning trace by an activation delta and compares it to two class centroids computed from labeled experience.
Outcome: The proposed model improves selection and reranking on large and less-calibrated models.
C2PO: Diagnosing and Disentangling Bias Shortcuts in LLMs (2026.findings-acl)

Copied to clipboard

Challenge: Existing approaches to solve large language models address stereotypical and structural biases in isolation . however, prior paradigms address these in isolation, often at the expense of exacerbating the other .
Approach: They propose a framework to tackle latent spurious feature correlations within input that drive erroneous reasoning shortcuts.
Outcome: The proposed framework mitigates stereotypical and structural biases while preserving robust general reasoning capabilities.
Structured Attention for Unsupervised Dialogue Structure Induction (2020.emnlp-main)

Copied to clipboard

Challenge: Using structured attention, a model can learn dialogue structure in unsupervised fashion.
Approach: They propose to incorporate structured attention layers into a Variational Recurrent Neural Network model with discrete latent states to learn dialogue structure in an unsupervised fashion.
Outcome: The proposed model learns semantic structures similar to templates used to generate a dialogue corpus on two-party datasets and on multi-party dialogues, disentangling dialogues without human annotation.
ADaPT: Token-Level Decoupling for Efficient Large Reasoning Models (2026.findings-acl)

Copied to clipboard

Challenge: Existing efficiency-oriented methods attempt to shorten or mix reasoning strategies, yet often degrade reasoning capability.
Approach: They propose a token-level dual-process framework that explicitly decouples efficiency and correctness signals during training.
Outcome: The proposed framework reduces inference cost while maintaining strong reasoning ability across multiple benchmarks.
FedMABench: Benchmarking Mobile GUI Agents on Decentralized Heterogeneous User Data (2025.emnlp-main)

Copied to clipboard

Challenge: Mobile GUI agents have attracted tremendous research participation recently. traditional approaches to mobile agent training rely on centralized data collection.
Approach: They propose a benchmark for federated training and evaluation of mobile GUI agents . they find that federation algorithms consistently outperform local training .
Outcome: The first benchmark for federated training and evaluation of mobile GUI agents is released . it features 6 datasets with 30+ subsets, 8 federation algorithms, 10+ base models, and over 800 apps across 5 categories .
EduBench: A Comprehensive Benchmarking Dataset for Evaluating Large Language Models in Diverse Educational Scenarios (2026.acl-long)

Copied to clipboard

Challenge: Existing benchmarks that focus on knowledge-intensive tasks do not reflect diverse educational scenarios.
Approach: They propose a benchmark that incorporates 9 major scenarios and 4,000 educational contexts.
Outcome: The proposed model performs comparable to state-of-the-art large models on the test set.
Let GPT be a Math Tutor: Teaching Math Word Problem Solvers with Customized Exercise Generation (2023.emnlp-main)

Copied to clipboard

Challenge: Existing approaches for distilling large language models into smaller, more efficient student models are based on educational science principles such as knowledge tracing and personalized learning.
Approach: They propose a method for distilling large language models into smaller, more efficient student models that are aligned with educational science principles such as knowledge tracing and personalized learning.
Outcome: The proposed approach outperforms LLMs on three benchmarks while employing significantly fewer parameters.
Improving Semantic Matching through Dependency-Enhanced Pre-trained Model with Adaptive Fusion (2022.findings-emnlp)

Copied to clipboard

Challenge: Existing work on dependency prior structure integration into pre-trained models is still unclear.
Approach: They propose a dependency-based fusion attention paradigm which explicitly introduces dependency prior structure into pre-trained models and adaptively fuses it with semantic information.
Outcome: The proposed model achieves state-of-the-art or competitive performance on 10 public datasets, demonstrating the benefits of adaptively fusing dependency structure in semantic matching task.
HERALD: An Annotation Efficient Method to Detect User Disengagement in Social Conversations (2021.acl-long)

Copied to clipboard

Challenge: Existing work on detecting user disengagement requires hand-labeling many dialog samples . Currently, self-reported user ratings are constrained to a static corpus .
Approach: They propose an efficient annotation framework that denoises dialog samples instead of manually labeling them.
Outcome: The proposed framework improves annotation efficiency significantly and detects user disengagement in two dialog corpora.
WebAgent-R1: Training Web Agents via End-to-End Multi-Turn Reinforcement Learning (2025.emnlp-main)

Copied to clipboard

Challenge: Existing work on reinforcement learning has focused on single-turn tasks such as solving math problems.
Approach: They propose a framework that learns directly from online interactions by asynchronously generating diverse trajectories, guided by binary rewards depending on task success.
Outcome: Experiments on the WebArena-Lite benchmark show that the framework outperforms state-of-the-art methods and strong proprietary models.
On the Complementarity between Pre-Training and Random-Initialization for Resource-Rich Machine Translation (2022.coling-1)

Copied to clipboard

Challenge: Pre-Training (PT) of text representations has been successfully applied to low-resource Neural Machine Translation (NMT) however, it often fails to achieve notable gains on resource-rich NMT on par with its Random-Initialization (RI) counterpart.
Approach: They propose to combine pre-training and random-initialization techniques to achieve significant improvements in NMT.
Outcome: The proposed model fusion algorithm can achieve significant improvements on two resource-rich translation benchmarks.
Controllable Contamination Detection for Reliable LLM Evaluation with Statistical Guarantees (2026.acl-long)

Copied to clipboard

Challenge: Existing training data detectors fail to detect clean samples from contaminated test sets . existing methods fail to identify clean samples due to black-box nature of LLMs .
Approach: They propose a framework that detects and filters contaminated evaluation data . they propose 'failure detection' to reduce the proportion of contaminated samples mistakenly retained .
Outcome: The proposed framework reduces false discovery rate (FDR) under valid FDR control while maintaining evaluation consistency.
DSQG-Syn: Synthesizing High-quality Data for Text-to-SQL Parsing by Domain Specific Question Generation (2025.findings-naacl)

Copied to clipboard

Challenge: Existing methods for generating SQL queries using natural language questions produce inconsistent NLQ-SQL pairs.
Approach: They propose a text-to-SQL data synthesis framework that generates domain-relevant questions . they synthesize NLQ-SqL pairs that are domain-specific and intent-consistent .
Outcome: The proposed method outperforms closed-source LLMs on the Text-to-SQL task.
A Query-Response Framework for Whole-Page Complex-Layout Document Image Translation with Relevant Regional Concentration (2025.findings-acl)

Copied to clipboard

Challenge: Existing methods for document image translation rely on the vanilla encoder-decoder paradigm . a novel dynamic aggregation mechanism is designed to enhance the text semantics in query features toward translation.
Approach: They propose a Query-Response DIT framework that reformulates the DIT task into a parallel response/translation process of multiple queries.
Outcome: The proposed framework improves translation quality on four translation directions on three benchmarks.
Save the Good Prefix: Precise Error Penalization via Process-Supervised RL to Enhance LLM Reasoning (2026.findings-acl)

Copied to clipboard

Challenge: Existing reinforcement learning methods rely on sparse outcome rewards, which fail to credit correct intermediate steps in partially successful solutions.
Approach: They propose a process reward model that rewards correct steps only when they detect errors . they propose VPPO, which rewards the correct prefix and an erroneous suffix .
Outcome: a new approach outperforms sparse-reward RL and prior PRM-guided baselines on Pass@1 and Pass@K . a process reward model (PRM) outperformed sparser-rebound RL on multiple reasoning benchmarks .
KERS: A Knowledge-Enhanced Framework for Recommendation Dialog Systems with Multiple Subgoals (2021.findings-emnlp)

Copied to clipboard

Challenge: Existing frameworks for multi-subgoal dialogs require a system to build a social bond with users to gain trust and develop affinity.
Approach: They propose a framework for common knowledge-based multi-subgoal dialogs that divides up conversations with multiple subgoals and propose mechanisms to filter noisy knowledge and to include cleaned knowledge in the dialog response generation process.
Outcome: The proposed framework obtains state-of-the-art results on a DuRecDial dataset in both automatic and human evaluation.
Type-enriched Hierarchical Contrastive Strategy for Fine-Grained Entity Typing (2022.coling-1)

Copied to clipboard

Challenge: Experimental results show that fine-grained entity typing (FET) can be used to deduce specific semantic types of entities.
Approach: They propose a type-enriched hierarchical contrastive strategy to model type differences . their method can make type information directly perceptible and improve distinguishability .
Outcome: The proposed method can model the differences between hierarchical types and distinguish multi-grained similar types at different granularities.
MMoE: Enhancing Multimodal Models with Mixtures of Multimodal Interaction Experts (2024.emnlp-main)

Copied to clipboard

Challenge: Multimodal models focus on the correspondence between images and text, but this only covers a subset of real-world interactions.
Approach: They propose an approach to enhance multimodal models by training separate expert models for each type of interaction, such as redundancy present in both modalities, uniqueness in one modality, or synergy that emerges when both . modality is used to capture overlaps in semantic content between images and text, making a strong multi-view redundancies assumption.
Outcome: The proposed approach improves on a sarcasm detection and humor detection task.
Self-Generated Critiques Boost Reward Modeling for Language Models (2025.naacl-long)

Copied to clipboard

Challenge: Existing reward models produce scalar scores and struggle to incorporate critiques in a natural language format.
Approach: They propose a framework that predicts critiques and rewards using self-generated critiques without extra supervision.
Outcome: The proposed framework improves reward modeling accuracy by 3.7%-7.3% compared to standard reward models and LLM judges.
Single-to-mix Modality Alignment with Multimodal Large Language Model for Document Image Machine Translation (2025.acl-long)

Copied to clipboard

Challenge: Document Image Machine Translation (DIMT) faces generalization challenges due to limited training data and the complex interplay between visual and textual information.
Approach: They propose a single-to-mix Modality alignment framework leveraging Multimodal Large Language Models (MLLMs) this framework aligns an imageonly encoder with multimodal representations of an MLLM pre-trained on large-scale document image datasets.
Outcome: The proposed framework improves translation quality in cross-domain generalization and challenging document image scenarios.
Step-by-Step Mastery: Enhancing Soft Constraint Following Ability of Large Language Models (2025.findings-acl)

Copied to clipboard

Challenge: In real-world scenarios, user instructions often contain soft constraints, which are semantically related and cannot be rule-based verified, posing challenges for large language models.
Approach: They propose a pipeline to construct datasets with high-quality outputs for instructions containing soft constraints automatically and use Direct Preference Optimization (DPO) as the training method.
Outcome: The proposed model improves the LLMs' soft constraint following ability by using direct preference optimization (DPO) and constraint quantity.
Document Image Machine Translation with Dynamic Multi-pre-trained Models Assembling (2024.naacl-long)

Copied to clipboard

Challenge: Existing TIMT tasks focus on text-line-level images.
Approach: They propose to extend the existing TIMT task and introduce a new framework to translate a source document image to markdown-formatted target translation.
Outcome: The proposed task aims to translate a source document image with long context and complex layout structure to markdown-formatted target translation.
You Can Have a Second Chance: Unbiased and Multi-bit Watermarking for Diffusion Language Models with Regret-based Remasking (2026.acl-long)

Copied to clipboard

Challenge: Existing sequential LLMs cannot be directly applied to DLMs, as their generation order is arbitrary.
Approach: They propose a stability-aware constraint that allows watermarking only in stable contexts and a bit-controlled, unbiased modulation to preserve the original DLM output distribution.
Outcome: The proposed scheme achieves stable watermarking with minimal quality impact while maintaining high detection accuracy and multi-bit capacity.
ReflectRM: Boosting Generative Reward Models via Self-Reflection within a Unified Judgment Framework (2026.acl-long)

Copied to clipboard

Challenge: Existing methods for generating reward models focus on outcome-level supervision, neglecting analytical process quality, which constrains their potential.
Approach: They propose a novel reward model that leverages self-reflection to assess analytical quality and enhance preference modeling.
Outcome: The proposed model improves performance on four benchmarks and significantly mitigates positional bias.
Sequential-NIAH: A Needle-In-A-Haystack Benchmark for Extracting Sequential Needles from Long Contexts (2025.emnlp-main)

Copied to clipboard

Challenge: Recent models have extended Corresponding Author. context lengths to millions of tokens while maintaining reasoning and comprehension capabilities.
Approach: They propose a benchmark to evaluate the ability of large language models to extract sequential information items from long contexts.
Outcome: The proposed model achieves maximum accuracy of 63.50% on six well-known LLMs.
PromptST: Abstract Prompt Learning for End-to-End Speech Translation (2023.emnlp-main)

Copied to clipboard

Challenge: Experimental results show that PromptST can improve speech-to-text translation by capturing richer linguistic knowledge.
Approach: They propose a plug-in prompt-enhanced S2T model that captures richer linguistic knowledge . they use a 10GB linguistic probing benchmark to investigate the fusion of speech and text features .
Outcome: The proposed model can improve on a strong baseline by capturing richer linguistic knowledge.
A Survey of Deep Learning for Mathematical Reasoning (2023.acl-long)

Copied to clipboard

Challenge: a survey of deep learning for mathematical reasoning examines the field . a comprehensive reading list is provided to assist readers interested in the field.
Approach: They present a survey of deep learning for mathematical reasoning over the past decade . they outline directions for future research and highlight potential for further exploration .
Outcome: The proposed framework is based on the results of a decade-long survey of deep learning for mathematical reasoning.
Training Verifier to Assessing Complex Real-World Tool-Use Trajectories (2026.findings-acl)

Copied to clipboard

Challenge: Existing methods for training effective AI agents often resort to synthetic data generation.
Approach: They propose a plug-and-play framework for data quality control in tool-use scenarios . they construct a tool-verify dataset and release a benchmark to assess its performance .
Outcome: The proposed framework surpasses Qwen2.5-72B-Instruct on Tool-V-Bench and the previous APIGen-MT dataset.
Targeting the Needle, Ignoring the Haystack: Anchoring Crucial Cues for Evolving Scam Call Detection via an LLM-Assisted Classifier (2026.findings-acl)

Copied to clipboard

Challenge: Existing methods for fraud detection on online service platforms often fail to generalize due to the scarcity of labeled data and the continuous evolution of conversational contexts.
Approach: They propose a framework that anchors detection on Semantic Primitives . they prioritize stable evidence over conversational noise to ensure a verifiable fraud tactic .
Outcome: The proposed framework achieves superior robustness and efficiency compared to baselines . it prioritizes stable evidence over diverse conversational noise .
Rˆ3Net:Relation-embedded Representation Reconstruction Network for Change Captioning (2021.emnlp-main)

Copied to clipboard

Challenge: Existing work on change captioning uses a natural language sentence to describe disagreement between two images.
Approach: They propose a Relation-embedded Representation Reconstruction Network to distinguish real change from clutter and irrelevant changes.
Outcome: The proposed method achieves state-of-the-art on two public datasets.
ConsistRM: Improving Generative Reward Models via Consistency-Aware Self-Training (2026.acl-long)

Copied to clipboard

Challenge: ConsistRM is a self-training framework that enables effective and stable GRM training without human annotations.
Approach: They propose a self-training framework that enables effective and stable GRM training without human annotations.
Outcome: The proposed framework outperforms vanilla Reinforcement Fine-Tuning (RFT) by 1.5% on five benchmark datasets.
Adaptive Helpfulness–Harmlessness Alignment with Preference Vectors (2026.eacl-long)

Copied to clipboard

Challenge: Existing approaches to balancing helpfulness and harmlessness suffer from performance conflicts, limited controllability, and poor extendability.
Approach: They propose a framework that allows users to control their own preferences and dynamically merge them at test time.
Outcome: The proposed framework improves helpfulness without conservatism and smooth control over preference trade-offs.
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.
COIG-P: A High-Quality and Large-Scale Chinese Preference Dataset for Alignment with Human Values (2026.findings-eacl)

Copied to clipboard

Challenge: Existing Chinese preference datasets suffer from limited scale, restricted domain coverage, and insufficiently rigorous data validation.
Approach: They propose an LLM-based data annotation pipeline with no human intervention to annotate Chinese preference datasets.
Outcome: The proposed pipeline outperforms existing Chinese preference datasets on AlignBench and Chinese Reward Benchmark.
Optimal Partial Transport Based Sentence Selection for Long-form Document Matching (2022.coling-1)

Copied to clipboard

Challenge: Existing methods for document matching are limited by the partial nature of the sentence-level matching signals.
Approach: They propose a matching approach that equips existing document matching models with an Optimal Partial Transport component, namely OPT-Match, which selects the key sentences that play a major role in matching.
Outcome: The proposed approach outperforms existing models on four publicly available datasets and the key sentences selected by it are consistent with human-provided rationales.
Instructions are all you need: Self-supervised Reinforcement Learning for Instruction Following (2026.acl-long)

Copied to clipboard

Challenge: Existing reinforcement learning approaches suffer from dependency on external supervision and sparse reward signals from multi-constraint tasks.
Approach: They propose a self-supervised reinforcement learning framework that eliminates dependency on external supervision by deriving reward signals directly from instructions and generating pseudo-labels for reward model training.
Outcome: The proposed framework achieves strong improvements across 3 in-domain and 5 out-of-domain datasets while maintaining computational efficiency.
Ground Every Sentence: Improving Retrieval-Augmented LLMs with Interleaved Reference-Claim Generation (2025.findings-naacl)

Copied to clipboard

Challenge: Existing methods to enhance credibility and verifiability of large language models (LLMs) mainly focus on passage-level or paragraph-level references or citations, which fall short in verifikatability.
Approach: They propose a method that provides sentence-level citations in LLM-generated responses.
Outcome: The proposed method achieves 90% accuracy in long-form question-answering tasks.
MinT: Boosting Generalization in Mathematical Reasoning via Multi-view Fine-tuning (2024.lrec-main)

Copied to clipboard

Challenge: Existing methods focus on specializing LMs in mathematical reasoning and rely on knowledge distillation.
Approach: They propose a multi-view fine-tuning method that exploits existing mathematical problem datasets with diverse annotation styles.
Outcome: The proposed method outperforms existing methods that rely heavily on LLM teachers . it grants models generalization ability across views and datasets, and the capability to learn from inaccurate or incomplete data.
FocalOrder: Focal Preference Optimization for Reading Order Detection (2026.acl-long)

Copied to clipboard

Challenge: Existing methods for document comprehension rely on uniform supervision, resulting in a performance degradation in the intermediate sections.
Approach: They propose a framework driven by Focal Preference Optimization to detect reading order in document layouts.
Outcome: The proposed framework outperforms competing baselines and surpasses large-scale general VLMs.
EconProver: Towards More Economical Test-Time Scaling for Automated Theorem Proving (2026.acl-long)

Copied to clipboard

Challenge: Large Language Models (LLMs) have recently advanced the field of Automated Theorem Proving (ATP) Existing cost analyses regulate only the number of sampling passes, ignoring the substantial disparities in sampling costs.
Approach: They propose to integrate two complementary methods into a unified EconRL pipeline to increase pass rates under constrained sampling passes.
Outcome: The proposed method reduces token usage and sample passes while maintaining the original performance.
Speech Sense Disambiguation: Tackling Homophone Ambiguity in End-to-End Speech Translation (2024.acl-long)

Copied to clipboard

Challenge: End-to-end speech translation (ST) models require simultaneous crossmodal and crosslingual transformations to be effective.
Approach: They propose a homophone-aware contrastive learning approach that integrates a speech-text masking strategy to reduce ambiguity.
Outcome: The proposed approach achieves SOTA results on BLEU scores on different MuST-C and CoVoST ST tasks, underlining its effectiveness in reducing speech sense ambiguity.
MPBoCo: Multimodal Prompt-based Boundary-enhanced Continual Framework for Joint Entity and Relation Extraction (2026.acl-long)

Copied to clipboard

Challenge: Existing methods struggle to balance real-time adaptability and computational efficiency in continual learning scenarios.
Approach: They propose a Continual Multimodal Entity and Relation Joint Extraction task and a Multimodal Prompt-based Boundary-enhanced Continuum framework that stores task-specific knowledge via learnable multimodal prompts.
Outcome: The proposed framework outperforms baseline methods in real-world scenarios by 5.5% and 7.2%.
Flexibly Utilize Memory for Long-Term Conversation via a Fragment-then-Compose Framework (2025.emnlp-main)

Copied to clipboard

Challenge: Large language models extract useful information from conversation history to enhance the response in long-term conversations.
Approach: They propose a Fragment-then-Compose framework to optimize memory utilization for long-term open-domain conversation.
Outcome: The proposed framework can be used to extract useful information from conversation history . it can be adapted to different situations and improve response generation .
Unsupervised Dense Retrieval with Relevance-Aware Contrastive Pre-Training (2023.findings-acl)

Copied to clipboard

Challenge: Dense retrievers have impressive performance, but their demand for abundant training data limits their application scenarios.
Approach: They propose a method which uses unlabeled data to construct pseudo-positive examples from unlabelled data and then contrastively weighs the contrastive loss of different pairs according to the estimated relevance.
Outcome: The proposed method beats the SOTA unsupervised Contriever model on BEIR and open-domain QA retrieval benchmarks and is a good few-shot learner.
Self-Training with Differentiable Teacher (2022.findings-naacl)

Copied to clipboard

Challenge: Existing methods for self-training are interpreted as teacher-student frameworks, where the teacher generates pseudo-labels and the student makes predictions.
Approach: They propose a differentiable self-training method that treats teacher-student as a Stackelberg game where a leader is always in a more advantageous position than a follower.
Outcome: The proposed model outperforms existing methods on semi- and weakly-supervised learning tasks on semi and weak supervised tasks.
Beyond User Self-Reported Likert Scale Ratings: A Comparison Model for Automatic Dialog Evaluation (2020.acl-main)

Copied to clipboard

Challenge: Existing automatic dialog evaluation metrics are mostly reference-based . Existing models that measure self-reported user ratings are biased and variance among different users.
Approach: They propose an automatic evaluation model that automatically cleans self-reported user ratings as it trains on them.
Outcome: The proposed model achieves 89.2% accuracy in the dialog comparison task.
Born a BabyNet with Hierarchical Parental Supervision for End-to-End Text Image Machine Translation (2024.lrec-main)

Copied to clipboard

Challenge: Existing research on text image machine translation (TIMT) is divided into two types: Cascade methods combine text image recognition and MT models to recognize source language text images.
Approach: They propose a method which is optimized with hierarchical parental supervision to improve translation performance.
Outcome: The proposed method significantly outperforms existing methods on synthetic and real-world tests on both synthetic and realistic images.
Improving MLLM’s Document Image Machine Translation via Synchronously Self-reviewing Its OCR Proficiency (2025.findings-acl)

Copied to clipboard

Challenge: Multimodal Large Language Models (MLLMs) have shown strong performance in document image tasks, especially Optical Character Recognition (OCR). However, they struggle with Document Image Machine Translation (DIMT), which requires handling both cross-modal and cross-lingual challenges.
Approach: They propose a novel fine-tuning paradigm that allows the model to generate OCR text before producing translation text, which allows it to leverage its strong monolingual OCR ability while learning to translate text across languages.
Outcome: The proposed model can leverage its strong monolingual OCR ability while learning to translate text across languages.
QAEncoder: Towards Aligned Representation Learning in Question Answering Systems (2025.acl-long)

Copied to clipboard

Challenge: Modern QA systems entail retrieval-augmented generation (RAG) for accurate and trustworthy responses, but the inherent gap between user queries and relevant documents hinders precise matching.
Approach: They propose a retrieval-augmented generation (RAG)-based approach to bridge this gap by attaching document fingerprints to the embedding to estimate the expectation of potential queries.
Outcome: Experiments across diverse datasets, languages, and embedding models confirm the proposed solution is simple-yet-effective with zero additional index storage, retrieval latency, training costs, or catastrophic forgetting and hallucination issues.
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.
Source Critical Reinforcement Learning for Transferring Spoken Language Understanding to a New Language (C18-1)

Copied to clipboard

Challenge: a study aims to develop a language transferring system to avoid the trouble of acquiring and labeling a new big SLU corpus . general-purpose translators cannot handle the lot of semantic labels, not to mention cultural differences . a RL-based language transfer method can be used to adapt the adapted translator to a target language .
Approach: They propose to use reinforcement learning to adapt a spoken language understanding model to a target language.
Outcome: The proposed language transferring method improves domain classification accuracy by 22% compared with naive translation . the proposed language transfer method can be used on Chinese to English translators with more proper slot tags .
Understanding and Mitigating Spurious Signal Amplification in Test-Time Reinforcement Learning for Math Reasoning (2026.findings-acl)

Copied to clipboard

Challenge: a framework to mitigate spurious optimization signals is proposed for test-time reinforcement learning (TTRL) Reinforcement learning with verifiable rewards (RLVR) is an effective paradigm for improving large language models on structured challenging reasoning tasks.
Approach: They propose a framework to mitigate spurious optimization signals from label noise . they propose to use a frequency-based sampling strategy to exclude ambiguous samples .
Outcome: The proposed framework outperforms existing TTRL baselines on three large language models across multiple mathematical reasoning benchmarks.
SAS: Dialogue State Tracking via Slot Attention and Slot Information Sharing (2020.acl-main)

Copied to clipboard

Challenge: Existing models with excessive information are inefficient and costly .
Approach: They propose to integrate a Dialogue State Tracker with Slot Attention and Slot Information Sharing to reduce redundant information’s interference and improve long dialogue context tracking.
Outcome: The proposed model significantly outperforms existing models on the MultiWOZ dataset.
MM-Verify: Enhancing Multimodal Reasoning with Chain-of-Thought Verification (2025.acl-long)

Copied to clipboard

Challenge: MM-Verifier and MM Reasoner are a powerful multimodal reasoning model . large language models (LLMs) have demonstrated exceptional performance across tasks spanning myriad domains.
Approach: They propose a method which combines tree search and verification to generate high-quality chain-of-thought data.
Outcome: The proposed method outperforms all larger models on the MathCheck, MathVista, and MathVerse benchmarks.
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.
From Chaotic OCR Words to Coherent Document: A Fine-to-Coarse Zoom-Out Network for Complex-Layout Document Image Translation (2025.coling-main)

Copied to clipboard

Challenge: Document Image Translation (DIT) aims to translate documents in images from one language to another.
Approach: They propose a novel end-to-end network called Zoom-out DIT to improve document translation by combining word positioning, sentence recognition and document organization.
Outcome: The proposed network improves word positioning, sentence recognition and document organization, and improves translation quality.
Learn Beyond The Answer: Training Language Models with Reflection for Mathematical Reasoning (2024.emnlp-main)

Copied to clipboard

Challenge: Existing studies focus on *broadening* the training set with data augmentation techniques to maximize such benefits.
Approach: They propose a method that embeds problem reflection into each training instance.
Outcome: The proposed method enhances performance in standard and complex scenarios that require reflective thinking.
Chain-of-Reasoning: Towards Unified Mathematical Reasoning in Large Language Models via a Multi-Paradigm Perspective (2025.acl-long)

Copied to clipboard

Challenge: Existing work shows that LLMs rely on single-paradigm reasoning that limits their effectiveness across diverse tasks.
Approach: They propose a new framework that integrates multiple reasoning paradigms to enable synergistic collaboration.
Outcome: The proposed model outperforms current SOTA models in theorem proving tasks and the MATH benchmark in arithmetic tasks.
AgenticRAGTracer: A Hop-Aware Benchmark for Diagnosing Multi-Step Retrieval Reasoning in Agentic RAG (2026.findings-acl)

Copied to clipboard

Challenge: Existing benchmarks provide only final questions and answers, while lacking intermediate hop-level questions that gradually connect atomic questions to the final multi-hop query.
Approach: They propose to build a multi-hop reasoning model that is primarily constructed automatically by large language models and designed to support step-by-step validation.
Outcome: The proposed benchmark spans multiple domains, contains 1,305 data points, and has no overlap with existing mainstream benchmarks.
Order Matters: Investigate the Position Bias in Multi-constraint Instruction Following (2025.findings-acl)

Copied to clipboard

Challenge: Existing large language models struggle to follow multi-constraint instructions in real-world applications.
Approach: They propose to quantify the difficulty distribution of constraints by a novel Difficulty Distribution Index (CDDI) they find that LLMs are more performant when presented with constraints in a “hard-to-easy” order.
Outcome: The proposed model is more performant when presented with constraints in a “hard-to-easy” order, compared with existing models with different architectures and sizes of parameters.
CritiQ: Mining Data Quality Criteria from Human Preferences (2025.acl-long)

Copied to clipboard

Challenge: Existing methods to train language models rely on manual design, perplexity, or careful prompt engineering.
Approach: They propose a method that automatically mines criteria from human preferences for data quality with only 30 human-annotated pairs and performs efficient data selection.
Outcome: The proposed method improves on human-annotated test sets and shows high accuracy on code, math, and logic domains.
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.
RoAST: Robustifying Language Models via Adversarial Perturbation with Selective Training (2023.findings-emnlp)

Copied to clipboard

Challenge: Several perspectives of robustness for pre-trained language models have been studied independently, but lacking a unified consideration in multiple perspectives.
Approach: They propose a technique to enhance the multi-perspective robustness of LMs by introducing adversarial perturbation while the model parameters are selectively updated upon their relative importance.
Outcome: The proposed technique improves the robustness of LMs by incorporating four perspectives on model robustness.
Every Document Owns Its Structure: Inductive Text Classification via Graph Neural Networks (2020.acl-main)

Copied to clipboard

Challenge: Existing graph-based methods for text classification cannot capture contextual word relationships within each document nor can they produce inductive learning of new words.
Approach: They propose to use Graph Neural Networks to learn the local word representations and then aggregate the word nodes as the document embeddings.
Outcome: The proposed method outperforms state-of-the-art methods on four benchmark datasets.
MGCL: Multi-Granularity Clue Learning for Emotion-Cause Pair Extraction via Cross-Grained Knowledge Distillation (2024.findings-emnlp)

Copied to clipboard

Challenge: Traditional methods often rely on coarse-grained clause-level annotations, which overlook valuable fine-grain clues.
Approach: They propose a method that captures fine-grained clues from a weakly-supervised perspective efficiently by using a teacher model to give sub-clause clues without needing fine-grain annotations.
Outcome: The proposed method achieves state-of-the-art performance while offering improved interpretability.
VenusFactory: An Integrated System for Protein Engineering with Data Retrieval and Language Model Fine-Tuning (2025.acl-demo)

Copied to clipboard

Challenge: Pre-trained protein language models have been used in protein engineering, but their adoption is limited due to data collection, task benchmarking, and application challenges.
Approach: They propose a versatile engine that integrates biological data retrieval, standardized task benchmarking, and modular fine-tuning of PLMs.
Outcome: The proposed engine integrates biological data retrieval, task benchmarking, and modular fine-tuning of PLMs.
Scaling Law for Multimodal Large Language Model Supervised Fine-Tuning (2026.acl-long)

Copied to clipboard

Challenge: supervised fine-tuning (SFT) is crucial for multimodal large language models, yet a comprehensive scaling law is lacking . et al.: scaling laws focus on model size, pre-training tokens, and MLLM SFT data volumes .
Approach: They propose two scaling laws to guide optimal model-data configuration . they propose one applicable when training data volumes are well defined by researchers .
Outcome: The proposed scaling laws provide valuable recommendations for optimal resource allocation . they show that the proposed laws are more accurate than existing models .
MetaLogic: Logical Reasoning Explanations with Fine-Grained Structure (2022.emnlp-main)

Copied to clipboard

Challenge: Current explanation datasets often employ synthetic data with simple reasoning structures.
Approach: They propose a comprehensive logical reasoning explanation form that incorporates three main components to better fit the human cognitive process.
Outcome: The proposed model performs better than existing models on real-life scenarios, but is more challenging for the current models.
FuseSearch: Learning Adaptive Parallel Execution for Efficient Code Localization (2026.findings-acl)

Copied to clipboard

Challenge: Existing parallel code localization agents suffer from a 34.9% redundant tool invocation rate . specialized localization agent that operate as dedicated search components is needed to achieve high localization accuracy.
Approach: They propose a parallel code localization system that reframes parallel code execution as a quality–efficiency co-optimization problem.
Outcome: The proposed method matches SOTA performance while being 93.6% faster.

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