Papers by Liang Liu
Attention-guided Self-reflection for Zero-shot Hallucination Detection in Large Language Models (2025.emnlp-main)
Copied to clipboard
| Challenge: | Hallucination is a significant barrier to the effective application of Large Language Models (LLMs). |
| Approach: | They propose an Attention-Guided SElf-Reflection approach for hallucination detection in Large Language Models. |
| Outcome: | The proposed method significantly outperforms existing methods in zero-shot hallucination detection on four widely-used LLMs across three different halluciation benchmarks. |
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. |
To Forget or Not? Towards Practical Knowledge Unlearning for Large Language Models (2024.findings-emnlp)
Copied to clipboard
Bozhong Tian, Xiaozhuan Liang, Siyuan Cheng, Qingbin Liu, Mengru Wang, Dianbo Sui, Xi Chen, Huajun Chen, Ningyu Zhang
| Challenge: | Existing unlearning paradigms are mired in vague forgetting boundaries, erasing knowledge indiscriminately. |
| Approach: | They propose a benchmark to evaluate if unlearning erases essential knowledge . they propose 'knowUnDo' which uses copyrighted content and privacy domains . |
| Outcome: | The proposed method is superior to existing methods in both precise knowledge unlearning and general knowledge retaining of LLMs. |
AFT-Tab: Adversarial Fine-Tuning for Tabular Data Synthesis with Long Text Columns (2026.acl-long)
Copied to clipboard
| Challenge: | Existing tabular data synthesis methods fail to account for cross-modal heterogeneity of real-world tables, where structured continuous and discrete attributes coexist with unstructured long-text columns. |
| Approach: | They propose a framework that synergistically trains an LLM-based text generator and a deep-learning-based non-textual generator to quantify cross-modal semantic alignment. |
| Outcome: | The proposed framework outperforms state-of-the-art frameworks in fidelity, diversity, and task utility. |
Temporal Knowledge Graph Reasoning with Dynamic Hypergraph Embedding (2024.lrec-main)
Copied to clipboard
| Challenge: | Existing models that model temporal dynamics with knowledge graphs and graph convolution networks lack high-order interactions between objects in TKG, which is an important factor to predict future facts. |
| Approach: | They propose to embed temporal knowledge graph reasoning by constructing hypergraphs based on temporal information graphs at different timestamps and then adapt dynamic meta-embedding to fit TKG. |
| Outcome: | The proposed method outperforms baseline models on public TKG datasets and provides good interpretation for the predicted results. |
CogGPT: Unleashing the Power of Cognitive Dynamics on Large Language Models (2024.findings-emnlp)
Copied to clipboard
Yaojia Lv, Haojie Pan, Zekun Wang, Jiafeng Liang, Yuanxing Liu, Ruiji Fu, Ming Liu, Zhongyuan Wang, Bing Qin
| Challenge: | Recent advances in large language models (LLMs) focus on replicating human cognition in specific contexts, overlooking the inherently dynamic nature of cognition. |
| Approach: | They propose a task to assess cognitive dynamics of large language models (LLMs) they introduce a benchmark and two evaluation metrics to validate the benchmark and evaluate it through participant surveys. |
| Outcome: | The proposed task overcomes the limitations of existing methods and is available for download. |
Too Long, Do Re-weighting for Efficient LLM Reasoning Compression (2026.acl-long)
Copied to clipboard
Zhong-Zhi Li, Xiao Liang, Zihao Tang, Lei Ji, Peijie Wang, Haotian Xu, Xing W, Haizhen Huang, Weiwei Deng, Yeyun Gong, Zhijiang Guo, Xiao Liu, Fei Yin, Cheng-Lin Liu
| Challenge: | Large Language Models (LLMs) have recently achieved remarkable progress on complex reasoning tasks by leveraging extended Chain-of-Thought (CoT) techniques. |
| Approach: | They propose a method that uses Extended Chain-of-Thought (EFT) to reduce the number of output tokens by nearly 40% while maintaining the accuracy of the reasoning. |
| Outcome: | The proposed method reduces the number of output tokens by nearly 40% while maintaining the accuracy of the reasoning. |
A Mousetrap: Fooling Large Reasoning Models for Jailbreak with Chain of Iterative Chaos (2025.findings-acl)
Copied to clipboard
| Challenge: | Large Reasoning Models (LRMs) have advanced beyond traditional Large Language Models, yet they pose heightened safety risks. |
| Approach: | They propose a first jailbreak attack targeting Large Reasoning Models . they exploit a Chaos Machine component to transform attack prompts with diverse one-to-one mappings based on the reasoning chain . |
| Outcome: | The proposed attack exploits the unique vulnerabilities of LRMs by integrating a Chaos Machine. success rates of the mousetrap attack are as high as 96%, 86% and 98% respectively. |
A Regularization-based Transfer Learning Method for Information Extraction via Instructed Graph Decoder (2024.lrec-main)
Copied to clipboard
| Challenge: | Existing methods for information extraction (IE) focus on training task-specific models, while common knowledge among different IE tasks is not explicitly modeled. |
| Approach: | They propose a regularization-based transfer learning method for IE via an instructed graph decoder which decodes various complex structures into a graph uniformly based on corresponding instructions. |
| Outcome: | The proposed method can learn common knowledge from existing datasets and transfer it to a new dataset with new labels. |
Composable Text Controls in Latent Space with ODEs (2023.emnlp-main)
Copied to clipboard
Guangyi Liu, Zeyu Feng, Yuan Gao, Zichao Yang, Xiaodan Liang, Junwei Bao, Xiaodong He, Shuguang Cui, Zhen Li, Zhiting Hu
| Challenge: | Existing approaches to composable text operations often require plug-and-play . a single LM can perform arbitrary text operation composition in the latent space . |
| Approach: | They propose an efficient approach for composable text operations in the latent space of text . they connect pretrained LMs to the laten space and adapt them to the space . |
| Outcome: | The proposed approach improves on existing methods in the latent space of text. |
CriticBench: Benchmarking LLMs for Critique-Correct Reasoning (2024.findings-acl)
Copied to clipboard
| Challenge: | CriticBench is a benchmark designed to assess LLMs’ abilities to critique and refine their reasoning across a variety of tasks. |
| Approach: | They propose a benchmark to assess LLMs' ability to critique and correct reasoning across a variety of tasks. |
| Outcome: | The proposed benchmark examines the performance of 17 large language models in generation, critique, and correction reasoning. |
Dual-Axis Generative Reward Model Toward Semantic and Turn-taking Robustness in Interactive Spoken Dialogue Models (2026.acl-long)
Copied to clipboard
Yifu Chen, Shengpeng Ji, Zhengqing Liu, Qian Chen, Wen Wang, Ziqing Wang, Yangzhuo Li, Tianle Liang, Zhou Zhao
| Challenge: | Reinforcement learning (RL) has improved text- and vision-language models, but its application in SDMs is hindered. |
| Approach: | They propose a dual-axis Generative Reward Model that provides semantic quality and interaction timing for SDMs. |
| Outcome: | The proposed model achieves state-of-the-art performance on interaction-quality assessment across a wide spectrum of datasets. |
Zero-shot Sharpness-Aware Quantization for Pre-trained Language Models (2023.emnlp-main)
Copied to clipboard
| Challenge: | Existing zero-shot quantization methods are based on overfitting problem in adversarial learning process, leading to sub-optimal performance. |
| Approach: | They propose a zero-shot sharpness-aware quantization framework for the quantization of various PLMs by optimizing a minimax problem. |
| Outcome: | The proposed framework can achieve significant performance gains on discriminative and generative PLMs. |
Large Language Models are not Fair Evaluators (2024.acl-long)
Copied to clipboard
Peiyi Wang, Lei Li, Liang Chen, Zefan Cai, Dawei Zhu, Binghuai Lin, Yunbo Cao, Lingpeng Kong, Qi Liu, Tianyu Liu, Zhifang Sui
| Challenge: | Existing evaluation frameworks that use large language models as referees are insufficient for accurately assessing their alignment with human intent. |
| Approach: | They propose a calibration framework to address positional bias in large language models as evaluators by manually annotating the “win/tie/lose” outcomes of responses from ChatGPT and Vicuna-13B in the Vicun A Benchmark’s question prompt. |
| Outcome: | The proposed framework alleviates evaluation bias, resulting in closer alignment with human judgments. |
RTQA : Recursive Thinking for Complex Temporal Knowledge Graph Question Answering with Large Language Models (2025.emnlp-main)
Copied to clipboard
| Challenge: | Current temporal knowledge graph question answering methods focus on implicit temporal constraints and lack the capability to handle complex temporal queries. |
| Approach: | They propose a temporal knowledge graph question answering framework that recursively decomposes questions into sub-problems and employs multi-path answer aggregation to improve fault tolerance. |
| Outcome: | The proposed framework outperforms existing methods on multiTQ and TimelineKGQA benchmarks. |
Document-Level Event Argument Extraction With a Chain Reasoning Paradigm (2023.acl-long)
Copied to clipboard
| Challenge: | Document-level event argument extraction aims to identify event arguments beyond sentence level, where a significant challenge is to model long-range dependencies. |
| Approach: | They propose a chain reasoning paradigm which captures long-range interdependence due to the chains’ compositional nature and generates decomposable first-order logic rules for reasoning. |
| Outcome: | The proposed method outperforms previous methods on two benchmarks and is robust enough to defend against adversarial attacks. |
Revisiting Knowledge Distillation for Autoregressive Language Models (2024.acl-long)
Copied to clipboard
| Challenge: | Autoregressive language models (LMs) are expensive and memory intensive, preventing the development of industrial applications. |
| Approach: | They propose an adaptive teaching approach to improve the KD of autoregressive language models by distilling knowledge into a small student model. |
| Outcome: | The proposed method can achieve consistent and significant performance gains across all model types and sizes. |
Logical Closed Loop: Uncovering Object Hallucinations in Large Vision-Language Models (2024.findings-acl)
Copied to clipboard
| Challenge: | Object hallucination has been an Achilles’ heel which hinders the broader applications of large vision-language models (LVLMs). |
| Approach: | They propose a logical closed loop-based framework for Object Hallucination Detection and Mitigation that uses logical consistency probing to raise questions with logical correlations to determine hallucinations. |
| Outcome: | The proposed method can be applied to all existing LVLMs and is effective and general. |
Learning from Contrasts: Synthesizing Reasoning Paths from Diverse Search Trajectories (2026.acl-long)
Copied to clipboard
| Challenge: | MCTS methods retain only the single highest-reward trajectory, discarding comparative signals present in the many explored paths. |
| Approach: | They propose a framework that transforms supervision extraction into a synthesis procedure. |
| Outcome: | The proposed framework matches or exceeds baselines on 60K CRPS-synthesized examples on out-of-domain benchmarks. |
ACR: Adaptive Context Refactoring via Context Refactoring Operators for Multi-Turn Dialogue (2026.findings-acl)
Copied to clipboard
Jiawei Shen, Jia Zhu, Hanghui Guo, Weijie Shi, Yue Cui, Qingyu Niu, Guoqing Ma, Jingjiang Liu, Yidan Liang, Yilin Wang, Shimin Di, Jiajie Xu
| Challenge: | Existing approaches to multi-turn dialogues lack contextual consistency and dependencies, and models struggle to maintain factual faithfulness as interaction turns increase. |
| Approach: | They propose an adaptive context refactoring framework that monitors and reshapes the interaction history to mitigate contextual inertia and state drift. |
| Outcome: | The proposed model outperforms baselines while reducing token consumption. |
Cool-Fusion: Fuse Large Language Models without Training (2025.acl-long)
Copied to clipboard
| Challenge: | Cool-Fusion is a simple yet effective approach to combine two or more heterogeneous large language models . |
| Approach: | They propose a method that fuses the knowledge of two or more heterogeneous large language models to leverage complementary strengths. |
| Outcome: | The proposed method increases accuracy from three strong source LLMs on GSM8K by 17.4%. |
Task Oriented In-Domain Data Augmentation (2024.emnlp-main)
Copied to clipboard
| Challenge: | Existing methods for large language models suffer from two major issues: in-domain data are scarce compared with general domain-agnostic data. |
| Approach: | They propose a task-oriented in-domain data augmentation framework that uses in- domain data selection and task-orientated synthetic passage generation to adapt LLMs to two domains: advertisement and math. |
| Outcome: | The proposed framework improves LLM performance by 8% in the advertisement domain and 7.5% in the math domain. |
Neutralizing Bias in LLM Reasoning using Entailment Graphs (2025.findings-acl)
Copied to clipboard
| Challenge: | Natural Language Inference (NLI) is a foundational understanding task in language understanding. |
| Approach: | They propose a framework to construct counterfactual reasoning data and fine-tune LLMs to reduce attestation bias. |
| Outcome: | The proposed framework reduces hallucinations from attestation bias on original and bias-neutralized datasets while keeping hypotheses unchanged. |
Towards Understanding and Improving Knowledge Distillation for Neural Machine Translation (2023.acl-long)
Copied to clipboard
| Challenge: | Existing knowledge distillation techniques for neural machine translation lack special treatment on the top-1 information, which is limiting the potential of KD. |
| Approach: | They propose a method to distill knowledge from top-1 predictions of teachers and a technique to infuse more additional knowledge by distilling on the data without ground-truth targets. |
| Outcome: | The proposed method outperforms the vanilla word-level KD and outperfies the existing methods on three different students with different capacity gaps. |
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. |
RepoAgent: An LLM-Powered Open-Source Framework for Repository-level Code Documentation Generation (2024.emnlp-demo)
Copied to clipboard
Qinyu Luo, Yining Ye, Shihao Liang, Zhong Zhang, Yujia Qin, Yaxi Lu, Yesai Wu, Xin Cong, Yankai Lin, Yingli Zhang, Xiaoyin Che, Zhiyuan Liu, Maosong Sun
| Challenge: | Xia et al., 2018) demonstrate that a large language model can generate and maintain high-quality code documentation. |
| Approach: | They propose a large language model powered open-source framework for generating, maintaining, and updating code documentation. |
| Outcome: | The proposed framework generates high-quality documentation for the entire project. |
Progressive Multi-Granularity Training for Non-Autoregressive Translation (2021.findings-acl)
Copied to clipboard
| Challenge: | Non-autoregressive translation models are weak at learning high-mode knowledge, argues a new study . despite the improved learning difficulty, there are still complicated word orders and structures in the synthetic sentences, making the NAT performance sub-optimal. |
| Approach: | They propose to train non-autoregressive translation models to learn fine-grained lower-mode knowledge . they break down sentence-level examples into three types and increase granularities . |
| Outcome: | The proposed method improves phrase translation accuracy and model reordering ability against strong NAT baselines. |
HacRED: A Large-Scale Relation Extraction Dataset Toward Hard Cases in Practical Applications (2021.findings-acl)
Copied to clipboard
Qiao Cheng, Juntao Liu, Xiaoye Qu, Jin Zhao, Jiaqing Liang, Zhefeng Wang, Baoxing Huai, Nicholas Jing Yuan, Yanghua Xiao
| Challenge: | Relation extraction (RE) is an essential topic in natural language processing and has attracted extensive attention. |
| Approach: | They propose a case-oriented construction framework to build a hard case relation extraction dataset with 65,225 relational facts annotated from 9,231 documents. |
| Outcome: | The proposed model achieves a high 96% F1 score on data quality and is far lower than humans. |
LM-Lexicon: Improving Definition Modeling via Harmonizing Semantic Experts (2026.eacl-long)
Copied to clipboard
| Challenge: | LM-LEXICON is a definition modeling approach that integrates data clustering, semantic expert learning, and model merging. |
| Approach: | They propose a definition modeling approach that integrates data clustering, semantic expert learning, and model merging using a sparse mixture-of-experts architecture. |
| Outcome: | The proposed model outperforms existing methods on five widely used benchmarks and achieves a BLEU score of 7%. |
MeanAudio: Fast and Faithful Text-to-Audio Generation with Mean Flows (2026.acl-long)
Copied to clipboard
| Challenge: | Recent advances in Text-to-Audio Generation (TTA) systems suffer from slow inference speed, authors report . authors demonstrate that MeanAudia achieves state-of-the-art performance in single-step audio generation . |
| Approach: | They propose a text-to-audio generator capable of rendering realistic sound with only one function evaluation. |
| Outcome: | The proposed system achieves state-of-the-art performance in single-step audio generation. |
CREATER: CTR-driven Advertising Text Generation with Controlled Pre-Training and Contrastive Fine-Tuning (2022.naacl-industry)
Copied to clipboard
| Challenge: | a paper focuses on automatically generating the text of an ad to capture user interest for achieving higher click-through rate. |
| Approach: | They propose a CTR-driven advertising text generation approach to generate ad texts based on user reviews. |
| Outcome: | The proposed approach outperforms existing approaches on industrial datasets and on large-scale unpaired reviews. |
The Efficiency vs. Accuracy Trade-off: Optimizing RAG-Enhanced LLM Recommender Systems Using Multi-Head Early Exit (2025.acl-long)
Copied to clipboard
Huixue Zhou, Hengrui Gu, Zaifu Zhan, Xi Liu, Kaixiong Zhou, Yongkang Xiao, Mingfu Liang, Srinivas Prasad Govindan, Piyush Chawla, Jiyan Yang, Xiangfei Meng, Huayu Li, Buyun Zhang, Liang Luo, Wen-Yen Chen, Yiping Han, Bo Long, Rui Zhang, Tianlong Chen
| Challenge: | Existing frameworks for Large Language Models (LLMs) for Click-Through Rate prediction require a careful balance between computational efficiency and predictive accuracy. |
| Approach: | They propose a framework that integrates Retrieval-Augmented Generation with a novel multi-head early exit architecture to address both challenges. |
| Outcome: | The proposed framework reduces retrieval time while maintaining high model performance. |
SKA-Bench: A Fine-Grained Benchmark for Evaluating Structured Knowledge Understanding of LLMs (2025.findings-emnlp)
Copied to clipboard
| Challenge: | Existing evaluations for Structured Knowledge (SK) understanding are non-rigorous and focus on a single type of SK. |
| Approach: | They propose a structured knowledge understanding benchmark that includes four widely used structured knowledge forms. |
| Outcome: | The proposed benchmark is based on four widely used structured knowledge forms . it includes a question, an answer, positive knowledge units, and noisy knowledge units . |
Rethinking Task-Specific Knowledge Distillation: Contextualized Corpus as Better Textbook (2022.emnlp-main)
Copied to clipboard
| Challenge: | Existing methods for knowledge distillation use a two-stage paradigm: general distillation with a task-agnostic general corpus and task-specific distillation using augmented task- specific corpus. |
| Approach: | They propose a contextualized corpus that contextualizes task corpus with large-scale general corpus through relevance-based text retrieval to improve student learning. |
| Outcome: | The proposed model improves on the GLUE benchmark and shows that it is better than generalized corpus and augmented task-specific corpus. |
Temp-R1: A Unified Autonomous Agent for Complex Temporal KGQA via Reverse Curriculum Reinforcement Learning (2026.acl-long)
Copied to clipboard
Zhaoyan Gong, Zhiqiang Liu, Songze Li, Xiaoke Guo, Yuanxiang Liu, Xinle Deng, Zhizhen Liu, Lei Liang, Huajun Chen, Wen Zhang
| Challenge: | Existing methods rely on fixed workflows and expensive closed-source APIs, limiting flexibility and scalability. |
| Approach: | They propose a temporal reasoning agent that trains on difficult questions first . they expand the action space with specialized internal actions alongside external action . |
| Outcome: | The proposed agent improves 19.8% over baselines on complex questions and multi-tasks. |
Learning distributed sentence vectors with bi-directional 3D convolutions (2020.coling-main)
Copied to clipboard
| Challenge: | Existing methods that render words or characters into images separately, but instead use text's visual features as input, we use 3-dimensional convolutions to learn distributed sentence representation. |
| Approach: | They propose to use text's visual features as input to learn distributed sentence representation using 3-dimensional sentence tensors and multiple 3-dimensional convolutions with different lengths are applied to the sentence . |
| Outcome: | The proposed model performs well on several downstream natural language processing tasks. |
Deep Attention Diffusion Graph Neural Networks for Text Classification (2021.emnlp-main)
Copied to clipboard
| Challenge: | Existing methods for text classification based on graph neural networks (GNNs) consider only one-hop neighborhoods and low-frequency information within texts, which suffer from over-smoothing issues if many graph layers are stacked. |
| Approach: | They propose a deep attention diffusion Graph Neural Network model to learn text representations by bridging the chasm of interaction difficulties between a word and its distant neighbors. |
| Outcome: | The proposed model outperforms existing methods on standard benchmark datasets on a set of textual features. |
C-World: A Computer Use Agent Environment Creator (2026.acl-long)
Copied to clipboard
Ziqiao Xi, Shuang Liang, Qi Liu, Jiaqing Zhang, Letian Peng, Fang Nan, Meshal Nayim, Tianhui Zhang, Rishika Mundada, Lianhui Qin, Biwei Huang, Kun Zhou
| Challenge: | C-World enables users to build agent environments on demand. |
| Approach: | They propose a system that enables users to build agent environments on demand. |
| Outcome: | The proposed system outperforms baselines on 119k samples and achieves Spearman = 0.883 ranking correlation with real execution. |
GuideTree: Guideline-Induced Review Trees for Long Medical Records (2026.acl-industry)
Copied to clipboard
| Challenge: | Medical record reviewers must produce consistent, traceable, guideline-compliant outcomes . longcontext inference is expensive and often degrades as inputs grow . |
| Approach: | a new method compiles textual guidelines into a fixed review tree . a cost-aware split-and-prune search is used to update the tree offline . the algorithm produces consistent, traceable, guideline-compliant outcomes . |
| Outcome: | The proposed system outperforms the strongest non-expert baselines by 84.5–92.8 Macro-F1 . it reduces average I/O volume to 74K input+output characters and average latency to 22s . |
Rethinking Text-to-SQL: Dynamic Multi-turn SQL Interaction for Real-world Database Exploration (2026.findings-acl)
Copied to clipboard
Linzhuang Sun, Tianyu Guo, Hao Liang, Ruitong Liu, Yuying Li, Qifeng Cai, Jingxuan Wei, Yuchen Wu, Bihui Yu, Xiangxiang Zhang, Wentao Zhang, Bin Cui
| 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. |
Data Interpreter: An LLM Agent for Data Science (2025.findings-acl)
Copied to clipboard
Sirui Hong, Yizhang Lin, Bang Liu, Bangbang Liu, Binhao Wu, Ceyao Zhang, Danyang Li, Jiaqi Chen, Jiayi Zhang, Jinlin Wang, Li Zhang, Lingyao Zhang, Min Yang, Mingchen Zhuge, Taicheng Guo, Tuo Zhou, Wei Tao, Robert Tang, Xiangtao Lu, Xiawu Zheng, Xinbing Liang, Yaying Fei, Yuheng Cheng, Yongxin Ni, Zhibin Gou, Zongze Xu, Yuyu Luo, Chenglin Wu
| Challenge: | Large Language Models (LLMs) excel in various domains but face challenges when applied to data science workflows due to their complex, multi-stage nature. |
| Approach: | They propose a hierarchical graph-based agent that represents complexity and a progressive strategy for step-by-step verification, refinement, and consistent context management. |
| Outcome: | The proposed agent surpasses state-of-the-art baselines on the MATH dataset and performs better on InfiAgent-DABench. |
PclGPT: A Large Language Model for Patronizing and Condescending Language Detection (2024.findings-emnlp)
Copied to clipboard
| Challenge: | Patronizing and condescending language is an essential branch of toxic language . pre-trained language models perform poorly in detecting PCL due to its implicit toxicity traits . |
| Approach: | They propose a novel LLM benchmark for patronizing and condescending language . they use a dataset to analyze the toxicity of patronizing condescending languages . |
| Outcome: | The proposed model can detect patronizing and condescending language (PCL) the model can be used to analyze the toxicity of the language and to improve the detection. |
MT3: A Synergistic Multi-Task RL Framework for Specializing MLLMs in Text Image Machine Translation (2026.acl-long)
Copied to clipboard
Zhaopeng Feng, Yupu Liang, Shaosheng Cao, Jiayuan Su, Jiahan Ren, Zhijie Zhou, Wenxuan Huang, Jian Wu, Zuozhu Liu
| Challenge: | Text Image Machine Translation (TIMT) is a critical subfield of machine translation . it requires accurate optical character recognition, robust visual-text reasoning, and high-quality translation a challenge . |
| Approach: | They propose a multi-task optimization framework to specialize MLLMs into expert TIMT models. |
| Outcome: | The proposed model outperforms baselines on the latest in-domain MIT-10M benchmark. |
Locate, Steer, and Improve: A Practical Survey of Actionable Mechanistic Interpretability in Large Language Models (2026.findings-acl)
Copied to clipboard
Hengyuan Zhang, Zhihao Zhang, Ercong Nie, Mingyang Wang, Zunhai Su, Yiwei Wang, Qianli Wang, Shuzhou Yuan, Xufeng Duan, Qibo Xue, Zeping Yu, Chenming Shang, Xiao Liang, Jing Xiong, Hui Shen, Chaofan Tao, Zhengwu Liu, Senjie Jin, Zhiheng Xi, Dongdong Zhang, Sophia Ananiadou, Tao Gui, Ruobing Xie, Hayden Kwok-Hay So, Hinrich Schuetze, Xuanjing Huang, Qi Zhang, Ngai Wong
| 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. |
Adversarial Regularization as Stackelberg Game: An Unrolled Optimization Approach (2021.emnlp-main)
Copied to clipboard
Simiao Zuo, Chen Liang, Haoming Jiang, Xiaodong Liu, Pengcheng He, Jianfeng Gao, Weizhu Chen, Tuo Zhao
| Challenge: | Existing approaches to adversarial regularization treat adversarials and defending players equally, which is undesirable because only the defending player contributes to the generalization performance. |
| Approach: | They propose a method which formulates adversarial regularization as a Stackelberg game and induces a competition between a leader and a follower. |
| Outcome: | The proposed method outperforms existing adversarial regularization baselines on a set of machine translation and natural language understanding tasks. |
Efficient Low-rank Multimodal Fusion With Modality-Specific Factors (P18-1)
Copied to clipboard
Zhun Liu, Ying Shen, Varun Bharadhwaj Lakshminarasimhan, Paul Pu Liang, AmirAli Bagher Zadeh, Louis-Philippe Morency
| Challenge: | Multimodal research is a growing field of artificial intelligence, and fusion is one of the main research problems. |
| Approach: | They propose a low-rank multimodal fusion method which integrates multiple unimodal representations into one compact multimodal representation. |
| Outcome: | The proposed method achieves competitive results on multimodal sentiment analysis, speaker trait analysis, and emotion recognition tasks while reducing computational complexity. |
AgentInit: Initializing LLM-based Multi-Agent Systems via Diversity and Expertise Orchestration for Effective and Efficient Collaboration (2025.findings-emnlp)
Copied to clipboard
| Challenge: | Existing MAS initialization methods do not fully account for the collaborative needs of the generated agents in subsequent stages. |
| Approach: | They propose to use a Natural Language to Format mechanism to optimize the structure of agent teams and incorporate a natural language to format mechanism to ensure consistency and standardization. |
| Outcome: | The proposed method outperforms state-of-the-art initialization methods and pre-defined strategies across various frameworks and tasks while reducing token consumption. |
Selected Languages are All You Need for Cross-lingual Truthfulness Transfer (2025.coling-main)
Copied to clipboard
| Challenge: | Existing methods for truthfulness enhancement in English are limited to multilingual scenarios. |
| Approach: | They propose a method for cross-lingual truthfulness transfer that uses language bias and transfer contributions to select an optimal subset of all tested languages and employ translation instruction tuning for cross language truthfulness transfers. |
| Outcome: | The proposed method reduces multilingual representation disparity and boosts cross-lingual truthfulness transfer of LLMs. |
DB-LLM: Accurate Dual-Binarization for Efficient LLMs (2024.findings-acl)
Copied to clipboard
Hong Chen, Chengtao Lv, Liang Ding, Haotong Qin, Xiabin Zhou, Yifu Ding, Xuebo Liu, Min Zhang, Jinyang Guo, Xianglong Liu, Dacheng Tao
| Challenge: | Existing methods for ultra-low bit quantization cause severe accuracy drops . a novel Dual-Binarization method is proposed for efficient Large Language Models . |
| Approach: | They propose a Dual-Binarization method that takes 2-bit-width and binarization into account . they propose DB-LLM, which uses a 2-bit binarized weighted model to represent weights efficiently . |
| Outcome: | The proposed method surpasses the current State-of-the-Art in ultra-low bit quantization and achieves 20% reduction in computational consumption compared to the SOTA method under the same bit-width. |
Data Mixing Agent: Learning to Re-weight Domains for Continual Pre-training (2026.acl-long)
Copied to clipboard
| Challenge: | Existing methods for reweighting data mixtures rely on manual designation with certain heuristics based on intuition or empirical results. |
| Approach: | They propose a model-based framework that learns to re-weight domains by reinforcement learning on large quantities of data mixing trajectories with corresponding feedback from an evaluation environment. |
| Outcome: | The proposed framework outperforms baselines in achieving balanced performance across source and target fields and domain spaces without retraining. |
RealChart2Code: Bridging the Gap in Real-World Chart-to-Code Generation via Multi-Task Evaluation (2026.acl-long)
Copied to clipboard
Jiajun Zhang, Yuying Li, Zhixun Li, Xingyu Guo, Jingzhuo Wu, Leqi Zheng, Yiran Yang, Jianke Zhang, Qingbin Li, Shannan Yan, Changguo Jia, Junfei Wu, Zilei Wang, Qiang Liu, Liang Wang
| Challenge: | Vision-Language Models (VLMs) have demonstrated impressive capabilities in code generation across various domains, but their ability to replicate complex, multi-panel visualizations remains largely unassessed. |
| Approach: | They propose a large-scale benchmark to evaluate chart generation from large- scale raw data and assess iterative code refinement in a multi-turn conversational setting. |
| Outcome: | The new benchmark evaluates 14 leading VLMs on real-world data and shows they struggle with complex plot structures and authentic data. |
Topology Matters: Measuring Memory Leakage in Multi-Agent LLMs (2026.findings-acl)
Copied to clipboard
| Challenge: | Multi-agent LLMs are rapidly moving from prototype to real-world use . network topology is a first-order security parameter in multi-aggent systems . |
| Approach: | They propose a framework for comparing topology-conditioned memory leakage in multi-agent LLM systems. |
| Outcome: | The proposed framework evaluates topology-conditioned memory leakage in multi-agent LLM systems. |
Context-aware Watermark with Semantic Balanced Green-red Lists for Large Language Models (2024.emnlp-main)
Copied to clipboard
| Challenge: | Recent research suggests that watermarking methods cause degradation of text quality due to semantic disparities between the watermarked text and the unwatermarked text. |
| Approach: | They propose a semantic-aware watermark method that generates a watermark key considering contexts to split a green/red list for watermark injection. |
| Outcome: | The proposed method reduces performance drop due to adding bias on green lists . it also allows green lists to cover almost all semantics . |
Texar: A Modularized, Versatile, and Extensible Toolkit for Text Generation (P19-3)
Copied to clipboard
Zhiting Hu, Haoran Shi, Bowen Tan, Wentao Wang, Zichao Yang, Tiancheng Zhao, Junxian He, Lianhui Qin, Di Wang, Xuezhe Ma, Zhengzhong Liu, Xiaodan Liang, Wanrong Zhu, Devendra Sachan, Eric Xing
| Challenge: | Texar is an open-source text generation toolkit that supports a broad set of text generation tasks. |
| Approach: | They introduce Texar, an open-source text generation toolkit that supports text generation tasks. |
| Outcome: | Texar supports machine translation, summarization, dialog, content manipulation, and more. |
Collaboration of Fusion and Independence: Hypercomplex-driven Robust Multi-Modal Knowledge Graph Completion (2026.acl-long)
Copied to clipboard
| Challenge: | Existing multi-modal knowledge graphs lack modality-specific information and are limited in their ability to capture nuanced semantic interplay between modalities. |
| Approach: | They propose a multi-modal knowledge graph completion method which integrates both paradigms . they use a fine-grained Entity Representation Factorization module and a Robust Relation-aware Modality Fusion module to obtain robust representations for three independent modalities and one fused modality. |
| Outcome: | The proposed method achieves coexistence and collaboration of fused and independent modality representations while maintaining modality-specific information. |
HELENE: Hessian Layer-wise Clipping and Gradient Annealing for Accelerating Fine-tuning LLM with Zeroth-order Optimization (2025.emnlp-main)
Copied to clipboard
| Challenge: | Large language models (LLMs) face memory challenges due to the high cost of backpropagation. |
| Approach: | They propose a zeroth-order (ZO) optimization that matches memory usage to inference . they propose scalable and memory-efficient zeroth order (ZE) optimizer that integrates annealed A-GNB gradients with diagonal Hessian estimation and layer-wise clipping as a second-order pre-conditioner. |
| Outcome: | The proposed algorithm outperforms state-of-the-art methods with an average speedup of 20 over MeZO on RoBERTa-large and OPT-1.3B. |
MinerU2.5: A Decoupled Vision-Language Model for Efficient High-Resolution Document Parsing (2026.acl-industry)
Copied to clipboard
Junbo Niu, Zheng Liu, Zhuangcheng Gu, Bin Wang, Linke Ouyang, Zhiyuan Zhao, Tao Chu, Tianyao He, Fan Wu, Qintong Zhang, Zhenjiang Jin, Guang Liang, Rui Zhang, Wenzheng Zhang, Yuan Qu, Zhifei Ren, Yuefeng Sun, Zirui Tang, Boyu Niu, Yuanhong Zheng, Dongsheng Ma, Ziyang Miao, Hejun Dong, Siyi Qian, Junyuan Zhang, Fangdong Wang, Jingzhou Chen, Xiaomeng Zhao, Liqun Wei, Wei Li, Shasha Wang, RuiLiang Xu, Yuanyuan Cao, Lu Chen, Qianqian Wu, Huaiyu Gu, Lindong Lu, Dechen Lin, null Shenguanlin, Xuanhe Zhou, Linfeng Zhang, Yuhang Zang, Xiaoyi Dong, Jiaqi Wang, Bo Zhang, Lei Bai, Pei Chu, Weijia Li, Jiang Wu, Lijun Wu, Zhenxiang Li, Guangyu Wang, Zhongying Tu, Chao Xu, Kai Chen, Bowen Zhou, Dahua Lin, Wentao Zhang, Conghui He
| Challenge: | Document images are characterized by higher resolutions, denser content, and more complex structural layouts. |
| Approach: | They propose a 1.2B-parameter document parsing vision-language model that decouples layout analysis from local content recognition. |
| Outcome: | The proposed model surpasses general-purpose and domain-specific models on multiple benchmarks while maintaining significantly lower computational overhead. |
GeoQA: A Geometric Question Answering Benchmark Towards Multimodal Numerical Reasoning (2021.findings-acl)
Copied to clipboard
| Challenge: | Existing methods to solve geometric problems are dependent on handcraft rules and limited on small-scale datasets. |
| Approach: | They propose a Geometric Question Answering dataset with 5,010 geometric problems with corresponding annotated programs to illustrate the solving process. |
| Outcome: | The proposed method is significantly lower than human performance on the proposed dataset than on a publicly available dataset. |
Emphasising Structured Information: Integrating Abstract Meaning Representation into LLMs for Enhanced Open-Domain Dialogue Evaluation (2025.findings-emnlp)
Copied to clipboard
| Challenge: | Existing evaluation metrics struggle to evaluate adversarial negative examples . existing metrics struggle in handling adversarials, resulting in low correlations with human judgments. |
| Approach: | They propose a framework that integrates AMR and domain-specific language models for automatic open-domain dialogue evaluation. |
| Outcome: | The proposed evaluation framework achieves strong correlations with human judgments across multiple datasets. |
PsyScam: A Benchmark for Psychological Techniques in Real-World Scams (2025.findings-emnlp)
Copied to clipboard
| Challenge: | PTs are employed by scammers to manipulate victims and cause lasting psychological trauma. |
| Approach: | They propose a benchmark to capture the PTs employed in real-worldscam reports and investigate how LLMs can be utilized to generate variants of scams based on the pts and the contexts provided by thesescams. |
| Outcome: | The proposed model can generate variants of scams based on the PTs employed in real-world scam reports and the contexts provided by these scams. |
TransBench: Breaking Barriers for Transferable Graphical User Interface Agents in Dynamic Digital Environments (2025.findings-acl)
Copied to clipboard
Yuheng Lu, Qian Yu, Hongru Wang, Zeming Liu, Wei Su, Yanping Liu, Yuhang Guo, Maocheng Liang, Yunhong Wang, Haifeng Wang
| 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. |
EXPLAIN: Enhancing Retrieval-Augmented Generation with Entity Summary (2025.acl-industry)
Copied to clipboard
Yaozhen Liang, Xiao Liu, Jiajun Yu, Zhouhua Fang, Qunsheng Zou, Linghan Zheng, Yong Li, Zhiwei Liu, Haishuai Wang
| 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. |
Beyond Memorization: The Challenge of Random Memory Access in Language Models (2024.acl-long)
Copied to clipboard
| Challenge: | Recent advances in Language Models (LMs) have shown their effectiveness in knowledge-intensive tasks. |
| Approach: | They investigate whether a generative language model is able to access its memory sequentially or randomly. |
| Outcome: | The proposed LMs are able to access memory sequentially or randomly. |
SINCon: Mitigate LLM-Generated Malicious Message Injection Attack for Rumor Detection (2025.acl-long)
Copied to clipboard
| Challenge: | Existing methods define important nodes as important and target them for attacks if the model treats nodes’ predictive influence more uniformly . Existing approaches target high predictive influence nodes but are vulnerable to malicious message injection attacks. |
| Approach: | They propose a defense mechanism that encourages the model to learn graph representations where nodes with varying importance have a more uniform influence on predictions. |
| Outcome: | Extensive experiments on the Twitter and Weibo datasets show that similarizing the predictive Influence of nodes with Contrastive Learning significantly enhances resistance against LLM-driven message injection attacks. |
Enhancing Lexical Relation Mining with Structured Sememe Knowledge (2026.acl-long)
Copied to clipboard
| Challenge: | Existing top-performing methods for Lexical Relation Mining rely on pre-trained language models yet fail to distinguish nuanced lexical relations. |
| Approach: | They propose a framework to leverage structured sememe knowledge to enhance LRC and LE. |
| Outcome: | The proposed method outperforms existing methods on benchmarks and outperformed the LLMs. |
Cocktail: A Comprehensive Information Retrieval Benchmark with LLM-Generated Documents Integration (2024.findings-acl)
Copied to clipboard
Sunhao Dai, Weihao Liu, Yuqi Zhou, Liang Pang, Rongju Ruan, Gang Wang, Zhenhua Dong, Jun Xu, Ji-Rong Wen
| Challenge: | Large Language Models (LLMs) have led to an influx of AI-generated content on the internet, transforming corpus of Information Retrieval (IR) systems from human-written to a coexistence with LLM-generated contents. |
| Approach: | They propose a benchmark named Cocktail that compares IR models with LLMs to find relevant documents and passages from a corpus. |
| Outcome: | The proposed benchmark aims to evaluate IR models in the mixed-sourced data landscape of the LLM era. |
Personalized Text Generation with Contrastive Activation Steering (2025.acl-long)
Copied to clipboard
| Challenge: | Existing approaches to personalized text generation rely on retrieval-augmented generation and parameter-efficient fine-tuning. |
| Approach: | They propose a training-free framework that disentangles and represents personalized writing style as a vector in LLM’s activation-space. |
| Outcome: | The proposed framework achieves 8% relative improvement in personalized generation while reducing storage requirements by 1700 over PEFT method. |
VLFeedback: A Large-Scale AI Feedback Dataset for Large Vision-Language Models Alignment (2024.emnlp-main)
Copied to clipboard
Lei Li, Zhihui Xie, Mukai Li, Shunian Chen, Peiyi Wang, Liang Chen, Yazheng Yang, Benyou Wang, Lingpeng Kong, Qi Liu
| Challenge: | Large vision-language models (LVLMs) are evolving rapidly and require data with human supervision to achieve better alignment. |
| Approach: | They introduce VLFeedback, the first large-scale vision-language feedback dataset . they train Silkie, an LVLM fine-tuned via direct preference optimization . |
| Outcome: | The proposed model outperforms its base model in helpfulness, visual faithfulness, and safety metrics and exhibits enhanced resilience against red-teaming attacks. |
Graph Reasoning Paradigm: Structured and Symbolic Reasoning with Topology-Aware Reinforcement Learning for Large Language Models (2026.acl-long)
Copied to clipboard
Runxuan Liu, Xianhao Ou, Xinyan Ma, Jiyuan Wang, Jiafeng Liang, Jiaqi Li, Tao He, Zheng Chu, Rongchuan Mu, Zekun Wang, Baoxin Wang, Dayong Wu, Ming Liu, Shijin Wang, Guoping Hu, Bing Qin
| Challenge: | Existing methods for long chain-of-thought (LCoT) are coarse-grained, reward hacking, and poor generalization. |
| Approach: | They propose a Long Chain-of-Thought (LCoT) model that integrates reinforcement learning with verifiable rewards with a process-aware verification approach. |
| Outcome: | The proposed model improves reasoning and code generation tasks while reducing the cost of training and performance bottlenecks. |
Revisiting Token Dropping Strategy in Efficient BERT Pretraining (2023.acl-long)
Copied to clipboard
| Challenge: | Token dropping is a recently-proposed strategy to speed up the pretraining of masked language models, such as BERT. |
| Approach: | They propose a semantic-consistent learning method to improve token dropping by skipping the computation of a subset of input tokens at several middle layers. |
| Outcome: | The proposed method achieves consistent and significant performance gains across all tasks and model sizes. |
Learning Representations from Imperfect Time Series Data via Tensor Rank Regularization (P19-1)
Copied to clipboard
Paul Pu Liang, Zhun Liu, Yao-Hung Hubert Tsai, Qibin Zhao, Ruslan Salakhutdinov, Louis-Philippe Morency
| Challenge: | Existing methods to regularize multimodal data are imperfect due to imperfect modalities, missing entries or noise corruption. |
| Approach: | They propose a method to regularize multimodal data by tensor rank minimization . they use correlations between time and modalities to generate low-rank tenses . |
| Outcome: | The proposed model achieves good results across various levels of imperfection. |
Flooding-X: Improving BERT’s Resistance to Adversarial Attacks via Loss-Restricted Fine-Tuning (2022.acl-long)
Copied to clipboard
Qin Liu, Rui Zheng, Bao Rong, Jingyi Liu, ZhiHua Liu, Zhanzhan Cheng, Liang Qiao, Tao Gui, Qi Zhang, Xuanjing Huang
| Challenge: | Existing approaches to generating adversarial perturbations scale up the cost of training computational complexity by the number of gradient steps it takes to obtain the adversarials. |
| Approach: | They propose a flood method which aims at better generalization and a criterion to bring hyper-parameter-dependent flooding into effect with a narrowed-down search space by measuring how the gradient steps taken within one epoch affect the loss of each batch. |
| Outcome: | The proposed method improves BERT’s resistance to textual adversarial attacks by a large margin and achieves state-of-the-art robust accuracy on various text classification and GLUE tasks. |
SceMQA: A Scientific College Entrance Level Multimodal Question Answering Benchmark (2024.acl-short)
Copied to clipboard
Zhenwen Liang, Kehan Guo, Gang Liu, Taicheng Guo, Yujun Zhou, Tianyu Yang, Jiajun Jiao, Renjie Pi, Jipeng Zhang, Xiangliang Zhang
| Challenge: | SceMQA focuses on core science subjects including Mathematics, Physics, Chemistry, and Biology. |
| Approach: | They propose to use SceMQA to evaluate multimodal question answering at college entrance level. |
| Outcome: | The proposed model provides specific knowledge points for each problem and detailed explanations for each answer. |
A Multi-Agent Framework with Automated Decision Rule Optimization for Cross-Domain Misinformation Detection (2025.emnlp-main)
Copied to clipboard
| Challenge: | Existing methods for misinformation detection are limited by domain knowledge and expert experience. |
| Approach: | They propose a Multi-Agent Framework for cross-domain misinformation detection with Automated Decision Rule Optimization (MARO) they first employ multiple expert agents to analyze target-domain news, then introduce a question-reflection mechanism that guides expert agents for higher-quality analysis. |
| Outcome: | The proposed framework improves on a common dataset and shows that iteratively improves over existing methods. |
QSpell 250K: A Large-Scale, Practical Dataset for Chinese Search Query Spell Correction (2025.naacl-industry)
Copied to clipboard
| Challenge: | Chinese Search Query Spell Correction is a task designed to identify and correct typographical errors within queries. |
| Approach: | They propose a large-scale benchmark specifically developed for Chinese Query Spell Correction. |
| Outcome: | The proposed benchmark covers a broad range of topics, including formal entities, everyday colloquialisms and idiomatic expressions. |
CR-LLM: A Dataset and Optimization for Concept Reasoning of Large Language Models (2024.findings-acl)
Copied to clipboard
Nianqi Li, Jingping Liu, Sihang Jiang, Haiyun Jiang, Yanghua Xiao, Jiaqing Liang, Zujie Liang, Feng Wei, Jinglei Chen, Zhenghong Hao, Bing Han
| Challenge: | Existing concept reasoning related datasets suffer from modeledge leakage and context leakage. |
| Approach: | They propose a concept reasoning for large language models with modeledge leakage prevention and context leakage preventive methods to improve the models' conceptual reasoning abilities. |
| Outcome: | The proposed method significantly improves the existing models and reasoning methods, achieving a 7% increase in accuracy compared to CoT and showing better granularity. |
Reasoning-Augmented Conversation for Multi-Turn Jailbreak Attacks on Large Language Models (2025.findings-emnlp)
Copied to clipboard
Zonghao Ying, Deyue Zhang, Zonglei Jing, Yisong Xiao, Quanchen Zou, Aishan Liu, Siyuan Liang, Xiangzheng Zhang, Xianglong Liu, Dacheng Tao
| Challenge: | Existing methods for implementing multi-turn jailbreaks struggle to balance semantic coherence with attack effectiveness, resulting in benign semantic drift or ineffective detection evasion. |
| Approach: | They propose a framework that reformulates harmful queries into benign reasoning tasks and leverages LLMs’ strong reasoning capabilities to compromise safety alignment. |
| Outcome: | The proposed framework achieves state-of-the-art attack effectiveness in complex conversational scenarios, with average ASRs increasing by up to 96%. |
Think Beyond Words: Exploring Context-Relevant Visual Commonsense for Diverse Dialogue Generation (2022.findings-emnlp)
Copied to clipboard
| Challenge: | Existing approaches to generate intelligent open-domain dialogue agents only consider auxiliary commonsense stored in pure text, ignoring grounding information from the external visual world. |
| Approach: | They propose a VIsual Commonsense enhanced dialogue generaTOR that exploits auxiliary commonsense from images related to context to generate coherent and informative responses. |
| Outcome: | The proposed method outperforms the latest competitive methods in terms of coherence and diversity on two public datasets. |
KELE: Residual Knowledge Erasure for Enhanced Multi-hop Reasoning in Knowledge Editing (2025.findings-emnlp)
Copied to clipboard
| Challenge: | Existing knowledge editing techniques show limitations when applied to multi-hop reasoning . residual single-hop knowledge causes edited models to revert to original answers . |
| Approach: | They propose a knowledge editing method that incorporates a Knowledge Erasure mechanism for Large language model Editing (KELE) they propose an erasure function for residual knowledge and an injection function for new knowledge . |
| Outcome: | The proposed method significantly improves multi-hop reasoning capability of edited models. |
Why Multi-Interest Fairness Matters: Hypergraph Contrastive Multi-Interest Learning for Fair Conversational Recommender System (2025.findings-acl)
Copied to clipboard
| Challenge: | Unfairness is a well-known challenge in Recommender Systems (RSs) some approaches have started to improve fairness in offline or static contexts, but it often exacerbates over time, leading to significant problems like the Matthew effect, filter bubbles, and echo chambers. |
| Approach: | They propose a framework to promote multi-interest diversity fairness in RSs by establishing diverse hypergraphs through contrastive learning. |
| Outcome: | The proposed framework achieves state-of-the-art performance while effectively alleviating unfairness in two CRS-based datasets. |
InsLogicBench: An Argumentation Logic Grounded Benchmark for Complex Insurance Claims Adjudication (2026.acl-long)
Copied to clipboard
Jin Liu, Yunpeng Liu, Keyi Wang, Jie Shi, Xiao Xu, Wenkang Huang, Xingzhong Xu, Xin Liang, Yanghua Xiao
| Challenge: | Existing benchmarks for insurance claims adjudication are limited to information retrieval or simple multiple-choice setups. |
| Approach: | They propose a benchmark that provides complete reasoning traces linking factual inputs, relevant policy clauses, and final verdicts. |
| Outcome: | The proposed benchmark shows that models often produce correct decisions but fail to provide precise justifications, highlighting a critical discrepancy between decision accuracy and logical reasoning capabilities. |
Parameter Importance is Not Static: Evolving Parameter Isolation for Supervised Fine-Tuning (2026.acl-long)
Copied to clipboard
Zekai Lin, Chao Xue, Di Liang, Xingsheng Han, Peiyang Liu, Xianjie Wu, Lei Jiang, Yu Lu, Bob Simons, Shuang Liang, Minlong Peng
| 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. |
AgentDropout: Dynamic Agent Elimination for Token-Efficient and High-Performance LLM-Based Multi-Agent Collaboration (2025.acl-long)
Copied to clipboard
| Challenge: | Existing methods for MAS suffer from high token consumption and inefficiency due to frequent generation and communication among multiple agents. |
| Approach: | They propose a multi-agent system based on large language models that identifies redundant agents and communication across different communication rounds by optimizing the adjacency matrices of the communication graphs and eliminates them to enhance both token efficiency and task performance. |
| Outcome: | The proposed method reduces prompt token consumption and completion token consumption by 18.4% and improves task performance by 1.14. |
Token-wise Curriculum Learning for Neural Machine Translation (2021.findings-emnlp)
Copied to clipboard
| Challenge: | Existing curriculum learning approaches to Neural Machine Translation (NMT) require sampling sufficient amounts of “easy” samples from training data at the early stage of training. |
| Approach: | They propose a token-wise curriculum learning approach that creates sufficient amounts of easy samples from training data. |
| Outcome: | The proposed approach outperforms baselines on five language pairs on low-resource languages. |
DialogGen: Multi-modal Interactive Dialogue System with Multi-turn Text-Image Generation (2025.findings-naacl)
Copied to clipboard
Minbin Huang, Yanxin Long, Xinchi Deng, Ruihang Chu, Jiangfeng Xiong, Xiaodan Liang, Hong Cheng, Qinglin Lu, Wei Liu
| Challenge: | Text-to-image (T2I) generation models have advanced in recent years, but effective interaction with these models is challenging for average users due to the need for specialized prompt engineering knowledge and the inability to perform multi-turn image generation. |
| Approach: | They propose to use off-the-shelf MLLMs and T2I models to build a multi-modal interactive dialogue system (MIDS) that can generate correct output modalities and coherence of output images. |
| Outcome: | The proposed pipeline can generate correct output modalities and coherent multi-modal outputs compared with other state-of-the-art models. |
Let’s Rectify Step by Step: Improving Aspect-based Sentiment Analysis with Diffusion Models (2024.lrec-main)
Copied to clipboard
| Challenge: | Empirical evaluations conducted on eight benchmark datasets underscore the compelling advantages offered by DiffusionABSA when compared against robust baseline models. |
| Approach: | They propose a diffusion model which extracts aspects step by step and learns a denoising process that progressively restores them in a reverse manner. |
| Outcome: | Empirical evaluations on eight benchmark datasets underscore the compelling advantages offered by DiffusionABSA when compared against robust baseline models. |
Mapping natural language commands to web elements (D18-1)
Copied to clipboard
| Challenge: | a dataset of over 50,000 natural language commands captures various phenomena, including functional references, relational reasoning, and visual reasoning. |
| Approach: | They propose a task that requires the user to choose the correct element on a web page . they use a dataset of over 50,000 natural language commands to map these to web pages . |
| Outcome: | The proposed task can be viewed as a reference game based on a dataset of over 50,000 natural language commands . |
AgentSense: Benchmarking Social Intelligence of Language Agents through Interactive Scenarios (2025.naacl-long)
Copied to clipboard
Xinyi Mou, Jingcong Liang, Jiayu Lin, Xinnong Zhang, Xiawei Liu, Shiyue Yang, Rong Ye, Lei Chen, Haoyu Kuang, Xuanjing Huang, Zhongyu Wei
| Challenge: | Large language models are increasingly employed to empower autonomous agents to simulate human behavior. |
| Approach: | They propose to evaluate LLM-driven agents through multi-turn interactions using a bottom-up approach to create diverse social scenarios constructed from extensive scripts. |
| Outcome: | The proposed model evaluates LLM-driven agents through multi-turn interactions emphasizing goal completion and implicit reasoning. |
Semantic XPath: Structured Agentic Memory Access for Conversational AI (2026.acl-demo)
Copied to clipboard
| Challenge: | Early ConvAI agents rely on an in-context approach that appends the growing conversation history to the model input, but this approach scales poorly under context-window limits. |
| Approach: | They propose a tree-structured memory module to access and update structured conversational memory. |
| Outcome: | The proposed system improves over flat-RAG baselines while using only 9.1% of the tokens required by in-context memory. |
Thinking Before You Speak: A Proactive Test-time Scaling Approach (2025.findings-emnlp)
Copied to clipboard
| Challenge: | Large Language Models often exhibit deficiencies with complex reasoning tasks, such as maths, due to the discrepancy between human reasoning patterns and those presented in training data. |
| Approach: | They propose to insert insights between consecutive reasoning steps to bridge this gap by generating insights between the next reasoning steps. |
| Outcome: | Experiments on mathematical datasets confirm the effectiveness of the proposed reasoning framework on complex problems. |
GenPilot: A Multi-Agent System for Test-Time Prompt Optimization in Image Generation (2025.findings-emnlp)
Copied to clipboard
Wen Ye, Zhaocheng Liu, Gui Yuwei, Tingyu Yuan, Yunyue Su, Bowen Fang, Chaoyang Zhao, Qiang Liu, Liang Wang
| Challenge: | Existing methods for text-to-image synthesis lack systematic error analysis and refinement strategies, resulting in limited reliability and effectiveness. |
| Approach: | They propose a plug-and-play multi-agent system called GenPilot that integrates error analysis, clustering-based adaptive exploration, fine-grained verification and a memory module for iterative optimization. |
| Outcome: | The proposed method improves text consistency and structural coherence on images with a plug-and-play system. |
Why Supervised Fine-Tuning Fails to Learn: A Systematic Study of Incomplete Learning in Large Language Models (2026.acl-long)
Copied to clipboard
Chao Xue, Yao Wang, Mengqiao Liu, Di Liang, Xingsheng Han, Peiyang Liu, Xianjie Wu, Chenyao Lu, Lei Jiang, Yu Lu, Haibo Shi, Shuang Liang, Minlong Peng, Flora D. Salim
| 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. |
MCS: An In-battle Commentary System for MOBA Games (2022.coling-1)
Copied to clipboard
Xiaofeng Qi, Chao Li, Zhongping Liang, Jigang Liu, Cheng Zhang, Yuanxin Wei, Lin Yuan, Guang Yang, Lanxiao Huang, Min Li
| Challenge: | In-battle commentary is an important component of live streaming of e-sports competitions and is applicable to a wide range of scenarios like combat information analysis and live streaming. |
| Approach: | They propose a generative system for in-battle real-time commentary in mobile MOBA games and propose 'transform' method to convert match statistics and utterances into consistent encoding space. |
| Outcome: | The proposed system is based on real-time match statistics and events and can be used for live streaming, e-sports commentary and combat information analysis. |
Super Tickets in Pre-Trained Language Models: From Model Compression to Improving Generalization (2021.acl-long)
Copied to clipboard
Chen Liang, Simiao Zuo, Minshuo Chen, Haoming Jiang, Xiaodong Liu, Pengcheng He, Tuo Zhao, Weizhu Chen
| Challenge: | 'lottery tickets' can be trained to match the performance of a full model . subnetwork training can also outperform random sampled subnetworks of the same size . |
| Approach: | They propose to train a subnetwork of 'lottery tickets' to match the full model's performance. |
| Outcome: | The proposed model outperforms subnetworks of the same size in a phase transition phenomenon . the proposed model improves single task fine-tuning by 0.9 points on BERT-base and 1.0 points on GLUE large . |
Out-of-Scope Intent Detection with Self-Supervision and Discriminative Training (2021.acl-long)
Copied to clipboard
| Challenge: | Existing methods for out-of-scope intent detection rely on strong assumptions on data distribution and confidence threshold selection. |
| Approach: | They propose a method to train an out-of-scope intent classifier in a fully end-to-end manner by simulating the test scenario in training. |
| Outcome: | The proposed method improves on four benchmark dialogue datasets and improves over state-of-the-art methods. |
Hierarchical Curriculum Learning for AMR Parsing (2022.acl-short)
Copied to clipboard
| Challenge: | Abstract Meaning Representation (AMR) parsing aims to translate sentences to semantic representation with a hierarchical structure, but there is a gap between their flat training objective and the hierarchic structure, which limits the model generalization. |
| Approach: | They propose a Hierarchical Curriculum Learning framework with Structure-level (SC) and Instance-level curricula (IC) that aims to translate sentences to semantic representation with a hierarchical structure. |
| Outcome: | Experiments on AMR2.0, AMR3.0, structure-complex and out-of-distribution situations confirm the effectiveness of the proposed framework. |
Relation Discovery with Out-of-Relation Knowledge Base as Supervision (N19-1)
Copied to clipboard
| Challenge: | Existing methods to extract relations from text corpus without annotated data are violated by up to 31%. |
| Approach: | They propose to use out-of-relation knowledge bases to supervise the discovery of unseen relations where relations to discover from the text corpus and those in knowledge bases are not overlapped. |
| Outcome: | The proposed method improves the state-of-the-art relation discovery performance by a large margin. |
Learning to Control Summaries with Score Ranking (2026.findings-acl)
Copied to clipboard
| Challenge: | Recent advances in summarization focus on improving summary quality across multiple dimensions, but they overlook the challenge of controlling summary generation with respect to individual dimensions. |
| Approach: | They propose a loss function that aligns model outputs with fine-grained, model-based evaluation scores to enable both improvement in summary quality and dimension-specific control. |
| Outcome: | The proposed method improves the overall quality of summaries while maintaining strong control over individual quality dimensions. |
Know the Known and the Unknown: Reasonable Answer Generation with Knowledge-Informed Citations (2026.acl-long)
Copied to clipboard
Yichi Zhang, Zhuo Chen, Lingbing Guo, Jun Xu, Mengshu Sun, Zhizhen Liu, Lei Liang, Wen Zhang, Huajun Chen
| Challenge: | Existing approaches focus on generating multi-level citations linked to specific references, making it verifiable and trustworthy. |
| Approach: | They propose a new data construction pipeline and a benchmark to improve citation granularity and awareness of unknown information. |
| Outcome: | The proposed model improves on the existing benchmark and data construction pipeline and provides citation granularity and awareness of unknown information. |
EX-FEVER: A Dataset for Multi-hop Explainable Fact Verification (2024.findings-acl)
Copied to clipboard
| Challenge: | Existing studies on fact verification lack a high-quality dataset for explainability . existing systems lack evidence retrieval and veracity prediction, limiting the ability to verify a claim . |
| Approach: | They propose a dataset for multi-hop explainable fact verification that summarises and modifies Wikipedia documents. |
| Outcome: | The proposed dataset aims to improve the accuracy of multi-hop explainable fact verification systems. |
Analyzing and Reducing the Performance Gap in Cross-Lingual Transfer with Fine-tuning Slow and Fast (2023.acl-long)
Copied to clipboard
| Challenge: | Existing research shows that a multilingual pre-trained language model fine-tuned with one (source) language performs well on downstream tasks for non-source languages . However, there is a clear performance gap between the source and non-sourced languages - this gap can be reduced by reducing forgetting. |
| Approach: | They propose a method to fine-tune a multilingual pre-trained language model fine- tuned with one (source) language and four training policies to address the performance gap. |
| Outcome: | The proposed method outperforms baselines on the XNLI dataset by a clear margin. |
RLHS: Mitigating Misalignment in RLHF with Hindsight Simulation (2026.findings-acl)
Copied to clipboard
| Challenge: | Reinforcement Learning from Hindsight Simulation (RLHF) can cause severe misalignment in generative AI, but it is not a universal method for fine-tuning large language models. |
| Approach: | They propose a method that uses evaluator feedback to decouple alignment signal from potentially compromised predictions. |
| Outcome: | The proposed method significantly outperforms RLHF in comparisons with baselines and human evaluations. |
From Hypothesis to Publication: A Comprehensive Survey of AI-Driven Research Support Systems (2025.findings-emnlp)
Copied to clipboard
Zekun Zhou, Xiaocheng Feng, Lei Huang, Xiachong Feng, Ziyun Song, Ruihan Chen, Liang Zhao, Weitao Ma, Yuxuan Gu, Baoxin Wang, Dayong Wu, Guoping Hu, Ting Liu, Bing Qin
| Challenge: | rapid development of artificial intelligence (AI) technologies has inspired researchers to explore how AI can accelerate and enhance research. |
| Approach: | They organize the relevant studies into three main categories: hypothesis formulation, hypothesis validation, and manuscript publication. |
| Outcome: | The authors summarize the current state of research in three main areas: hypothesis formulation, hypothesis validation, and manuscript publication. |
Light-R1: Curriculum SFT, DPO and RL for Long COT from Scratch and Beyond (2025.acl-industry)
Copied to clipboard
Liang Wen, Yunke Cai, Fenrui Xiao, Xin He, Qi An, Zhenyu Duan, Yimin Du, Junchen Liu, Tanglifu Tanglifu, Xiaowei Lv, Haosheng Zou, Yongchao Deng, Shousheng Jia, Xiangzheng Zhang
| Challenge: | Experimental results show that opensource curriculum training is more effective when distinct datasets are available for different training stages. |
| Approach: | They propose an opensource suite for training long reasoning models using publicdata and models. |
| Outcome: | The proposed model outperforms DeepSeek-R1-DistillQwen-32B models in math reasoning. |
Musical Score Understanding Benchmark: Evaluating Large Language Models’ Comprehension of Complete Musical Scores (2026.acl-long)
Copied to clipboard
Congren Dai, Yue Yang, Krinos Li, Huichi Zhou, Shijie Liang, Zhang Bo, Enyang Liu, Ge Jin, Hongran An, Haosen Zhang, Peiyuan Jing, KinHei Lee, Zhenxuan Zhang, Xiaobing Li, Maosong Sun
| Challenge: | Existing benchmarks for musical score understanding are narrow in scope, focusing on isolated fragments, short excerpts, or multiple-choice formulations, rather than supporting holistic reasoning over entire scores. |
| Approach: | They propose a benchmark for score-level musical understanding across textual and visual modalities. |
| Outcome: | The musical score understanding benchmark contains 1,800 question-answer pairs from works by Bach, Beethoven, Chopin, Debussy, and others. |
Achieving Multi-Hop Calculation and Safe Abstention in Financial Numerical Reasoning by Metric Graph Constrained LLMs (2026.acl-long)
Copied to clipboard
| Challenge: | Large language models (LLMs) are prone to forced generation when confronting ambiguous evidence or complex recursive dependencies. |
| Approach: | They propose a framework that imposes semantic and structural constraints via a financial metric knowledge graph. |
| Outcome: | a neuro-symbolic framework outperforms existing models on financial metric knowledge graphs. |
STACL: Simultaneous Translation with Implicit Anticipation and Controllable Latency using Prefix-to-Prefix Framework (P19-1)
Copied to clipboard
Mingbo Ma, Liang Huang, Hao Xiong, Renjie Zheng, Kaibo Liu, Baigong Zheng, Chuanqiang Zhang, Zhongjun He, Hairong Liu, Xing Li, Hua Wu, Haifeng Wang
| Challenge: | Simultaneous translation is notoriously dif- ficult due to word-order differences. |
| Approach: | They propose a prefix-to-prefix framework that implicitly learns to anticipate in a single translation model. |
| Outcome: | The proposed framework achieves low latency and reasonable qual- ity on 4 directions. |
A Middle Path for On-Premises LLM Deployment: Preserving Privacy Without Sacrificing Model Confidentiality (2025.emnlp-main)
Copied to clipboard
| Challenge: | Privacy-sensitive users require deploying large language models within their own infrastructure (on-premises) vulnerabilities in local environments can lead to unauthorized access and potential model theft. |
| Approach: | They propose a framework that secures a few bottom layers in a secure environment . they propose metric to optimize trade-off between protection and customization flexibility . |
| Outcome: | The proposed framework outperforms baselines on five models with 1.3B to 70B parameters. |
Act-Adaptive Margin: Dynamically Calibrating Reward Models for Subjective Ambiguity (2026.acl-long)
Copied to clipboard
Feiteng Fang, Dingwei Chen, Xiang Huang, Ting-En Lin, Yuchuan Wu, Xiong Liu, Jing Ye, Ziqiang Liu, Haonan Zhang, Liang Zhu, Hamid Alinejad-Rokny, Min Yang, Yongbin Li
| Challenge: | Existing approaches to reward modeling in reinforcement learning tasks are limited when dealing with ambiguous preferences. |
| Approach: | They propose to use AAM to dynamically calibrate preference margins using the Bradley-Terry model's internal parameter knowledge to improve reward modeling in subjective tasks. |
| Outcome: | The proposed approach improves reward modeling by dynamically calibrating preference margins using the model’s internal parameter knowledge. |
Can Language Models Follow Multiple Turns of Entangled Instructions? (2025.findings-emnlp)
Copied to clipboard
Chi Han, Xin Liu, Haodong Wang, Shiyang Li, Jingfeng Yang, Haoming Jiang, Zhengyang Wang, Qingyu Yin, Liang Qiu, Changlong Yu, Yifan Gao, Zheng Li, Bing Yin, Jingbo Shang, Heng Ji
| 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. |
Multi-Level Cross-Modal Alignment for Speech Relation Extraction (2024.emnlp-main)
Copied to clipboard
Liang Zhang, Zhen Yang, Biao Fu, Ziyao Lu, Liangying Shao, Shiyu Liu, Fandong Meng, Jie Zhou, Xiaoli Wang, Jinsong Su
| Challenge: | Existing studies use synthetic speech to train and evaluate SpeechRE models, hindering their development . modality gap issue limits performance of existing models, limiting future researches . |
| Approach: | They propose to use speech data to train and evaluate SpeechRE models by using real speech . they propose to train a cross-modal alignment model to bridge the modality gap . |
| Outcome: | The proposed model can train to bridge the modality gap between speech encoder and text decoder . the proposed model is based on two real SpeechRE datasets . |
CARL: Constraint-Aware Reinforcement Learning for Planning with LLMs (2026.findings-acl)
Copied to clipboard
Qiuyi Qi, Jinjian Zhang, Mutian Bao, Tian Liang, Guocong Li, Dongnan Liu, Wei Zhou, Jie Liu, Ming Kong, Linjian Mo, Feng Zhang, Qiang Zhu
| Challenge: | Existing approaches to constraint-aware planning fail to enhance the model’s intrinsic focus on constraints. |
| Approach: | They propose a constraint-aware reinforcement learning framework that encourages constraint focus and penalizes neglect of LLMs. |
| Outcome: | The proposed framework outperforms existing frameworks and state-of-the-art reasoning models in a number of real-world applications. |
Alleviating Hallucinations from Knowledge Misalignment in Large Language Models via Selective Abstention Learning (2025.acl-long)
Copied to clipboard
Lei Huang, Xiaocheng Feng, Weitao Ma, Yuchun Fan, Xiachong Feng, Yuxuan Gu, Yangfan Ye, Liang Zhao, Weihong Zhong, Baoxin Wang, Dayong Wu, Guoping Hu, Lingpeng Kong, Tong Xiao, Ting Liu, Bing Qin
| Challenge: | Large language models (LLMs) suffer from severe hallucination issues due to the knowledge misalignment between the pre-training stage and the supervised fine-tuning stage. |
| Approach: | They propose a training objective with an abstention mechanism that selectively rejects tokens that misalign with the desired knowledge distribution via a special [REJ] token. |
| Outcome: | The proposed model selectively rejects tokens that misalign with the desired knowledge distribution via a special [REJ] token. |
TS-SQL: Test-driven Self-refinement for Text-to-SQL (2025.findings-emnlp)
Copied to clipboard
| Challenge: | null |
| Approach: | null |
| Outcome: | null |
SLAM-Omni: Timbre-Controllable Voice Interaction System with Single-Stage Training (2025.findings-acl)
Copied to clipboard
Wenxi Chen, Ziyang Ma, Ruiqi Yan, Yuzhe Liang, Xiquan Li, Ruiyang Xu, Zhikang Niu, Yanqiao Zhu, Yifan Yang, Zhanxun Liu, Kai Yu, Yuxuan Hu, Jinyu Li, Yan Lu, Shujie Liu, Xie Chen
| 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. |
Simultaneous Translation Policies: From Fixed to Adaptive (2020.acl-main)
Copied to clipboard
| Challenge: | Adaptive policies can balance translation quality and latency based on context information . previous methods on obtaining adaptive policies rely on complicated training process . |
| Approach: | They propose to obtain adaptive policies by a simple heuristic composition of fixed policies . they propose to use a heurism to obtain policies that can outperform fixed ones . |
| Outcome: | Experiments on Chinese -> English and German -> english show that adaptive policies outperform fixed policies by up to 4 BLEU points for the same latency. |
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. |
Neural Relation Classification with Text Descriptions (C18-1)
Copied to clipboard
| Challenge: | State-of-the-art methods for relation classification suffer from data sparsity issue greatly. |
| Approach: | They propose a new neural relation classification method which integrates entities’ text descriptions into deep neural networks models. |
| Outcome: | The proposed method achieves much better experimental results than other state-of-the-art methods on the SemEval 2010 dataset. |
MedQPA-Gen: Medical Question Proposing and Answering for Report Generation (2026.findings-acl)
Copied to clipboard
Weijie Liang, Xiyue Zhu, Ruike Zhu, Chenhao Li, Cheng Tang, Zhiyu Liu, Zhihua Gong, Shirui Luo, Yudu Li, Volodymyr Kindratenko
| Challenge: | Existing training paradigms fail to explicitly target factual accuracy, resulting in inaccuracies and serious patient safety risks. |
| Approach: | They propose an automatic and generalizable report evaluation technique that uses question proposing and answering to enable controllable, structured reasoning grounded in medical domain knowledge and the factual correctness of the report. |
| Outcome: | The proposed method can improve human preference scores and perform better on downstream tasks. |
Opportunistic Decoding with Timely Correction for Simultaneous Translation (2020.acl-main)
Copied to clipboard
| Challenge: | Existing approaches to balancing translation quality and latency are either too aggressive or too conservative. |
| Approach: | They propose an opportunistic decoding technique that always (over-)generates a certain mount of extra words at each step to keep the audience on track with the latest information. |
| Outcome: | The proposed technique reduces latency and increases BLEU with no over-generating . it also corrects mistakes in the overgenerated words when observing more context . |
Context-aware Stand-alone Neural Spelling Correction (2020.findings-emnlp)
Copied to clipboard
| Challenge: | Existing natural language processing systems are vulnerable to noisy inputs resulting from misspellings. |
| Approach: | They propose a stand-alone spelling correction problem that corrects the spelling of tokens without additional token insertion or deletion. |
| Outcome: | The proposed solution outperforms the state-of-the-art spelling correction model by 12.8% absolute F0.5 score. |
Fluent and Low-latency Simultaneous Speech-to-Speech Translation with Self-adaptive Training (2020.findings-emnlp)
Copied to clipboard
| Challenge: | Current approaches to simultaneous speech-to-speech translation accumulate more and more latencies in later sentences when the speaker talks faster. |
| Approach: | They propose a method which generates more fluent target speech latency than the baseline . they propose to use self-adaptive translation to adjust the length of translations to accommodate different source speech rates. |
| Outcome: | Xiong et al., 2019) show that the proposed method generates more fluent target speech latency than baseline . authors say it provides more natural communication process than speech-to-text translation . xiong and colleagues say the proposed technique is more efficient than current approaches . |
A Self-Distillation Recipe for Neural Machine Translation (2025.findings-acl)
Copied to clipboard
| Challenge: | Existing methods for Neural Machine Translation (NMT) have been proven effective in improving the performance of computer vision tasks without pre-training a teacher. |
| Approach: | They propose a rank-order augmented Pearson correlation loss and an iterative distillation method to prevent the discrepancy of predictions between the student and a stronger teacher from disturbing the training. |
| Outcome: | The proposed method can lead to significant improvements over the strong Transformer baseline on low/middle/high-resource tasks, obtaining comparable or better performance with fewer layers. |
VulLibGen: Generating Names of Vulnerability-Affected Packages via a Large Language Model (2024.acl-long)
Copied to clipboard
Tianyu Chen, Lin Li, ZhuLiuchuan ZhuLiuchuan, Zongyang Li, Xueqing Liu, Guangtai Liang, Qianxiang Wang, Tao Xie
| Challenge: | Existing work on affected package identification is limited by large language models . a recent study shows that 84% third-party packages contain security vulnerabilities . |
| Approach: | They propose a method to use LLM to generate the affected package . they propose supervised fine-tuning, retrieval augmented generation and a local search algorithm . |
| Outcome: | The proposed method has an average precision of 0.806 for identifying vulnerable packages in four most popular ecosystems in GitHub Advisory. |
Should We Rely on Entity Mentions for Relation Extraction? Debiasing Relation Extraction with Counterfactual Analysis (2022.naacl-main)
Copied to clipboard
Yiwei Wang, Muhao Chen, Wenxuan Zhou, Yujun Cai, Yuxuan Liang, Dayiheng Liu, Baosong Yang, Juncheng Liu, Bryan Hooi
| Challenge: | Existing studies rely on entity information for sentence-level relation extraction (RE) but this can leak superficial and spurious clues of relations. |
| Approach: | They propose to use entity mentions to extract relations from textual context . they use a causal graph to model dependencies between variables in RE models . |
| Outcome: | The proposed method yields significant gains on both effectiveness and generalization for RE. |
Universally Empowering Zeroth-Order Optimization via Adaptive Layer-wise Sampling (2026.findings-acl)
Copied to clipboard
| Challenge: | Existing methods for fine-tuning Large Language Models are slow and lack of performance. |
| Approach: | They propose a Zeroth-Order optimization framework that uses forward passes to fine-tune Large Language Models. |
| Outcome: | The proposed framework achieves 1.7 to 3.0 wall-clock acceleration on LLaMA and OPT models. |
Augur: Modeling Covariate Causal Associations in Time Series via Large Language Models (2026.acl-long)
Copied to clipboard
| Challenge: | Large language models (LLMs) have emerged as a promising avenue for time series forecasting . existing approaches face limitations such as marginalized role in model architectures and lack of interpretability. |
| Approach: | They propose a framework that exploits LLM causal reasoning to discover and use directed causal associations among covariates. |
| Outcome: | The proposed model improves predictive accuracy while yielding transparent, traceable reasoning about variable interactions. |
CLUE: A Chinese Language Understanding Evaluation Benchmark (2020.coling-main)
Copied to clipboard
Liang Xu, Hai Hu, Xuanwei Zhang, Lu Li, Chenjie Cao, Yudong Li, Yechen Xu, Kai Sun, Dian Yu, Cong Yu, Yin Tian, Qianqian Dong, Weitang Liu, Bo Shi, Yiming Cui, Junyi Li, Jun Zeng, Rongzhao Wang, Weijian Xie, Yanting Li, Yina Patterson, Zuoyu Tian, Yiwen Zhang, He Zhou, Shaoweihua Liu, Zhe Zhao, Qipeng Zhao, Cong Yue, Xinrui Zhang, Zhengliang Yang, Kyle Richardson, Zhenzhong Lan
| 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 . |
Empirical Study on Data Attributes Insufficiency of Evaluation Benchmarks for LLMs (2025.coling-main)
Copied to clipboard
| Challenge: | Existing benchmarks for evaluating large language models neglect key qualitative data attributes that can significantly impact the final rankings of LLMs. |
| Approach: | They propose a framework with three modules designed to assess diversity, redundancy, and difficulty. |
| Outcome: | The proposed framework systematically incorporates diversity, redundancy, and difficulty attributes and shows that they influence the ranking of LLMs. |
Improve Interpretability of Neural Networks via Sparse Contrastive Coding (2022.findings-emnlp)
Copied to clipboard
| Challenge: | XAI has achieved remarkable advances, but few efforts have been devoted to solving the problem. |
| Approach: | They propose a model-agnostic explanation method termed Sparse Contrastive Coding . they use model-based explanations to explain the black-box in a more model-oriented way . |
| Outcome: | The proposed method outperforms five state-of-the-art methods in interpretability and classification metrics. |
TRIGO: Benchmarking Formal Mathematical Proof Reduction for Generative Language Models (2023.emnlp-main)
Copied to clipboard
Jing Xiong, Jianhao Shen, Ye Yuan, Haiming Wang, Yichun Yin, Zhengying Liu, Lin Li, Zhijiang Guo, Qingxing Cao, Yinya Huang, Chuanyang Zheng, Xiaodan Liang, Ming Zhang, Qun Liu
| Challenge: | Automated theorem proving (ATP) benchmarks focus on symbolic inference but rarely involve understanding complex number combination reasoning. |
| Approach: | They propose a benchmark that requires a model to reduce a trigonometric expression with step-by-step proof and evaluates a generative LM’s reasoning ability on formulas and ability to manipulate, group, and factor number terms. |
| Outcome: | The proposed benchmark evaluates a generative LM’s reasoning ability on formulas and ability to manipulate, group, and factor number terms. |
Learning How to Remember: A Meta-Cognitive Management Method for Structured and Transferable Agent Memory (2026.findings-acl)
Copied to clipboard
| Challenge: | Existing approaches store memory in fixed representations and reuse it at a single or implicit level of abstraction, which limits generalization and often leads to negative transfer when distribution shift. |
| Approach: | They propose a Meta-Cognitive Memory Abstraction method which decouples task execution from memory management by combining a frozen task model with a learned memory copilot. |
| Outcome: | Experiments on ALFWorld, ScienceWorld, and BabyAI show that the proposed method improves performance, out-of-distribution generalization, and cross-task transfer over several baselines. |
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. |
Chain-of-History Reasoning for Temporal Knowledge Graph Forecasting (2024.findings-acl)
Copied to clipboard
| Challenge: | Existing graph-based models excel at capturing structural information within TKGs but lack semantic comprehension abilities. |
| Approach: | They propose a plug-and-play module to enhance the performance of graph-based TKG models by exploring high-order histories step-by-step. |
| Outcome: | Experiments on three datasets and backbones show that CoH is effective in capturing high-order historical information for LLMs. |
Morpheme Sense Disambiguation: A New Task Aiming for Understanding the Language at Character Level (2024.lrec-main)
Copied to clipboard
| Challenge: | Morphemes are a strong linguistic feature to capture lexical semantics, but lack of morpheme-informed resources and the expense of manual annotations hinder morphme-enhanced methods. |
| Approach: | They propose a task of Morpheme Sense Disambiguation with two subtasks in-text and in-word to generalize morpheme features on more tasks. |
| Outcome: | The proposed tasks are based on two morpheme-annotated datasets for Chinese . the best model yields a promising precision of 77.66% on in-text and 88.19% on in word . |
CRAFTQA: A Code-Driven Adaptive Framework for Complex Structured Data Reasoning (2026.findings-acl)
Copied to clipboard
| Challenge: | Existing unified structured data question answering methods rely on a set of predefined functions, which restricts their ability to perform complex reasoning beyond these predefined operations. |
| Approach: | They propose a novel adaptive code-driven framework that generates code-based reasoning operations based on a question. |
| Outcome: | The proposed framework improves on multiple structured datasets on real-world scenarios. |
Structured Preference Optimization for Vision-Language Long-Horizon Task Planning (2025.emnlp-main)
Copied to clipboard
Xiwen Liang, Min Lin, Weiqi Ruan, Rongtao Xu, Yuecheng Liu, Jiaqi Chen, Bingqian Lin, Yuzheng Zhuang, Xiaodan Liang
| Challenge: | Existing vision-language planning methods struggle with long-horizon reasoning in dynamic environments due to the difficulty of training models to generate high-quality reasoning processes. |
| Approach: | They propose a framework that enhances reasoning and action selection for long-horizon task planning through structured evaluation and optimized training. |
| Outcome: | The proposed framework outperforms existing methods on short-horizon tasks but struggles with long-horizon reasoning in dynamic environments. |
Logic-Thinker: Teaching Large Language Models to Think more Logically. (2025.findings-emnlp)
Copied to clipboard
| Challenge: | Recent Large Reasoning Models (LRMs) have demonstrated the ability to generate long chains of thought (LongCoT) LongCoT still faces challenges such as redundancy and logical incoherence. |
| Approach: | They propose a neural-symbolic reasoning framework that generates chains of thought . they propose Logic-Thinker, which transforms symbolic solvers into chains of thoughts . |
| Outcome: | The proposed framework outperforms models fine-tuned with ThinkerCoT on logic reasoning tasks. |
Strength Lies in Differences! Improving Strategy Planning for Non-collaborative Dialogues via Diversified User Simulation (2024.emnlp-main)
Copied to clipboard
| Challenge: | Non-collaborative dialogue agents are expected to engage in strategic conversations with diverse users, and this poses two main challenges for existing dialogue agents: 1) the inability to integrate user-specific characteristics into the strategic planning; 2) the difficulty of training strategic planners that can be generalized to diverse users. |
| Approach: | They propose to integrate a user-aware strategic planning module and a population-based training paradigm into a non-collaborative dialogue agent for securing a mutual agreement that leans favorably towards the system's objectives. |
| Outcome: | The proposed model can be used to achieve a mutual agreement that leans favorably towards the system's objectives. |
ARCH: Efficient Adversarial Regularized Training with Caching (2021.findings-emnlp)
Copied to clipboard
Simiao Zuo, Chen Liang, Haoming Jiang, Pengcheng He, Xiaodong Liu, Jianfeng Gao, Weizhu Chen, Tuo Zhao
| Challenge: | Existing approaches to regularize models require generating a perturbation for each sample in each epoch. |
| Approach: | They propose an adversarial regularization method where perturbations are generated and cached once every several epochs. |
| Outcome: | The proposed method significantly eases the computational burden (saves up to 70% of computational time) it produces a notably better (in most of the tasks) or comparable model generalization. |
Do Question Answering Modeling Improvements Hold Across Benchmarks? (2023.acl-long)
Copied to clipboard
| Challenge: | a new study finds that human-constructed and downsampled benchmarks hold more concurrence than downsampled benchmarks. |
| Approach: | They propose to measure concurrence between two QA benchmarks on a set of 20 models . they find that human-constructed benchmarks have high concurrence amongst themselves . |
| Outcome: | The proposed models hold broadly across the diverse landscape of question answering (QA) benchmarks. |
From Specific-MLLMs to Omni-MLLMs: A Survey on MLLMs Aligned with Multi-modalities (2025.findings-acl)
Copied to clipboard
Shixin Jiang, Jiafeng Liang, Jiyuan Wang, Xuan Dong, Heng Chang, Weijiang Yu, Jinhua Du, Ming Liu, Bing Qin
| 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. |
Reason Only When Needed: Efficient Generative Reward Modeling via Model-Internal Uncertainty (2026.findings-acl)
Copied to clipboard
Chao Xue, Yao Wang, Mengqiao Liu, Di Liang, Xingsheng Han, Peiyang Liu, Xianjie Wu, Chenyao Lu, Lei Jiang, Yu Lu, Haibo Shi, Shuang Liang, Minlong Peng, Flora D. Salim
| 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. |
Improving Multi-turn Emotional Support Dialogue Generation with Lookahead Strategy Planning (2022.emnlp-main)
Copied to clipboard
| Challenge: | Existing research on building ES conversation systems only considered single-turn interactions with users, which is over-simplified and has limited support for multi-turn systems. |
| Approach: | They propose a multi-turn ES conversation system that uses lookahead heuristics to estimate future user feedback after using particular strategies. |
| Outcome: | The proposed system significantly outperforms baselines in both dialogue generation and strategy planning. |
Empathy in Diversity: Personalized Depression and Anxiety Therapy via Dialogue State Tracking and Patient-Aware Planning (2026.acl-long)
Copied to clipboard
Xinwei Yang, Junyi Fan, Yuqing Liu, Jiaxuan Wang, Jiashuai Zhang, Hongru Liang, Wenqiang Lei, Yao Song
| Challenge: | Recent efforts have turned to large language models (LLMs) as therapeutic agents for psychological therapy tasks, yet robustness across diverse patients remains underexplored. |
| Approach: | They propose a realistic role-play protocol for evaluating therapeutic dialogue agents and a de-identified, expert-annotated corpus of therapist–patient dialogues. |
| Outcome: | The proposed framework outperforms baselines on therapeutic outcomes and dialogue quality while improving conversational efficiency. |
Unsupervised Preference-Aware Language Identification (2022.findings-acl)
Copied to clipboard
| Challenge: | Existing studies do not consider inter-personal variations due to the lack of user annotated training data. |
| Approach: | They propose to use user preferences to identify ambiguous texts in multilingual applications without user annotated training data to build a preference-aware LID model. |
| Outcome: | The proposed model significantly outperforms existing LID systems on handling ambiguous texts. |
Hawkes based Representation Learning for Reasoning over Scale-free Community-structured Temporal Knowledge Graphs (2025.coling-main)
Copied to clipboard
| Challenge: | Temporal knowledge graph reasoning is a useful tool for many practical tasks. |
| Approach: | They propose a Hawkes process-based Evolutional Representation Learning Network model which learns structural information and evolutional patterns of a TKG simultaneously. |
| Outcome: | The proposed model learns structural information and evolutional patterns of a TKG simultaneously, considering the characteristics of real-world networks: community structure, scale-free and temporal decaying. |
Tracing the Light of Thought: A Probabilistic Self- and Cross-Consistency Verification Mechanism Improving Mathematical Reasoning in LLMs (2026.findings-acl)
Copied to clipboard
| Challenge: | Existing methods for evaluating reasoning paths are not efficient, but they are prone to errors. |
| Approach: | They propose a probabilistic self- and cross-consistency framework for mathematical reasoning that employs an accept-reject mechanism to encourage high-quality reasoning paths. |
| Outcome: | The proposed framework improves on 9 LLMs across 4 challenging benchmarks. |
Causal Intervention for Abstractive Related Work Generation (2023.findings-emnlp)
Copied to clipboard
| Challenge: | Existing models ignore the inherent causality during related work generation, leading to spurious correlations which downgrade the models’ generation quality and generalizability. |
| Approach: | They propose a Causal Intervention Module for Related Work Generation (CaM) that captures causal relationships in related work generation and implements causal interventions to mitigate the negative impact of spurious correlations. |
| Outcome: | The proposed framework improves the quality and coherence of generated related work by capturing causalities in the generation process. |
Revisiting the Negative Data of Distantly Supervised Relation Extraction (2021.acl-long)
Copied to clipboard
| Challenge: | Existing methods for relation extraction with distant supervision generate plenty of training samples but noisy labels and imbalanced training data cause problems. |
| Approach: | They propose a method that automatically labels a sentence with relational triples from a knowledge base. |
| Outcome: | The proposed method outperforms existing methods even with false positive samples. |
Landmark-Guided Cross-Speaker Lip Reading with Mutual Information Regularization (2024.lrec-main)
Copied to clipboard
| Challenge: | Lip reading is a process of interpreting silent speech from visual lip movements . but lip reading in cross-speaker scenarios poses a challenging problem due to inter-speech variability . |
| Approach: | They propose to exploit lip landmark-guided visual clues instead of mouth-cropped images as input features. |
| Outcome: | Experimental results show that the proposed approach reduces speaker-specific appearance characteristics in cross-speaker scenarios. |
CLAMBER: A Benchmark of Identifying and Clarifying Ambiguous Information Needs in Large Language Models (2024.acl-long)
Copied to clipboard
Tong Zhang, Peixin Qin, Yang Deng, Chen Huang, Wenqiang Lei, Junhong Liu, Dingnan Jin, Hongru Liang, Tat-Seng Chua
| Challenge: | Large language models are used to meet user information needs, but their effectiveness in dealing with user queries that contain various types of ambiguity remains unknown. |
| Approach: | They propose a benchmark for evaluating large language models using a well-organized taxonomy. |
| Outcome: | The proposed model is based on a well-organized taxonomy and compares it with other models. |
TransGEC: Improving Grammatical Error Correction with Translationese (2023.findings-acl)
Copied to clipboard
| Challenge: | Experimental results show that data augmentation improves accuracy over strong baselines. |
| Approach: | They propose to use translationese as input for GEC data augmentation to overcome stylistic discrepancies . they propose to obtain human-translated texts with a more similar style to non-native texts . |
| Outcome: | The proposed method improves correction accuracy over strong baselines on four GEC benchmarks. |
M2PT: Multimodal Prompt Tuning for Zero-shot Instruction Learning (2024.emnlp-main)
Copied to clipboard
Taowen Wang, Yiyang Liu, James Liang, Junhan Zhao, Yiming Cui, Yuning Mao, Shaoliang Nie, Jiahao Liu, Fuli Feng, Zenglin Xu, Cheng Han, Lifu Huang, Qifan Wang, Dongfang Liu
| Challenge: | Multimodal Large Language Models (MLLMs) exhibit remarkable performance across a wide range of domains. |
| Approach: | They propose a multimodal prompt tuning approach for efficient instruction tuning of MLLMs. |
| Outcome: | The proposed approach shows superior performance on multimodal evaluation datasets compared to state-of-the-art methods. |
KaFT: Knowledge-aware Fine-tuning for Boosting LLMs’ Domain-specific Question-Answering Performance (2025.findings-acl)
Copied to clipboard
| Challenge: | Recent literature reveals that supervised fine-tuning (SFT) is suboptimal for domain-specific question-answering tasks. |
| Approach: | They propose a query diversification strategy for robust conflict detection and a knowledge-aware fine-tuning approach to effectively boost LLMs’ performance. |
| Outcome: | The proposed approach improves the model generalization and alleviates the hallucination. |
DialogSum: A Real-Life Scenario Dialogue Summarization Dataset (2021.findings-acl)
Copied to clipboard
| Challenge: | Experimental results show unique challenges in dialogue summarization such as spoken terms, special discourse structures, coreferences and ellipsis, pragmatics and social common sense. |
| Approach: | They propose a large-scale labeled dialogue summarization dataset . they use state-of-the-art neural models to analyze spoken dialogue summaries . |
| Outcome: | The proposed dataset can be used to analyze spoken dialogue summarization challenges. |
Eureka: Neural Insight Learning for Knowledge Graph Reasoning (2022.coling-1)
Copied to clipboard
| Challenge: | Existing knowledge embedding methods have limited performance on knowledge graph reasoning tasks . eureka is empowered to learn seen relations with sufficient training triples . |
| Approach: | They propose a neural insight learning framework called Eureka to bridge the “seen” to “unsea” gap . Eureca is empowered to learn seen relations with sufficient training triples while providing flexibility to learn unseen relations given only one trigger . |
| Outcome: | The proposed framework outperforms state-of-the-art models on seen and unseen relations . it can learn seen and unseen relationships with sufficient training triples . |
Structural Reward Model: Enhancing Interpretability, Efficiency, and Scalability in Reward Modeling (2025.emnlp-industry)
Copied to clipboard
Xiaoyu Liu, Di Liang, Hongyu Shan, Peiyang Liu, Yonghao Liu, Muling Wu, Yuntao Li, Xianjie Wu, Li Miao, Jiangrong Shen, Minlong Peng
| Challenge: | Generative RMs (GRMs) lack contextual and background information during inference, leading to incomplete evaluations. |
| Approach: | They propose a modular and interpretable framework that integrates side-branch models as auxiliary feature generators. |
| Outcome: | The proposed framework outperforms scalar and saline reward models in robustness and alignment with human preferences. |
AMEX: Android Multi-annotation Expo Dataset for Mobile GUI Agents (2025.findings-acl)
Copied to clipboard
Yuxiang Chai, Siyuan Huang, Yazhe Niu, Han Xiao, Liang Liu, Guozhi Wang, Dingyu Zhang, Shuai Ren, Hongsheng Li
| Challenge: | a new dataset is being developed to improve the capabilities of mobile GUI-control agents. |
| Approach: | They propose a dataset designed for generalist mobile GUI-control agents . they use screenshots from popular mobile applications to create a detailed GUI-annotated dataset . |
| Outcome: | The Android Multi-annotation EXpo (AMEX) is a large-scale dataset for generalist mobile GUI-control agents . it includes screenshots from popular mobile applications, which are annotated at multiple levels . |
Conditional Semantic Textual Similarity via Conditional Contrastive Learning (2025.coling-main)
Copied to clipboard
| Challenge: | Existing methods to assess similarity between sentences encounter over-estimation problem . compared to fuzzy representations, similarity is comparatively lower in terms of "The person's age". |
| Approach: | They propose a conditional contrastive learning framework that constructs positive and negative samples from two perspectives. |
| Outcome: | The proposed method achieves state-of-the-art performance with five models based on bi-encoder and tri-encoding architectures. |
EMTIR-GRPO: Efficient Multi-Tool Augmented Large Language Models via Reinforcement Learning (2026.findings-acl)
Copied to clipboard
| Challenge: | Tool-integrated reasoning (TIR) enables large language models to invoke external tools for tasks beyond their internal capacity but often suffers from tool overuse. |
| Approach: | They propose an algorithm that uses a composite reward to model tool costs and tool efficiency. |
| Outcome: | The proposed algorithm models heterogeneous tool costs and encourages more cost-effective tool-use strategies. |
Bayesian Active Learning with Gaussian Processes Guided by LLM Relevance Scoring for Dense Passage Retrieval (2026.findings-acl)
Copied to clipboard
Junyoung Kim, Anton Korikov, Jiazhou Liang, Justin Cui, Yifan Simon Liu, Qianfeng Wen, Mark Zhao, Scott Sanner
| Challenge: | Existing approaches passively rely on first-stage dense retrievers, which leads to two limitations: failing to retrieve relevant passages in semantically distinct clusters and failing to propagate relevance signals to the broader corpus. |
| Approach: | They propose a framework that propagates sparse LLM relevance signals across the embedding space to guide global exploration. |
| Outcome: | Experiments show that the proposed framework outperforms existing approaches under the same budget on all four datasets. |
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 . |
Explicit Inductive Inference using Large Language Models (2024.findings-emnlp)
Copied to clipboard
| Challenge: | Large Language Models (LLMs) suffer a signifi- cant performance drop when entailment labels disagree with the attestation label of hypothesis H. |
| Approach: | They propose a pipeline that exploits an LLM's attestation bias to do explicit inductive inference . they transform a premise into attested alternatives and aggregate the results . |
| Outcome: | The proposed pipeline improves the performance of large language models on inference tasks and alleviates the attestation bias. |
ZhuJiu-Knowledge: A Fairer Platform for Evaluating Multiple Knowledge Types in Large Language Models (2024.naacl-demo)
Copied to clipboard
| Challenge: | evaluating the knowledge of large language models (LLMs) is crucial, and rapid advancement in large language modeling has heightened the importance of model evaluations. |
| Approach: | They propose a fairer benchmark for evaluating multiple knowledge types of LLMs by focusing on commonsense knowledge, world knowledge, and language knowledge. |
| Outcome: | The proposed framework evaluates 14 current mainstream LLMs and provides a detailed discussion and analysis of their results. |
EduBench: A Comprehensive Benchmarking Dataset for Evaluating Large Language Models in Diverse Educational Scenarios (2026.acl-long)
Copied to clipboard
Bin Xu, Yu Bai, Huashan Sun, Yiguan Lin, Siming Liu, Xinyue Liang, Yaolin Li, Zhuangzhi Dong, Jingren Zhang, Yufan Deng, Xinyu Zou, Yang Gao, Heyan Huang
| 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. |
A Quality-based Syntactic Template Retriever for Syntactically-Controlled Paraphrase Generation (2023.emnlp-main)
Copied to clipboard
| Challenge: | Existing syntactically-controlled paraphrase generation models perform well with human-annotated or well-chosen syntaktic templates. |
| Approach: | They propose a quality-based Syntactic Template Retriever to retrieve templates based on the quality of the to-be-generated paraphrases. |
| Outcome: | The proposed algorithm can generate high-quality paraphrases without sacrificing quality. |
Robust Neural Machine Translation with Joint Textual and Phonetic Embedding (P19-1)
Copied to clipboard
| Challenge: | Neural machine translation models are sensitive to noises in input sentences . one special kind of noise is the homophone noise, where words are replaced by other words with similar pronunciations. |
| Approach: | They propose to embed phonetic and textual information into neural machine translation datasets to improve robustness to homophone noises. |
| Outcome: | The proposed method improves the robustness of neural machine translation to homophone noises on clean test sets. |
MorphoBench: A Benchmark with Difficulty Adaptive to Model Reasoning (2026.findings-acl)
Copied to clipboard
Xukai Wang, Xuanbo Liu, Mingrui Chen, Haitian Zhong, Xuanlin Yang, Bohan Zeng, Jinbo Hu, Hao Liang, Junbo Niu, Xuchen Li, Ruitao Wu, Ruichuan An, Yang Shi, Liu Liu, Qiang Liu, Zhouchen Lin, Xu-Yao Zhang, Wentao Zhang, Bin Dong
| Challenge: | Existing benchmarks designed to evaluate the reasoning capabilities of large models are limited in scope and lack flexibility to adapt difficulty according to evolving reasoning capacities of models. |
| Approach: | They propose a benchmark that incorporates multidisciplinary questions to evaluate the reasoning capabilities of large models and can adjust and update question difficulty based on the reasoning abilities of advanced models. |
| Outcome: | The proposed benchmark incorporates multidisciplinary questions to evaluate the reasoning capabilities of large models and can adjust and update question difficulty based on the reasoning abilities of advanced models. |
Mosaic-IT: Cost-Free Compositional Data Synthesis for Instruction Tuning (2025.findings-acl)
Copied to clipboard
| Challenge: | Current instruction tuning relies on teacher models or human intervention to generate and refine the instructions and responses for training, which are costly, non-sustainable, and may lack diversity. |
| Approach: | They propose a human/model-free compositional data synthesis method that can create rich and diverse augmentations from existing instruction tuning data to enhance large language models. |
| Outcome: | The proposed method improves performance over benchmarks and reduces training costs by 80% compared with original instruction tuning. |
Length-Adaptive Distillation: Customizing Small Language Model for Dynamic Token Pruning (2023.findings-emnlp)
Copied to clipboard
| Challenge: | Existing methods to accelerate inference speed are model compression and dynamic computation (e.g., dynamic token pruning). |
| Approach: | They propose a two-stage knowledge distillation framework that produces a customized small language model for dynamic token pruning. |
| Outcome: | The proposed framework can make the small language model more customized for dynamic token pruning and achieve better speed-performance trade-off. |
LearnAct: Few-Shot Mobile GUI Agent with a Unified Demonstration Benchmark (2026.findings-acl)
Copied to clipboard
Guangyi Liu, Pengxiang Zhao, Liang Liu, Zhiming Chen, Yuxiang Chai, Yaozhen Liang, WenHao Wang, Siheng Chen, Zhengxi Lu, Shuai Ren, Hao Wang, Shibo He, Yong Liu, Wenchao Meng
| Challenge: | Mobile GUI agents show promise in automating tasks but face significant generalization challenges in long-tail scenarios. |
| Approach: | They propose a benchmark framework for mobile GUI agents that measures the performance of GUI agents by analyzing their performance. |
| Outcome: | The LearnGUI benchmark outperforms existing methods in offline and online evaluations and demonstrates consistent gains across model architectures. |
DeepPlanner: Scaling Planning Capability for Deep Research Agents via Advantage Shaping (2026.findings-acl)
Copied to clipboard
| Challenge: | Existing approaches to planning involve implicit planning or introduce explicit planners without systematically optimizing the planning stage. |
| Approach: | They propose an end-to-end RL framework that enhances the planning capabilities of deep research agents. |
| Outcome: | Experiments show that DeepPlanner improves planning quality and achieves state-of-the-art results under a lower training budget. |
ChatMusician: Understanding and Generating Music Intrinsically with LLM (2024.findings-acl)
Copied to clipboard
Ruibin Yuan, Hanfeng Lin, Yi Wang, Zeyue Tian, Shangda Wu, Tianhao Shen, Ge Zhang, Yuhang Wu, Cong Liu, Ziya Zhou, Liumeng Xue, Ziyang Ma, Qin Liu, Tianyu Zheng, Yizhi Li, Yinghao Ma, Yiming Liang, Xiaowei Chi, Ruibo Liu, Zili Wang, Chenghua Lin, Qifeng Liu, Tao Jiang, Wenhao Huang, Wenhu Chen, Jie Fu, Emmanouil Benetos, Gus Xia, Roger Dannenberg, Wei Xue, Shiyin Kang, Yike Guo
| Challenge: | Despite LLMs' impressive capabilities in musical knowledge, music reasoning remains an unsolved task. |
| Approach: | They propose an open-source large language model (LLM) that integrates intrinsic musical abilities into LLaMA2 and GPT-3.5. |
| Outcome: | The proposed model can understand and generate music with a pure text tokenizer without external multi-modal neural structures or tokenizers. |
A3: Android Agent Arena for Mobile GUI Agents with Essential-State Procedural Evaluation (2026.findings-acl)
Copied to clipboard
Yuxiang Chai, Shunye Tang, Han Xiao, Weifeng Lin, Hanhao Li, Jiayu Zhang, Liang Liu, Pengxiang Zhao, Guangyi Liu, Guozhi Wang, Shuai Ren, Rongduo Han, Haining Zhang, Siyuan Huang, Hongsheng Li
| Challenge: | Existing evaluation methods for mobile GUI agents rely on static frame assessments or offline static apps. |
| Approach: | They propose an evaluation system that leverages large language models as reward models to verify task completion and process achievement. |
| Outcome: | The proposed system addresses the limitations of traditional function based evaluation methods on online dynamic apps. |
Chain-of-Talkers (CoTalk): Fast Human Annotation of Dense Image Captions (2025.emnlp-main)
Copied to clipboard
| Challenge: | Existing approaches for optimizing human annotation efforts are limited . et al., 2015) suggest that densely annotated image captions improve vision-language alignment . |
| Approach: | They propose an AI-in-the-loop methodology to maximize the number of annotated samples and improve their comprehensiveness under fixed budget constraints. |
| Outcome: | The proposed method improves annotation speed and retrieval performance over the parallel method. |
WebAgent-R1: Training Web Agents via End-to-End Multi-Turn Reinforcement Learning (2025.emnlp-main)
Copied to clipboard
Zhepei Wei, Wenlin Yao, Yao Liu, Weizhi Zhang, Qin Lu, Liang Qiu, Changlong Yu, Puyang Xu, Chao Zhang, Bing Yin, Hyokun Yun, Lihong Li
| 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. |
AssoCiAm: A Benchmark for Evaluating Association Thinking while Circumventing Ambiguity (2025.emnlp-main)
Copied to clipboard
| Challenge: | Recent advances in multimodal large language models (MLLMs) have garnered significant attention, offering a promising pathway toward artificial general intelligence (AGI). |
| Approach: | They propose a benchmark to evaluate associative ability while circumventing the inherent ambiguity in association tasks by decomposing ambiguities into two types and propose 'assoCiAm' they conduct extensive experiments on MLLMs, revealing a strong positive correlation between cognition and association. |
| Outcome: | The proposed method shows that ambiguity in association evaluations makes MLLMs more random-like and the model's behavior more random. |
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. |
Revisiting Demonstration Selection Strategies in In-Context Learning (2024.acl-long)
Copied to clipboard
| Challenge: | Large language models (LLMs) have shown an impressive ability to perform a wide range of tasks using in-context learning (ICL). |
| Approach: | They propose a data- and model-dependent method to select models using in-context learning, TopK + ConE, and propose unified explanations for the effectiveness of previous methods. |
| Outcome: | The proposed method improves language understanding and generation tasks with different model scales. |
Question Tells You Where the Answer Is: Intention-aware Long-Context KV Cache Compression (2026.acl-long)
Copied to clipboard
Liang Zhao, Xiaocheng Feng, Weihong Zhong, Lei Huang, Kun Zhu, Baoxin Wang, Dayong Wu, Guoping Hu, Ting Liu, Bing Qin
| Challenge: | Recent methods to reduce the KV cache size fail to identify crucial KVs for generation while excluding others accurately, resulting in severe information loss. |
| Approach: | They propose an intention-aware KV cache eviction method that identifies and retains crucial KVs according to the attention distribution of intention, which semantically reflects the user’s goal and determines which part of the context is relevant. |
| Outcome: | The proposed method can maintain the model performance while reducing the KV cache size from 128K to 2K, leading to a 6.3x increase in decoding speed and 7.8x enhancement in memory efficiency compared to the default setting. |
Improving Grammatical Error Correction via Pre-Training a Copy-Augmented Architecture with Unlabeled Data (N19-1)
Copied to clipboard
| Challenge: | Neural machine translation systems have become state-of-the-art approaches for Grammatical Error Correction (GEC) task. |
| Approach: | They propose a copy-augmented architecture for the Grammatical Error Correction task by copying unchanged words from the source sentence to the target sentence. |
| Outcome: | The proposed architecture outperforms all recently published state-of-the-art results by a large margin. |
Controllable Contamination Detection for Reliable LLM Evaluation with Statistical Guarantees (2026.acl-long)
Copied to clipboard
Zheng Zhang, Qi Liu, Siyuan Liang, Ning Li, Zirui Hu, Weibo Gao, Rui Li, Zhenya Huang, Leszek Rutkowski, Baosheng Yu, Dacheng Tao
| 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. |
RelCLIP: Adapting Language-Image Pretraining for Visual Relationship Detection via Relational Contrastive Learning (2022.emnlp-main)
Copied to clipboard
| Challenge: | Existing visual relationship detection models only use numeric ids of relation labels for training, but ignore semantic correlation between labels. |
| Approach: | They propose a visual Relationship prediction framework that transfers natural language knowledge from Contrastive Language-Image Pre-training models to enhance the relationship prediction. |
| Outcome: | The proposed framework improves visual relationship prediction by matching semantic correlations with relation triplets. |
Stable Language Guidance for Vision–Language–Action Models (2026.acl-long)
Copied to clipboard
| Challenge: | Existing vision-Language-Action models are notoriously brittle to linguistic perturbations. |
| Approach: | They propose a probabilistic framework that disentangles physical affordance from semantic execution. |
| Outcome: | The proposed framework disentangles physical affordance from semantic execution. |
SEEK: Segmented Embedding of Knowledge Graphs (2020.acl-main)
Copied to clipboard
| Challenge: | Existing methods for knowledge graph embedding can not make a proper trade-off between the model complexity and the model expressiveness, which makes them far from satisfactory. |
| Approach: | They propose a lightweight modeling framework that can achieve highly competitive relational expressiveness without increasing the model complexity. |
| Outcome: | The proposed framework can achieve highly competitive relational expressiveness without increasing model complexity. |
On the Copying Behaviors of Pre-Training for Neural Machine Translation (2021.findings-acl)
Copied to clipboard
| Challenge: | Existing studies show that initializing NMT models with pre-trained language models (LM) can speed up the model training and boost the model performance. |
| Approach: | They propose a method to control copying behaviors in NMT models by initializing them with pre-trained language models (LM) they propose to use a metric called copy ratio to control the copying behavior in decoding. |
| Outcome: | The proposed method improves translation performance by controlling copying behaviors for pre-training based models. |
DSQG-Syn: Synthesizing High-quality Data for Text-to-SQL Parsing by Domain Specific Question Generation (2025.findings-naacl)
Copied to clipboard
Shaoming Duan, Youxuan Wu, Chuanyi Liu, Yuhao Zhang, Zirui Wang, Peiyi Han, Shengyuan Yu, Liang Yan, Yingwei Liang
| 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. |
Don’t Take It Literally: An Edit-Invariant Sequence Loss for Text Generation (2022.naacl-main)
Copied to clipboard
Guangyi Liu, Zichao Yang, Tianhua Tao, Xiaodan Liang, Junwei Bao, Zhen Li, Xiaodong He, Shuguang Cui, Zhiting Hu
| Challenge: | Neural text generation models are typically trained by maximizing log-likelihood with the sequence cross entropy (CE) loss. |
| Approach: | They propose an Edit-Invariant Sequence Loss method which computes the matching loss of a target sequence with all n-grams in the generated sequence. |
| Outcome: | The proposed method outperforms the common CE loss and strong baselines on a wide range of tasks. |
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 . |
ATG: Benchmarking Automated Theorem Generation for Generative Language Models (2024.findings-naacl)
Copied to clipboard
| Challenge: | Existing generative language models (LMs) can generate new or reusable theorems, but their ability to generate new theorels is under-explored. |
| Approach: | They propose to use Metamath library to generate new theorems that can be saved as reusable knowledge for future theoretical proving. |
| Outcome: | The proposed benchmark evaluates whether an agent can generate valuable (and possibly brand new) theorems that are applicable for downstream theoretic proving as reusable knowledge. |
Evaluating Scene-based In-Situ Item Labeling for Immersive Conversational Recommendation (2026.findings-acl)
Copied to clipboard
| Challenge: | Existing methods for evaluating item labels fail to leverage scenario-specific information modalities, present redundant information that is visually inferable, and lack latent awareness of users' information needs. |
| Approach: | They propose a principled categorization of information needs into explicit intent satisfaction and proactive information needs and define evaluation metrics for item label selection. |
| Outcome: | The proposed evaluation framework is based on IR-, LLM-, and VLM-based methods across fashion, movie recommendation, and retail shopping scenarios. |
ROSE Doesn’t Do That: Boosting the Safety of Instruction-Tuned Large Language Models with Reverse Prompt Contrastive Decoding (2024.findings-acl)
Copied to clipboard
| Challenge: | Existing methods for aligning LLMs output with expected safety require substantial training efforts and expensive computational resources. |
| Approach: | They propose a method to directly boost the safety of existing instruction-tuned large language models without additional training. |
| Outcome: | The proposed method improves safety of instruction-tuned large language models without training and requires expensive computational resources. |
Best Practices for Distilling Large Language Models into BERT for Web Search Ranking (2025.coling-industry)
Copied to clipboard
| Challenge: | Recent studies have highlighted the potential of Large Language Models (LLMs) as zero-shot relevance rankers. |
| Approach: | They propose to use a ranking loss to transfer ranking knowledge from LLMs to smaller models like BERT. |
| Outcome: | The proposed model has been successfully integrated into a commercial web search engine as of February 2024. |
On the Complementarity between Pre-Training and Back-Translation for Neural Machine Translation (2021.findings-emnlp)
Copied to clipboard
| Challenge: | Experimental results show that PT and BT are nicely complementary to each other. |
| Approach: | They introduce two probing tasks for PT and BT respectively and investigate their complementarity. |
| Outcome: | The proposed methods establish state-of-the-art on the WMT16 English-Romanian and English-Russian benchmarks. |
GEMv2: Multilingual NLG Benchmarking in a Single Line of Code (2022.emnlp-demos)
Copied to clipboard
Sebastian Gehrmann, Abhik Bhattacharjee, Abinaya Mahendiran, Alex Wang, Alexandros Papangelis, Aman Madaan, Angelina Mcmillan-major, Anna Shvets, Ashish Upadhyay, Bernd Bohnet, Bingsheng Yao, Bryan Wilie, Chandra Bhagavatula, Chaobin You, Craig Thomson, Cristina Garbacea, Dakuo Wang, Daniel Deutsch, Deyi Xiong, Di Jin, Dimitra Gkatzia, Dragomir Radev, Elizabeth Clark, Esin Durmus, Faisal Ladhak, Filip Ginter, Genta Indra Winata, Hendrik Strobelt, Hiroaki Hayashi, Jekaterina Novikova, Jenna Kanerva, Jenny Chim, Jiawei Zhou, Jordan Clive, Joshua Maynez, João Sedoc, Juraj Juraska, Kaustubh Dhole, Khyathi Raghavi Chandu, Laura Perez Beltrachini, Leonardo F . R. Ribeiro, Lewis Tunstall, Li Zhang, Mahim Pushkarna, Mathias Creutz, Michael White, Mihir Sanjay Kale, Moussa Kamal Eddine, Nico Daheim, Nishant Subramani, Ondrej Dusek, Paul Pu Liang, Pawan Sasanka Ammanamanchi, Qi Zhu, Ratish Puduppully, Reno Kriz, Rifat Shahriyar, Ronald Cardenas, Saad Mahamood, Salomey Osei, Samuel Cahyawijaya, Sanja Štajner, Sebastien Montella, Shailza Jolly, Simon Mille, Tahmid Hasan, Tianhao Shen, Tosin Adewumi, Vikas Raunak, Vipul Raheja, Vitaly Nikolaev, Vivian Tsai, Yacine Jernite, Ying Xu, Yisi Sang, Yixin Liu, Yufang Hou
| Challenge: | Evaluations in machine learning rarely use the latest metrics, datasets, or human evaluation in favor of remaining compatible with prior work. |
| Approach: | They propose to use the Generation, Evaluation, and Metrics Benchmark to integrate new evaluation methods into existing evaluations. |
| Outcome: | The proposed evaluation infrastructure bridges the gap between the advantages of leaderboards and in-depth and evolving evaluations by allowing model developers to benefit from each other's work. |
Chinese Toxic Language Mitigation via Sentiment Polarity Consistent Rewrites (2025.emnlp-main)
Copied to clipboard
| Challenge: | Large language models (LLMs) can be effective at rewriting toxic content, but they often default to overly polite rewrites, distorting the emotional tone and communicative intent. |
| Approach: | They evaluate 17 large language models with variant architectures to evaluate their ability to rewrite toxic content while preserving the speaker's original intent. |
| Outcome: | The first Chinese detoxification dataset explicitly designed to preserve sentiment polarity is evaluated across five real-world scenarios. |
Can MLLMs Understand the Deep Implication Behind Chinese Images? (2025.acl-long)
Copied to clipboard
Chenhao Zhang, Xi Feng, Yuelin Bai, Xeron Du, Jinchang Hou, Kaixin Deng, Guangzeng Han, Qinrui Li, Bingli Wang, Jiaheng Liu, Xingwei Qu, Yifei Zhang, Qixuan Zhao, Yiming Liang, Ziqiang Liu, Feiteng Fang, Min Yang, Wenhao Huang, Chenghua Lin, Ge Zhang, Shiwen Ni
| Challenge: | MLLMs perform poorly on traditional culture images, indicating limitations in understanding high-level semantics and lacking a deep knowledge base of Chinese traditional culture. |
| Approach: | They propose to use Chinese images to assess MLLMs' higher-order perception and understanding of Chinese visual content. |
| Outcome: | The proposed model incorporates images that represent Chinese traditional culture, such as famous Chinese traditional paintings, to ensure the authenticity of the Chinese context. |
DT-Solver: Automated Theorem Proving with Dynamic-Tree Sampling Guided by Proof-level Value Function (2023.acl-long)
Copied to clipboard
Haiming Wang, Ye Yuan, Zhengying Liu, Jianhao Shen, Yichun Yin, Jing Xiong, Enze Xie, Han Shi, Yujun Li, Lin Li, Jian Yin, Zhenguo Li, Xiaodan Liang
| Challenge: | Recent advances in neural theorem-proving resort to large language models and tree searches. |
| Approach: | They propose a Dynamic-Tree Driven Theorem Solver to accommodate general theoremes by guiding the search procedure with state confidence and proof-level values. |
| Outcome: | The proposed method outperforms state-of-the-art methods on two popular theorem-proving datasets with a 6.65% improvement on average in terms of success rate. |
HyperCRS: Hypergraph-Aware Multi-Grained Preference Learning to Burst Filter Bubbles in Conversational Recommendation System (2025.findings-acl)
Copied to clipboard
Yongsen Zheng, Mingjie Qian, Guohua Wang, Yang Liu, Ziliang Chen, Mingzhi Mao, Liang Lin, Kwok-Yan Lam
| Challenge: | Existing methods to analyze filter bubbles in the static recommendation environment are unable to burst them during user interactions. |
| Approach: | They propose a paradigm to learn multi-grained user preferences during dynamic user-system interactions via natural language conversations to burst filter bubbles. |
| Outcome: | The proposed paradigm achieves state-of-the-art performance and the superior of bursting filter bubbles in the conversational recommendation system. |
LongInsightBench: A Comprehensive Benchmark for Evaluating Omni-Modal Models on Human-Centric Long-Video Understanding. (2026.findings-acl)
Copied to clipboard
| Challenge: | LongInsightBench is the first benchmark designed to assess models’ ability to understand long videos, with a focus on human language, viewpoints, actions, and other contextual elements. |
| Approach: | They propose a benchmark to assess models’ ability to understand long videos with a focus on human language, viewpoints, actions, and other contextual elements. |
| Outcome: | The proposed model excels in three key areas: a) long-duration, human-centric videos; b) diversifying and challenging task scenarios; c) quality assurance pipeline; and d) reliability. |
Toolscaler: Scalable Generative Tool Calling via Structure-Aware Semantic Tokenization (2025.findings-emnlp)
Copied to clipboard
Yunyue Su, Zhang Jinshuai, Bowen Fang, Wen Ye, Jinghao Zhang, Bowen Song, Weiqiang Wang, Qiang Liu, Liang Wang
| Challenge: | Extensive experiments demonstrate the effectiveness of SGTC across various tasks. |
| Approach: | They propose a generative tool invocation framework that introduces structure-aware semantic tokenization to encode tools as discrete code sequences. |
| Outcome: | The proposed framework reduces the size of the representation space and underutilizes collaborative signals among tools in downstream tasks. |
Breaking the Reasoning Barrier A Survey on LLM Complex Reasoning through the Lens of Self-Evolution (2025.findings-acl)
Copied to clipboard
Tao He, Hao Li, Jingchang Chen, Runxuan Liu, Yixin Cao, Lizi Liao, Zihao Zheng, Zheng Chu, Jiafeng Liang, Ming Liu, Bing Qin
| Challenge: | OpenAI's O1 and subsequent projects like DeepSeek R1 have significantly advanced research on complex reasoning in LLMs. |
| Approach: | They analyze existing reasoning studies from the perspective of self-evolution and summarize O1-like works from open-source projects like DeepSeek R1 and Kimi-k1.5. |
| Outcome: | The proposed models are based on open-source models and pioneer advanced methodologies like Scaling Reinforcement Learning (RL). |
Why Do Emotions Change? Appraisal-Guided Reasoning for Emotion–Cause Triplet Extraction in Conversations (2026.acl-long)
Copied to clipboard
| Challenge: | Existing methods for multi-turn, multi-speaker multimodal affect understanding are difficult to maintain conversation-level consistency under within-speaks' emotion shifts. |
| Approach: | They propose a framework that combines appraisal-guided structured generation with graph-structured reinforcement learning to extract triplets from multi-turn multimodal conversations. |
| Outcome: | The proposed framework outperforms baselines on public MECTEC benchmarks and improves structure-aware metrics on emotion shift coherence and core events. |
SmartTrim: Adaptive Tokens and Attention Pruning for Efficient Vision-Language Models (2024.lrec-main)
Copied to clipboard
Zekun Wang, Jingchang Chen, Wangchunshu Zhou, Haichao Zhu, Jiafeng Liang, Liping Shan, Ming Liu, Dongliang Xu, Qing Yang, Bing Qin
| Challenge: | Experimental results show that SmartTrim accelerates the original model by 2-3 times with minimal performance degradation. |
| Approach: | They propose an adaptive acceleration framework which prunes redundant token representations and attention heads within each layer of the original model. |
| Outcome: | The proposed framework accelerates the original model by 2-3 times with minimal performance degradation across vision-language tasks. |
ReflectRM: Boosting Generative Reward Models via Self-Reflection within a Unified Judgment Framework (2026.acl-long)
Copied to clipboard
Kai Qin, Liangxin Liu, Yu Liang, Longzheng Wang, null Wangyan, Zhang Yueyang, Long Xia, Zhiyuan Sun, Houde Liu, Daiting Shi
| 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. |
Novel Slot Detection With an Incremental Setting (2023.findings-emnlp)
Copied to clipboard
| Challenge: | Current dialogue systems face diverse user requests and rapid change domains, making quickly adapt to scenarios with previous unseen slot types becomes a major challenge. |
| Approach: | They propose an incremental novel slot detection task which separates the dialogue system to deal with novel types as two major phrases: 1) model discovers unknown slots; 2) training model to possess the capability to handle new classes. |
| Outcome: | The proposed approach overcomes catastrophic forgetting during the process of INSD and is highly effective. |
EfficientLLM: Unified Pruning-Aware Pretraining for Auto-Designed Compact Language Models (2026.acl-long)
Copied to clipboard
Xingrun Xing, Zheng Liu, Shitao Xiao, Boyan Gao, Yiming Liang, Haokun Lin, Xianlin Zeng, Guoqi Li, Jiajun Zhang
| Challenge: | Large language models (LLMs) driven by scaling laws can be developed in large model sizes. |
| Approach: | They propose a pruning-aware pretraining approach that decouples LLM pruning from direct pretraining. |
| Outcome: | The proposed model outperforms pretraining models with 100M 1B parameters in commen sense benchmarks. |
Counterfactual Debiasing for Fact Verification (2023.acl-long)
Copied to clipboard
| Challenge: | Existing methods for debiasing factchecking models learn such biases instead of understanding the semantic relationship between the claim and evidence. |
| Approach: | They propose a counterfactual framework CLEVER which is augmentation-free and mitigates biases on the inference stage. |
| Outcome: | The proposed method is augmentation-free and mitigates biases on the inference stage. |
MaXIFE: Multilingual and Cross-lingual Instruction Following Evaluation (2025.acl-long)
Copied to clipboard
| Challenge: | Existing evaluation methods focus on single-language scenarios, overlooking multilingual and cross-lingual contexts. |
| Approach: | They propose a tool to assess instruction-following capabilities across 23 different languages with 1667 verifiable instruction tasks. |
| Outcome: | MaXIFE evaluates instruction-following capabilities across 23 languages with 1667 verifiable instruction tasks. |
StableToolBench: Towards Stable Large-Scale Benchmarking on Tool Learning of Large Language Models (2024.findings-acl)
Copied to clipboard
Zhicheng Guo, Sijie Cheng, Hao Wang, Shihao Liang, Yujia Qin, Peng Li, Zhiyuan Liu, Maosong Sun, Yang Liu
| Challenge: | Large Language Models (LLMs) have witnessed remarkable advancements in recent years, prompting the exploration of tool learning. |
| Approach: | They propose a virtual API server and stable evaluation system to assess the stability of large-scale real-time APIs. |
| Outcome: | The proposed benchmarks demonstrate the stability of the proposed system and its caching system. |
MAS-Bench: A Unified Benchmark for Shortcut-Augmented Hybrid Mobile GUI Agents (2026.acl-long)
Copied to clipboard
Pengxiang Zhao, Guangyi Liu, Yaozhen Liang, Weiqing He, Zhengxi Lu, WenHao Wang, Yuehao Huang, Yuxiang Chai, Zhaolu Kang, Yaxuan Guo, Hao Wang, Kexin Zhang, Liang Liu, Yong Liu
| Challenge: | Shortcuts such as APIs and deep-links have emerged as efficient complements to flexible GUI operations, but systematic evaluation of GUI–shortcut hybrid agents remains underexplored. |
| Approach: | They propose a benchmark that evaluates GUI-shortcut hybrid agents with a specific focus on the mobile domain. |
| Outcome: | MAS-Bench evaluates agent's ability to generate shortcuts by discovering and creating reusable, low-cost workflows. |
Open-ended Commonsense Reasoning with Unrestricted Answer Candidates (2023.findings-emnlp)
Copied to clipboard
Chen Ling, Xuchao Zhang, Xujiang Zhao, Yanchi Liu, Wei Cheng, Mika Oishi, Takao Osaki, Katsushi Matsuda, Haifeng Chen, Liang Zhao
| Challenge: | Current approaches to commonsense reasoning are limited due to limited answer scope. |
| Approach: | They propose to solve a commonsense question without a pre-defined answer scope . they leverage pre-trained language models to iteratively retrieve reasoning paths on the external knowledge base . |
| Outcome: | The proposed method achieves better performance on two commonsense benchmark datasets. |
Are Sample-Efficient NLP Models More Robust? (2023.acl-short)
Copied to clipboard
| Challenge: | Recent work in image classification and extractive question answering have observed that pre-trained models trained on less in-distribution data have better out-of-distortion performance. |
| Approach: | They conduct a large empirical study to investigate the relationship between sample efficiency and robustness. |
| Outcome: | The results show that pre-trained models with lower sample efficiency perform better on some tasks but not others. |
Learning Latent Relations for Temporal Knowledge Graph Reasoning (2023.acl-long)
Copied to clipboard
| Challenge: | Existing methods for Temporal Knowledge Graph reasoning capture intra- and inter-time latent relations between entities that appear at different times. |
| Approach: | They propose a Latent relations Learning method for TKG reasoning that captures latent relations between entities at different times. |
| Outcome: | The proposed method exploits the intra- and inter-time latent relations of entities at different times. |
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. |
Length Extrapolation of Transformers: A Survey from the Perspective of Positional Encoding (2024.findings-emnlp)
Copied to clipboard
Liang Zhao, Xiachong Feng, Xiaocheng Feng, Weihong Zhong, Dongliang Xu, Qing Yang, Hongtao Liu, Bing Qin, Ting Liu
| Challenge: | Existing methods to enhance length extrapolation of large language models have been developed, but a systematic survey is lacking. |
| Approach: | They propose to examine the effects of positional encoding on length extrapolation. |
| Outcome: | The proposed methods improve the extrapolation of large language models, but they are still lacking a systematic survey. |
WebCPM: Interactive Web Search for Chinese Long-form Question Answering (2023.acl-long)
Copied to clipboard
Yujia Qin, Zihan Cai, Dian Jin, Lan Yan, Shihao Liang, Kunlun Zhu, Yankai Lin, Xu Han, Ning Ding, Huadong Wang, Ruobing Xie, Fanchao Qi, Zhiyuan Liu, Maosong Sun, Jie Zhou
| Challenge: | Long-form question answering requires two procedures: information retrieval and information synthesis. |
| Approach: | They propose a Chinese long-form question answering dataset called WebCPM . the dataset is based on a web search interface that engages with a search engine in real time . |
| Outcome: | The proposed dataset generates answers that are no worse than human-written ones . the dataset is the first Chinese LFQA dataset . |
Efficient Temporal Extrapolation of Multimodal Large Language Models with Temporal Grounding Bridge (2024.emnlp-main)
Copied to clipboard
| Challenge: | despite advances in multimodal large language models, the challenge of interpreting long-form videos remains a challenge . despite advancements in video-language benchmarks, the inefficiency in temporal grounding and limited pre-trained context window size remains . |
| Approach: | They propose a framework that bootstraps MLLMs with advanced temporal grounding capabilities and broadens their contextual scope. |
| Outcome: | The proposed framework significantly enhances the temporal capabilities of existing MLLMs. |
ReasonRec: A Reasoning-Augmented Multimodal Agent for Unified Recommendation (2026.findings-acl)
Copied to clipboard
Yihua Zhang, Mingfu Liang, Jiyan Yang, Rong Jin, Wen-Yen Chen, Yiping Han, Huayu Li, Buyun Zhang, Liang Luo, Luke Simon, Sijia Liu, Tianlong Chen, Xi Liu
| Challenge: | Recent advances in multimodal recommenders lack explicit reasoning and self-awareness of uncertainty. |
| Approach: | They propose a reasoning-augmented multimodal agent structured around a three-stage explicit reasoning pipeline. |
| Outcome: | The proposed agent improves ranking metrics and performance on four standard recommendation tasks across five real-world datasets. |
A Semantic Filter Based on Relations for Knowledge Graph Completion (2021.emnlp-main)
Copied to clipboard
| Challenge: | Knowledge graph embedding is a new form of knowledge graphing that allows for better link prediction. |
| Approach: | They propose to use relational embedding to fit symmetry/antisymmetry and combination relationships. |
| Outcome: | The proposed model can fit symmetry/antisymmetry and combination relationships. |
Aligning Cross-lingual Sentence Representations with Dual Momentum Contrast (2021.emnlp-main)
Copied to clipboard
| Challenge: | Existing work uses sentences within the same batch as negatives, which suffers from easy negatives. |
| Approach: | They propose to align sentence representations from different languages into a unified embedding space . they adapt MoCo to further improve the quality of alignment . |
| Outcome: | The proposed model achieves state-of-the-art on several tasks. |
ConsistRM: Improving Generative Reward Models via Consistency-Aware Self-Training (2026.acl-long)
Copied to clipboard
Yu Liang, Liangxin Liu, Longzheng Wang, null Wangyan, Zhang Yueyang, Long Xia, Zhiyuan Sun, Daiting Shi
| 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. |
DocStruct: A Multimodal Method to Extract Hierarchy Structure in Document for General Form Understanding (2020.findings-emnlp)
Copied to clipboard
| Challenge: | Form understanding is a complex task because of the textual contents and organizational structure of forms. |
| Approach: | They propose to use multimodal methods to extract key-value pairs from forms . they validate their method on two benchmarks and demonstrate their effectiveness . |
| Outcome: | The proposed method is validated on two benchmarks, MedForm and FUNSD. |
Learning Language and Multimodal Privacy-Preserving Markers of Mood from Mobile Data (2021.acl-long)
Copied to clipboard
Paul Pu Liang, Terrance Liu, Anna Cai, Michal Muszynski, Ryo Ishii, Nick Allen, Randy Auerbach, David Brent, Ruslan Salakhutdinov, Louis-Philippe Morency
| Challenge: | Mental health conditions remain underdiagnosed in many countries despite access to advanced medical care . a new approach to learn mood markers from mobile data is needed to improve accuracy and improve learning from typed text. |
| Approach: | They propose to use mobile data to learn mood markers without identifying users through personal or protected attributes. |
| Outcome: | The proposed model obfuscates user identities while remaining predictive . future directions include better models and pre-learning from typed text . |
Rejuvenating Low-Frequency Words: Making the Most of Parallel Data in Non-Autoregressive Translation (2021.acl-long)
Copied to clipboard
| Challenge: | Knowledge distillation (KD) is commonly used to construct synthetic data for training non-autoregressive translation models. |
| Approach: | They propose to use knowledge distillation to generate training data for non-autoregressive translation models by leveraging pretraining. |
| Outcome: | The proposed approach achieves 28.2 and 33.9 BLEU points on the WMT14 English-German and WMT16 Romanian-English datasets. |
Giving Control Back to Models: Enabling Offensive Language Detection Models to Autonomously Identify and Mitigate Biases (2024.findings-emnlp)
Copied to clipboard
| Challenge: | Existing models often rely on specific words to predict offensive content, compromising model fairness and potentially exacerbates biases against vulnerable and minority groups. |
| Approach: | They propose a bias self-awareness and data self-iteration framework to help models identify and mitigate biases by integrating multiple natural language processing techniques. |
| Outcome: | The proposed framework reduces false positive rate of models in in-distribution and out-of-difference tests, enhances model accuracy and fairness, and shows promising performance improvements on larger datasets. |
RSDA: Restoring Stale Data Affinity via Dynamic Renovation Strategy for Mitigating Data Scarcity (2026.acl-long)
Copied to clipboard
Yidan Liang, Jia Zhu, Weijie Shi, Hanghui Guo, Yue Cui, Jiawei Shen, Guoqing Ma, Jingjiang Liu, Qingyu Niu, Yilin Wang, Shimin Di, Jiajie Xu
| Challenge: | High-quality data is the cornerstone of advancing large language models, but the supply of premium data is nearing depletion, while vast stale corpora remain underutilized. |
| Approach: | They propose a framework to restore stale data affinity by quantifying the latent value of samples and employing a dynamic renovation strategy selection mechanism to determine the optimal component-level strategy. |
| Outcome: | The proposed framework achieves performance improvements using less than 10% of the data volume, underscoring that the latent potential of stale corpora remains largely untapped. |
m3P: Towards Multimodal Multilingual Translation with Multimodal Prompt (2024.lrec-main)
Copied to clipboard
Jian Yang, Hongcheng Guo, Yuwei Yin, Jiaqi Bai, Bing Wang, Jiaheng Liu, Xinnian Liang, LinZheng Chai, Liqun Yang, Zhoujun Li
| Challenge: | Existing multimodal neural machine translation models focus on bilingual translation, but experimental results show that they outperform the text-only baselines and multilingual multimodal methods by a large margin. |
| Approach: | They propose a framework to leverage the multimodal prompt to guide the Multimodal Multilingual Neural Machine Translation (m3P) this framework aligns the representations of different languages with the same meaning and generates the conditional vision-language memory for translation. |
| Outcome: | The proposed framework outperforms previous text-only baselines and multilingual multimodal methods by a large margin. |
Expanding the Boundaries of Vision Prior Knowledge in Multi-modal Large Language Models (2026.eacl-long)
Copied to clipboard
Qiao Liang, Yanjiang Liu, Weixiang Zhou, Ben He, Yaojie Lu, Hongyu Lin, Jia Zheng, Xianpei Han, Le Sun, Yingfei Sun
| Challenge: | Existing research treats MLLMs as unified systems optimized through end-to-end training, but the impact of vision encoder’s prior knowledge is seldom investigated. |
| Approach: | They propose a metric to quantify the effect of prior knowledge on MLLM performance by integrating prior knowledge at the vision encoder level into a training framework. |
| Outcome: | The proposed training framework incorporates prior knowledge at the vision encoder level, and significantly boosts visual understanding capabilities of MLLMs. |
COIG-P: A High-Quality and Large-Scale Chinese Preference Dataset for Alignment with Human Values (2026.findings-eacl)
Copied to clipboard
Siwei Wu, JinCheng Ren, Xeron Du, Shuyue Guo, Xingwei Qu, Yiming Liang, Jie Liu, Yunwen Li, Tyler Loakman, Tianyu Zheng, Boyu Feng, Huaqing Yuan, Zili Wang, Jiaheng Liu, Wenhao Huang, Chenglin Cai, Haoran Que, Jian Yang, Yuelin Bai, Zekun Moore Wang, Zhouliang Yu, Qunshu Lin, Ding Pan, Yuchen Eleanor Jiang, Tiannan Wang, Wangchunshu Zhou, Shenzhi Wang, Xingyuan Bu, Minghao Liu, Guoyin Wang, Ge Zhang, Chenghua Lin
| 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. |
XGLUE: A New Benchmark Dataset for Cross-lingual Pre-training, Understanding and Generation (2020.emnlp-main)
Copied to clipboard
Yaobo Liang, Nan Duan, Yeyun Gong, Ning Wu, Fenfei Guo, Weizhen Qi, Ming Gong, Linjun Shou, Daxin Jiang, Guihong Cao, Xiaodong Fan, Ruofei Zhang, Rahul Agrawal, Edward Cui, Sining Wei, Taroon Bharti, Ying Qiao, Jiun-Hung Chen, Winnie Wu, Shuguang Liu, Fan Yang, Daniel Campos, Rangan Majumder, Ming Zhou
| Challenge: | XGLUE provides a benchmark dataset to train large-scale cross-lingual pre-trained models . XCLUE provides 11 diversified tasks that cover both understanding and generation scenarios . |
| Approach: | They introduce a new benchmark dataset to train large-scale cross-lingual pre-trained models using multilingual and bilingual corpora. |
| Outcome: | The proposed dataset is labeled in English and includes only natural language understanding tasks. |
SimKGC: Simple Contrastive Knowledge Graph Completion with Pre-trained Language Models (2022.acl-long)
Copied to clipboard
| Challenge: | Text-based methods lag behind graph embedding-based approaches for knowledge graph completion (KGC) |
| Approach: | They propose three types of negatives to improve contrastive learning to improve learning efficiency. |
| Outcome: | The proposed model outperforms embedding-based methods on several benchmark datasets. |
Conv-Basis: A New Paradigm for Efficient Attention Inference and Gradient Computation in Transformers (2025.findings-emnlp)
Copied to clipboard
| Challenge: | a large computational cost for attention computation in large language models is a major obstacle . |
| Approach: | They propose a convolution-like structure for attention computation using convolution matrices . they then propose an efficient approximation method to approximate the attention matrix . |
| Outcome: | The proposed method achieves nearly linear time complexity in n1+o(1) time. |
SHARP: Steering Hallucination in LVLMs via Representation Engineering (2025.emnlp-main)
Copied to clipboard
Junfei Wu, Yue Ding, Guofan Liu, Tianze Xia, Ziyue Huang, Dianbo Sui, Qiang Liu, Shu Wu, Liang Wang, Tieniu Tan
| Challenge: | Large Vision-Language Models (LVLMs) generate responses that are plausible but incorrect or unsupported—commonly referred to as hallucinations. |
| Approach: | They propose a representation-level intervention framework that modulates hallucination-related features during inference by probing their encoded features. |
| Outcome: | The proposed framework reduces hallucinations while maintaining the performance and generalization capabilities of Large Vision-Language Models (LVLMs). |
Bridging the Gap between Training and Inference: Multi-Candidate Optimization for Diverse Neural Machine Translation (2022.findings-naacl)
Copied to clipboard
| Challenge: | Existing diverse NMT models lack translation diversity due to a discrepancy between training and inference . despite the success of diverse NTM, there is still a lack of translation diversity . |
| Approach: | They propose a multi-candidate optimization framework for diverse NMT to deal with this defect. |
| Outcome: | The proposed framework is transparent to basic diverse NMT models, and universally makes better trade-off between diversity and quality. |
Self-Critique Guided Iterative Reasoning for Multi-hop Question Answering (2025.findings-acl)
Copied to clipboard
Zheng Chu, Huiming Fan, Jingchang Chen, Qianyu Wang, Mingda Yang, Jiafeng Liang, Zhongjie Wang, Hao Li, Guo Tang, Ming Liu, Bing Qin
| Challenge: | Large language models (LLMs) have demonstrated remarkable reasoning capabilities, but they still face challenges in knowledge-intensive multi-hop reasoning. |
| Approach: | They propose a method that uses self-critique feedback to guide iterative reasoning by enabling iteration and self-evaluation of its intermediate reasoning steps. |
| Outcome: | The proposed method surpasses the previous SOTA by 8.6% on three multi-hop reasoning datasets. |
Causality-aware Concept Extraction based on Knowledge-guided Prompting (2023.acl-long)
Copied to clipboard
| Challenge: | Concepts in knowledge graphs (KGs) are far from complete in existing knowledge graph models. |
| Approach: | They propose to equip a PLM-based extractor with a knowledge-guided prompt to alleviate concept bias by removing spurious co-occurrence correlations from existing knowledge. |
| Outcome: | The proposed prompt can alleviate concept bias and improve the performance of existing models. |
FocalOrder: Focal Preference Optimization for Reading Order Detection (2026.acl-long)
Copied to clipboard
Fuyuan Liu, Dianyu Yu, He Ren, Nayu Liu, Xiaomian Kang, Delai Qiu, Fa Zhang, Genpeng Zhen, Shengping Liu, Liang Jiaen, null Weihuang, Yining Wang, Junnan Zhu
| 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. |
ATP: AMRize Then Parse! Enhancing AMR Parsing with PseudoAMRs (2022.findings-naacl)
Copied to clipboard
| Challenge: | Abstract Meaning Representation (AMR) implicitly involves compound semantic annotations. |
| Approach: | They propose to use auxiliary tasks which are semantically or formally related to enhance AMR parsing. |
| Outcome: | The proposed method achieves state-of-the-art performance on benchmarks especially in topology-related scores. |
Do Large Language Models have Problem-Solving Capability under Incomplete Information Scenarios? (2024.findings-acl)
Copied to clipboard
| Challenge: | Existing games such as "Who is undercover" are subjective and difficult to evaluate . |
| Approach: | They propose a game called BrainKing that evaluates LLMs' problem-solving capability under incomplete information scenarios. |
| Outcome: | The proposed game requires LLMs to identify target entities with limited yes-or-no questions and potential misleading answers. |
KCVR: Knowledge-Centric Video Reconstruction for Structured Pedagogical Summarization via Dynamic Graph Planning (2026.acl-long)
Copied to clipboard
Jingjiang Liu, Jia Zhu, Hanghui Guo, Weijie Shi, Yue Cui, Xiaokang Jin, Yilin Wang, Qingyu Niu, Jiawei Shen, Guoqing Ma, Yidan Liang, Shimin Di, Jiajie Xu
| Challenge: | Existing summarization methods compress content for gist browsing, but they break prerequisite logic in instructional videos. |
| Approach: | They propose a framework that decouples epistemic planning from content generation. |
| Outcome: | The proposed framework outperforms strong end-to-end baselines on Knowledge Progression Consistency and Learning Objective Coverage. |
PCA-Bench: Evaluating Multimodal Large Language Models in Perception-Cognition-Action Chain (2024.findings-acl)
Copied to clipboard
Liang Chen, Yichi Zhang, Shuhuai Ren, Haozhe Zhao, Zefan Cai, Yuchi Wang, Peiyi Wang, Xiangdi Meng, Tianyu Liu, Baobao Chang
| Challenge: | a new multimodal decision-making benchmark evaluates the integrated capabilities of multimodal large language models. |
| Approach: | They propose a multimodal decision-making benchmark for evaluating MLLMs . they propose an automatic evaluation protocol to assess 10 prevalent ML models . |
| Outcome: | The proposed benchmark improves performance of multimodal large language models in three scenarios . the model is required to integrate multiple capabilities to make accurate decisions . |
Revisiting Parameter-Efficient Tuning: Are We Really There Yet? (2022.emnlp-main)
Copied to clipboard
| Challenge: | Pretrained language models (PLMs) are used as backbones to be combined with additional parameters and finetuned on downstream tasks in an end-to-end manner. |
| Approach: | They propose to use a fraction of parameters to tune pretrained language models (PLMs) this is the first comprehensive investigation into the training and evaluation of PETuning methods. |
| Outcome: | The proposed methods have been validated and tested with a rigorous evaluation protocol and have shown that they are unstable and inconsistent. |
3AM: An Ambiguity-Aware Multi-Modal Machine Translation Dataset (2024.lrec-main)
Copied to clipboard
Xinyu Ma, Xuebo Liu, Derek F. Wong, Jun Rao, Bei Li, Liang Ding, Lidia S. Chao, Dacheng Tao, Min Zhang
| Challenge: | Existing studies have shown that visual information in existing MMT datasets is insufficient, causing models to disregard it and overestimate their capabilities. |
| Approach: | They propose to use 3AM to create an ambiguity-aware multimodal machine translation dataset. |
| Outcome: | The proposed dataset includes more ambiguity and a greater variety of captions and images than other MMT datasets. |
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. |
Uncertainty Quantification for In-Context Learning of Large Language Models (2024.naacl-long)
Copied to clipboard
Chen Ling, Xujiang Zhao, Xuchao Zhang, Wei Cheng, Yanchi Liu, Yiyou Sun, Mika Oishi, Takao Osaki, Katsushi Matsuda, Jie Ji, Guangji Bai, Liang Zhao, Haifeng Chen
| Challenge: | Existing studies on in-context learning have focused on quantifying the uncertainty associated with the model's response, but they neglect the complexity of the LLM and the uniqueness of in-constitut learning. |
| Approach: | They propose a method to quantify the uncertainty associated with in-context learning and propose corresponding estimation method to quantify both types of uncertainties. |
| Outcome: | The proposed method offers an unsupervised way to understand the prediction of in-context learning in a plug-and-play fashion. |
ReasMark: A Robust Watermark for Attributing LLM Reasoning Under Knowledge Distillation Attacks (2026.acl-long)
Copied to clipboard
Peizhuo Lv, Ruihua Zhou, Yunpeng Li, Ruigang Liang, Xingshuo Han, XiaoFeng Wang, Wei Dong, Yuling Liu
| Challenge: | Existing reasoning-enhanced large language models fail to provide reliable attribution of reasoning behavior once it is transferred through knowledge distillation. |
| Approach: | They propose to embed a reasoning-length gap in a model by querying a target domain and training a local student to imitate its outputs. |
| Outcome: | et al. show that ReasMark outperforms baselines while preserving task utility. |
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. |
On-the-Fly VLA Adaptation via Test-Time Reinforcement Learning (2026.acl-long)
Copied to clipboard
Changyu Liu, Yiyang Liu, Taowen Wang, Qiao Zhuang, James Chenhao Liang, Wenhao Yang, Renjing Xu, Qifan Wang, Dongfang Liu, Cheng Han
| Challenge: | Existing vision-language-action models are unsuitable for simulated or physical-world deployments . current methods fail when confronted with inherent real-world dynamic variability. |
| Approach: | They propose a test-time reinforcement learning framework that enables on-the-fly policy adaptation during inference. |
| Outcome: | Empirical results show that the proposed framework improves adaptability, stability and task success in dynamic, previously unseen scenarios. |
Adaptive Schema-aware Event Extraction with Retrieval-Augmented Generation (2025.findings-emnlp)
Copied to clipboard
| Challenge: | Event extraction is a task in natural language processing that involves identifying and extracting event information from unstructured text. |
| Approach: | They propose a paradigm that combines schema paraphrasing with schema retrieval-augmented generation. |
| Outcome: | The proposed paradigm retrieves paraphrased schemas and accurately generates targeted structures. |
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%. |
H-MAS: Hierarchical Multi-Agent Scheduling for Multi-Tenant LLM Serving (2026.findings-acl)
Copied to clipboard
Yuhan Liu, Cong Xu, Qi Jia, Yihua Wang, Feiyu Chen, Liang Jin, Lu Liu, Yaqian Zhao, Yuting Ding, Xiang Li
| Challenge: | Multi-tenant Model-as-a-Service (MaaS) workloads exhibit non-stationarity across multiple time scales . existing request schedulers often rely on a fixed policy that remains unchanged at runtime . |
| Approach: | They propose a hierarchical multi-agent scheduler that operates in a layered closed loop . they propose to maintain 1.2–3.0 higher Goodput than SGLang and vLLM . |
| Outcome: | Experiments show that H-MAS achieves 1.2–3.0 higher Goodput than SGLang and vLLM . it maintains more stable QoS under diverse request lengths and heterogeneous SLO targets . |
The Evolution of Thought: Tracking LLM Overthinking via Reasoning Dynamics Analysis (2026.acl-long)
Copied to clipboard
Zihao Wei, Liang Pang, Jiahao Liu, Wenjie Shi, Jingcheng Deng, Shicheng Xu, Zenghao Duan, Jingang Wang, Fei Sun, Huawei Shen, Xueqi Cheng
| Challenge: | Explicit reasoning trajectories increase performance but often trigger overthinking . despite its importance, this study examines how each step of reasoning affects the final outcome . |
| Approach: | They propose a Reasoning Completion Point Detector that detects the RCP by monitoring rank dynamics of termination tokens. |
| Outcome: | The proposed method reduces token usage by up to 44% while preserving accuracy. |
A Data-Centric Framework for Composable NLP Workflows (2020.emnlp-demos)
Copied to clipboard
Zhengzhong Liu, Guanxiong Ding, Avinash Bukkittu, Mansi Gupta, Pengzhi Gao, Atif Ahmed, Shikun Zhang, Xin Gao, Swapnil Singhavi, Linwei Li, Wei Wei, Zecong Hu, Haoran Shi, Xiaodan Liang, Teruko Mitamura, Eric Xing, Zhiting Hu
| Challenge: | Empirical natural language processing (NLP) systems involve interoperation among multiple components . a wealth of NLP toolkits exist ( 4), such as spaCy, DKPro, CoreNLP. |
| Approach: | They propose a unified open-source framework that supports fast development of NLP workflows . framework includes processors for NLP tasks, visualization, and annotation . |
| Outcome: | The framework offers processors for NLP tasks, visualization, and annotation, and is extensible . it is delivered through two modularized yet integratable open-source projects, Forte and Stave . |
Speeding Up Neural Machine Translation Decoding by Cube Pruning (D18-1)
Copied to clipboard
| Challenge: | Neural machine translation suffers from slow translation speed due to the large search space . a trade-off has to be made between translation quality and speed, argues a new study . |
| Approach: | They apply cube pruning technique to speed up dynamic programming into neural machine translation to speed it up. |
| Outcome: | The proposed method can translate faster on GPUs and CPUs with better translation quality than naive beam search. |
Interpreting Positional Information in Perspective of Word Order (2023.acl-long)
Copied to clipboard
| Challenge: | Attention mechanism is a powerful and effective method utilized in natural language processing, but it is insensitive to positional information. |
| Approach: | They propose a weight concatenation operation to evaluate its efficacy in machine translation tasks. |
| Outcome: | The proposed operation can encode positional information and confirms our hypothesis. |
Skip-Thinking: Chunk-wise Chain-of-Thought Distillation Enable Smaller Language Models to Reason Better and Faster (2025.emnlp-main)
Copied to clipboard
| Challenge: | Existing methods train small language models to learn long rationales in one iteration. |
| Approach: | They propose a method that uses a heuristic search to divide rationale into internal chunks . they propose CWT, which uses CWt to focus SLM on learning from only one chunk per iteration. |
| Outcome: | The proposed method can guide a large language model (LLM) in reasoning tasks. |
ELBA-Bench: An Efficient Learning Backdoor Attacks Benchmark for Large Language Models (2025.acl-long)
Copied to clipboard
| Challenge: | Existing backdoor models are limited in coverage of attack, system integrity and backdoor alignment . ELBA-Bench provides over 1300 experiments encompassing 12 attack methods, 18 datasets, and 12 LLMs. |
| Approach: | They propose a framework that allows attackers to inject backdoor through parameter efficient fine-tuning or without fine-uning techniques. |
| Outcome: | ELBA-Bench provides over 1300 experiments encompassing 12 attack methods, 18 datasets, and 12 LLMs. |
Stealthy Attack on Large Language Model based Recommendation (2024.acl-long)
Copied to clipboard
| Challenge: | Recent advances in recommender systems have been overlooked due to their emphasis on textual content. |
| Approach: | They propose to introduce large language models into recommendation models to exploit the semantic understanding and strong transferability of LLMs. |
| Outcome: | The proposed approach significantly boosts an item’s exposure by altering its textual content during the testing phase, without requiring direct interference with the model’s training process. |
Knowing-how & Knowing-that: A New Task for Machine Comprehension of User Manuals (2023.findings-acl)
Copied to clipboard
| Challenge: | Existing methods for machine reading comprehension of user manuals have trouble answering complex questions. |
| Approach: | They propose a knowing-how & knowing-that task that requires the model to answer factoid-style, procedure-style and inconsistent questions about user manuals. |
| Outcome: | The proposed model can answer factoid-style, procedure-style and inconsistent questions about user manuals. |
Towards Effective Automatic Debt Collection with Persona Awareness (2023.emnlp-industry)
Copied to clipboard
| Challenge: | Existing debt collection agents fail to tailor strategies to debtor personas, leading to ineffective collection. |
| Approach: | They present a commercial practice on debt collection agents that organizes debtor personas into a taxonomy and constructs a persona-aware conversation dataset. |
| Outcome: | The proposed agent increases recovery rate by 3.31% and collects additional 100K RMB after two months of testing. |
LTRS: Improving Word Sense Disambiguation via Learning to Rank Senses (2025.coling-main)
Copied to clipboard
| Challenge: | Conventional training strategies only consider predefined senses for target words and learn each of them from relatively limited instances, neglecting the influence of similar ones. |
| Approach: | They propose a method to rank senses to improve the task of word Sense Disambiguation (WSD) by ranking an expanded list of sense definitions. |
| Outcome: | The proposed method achieves a SOTA F1 score of 79.6% in Chinese WSD and shows faster convergence than previous methods. |
MMRA: A Benchmark for Evaluating Multi-Granularity and Multi-Image Relational Association Capabilities in Large Visual Language Models (2026.findings-eacl)
Copied to clipboard
Siwei Wu, King Zhu, Yu Bai, Yiming Liang, Yizhi Li, Haoning Wu, Jiaheng Liu, Ruibo Liu, Xingwei Qu, Xuxin Cheng, Ge Zhang, Wenhao Huang, Chenghua Lin
| 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. |
REACT: Representation Extraction And Controllable Tuning to Overcome Overfitting in LLM Knowledge Editing (2025.emnlp-main)
Copied to clipboard
Haitian Zhong, Yuhuan Liu, Ziyang Xu, Guofan Liu, Qiang Liu, Shu Wu, Zhe Zhao, Liang Wang, Tieniu Tan
| Challenge: | Large language model editing methods suffer from overfitting, where factual updates can propagate beyond their intended scope, overemphasizing the edited target even when it’s contextually inappropriate. |
| Approach: | They propose a framework for precise and controllable knowledge editing that utilizes two-phase representations and a linear transformation to compute a directional "belief shift" vector. |
| Outcome: | The proposed framework significantly reduces overfitting across nearly all evaluation metrics and on COUNTERFACT and MQuAKE. |
Multimodal Language Analysis with Recurrent Multistage Fusion (D18-1)
Copied to clipboard
| Challenge: | Comprehending multimodal language requires modeling interactions between modalities and between them. |
| Approach: | They propose a multistage fusion network which decomposes the fusion problem into multiple stages, each focused on a subset of multimodal signals for specialized, effective fusion. |
| Outcome: | The proposed model performs state-of-the-art across three datasets relating to multimodal sentiment analysis, emotion recognition, and speaker traits recognition. |
Croppable Knowledge Graph Embedding (2025.acl-long)
Copied to clipboard
| Challenge: | Knowledge Graph Embedding (KGE) is a common approach for Knowledge Grasse (KGs) in AI tasks. |
| Approach: | They propose a new KGE training framework MED that allows one training to obtain a croppable KGE model for multiple scenarios with different dimensional needs. |
| Outcome: | The proposed framework improves low-dimensional sub-models and makes high-dimensional models retain the low-dimension sub-modells’ capacity. |
Take Its Essence, Discard Its Dross! Debiasing for Toxic Language Detection via Counterfactual Causal Effect (2024.lrec-main)
Copied to clipboard
| Challenge: | Existing methods to mitigate lexical bias in toxic language detection (TLD) do not exploit the “useful” and “misleading” impact of the bias. |
| Approach: | They propose a counterfactual Causal Debiasing Framework to mitigate lexical bias in toxic language detection (TLD) it preserves the “useful impact” of lexical bias and eliminates the "misleading impact" they propose to use the same framework to analyze the causal effect of a sentence and bias tokens . |
| Outcome: | The proposed framework preserves the “useful impact” of lexical bias and eliminates the ‘misleading impact’ Empirical evaluations show that the proposed model outperforms current debiased models for out-of-distribution data. |
Learning from Imperfect Data: Towards Efficient Knowledge Distillation of Autoregressive Language Models for Text-to-SQL (2024.findings-emnlp)
Copied to clipboard
| Challenge: | Existing text-to-SQL LLMs are computationally expensive and difficult to deploy in real-world applications. |
| Approach: | They propose to distill a larger teacher model into a smaller student model by using imperfect data to improve the KD. |
| Outcome: | The proposed method achieves the best tradeoff between performance and efficiency on 5 text-to-SQL benchmarks. |
Runaway is Ashamed, But Helpful: On the Early-Exit Behavior of Large Language Model-based Agents in Embodied Environments (2025.findings-emnlp)
Copied to clipboard
| Challenge: | Experiments with 4 different LLMs across 5 embodied environments show significant efficiency improvements, with only minor drops in agent performance. |
| Approach: | They propose an intrinsic method that injects exit instructions during generation and an extransic system that verifies task completion to determine when to halt an agent’s trial. |
| Outcome: | The proposed method injects exit instructions during generation and an exit method verifies task completion to determine when to halt an agent’s trial. |
Evaluating Verifiability in Generative Search Engines (2023.findings-emnlp)
Copied to clipboard
| Challenge: | Existing generative search engines are rapidly gaining users, according to a new study . existing systems are poorly cited and lack reliability, a study finds . |
| Approach: | They conduct human evaluations of four popular generative search engines . they find that existing generative engines are fluent and appear informative . |
| Outcome: | The results show that existing generative search engines are not reliable and often contain unsupported statements and inaccurate citations. |
Chain of Methodologies: Scaling Test Time Computation without Training (2025.findings-acl)
Copied to clipboard
| Challenge: | Existing prompts for complex reasoning tasks are limited to specific tasks with few-shot examples due to constraints like context length and information extraction accuracy. |
| Approach: | They propose a method to build structured reasoning processes by injecting human insights into LLMs' training data. |
| Outcome: | The proposed framework outperforms baselines in the analysis of large language models. |
CARE: A Clue-guided Assistant for CSRs to Read User Manuals (2024.acl-long)
Copied to clipboard
| Challenge: | Current solutions don't fit the online custom service scenarios well due to the lack of attention to user questions and possible responses. |
| Approach: | They propose to build a clue-guided assistant for customer service representations (CSRs) that can provide accurate responses and explicitly show explainable paths about how to arrive at these responses. |
| Outcome: | The proposed assistant can reduce CSRs' reading burden and keep high service quality, in particular with >35% decrease in time spent and keeping a >0.75 ICC score. |
Document Modeling with Graph Attention Networks for Multi-grained Machine Reading Comprehension (2020.acl-main)
Copied to clipboard
| Challenge: | Existing approaches to machine reading comprehension treat documents at their hierarchical nature, ignoring their dependencies. |
| Approach: | They propose a machine reading comprehension benchmark with two-grained answers . they use graph attention networks to model documents at their hierarchical nature . |
| Outcome: | The proposed framework outperforms existing systems at long and short answer criteria. |
Generative Entity Typing with Curriculum Learning (2022.emnlp-main)
Copied to clipboard
| Challenge: | Entity typing fails to assign an entity to the types beyond the predefined type set. |
| Approach: | They propose a generative entity typing paradigm that assigns types to entities . traditional classification-based approaches fail to assign entities to the types beyond the predefined set . they employ curriculum learning to train the model on heterogeneous data . |
| Outcome: | The proposed model outperforms the state-of-the-art model on heterogeneous training data. |
Quantification of Large Language Model Distillation (2025.acl-long)
Copied to clipboard
Sunbowen Lee, Junting Zhou, Chang Ao, Kaige Li, Xeron Du, Sirui He, Haihong Wu, Tianci Liu, Jiaheng Liu, Hamid Alinejad-Rokny, Min Yang, Yitao Liang, Zhoufutu Wen, Shiwen Ni
| Challenge: | Existing studies have revealed the robustness degra-dation caused by data distillation. |
| Approach: | They propose a framework to evaluate and quantify model distillation . they aim to identify identity cognition contradictions and analyse multi-granularity response similarities across models to measure the extent of homogenization. |
| Outcome: | The proposed framework addresses two key aspects: (1) Identifying identity cognition contradictions to assess discrepancies in how models perceive and represent identity-related information; (2) Analyzing multi-granularity response similarities across models to measure the extent of homogenization. |
Denoising based Sequence-to-Sequence Pre-training for Text Generation (D19-1)
Copied to clipboard
| Challenge: | PoDA pre-trains encoders and decoders by denoising noise-corrupted text . Unlike encoder-only or decode-only methods, it can be used for text generation tasks without using any task-specific techniques. |
| Approach: | They propose a sequence-to-sequence (seq2sequ) pre-training method PoDA which denoises autoencoders by denoising noise-corrupted text. |
| Outcome: | The proposed method improves model performance over strong baselines without using any task-specific techniques and significantly speed up convergence. |
Efficiently Editing Mixture-of-Experts Models with Compressed Experts (2025.findings-emnlp)
Copied to clipboard
| Challenge: | Mixture-of-Experts models allow for efficient scaling of large language models . fewer experts reduce computational costs, while more experts improve performance . |
| Approach: | They propose to activate only a subset of experts during training and inference . they propose compressed experts that preserve the most important experts . |
| Outcome: | The proposed approach preserves the most important experts while replacing other auxiliary activated experts with compressed experts. |
MatchPrompt: Prompt-based Open Relation Extraction with Semantic Consistency Guided Clustering (2022.emnlp-main)
Copied to clipboard
| Challenge: | Existing methods for open relation extraction (OpenRE) focus on labeled and pre-defined instances, which are costly to acquire in reality. |
| Approach: | They propose a framework that can extract relations without pre-defined types from open-domain corpus with efficient knowledge transfer from a few pre-determined relational instances. |
| Outcome: | The proposed framework achieves the new SOTA results for OpenRE on different datasets. |
From Completion to Editing: Unlocking Context-Aware Code Infilling via Search-and-Replace Instruction Tuning (2026.acl-long)
Copied to clipboard
Jiajun Zhang, Zeyu Cui, Jiaxi Yang, Lei Zhang, Yuheng Jing, Zeyao Ma, Tianyi Bai, Zilei Wang, Qiang Liu, Liang Wang, Binyuan Hui, Junyang Lin
| Challenge: | Fill-in-the-Middle (FIM) models suffer from performance degradation and prohibitive latency. |
| Approach: | They propose a search-and-replace infilling framework that integrates agentic verification and editing into a single-pass inference process. |
| Outcome: | The proposed framework harmonizes completion tasks with the instruction-following priors of Chat LLMs, extending the paradigm from static infilling to dynamic context-aware editing. |
DynamicKV: Task-Aware Adaptive KV Cache Compression for Long Context LLMs (2025.findings-emnlp)
Copied to clipboard
| Challenge: | Existing KV cache compression methods enforce a fixed pattern, neglecting task-specific characteristics, which hampers the effective retention of essential information while discarding less important tokens. |
| Approach: | They propose a Task-Aware KV cache mechanism that dynamically adjusts the KV caching size across different layers based on the characteristics of the tasks. |
| Outcome: | The proposed method surpasses state-of-the-art methods by 11% on the LongBench dataset even under extreme compression (0.9%) |
Self-supervised Product Title Rewrite for Product Listing Ads (2022.naacl-industry)
Copied to clipboard
| Challenge: | Existing work has investigated the title optimization for Product Listing Ads (PLAs) however, little work has examined the effectiveness of this method. |
| Approach: | They propose a method to rewrite product listing ads titles without considering the fluency and information priority. |
| Outcome: | The proposed solution reduces the cost and improves CTR in the offline test and real-world online test by a large amount. |
An Empirical Study of LLM Reasoning Ability Under Strict Output Length Constraint (2025.emnlp-main)
Copied to clipboard
Yi Sun, Han Wang, Jiaqiang Li, Jiacheng Liu, Xiangyu Li, Hao Wen, Yizhen Yuan, Huiwen Zheng, Yan Liang, Yuanchun Li, Yunxin Liu
| Challenge: | Large Language Models (LLMs) are a powerful tool for test-time scaling, but they are often used under time constraints. |
| Approach: | They propose to use LLMs to make models think before answering questions . they also use self-correction and best-of-N decoding to encourage deeper thinking . |
| Outcome: | The proposed models are able to achieve higher inference accuracy with extra inference computation under time constraints. |
ABSEval: An Agent-based Framework for Script Evaluation (2024.emnlp-main)
Copied to clipboard
| Challenge: | Existing studies on script evaluation of large language models (LLMs) have not evaluated scripts generated by LLMs due to their logical structure, sequential organization, and open-ended nature. |
| Approach: | They propose to use a script evaluation dataset to evaluate LLM scripts . they propose to develop an agent-based script evaluation framework ABSEval to evaluate scripts. |
| Outcome: | The proposed framework provides superior accuracy and relevance, aligning closely with human evaluation. |
COIG-CQIA: Quality is All You Need for Chinese Instruction Fine-tuning (2025.findings-naacl)
Copied to clipboard
Yuelin Bai, Xeron Du, Yiming Liang, Leo Jin, Junting Zhou, Ziqiang Liu, Feiteng Fang, Mingshan Chang, Tianyu Zheng, Xincheng Zhang, Nuo Ma, Zekun Moore Wang, Ruibin Yuan, Haihong Wu, Hongquan Lin, Wenhao Huang, Jiajun Zhang, Chenghua Lin, Jie Fu, Min Yang, Shiwen Ni, Ge Zhang
| Challenge: | Existing datasets for Chinese instruction tuning are not well-aligned with Chinese users’ interaction patterns. |
| Approach: | They propose to use Chinese instruction tuning datasets to improve instruction fine-tuning for Chinese users. |
| Outcome: | The proposed dataset shows that Chinese models achieve competitive performance in diverse benchmarks. |
FinEval: A Chinese Financial Domain Knowledge Evaluation Benchmark for Large Language Models (2025.naacl-long)
Copied to clipboard
Xin Guo, Haotian Xia, Zhaowei Liu, Hanyang Cao, Zhi Yang, Zhiqiang Liu, Sizhe Wang, Jinyi Niu, Chuqi Wang, Yanhui Wang, Xiaolong Liang, Xiaoming Huang, Bing Zhu, Zhongyu Wei, Yun Chen, Weining Shen, Liwen Zhang
| Challenge: | Large language models have demonstrated outstanding performance in various natural language processing tasks, but their security capabilities in the financial domain have not been explored. |
| Approach: | They propose to use a benchmark to evaluate large language models' financial domain knowledge and practical abilities. |
| Outcome: | The proposed benchmark evaluates large language models' financial domain knowledge and practical abilities. |
Advancing Large Language Model Attribution through Self-Improving (2024.emnlp-main)
Copied to clipboard
Lei Huang, Xiaocheng Feng, Weitao Ma, Liang Zhao, Yuchun Fan, Weihong Zhong, Dongliang Xu, Qing Yang, Hongtao Liu, Bing Qin
| Challenge: | Teaching large language models to generate text with citations to evidence sources requires high-quality attribution data, which is costly and labor-intensive. |
| Approach: | They propose a framework for iteratively improving the attribution capability of large language models (LLMs) by attributing output to verifiable sources. |
| Outcome: | Experiments on three open-domain question-answering datasets show that START improves in aggregating information across multiple sources. |
Supervised neural machine translation based on data augmentation and improved training & inference process (D19-52)
Copied to clipboard
| Challenge: | This paper describes the neural machine translation systems for the shared translation tasks of WAT 2019 . |
| Approach: | They propose a model for translation tasks of WAT 2019 that employs a Transformer model as the baseline and a deep layer model to improve translation quality. |
| Outcome: | The proposed methods can improve translation quality over traditional statistical machine translation (SMT) The proposed models can improve the translation quality of Japanese-English and Japanese-Chinese corpus. |
Self-Evolution Learning for Discriminative Language Model Pretraining (2023.findings-acl)
Copied to clipboard
| Challenge: | Random masking does not consider the importance of the different words in the sentence meaning, e.g., entity-level masking requires expensive prior knowledge and generally does not use existing model weights. |
| Approach: | They propose a token masking and learning method that uses a random masking strategy to learn the under-explored tokens. |
| Outcome: | The proposed method improves linguistic knowledge learning and generalization on 10 tasks. |
STAPO: Selective Trajectory-Aware Policy Optimization for LLM Agent Training (2026.acl-long)
Copied to clipboard
Qiuyi Qi, Tian Liang, Mutian Bao, Jinjian Zhang, Dongnan Liu, Wei Zhou, Linjian Mo, Ming Kong, Jie Liu, Feng Zhang, Qiang Zhu
| Challenge: | Prior work has explored step-level supervision using Shannon-entropy-based uncertainty signals, which conflate inherent state complexity with agent confidence. |
| Approach: | They propose a hierarchical group-based RL framework that leverages normalized entropy to locate outlier steps associated with trajectory neglect and optimizes them via a mechanism of trajectory-aware reward and trajectory-independent penalty. |
| Outcome: | Experiments on ALFWorld, WebShop, and Search-Augmented QA show that STAPO achieves state-of-the-art performance while substantially alleviating trajectory neglect. |
MoCa: Modality-aware Continual Pre-training Makes Better Bidirectional Multimodal Embeddings (2026.acl-long)
Copied to clipboard
| Challenge: | Existing approaches to embed multimodal models face limitations such as suboptimal causal attention in VLMs and limited diversity in training objectives and data. |
| Approach: | They propose a framework for transforming pre-trained VLMs into bidirectional multimodal embedding models. |
| Outcome: | The proposed model improves performance across MMEB and ViDoRe-v2 benchmarks and exhibits strong scalability with both model size and training data on MMEF. |
MA-DPR: Manifold-aware Distance Metrics for Dense Passage Retrieval (2025.emnlp-main)
Copied to clipboard
| Challenge: | Empirical evidence suggests that manifold-aware distance allows DPR to leverage context from related neighboring passages. |
| Approach: | They propose a "manifold-aware" distance metric that measures query–passage distance . they propose to model the intrinsic manifold structure of passages using a nearest-neighbor graph . |
| Outcome: | Empirical evidence suggests MA-DPR outperforms Euclidean and cosine distances on OOD . it can be applied to a wide range of dense embedding and retrieval tasks . |
Improving Sharpness-Aware Minimization with Fisher Mask for Better Generalization on Language Models (2022.findings-emnlp)
Copied to clipboard
| Challenge: | Existing methods for fine-tuning pretrained language models suffer from poor generalization . however, they add a perturbation to each model parameter equally, which is sub-optimal . |
| Approach: | They propose a sharpness-aware minimization optimization procedure that introduces a Fisher mask to improve the efficiency of SAM. |
| Outcome: | The proposed method outperforms the vanilla sharpness-aware minimization method on GLUE and SuperGLUE benchmarks. |
Investigating and Enhancing the Robustness of Large Multimodal Models Against Temporal Inconsistency (2025.acl-long)
Copied to clipboard
Jiafeng Liang, Shixin Jiang, Xuan Dong, Ning Wang, Zheng Chu, Hui Su, Jinlan Fu, Ming Liu, See-Kiong Ng, Bing Qin
| Challenge: | Large Multimodal Models (LMMs) have demonstrated impressive performance on general video comprehension benchmarks, but their robustness needs to be thoroughly investigated for broader applications. |
| Approach: | They propose a temporal robustness benchmark which introduces temporal inconsistency perturbations separately at the visual and textual modalities to assess the robustness of models. |
| Outcome: | The proposed method improves the model’s robustness and reliability in temporal analysis. |
CodeV: Issue Resolving with Visual Data (2025.findings-acl)
Copied to clipboard
Linhao Zhang, Daoguang Zan, Quanshun Yang, Zhirong Huang, Dong Chen, Bo Shen, Tianyu Liu, Yongshun Gong, Huang Pengjie, Xudong Lu, Guangtai Liang, Lizhen Cui, Qianxiang Wang
| Challenge: | Large Language Models (LLMs) have expanded to more complex repository-level tasks. |
| Approach: | They propose a first approach to leveraging visual data to enhance the issue-resolving capabilities of Large Language Models (LLMs) they demonstrate the effectiveness of CodeV and provide valuable insights into leveraging visualization to resolve GitHub issues. |
| Outcome: | The proposed approach improves the issue-resolving capabilities of Large Language Models (LLMs) by using visual data. |
How Sememic Components Can Benefit Link Prediction for Lexico-Semantic Knowledge Graphs? (2025.emnlp-main)
Copied to clipboard
| Challenge: | Existing methods to predict missing triples in Knowledge Graphs are limited by semantic information. |
| Approach: | They propose a method to leverage sememe knowledge to enhance LP . LP is a technique that integrates structural and textual information into a Knowledge Graph . |
| Outcome: | The proposed method improves LP performance in English and Chinese . it improves on WN18RR, HN7 and CWN5, respectively . |
Competition-Level Problems are Effective LLM Evaluators (2024.findings-acl)
Copied to clipboard
Yiming Huang, Zhenghao Lin, Xiao Liu, Yeyun Gong, Shuai Lu, Fangyu Lei, Yaobo Liang, Yelong Shen, Chen Lin, Nan Duan, Weizhu Chen
| Challenge: | Large language models (LLMs) have demonstrated impressive reasoning capabilities, yet there is ongoing debate about their capabilities and the potential data contamination problem. |
| Approach: | They propose to evaluate the reasoning capabilities of large language models in solving recent competition-level programming problems in Codeforces. |
| Outcome: | The proposed model has experienced a cliff-like decline in problems after September 2021, which shows the potential data contamination and the challenges for any existing LLM to solve unseen complex reasoning problems. |
Towards Making the Most of ChatGPT for Machine Translation (2023.findings-emnlp)
Copied to clipboard
| Challenge: | Prior studies have shown that ChatGPT achieves comparable results to commercial systems for high-resource languages, but lags behind in complex tasks, e.g., low-resourced and distant-language-pairs translation. |
| Approach: | They propose task-specific prompts and domain-specific prompts which are based on task information and domain information and a task-specific prompt. |
| Outcome: | The proposed prompts improve the performance of ChatGPT in complex tasks and generate hallucinations for non-English-centric tasks. |
Incremental Text-to-Speech Synthesis with Prefix-to-Prefix Framework (2020.findings-emnlp)
Copied to clipboard
Mingbo Ma, Baigong Zheng, Kaibo Liu, Renjie Zheng, Hairong Liu, Kainan Peng, Kenneth Church, Liang Huang
| Challenge: | Text-to-speech synthesis (TTS) has seen rapid progress in recent years, but still suffers from latencies. |
| Approach: | They propose a neural incremental TTS approach that synthesizes speech in an online fashion, playing a segment of audio while generating the next. |
| Outcome: | Experiments on English and Chinese TTS show that the proposed approach achieves similar speech naturalness compared to full sentence TTS, but with a constant (1-2 words) latency. |
TED-TTS: Training-Free Intra-Utterance Emotion and Duration Control for Text-to-Speech Synthesis (2026.acl-long)
Copied to clipboard
| Challenge: | Existing controllable Text-to-Speech methods limited to inter-utterance-level control . utterance expressiveness remains a challenge in building human-like TTS synthesis systems . |
| Approach: | They propose a training-free controllable framework for pretrained zero-shot TTS to enable intra-utterance emotion and duration expression. |
| Outcome: | The proposed framework achieves state-of-the-art intra-utterance consistency while maintaining baseline-level speech quality. |
Divide-Then-Align: Honest Alignment based on the Knowledge Boundary of RAG (2025.acl-long)
Copied to clipboard
Xin Sun, Jianan Xie, Zhongqi Chen, Qiang Liu, Shu Wu, Yuehe Chen, Bowen Song, Zilei Wang, Weiqiang Wang, Liang Wang
| Challenge: | Large language models (LLMs) augmented with retrieval systems have significantly advanced natural language processing tasks by integrating external knowledge sources. |
| Approach: | They propose a method that conditions large language models to generate answers even in the absence of reliable knowledge. |
| Outcome: | The proposed approach balances accuracy with appropriate abstention, enhancing the reliability and trustworthiness of retrieval-augmented systems. |
Attend, Select and Eliminate: Accelerating Multi-turn Response Selection with Dual-attention-based Content Elimination (2023.findings-acl)
Copied to clipboard
| Challenge: | Pre-trained language models can be used to perform multi-turn response selection, but they can be expensive. |
| Approach: | They propose a framework and a strategy that progressively selects and eliminates unimportant content under context-response dual-attention. |
| Outcome: | The proposed method can effectively speed-up SOTA models without much performance degradation and shows a better trade-off between speed and performance than previous methods. |
Any Information Is Just Worth One Single Screenshot: Unifying Search With Visualized Information Retrieval (2025.acl-long)
Copied to clipboard
| Challenge: | Existing multimodal retrieval models are lacking in visual representations of multimodal data. |
| Approach: | They propose a visualized information retrieval paradigm where multimodal information is represented by a unified visual format called Screenshots for various retrieval applications. |
| Outcome: | The proposed model is based on a large dataset of screenshots from diverse sources . it is compared with existing models and lays a solid foundation for the new model . |
Data to Defense: The Role of Curation in Aligning Large Language Models Against Safety Compromise (2025.emnlp-main)
Copied to clipboard
| Challenge: | Recent studies have identified a vulnerability in large language models (LLMs) during customization. |
| Approach: | They propose an adaptive data curation approach that allows any text to be curated to enhance its effectiveness in counteracting harmful samples during customization. |
| Outcome: | The proposed approach reduces compromising effects and generates 100% safe responses. |
Concise and Organized Perception Facilitates Reasoning in Large Language Models (2025.findings-naacl)
Copied to clipboard
| Challenge: | Extensive experimental results on several popular logical benchmarks (ProofWriter, PrOntoQA, PrONtoQA-OOD, and FOLIO) and mathematical benchmark (DI-GSM) show that COP significantly outperforms previous state-of-the-art methods. |
| Approach: | They propose a reasoning approach called Concise and Organized Perception (COP) that carefully analyzes the given statements to identify the most pertinent information while eliminating redundancy efficiently. |
| Outcome: | The proposed approach outperforms state-of-the-art methods on several popular logical benchmarks and mathematical benchmarks. |
VenusFactory: An Integrated System for Protein Engineering with Data Retrieval and Language Model Fine-Tuning (2025.acl-demo)
Copied to clipboard
Yang Tan, Chen Liu, Jingyuan Gao, Wu Banghao, Mingchen Li, Ruilin Wang, Lingrong Zhang, Huiqun Yu, Guisheng Fan, Liang Hong, Bingxin Zhou
| 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. |
MMEvalPro: Calibrating Multimodal Benchmarks Towards Trustworthy and Efficient Evaluation (2025.naacl-long)
Copied to clipboard
Jinsheng Huang, Liang Chen, Taian Guo, Fu Zeng, Yusheng Zhao, Bohan Wu, Ye Yuan, Haozhe Zhao, Zhihui Guo, Yichi Zhang, Jingyang Yuan, Wei Ju, Luchen Liu, Tianyu Liu, Baobao Chang, Ming Zhang
| Challenge: | Large Multimodal Models (LMMs) exhibit impressive cross-modal understanding and reasoning abilities, but many benchmarks suffer from systematic biases. |
| Approach: | They propose a benchmark to avoid Type-I errors by creating one perception question and one knowledge anchor question through a meticulous annotation process. |
| Outcome: | The proposed benchmark avoids Type-I errors while maintaining reliability of MCQ evaluations. |
SELP: A Semantically-Driven Approach for Separated and Accurate Class Prototypes in Few-Shot Text Classification (2024.findings-acl)
Copied to clipboard
| Challenge: | Existing methods for few-shot text classification focus on enhancing separation of prototypes without taking semantic relationships into account. |
| Approach: | They propose to utilize semantically enhanced labels to calibrate class Prototypes . they propose a center loss method to enhance intra-class compactness . |
| Outcome: | The proposed method outperforms baseline methods on eight few-shot text classification datasets. |
Towards User-Driven Neural Machine Translation (2021.acl-long)
Copied to clipboard
| Challenge: | a good translation should implicitly mirror user traits rather than translate the original content semantically. |
| Approach: | They propose a framework that captures user traits from historical inputs . they propose 'user-driven' NMT to model user behavior under a zero-shot learning fashion . |
| Outcome: | The proposed framework can capture user traits from historical inputs under zero-shot learning fashion. |
RAP: Efficient Text-Video Retrieval with Sparse-and-Correlated Adapter (2024.findings-acl)
Copied to clipboard
Meng Cao, Haoran Tang, Jinfa Huang, Peng Jin, Can Zhang, Ruyang Liu, Long Chen, Xiaodan Liang, Li Yuan, Ge Li
| Challenge: | Text-Video Retrieval (TVR) aims to align relevant video content with natural language queries. |
| Approach: | They propose to conduct efficient text-video Retrieval with a salient-and-correlated AdaPter . they propose a low-rank modulation module to refine per-image features from frozen CLIP backbone . |
| Outcome: | Experiments on four TVR datasets show that the proposed method performs better than other methods. |
Noise-Robust Semi-Supervised Learning for Distantly Supervised Relation Extraction (2023.findings-emnlp)
Copied to clipboard
| Challenge: | Distantly supervised relation extraction (DSRE) methods are not capable of extracting relation labels for individual sentences. |
| Approach: | They propose a semi-supervised learning relation extraction framework for sentence-level DSRE . they discard only the labels of the noisy samples and utilize them as unlabeled samples . |
| Outcome: | The proposed framework achieves significant performance enhancements on two real-world datasets. |
Free your mouse! Command Large Language Models to Generate Code to Format Word Documents (2024.emnlp-main)
Copied to clipboard
| Challenge: | Recent LLMs have significantly improved code generation, making it increasingly accessible to users. |
| Approach: | They propose an automatic document formatting method, Text-to-Format, driven by various prompting strategies and a high-quality dataset DocFormEval data. |
| Outcome: | The proposed method improves the efficiency and experience of users in formatting the document and improves document formatting task. |
MTGER: Multi-view Temporal Graph Enhanced Temporal Reasoning over Time-Involved Document (2023.findings-emnlp)
Copied to clipboard
| Challenge: | Existing work models time implicitly, making it difficult to handle complex relationships . a novel temporal reasoning framework explicitly models the temporal relationships among facts by multi-view temporal graphs . |
| Approach: | They propose a multi-view temporal graph-based temporal reasoning framework that explicitly models the temporal relationships among facts by multi-visit temporal charts. |
| Outcome: | The proposed framework gives more consistent answers under question perturbations. |
Multimodal Item Scoring for Natural Language Recommendation via Gaussian Process Regression with LLM Relevance Judgments (2026.findings-acl)
Copied to clipboard
Yifan Simon Liu, Qianfeng Wen, Jiazhou Liang, Mark Zhao, Justin Cui, Anton Korikov, Armin Toroghi, Junyoung Kim, Scott Sanner
| Challenge: | Existing NLRec approaches use Dense Retrieval to compute item relevance scores . DR views the request as the sole relevance label, leading to a weak proxy for query relevance. |
| Approach: | They propose to use Gaussian Process Regression to model item relevance . they propose to combine LLM with a Gauss-based kernel to model multimodal relevance judging . |
| Outcome: | The proposed approach outperforms simpler unimodal kernels and baseline methods by up to 65% on four NLRec datasets and two LLM backbones. |
Infrared-LLaVA: Enhancing Understanding of Infrared Images in Multi-Modal Large Language Models (2024.findings-emnlp)
Copied to clipboard
| Challenge: | Existing methods for infrared modeling ignore supervisory signals of infra-modality-specific attributes, which may lead to biased understanding of in-frarea images. |
| Approach: | They propose a multi-agent generation system which transfers knowledge from visible images to generate infrared image-text pairs and infra-instructional data. |
| Outcome: | The proposed system generates infrared image-text pairs and infra-response data and is able to answer common infreas tasks with the proposed model. |
Multi-Perspective Context Aggregation for Semi-supervised Cloze-style Reading Comprehension (C18-1)
Copied to clipboard
| Challenge: | Recent studies have shown that cloze-style reading comprehension is a popular task for measuring the progress of natural language understanding. |
| Approach: | They propose a multi-perspective framework which can be seen as joint training of heterogeneous experts and aggregate context information from different perspectives. |
| Outcome: | The proposed framework achieves new state-of-the-art over previous strong baselines on a recently released cloze-test dataset. |
Enhancing Agentic Textual Graph Retrieval with Synthetic Stepwise Supervision (2026.acl-long)
Copied to clipboard
Ge Chang, Jinbo Su, Jiacheng Liu, Pengfei Yang, Yuhao Shang, Huiwen Zheng, Hongli Ma, Yan Liang, Yuanchun Li, Yunxin Liu
| Challenge: | Existing methods for integrating textual graphs with LLMs are limited by symbolic inference and high annotation costs. |
| Approach: | They propose a textual graph reasoning framework that integrates textual diagrams with large language models. |
| Outcome: | The proposed approach achieves 15.6% accuracy and 17.2% in F1 score on three common datasets. |