Papers with generalization
RAVEN++: Pinpointing Fine-Grained Violations in Advertisement Videos with Active Reinforcement Reasoning (2025.emnlp-industry)
Copied to clipboard
Deyi Ji, Yuekui Yang, Liqun Liu, Peng Shu, Haiyang Wu, Shaogang Tang, Xudong Chen, Shaoping Ma, Tianrun Chen, Lanyun Zhu
| Challenge: | Recent advances in large language models have improved the detection of non-compliant content, but critical gaps persist in fine-grained understanding, explainability, and generalization. |
| Approach: | They propose a framework that combines active reinforcement learning, fine-grained violation understanding and progressive multi-stage training. |
| Outcome: | The proposed framework outperforms general-purpose LLMs and specialized models in fine-grained violation understanding, explainability, and generalization. |
RAVEN: Robust Advertisement Video Violation Temporal Grounding via Reinforcement Reasoning (2025.acl-industry)
Copied to clipboard
| Challenge: | Existing methods for detecting ads video violations lack precise temporal grounding, noisy annotations, and limited generalization. |
| Approach: | They propose a framework that integrates curriculum reinforcement learning with large language models to enhance reasoning and cognitive capabilities for violation detection. |
| Outcome: | The proposed framework achieves superior performance in violation category accuracy and temporal interval localization. |
Aligning Multilingual Word Embeddings for Cross-Modal Retrieval Task (D19-66)
Copied to clipboard
| Challenge: | Existing methods to learn multimodal multilingual embeddings for text and image retrieval tasks are limited to English. |
| Approach: | They propose a new approach to learn multimodal multilingual embeddings for matching images and captions in two languages by combing two existing objective functions and adapting alignment between existing languages. |
| Outcome: | The proposed model achieves state-of-the-art in retrieval and caption-caption tasks while adapting existing language alignments. |
GRITHopper: Decomposition-Free Multi-Hop Dense Retrieval (2026.eacl-long)
Copied to clipboard
| Challenge: | Decomposition-based multi-hop retrieval methods rely on autoregressive steps to break down complex queries, which breaks end-to-end differentiability and is computationally expensive. |
| Approach: | They propose a multi-hop dense retrieval model that integrates causal language modeling with dense retrievals. |
| Outcome: | The proposed model outperforms existing methods on in-distribution and out-of-difference benchmarks. |
Span-Selective Linear Attention Transformers for Effective and Robust Schema-Guided Dialogue State Tracking (2023.acl-long)
Copied to clipboard
| Challenge: | Existing schema-guided dialogue state tracking models do not account for schema variations and are not generalized to unseen services. |
| Approach: | They propose a new architecture which allows for rich attention among descriptions and history while keeping computation costs constrained. |
| Outcome: | The proposed model outperforms the more than 30x larger D3ST-XXL model on the SGD-X benchmark by 5.0 points. |
Modeling the Q-Diversity in a Min-max Play Game for Robust Optimization (2023.findings-acl)
Copied to clipboard
| Challenge: | Existing methods for minimizing the worst-case loss of annotated groups are lacking in practice due to expensive annotations and privacy issues. |
| Approach: | They propose a distributionally robust optimization framework that relaxes group identification into direct parameterization by using an interactive training mode. |
| Outcome: | The proposed method outperforms state-of-the-art methods on synthetic and real-world text classification tasks. |
[CASPI] Causal-aware Safe Policy Improvement for Task-oriented Dialogue (2022.acl-long)
Copied to clipboard
| Challenge: | Recent advances in off-policy reinforcement learning methods that use offline data as against a simulator have proven to be sample efficient. |
| Approach: | They propose a batch-RL framework for ToD policy learning: Causal-aware Safe Policy Improvement (CASPI) that uses a mechanism to learn fine-grained reward that captures intention behind human response and offers guarantee on dialogue policy’s performance against a baseline. |
| Outcome: | The proposed framework outperforms the current state of the art on an end-to-end dialogue task using a multiwoz2.0 dataset. |
In-BoXBART: Get Instructions into Biomedical Multi-Task Learning (2022.findings-naacl)
Copied to clipboard
| Challenge: | Experimental results show that the proposed model outperforms single-task baseline by 3% and multi-task (without instruction) baseline by 18% on an average. |
| Approach: | They propose a unified model that can learn all 32 instruction tasks of the BoX without any task-specific modules. |
| Outcome: | The proposed model outperforms single-task baseline by 3% and multi-task (without instruction) baseline by 18% on an average. |
SyGNS: A Systematic Generalization Testbed Based on Natural Language Semantics (2021.findings-acl)
Copied to clipboard
| Challenge: | Existing models have limitations to generalize to diverse semantic phenomena, and it is unclear whether they can capture compositional meanings. |
| Approach: | They propose a systematic generalization testbed based on Natural language semantics to map natural language sentences to multiple meaning representations. |
| Outcome: | The proposed model can generalize to unseen combinations of quantifiers, negations, and modifiers, but not to the others. |
A Methodology for Generative Spelling Correction via Natural Spelling Errors Emulation across Multiple Domains and Languages (2024.findings-eacl)
Copied to clipboard
Nikita Martynov, Mark Baushenko, Anastasia Kozlova, Katerina Kolomeytseva, Aleksandr Abramov, Alena Fenogenova
| Challenge: | Recent advances in large language models have shown impressive text generation and language understanding capabilities, evident in benchmarks like SuperGLUE, GEM, BigBench etc. |
| Approach: | They propose a method for generative spelling correction that can be extended to any language with minor changes. |
| Outcome: | The proposed method can be extended to any language with minor changes, and is based on a set of generative models with a single-domain and multi-domain test sets. |
Book QA: Stories of Challenges and Opportunities (D19-58)
Copied to clipboard
| Challenge: | Existing approaches to answer questions based on the full text of books are limited by their unique characteristics. |
| Approach: | They propose a system for answering questions based on the full text of books . they use a memory network to reason and predict an answer, and a novel question generator to improve generalization. |
| Outcome: | The proposed system improves on the recently published NarrativeQA corpus on Who questions . it shows that the proposed system is highly challenging and needs more research . |
AgentCPM-GUI: Building Mobile-Use Agents with Reinforcement Fine-Tuning (2025.emnlp-demos)
Copied to clipboard
Zhong Zhang, Yaxi Lu, Yikun Fu, Yupeng Huo, Shenzhi Yang, Yesai Wu, Han Si, Xin Cong, Haotian Chen, Yankai Lin, Xie Xie, Wei Zhou, Wang Xu, Zhou Su, Zhongwu Zhai, Xiaoming Liu, null Meiyudong, Jianming Xu, Hongyan Tian, Chongyi Wang, Chi Chen, Yuan Yao, Zhiyuan Liu, Maosong Sun
| Challenge: | Large language model agents have enabled GUI-based automation, but their deployment is limited by noisy data, poor generalization, and lack of support for non-English GUIs. |
| Approach: | They propose an 8B-parameter GUI agent built for robust and efficient on-device GUI interaction. |
| Outcome: | The proposed GUI agent achieves promising performance on five public benchmarks and proposed Chinese benchmark CAGUI. |
FlowDelta: Modeling Flow Information Gain in Reasoning for Conversational Machine Comprehension (D19-58)
Copied to clipboard
| Challenge: | Existing machine comprehension models focus on a single-turn setting and do not account for previous reasoning processes. |
| Approach: | They propose to explicitly model the information gain through the dialogue reasoning . they propose to apply the proposed mechanism to other machine comprehension models . |
| Outcome: | The proposed model achieves state-of-the-art performance in a conversational QA dataset QuAC and a sequential instruction understanding dataset SCONE. |
Facebook AI’s WAT19 Myanmar-English Translation Task Submission (D19-52)
Copied to clipboard
Peng-Jen Chen, Jiajun Shen, Matthew Le, Vishrav Chaudhary, Ahmed El-Kishky, Guillaume Wenzek, Myle Ott, Marc’Aurelio Ranzato
| Challenge: | Using back-translation, we can improve generalization by using noisy channel re-ranking and ensembling. |
| Approach: | They propose to use BPE-based transformer models to leverage monolingual data to improve generalization and use noisy channel re-ranking and ensembling to improve results. |
| Outcome: | The proposed system improves on the baseline system trained exclusively on the provided small parallel dataset, and the human evaluation and BLEU score are higher. |
Generalization in Generation: A closer look at Exposure Bias (D19-56)
Copied to clipboard
| Challenge: | Autoregressive generative models are often criticized for using ground-truth contexts at training time but generated ones at test time. |
| Approach: | They propose that generalization is the underlying property to address and propose unconditional generation as its fundamental benchmark. |
| Outcome: | The proposed model is generalized and can handle true and generated contexts. |
PUMA: Projected Universal Multilingual ASR for Low-Resource Settings. Application to Diverse African Languages (2026.findings-acl)
Copied to clipboard
| Challenge: | Existing multilingual ASR models fail to generalize to low-resource languages while remaining costly to scale. |
| Approach: | They propose a multilingual ASR model that integrates a learnable language token with acoustic representations to enable language-aware processing. |
| Outcome: | The proposed model improves low-resource performance with reduced model complexity on African languages. |
PromptRefine: Enhancing Few-Shot Performance on Low-Resource Indic Languages with Example Selection from related Example Banks (2025.naacl-long)
Copied to clipboard
| Challenge: | Large Language Models (LLMs) have demonstrated impressive few-shot learning capabilities through in-context learning. |
| Approach: | They propose a novel Alternating Minimization approach for example selection that improves ICL performance on low-resource Indic languages. |
| Outcome: | The proposed approach outperforms existing frameworks for retrieving examples on low-resource Indic languages. |
Analyzing Dynamic Adversarial Training Data in the Limit (2022.findings-acl)
Copied to clipboard
| Challenge: | Dynamic adversarial data collection (DADC) can be used to build models that are robust across a wide range of test inputs. |
| Approach: | They propose to run Dynamic adversarial data collection over many rounds to maximize its training-time benefits. |
| Outcome: | The proposed model makes 26% fewer errors on the premise paragraphs compared to models trained on non-adversarial examples. |
Persona-DB: Efficient Large Language Model Personalization for Response Prediction with Collaborative Data Refinement (2025.coling-main)
Copied to clipboard
Chenkai Sun, Ke Yang, Revanth Gangi Reddy, Yi Fung, Hou Pong Chan, Kevin Small, ChengXiang Zhai, Heng Ji
| Challenge: | Existing research has focused on enhancing the retrieval stage and optimizing the representation of the database. |
| Approach: | They propose a framework to improve generalization across task contexts and collaborative refinement to bridge knowledge gaps among users. |
| Outcome: | The proposed framework improves generalization across task contexts and collaborative refinement to bridge knowledge gaps among users. |
ViClaim: A Multilingual Multilabel Dataset for Automatic Claim Detection in Videos (2025.emnlp-main)
Copied to clipboard
| Challenge: | Existing efforts in misinformation detection focus on written text, leaving a significant gap in addressing the complexity of spoken text in video transcripts. |
| Approach: | They propose to annotate video transcripts in three languages and six topics using a custom annotation tool. |
| Outcome: | The proposed tool shows strong cross-validation performance but challenges for generalization to unseen topics. |
Morphological Reinflection with Multiple Arguments: An Extended Annotation schema and a Georgian Case Study (2022.acl-short)
Copied to clipboard
| Challenge: | morphological annotations are a common problem in some languages, but the flat structure of the current schema makes it impossible to treat them. |
| Approach: | They propose a general solution for polypersonal agreement in Georgian language . they extend the existing UniMorph annotation schema to address this problem . |
| Outcome: | The proposed framework covers all possible variants of argument marking, and is accurate and balanced. |
Multimodal, Multilingual Grapheme-to-Phoneme Conversion for Low-Resource Languages (D19-61)
Copied to clipboard
| Challenge: | Grapheme-to-phoneme conversion (g2p) is a task of predicting the pronunciation of words from their orthographic representation. |
| Approach: | They propose to leverage audio data as an auxiliary modality in a multi-task training process to learn a more optimal grapheme representation. |
| Outcome: | The proposed model reduces phoneme error rate to 2.46% on in-domain test set compared to unimodal spelling- pronunciation model. |
ASPIRE: Language-Guided Data Augmentation for Improving Robustness Against Spurious Correlations (2024.findings-acl)
Copied to clipboard
Sreyan Ghosh, Chandra Kiran Evuru, Sonal Kumar, Utkarsh Tyagi, S Sakshi, Sanjoy Chowdhury, Dinesh Manocha
| Challenge: | Neural image classifiers often rely on non-predictive features that are spuriously correlated with the class labels in training data. |
| Approach: | They propose a language-guided data augmented with images without spurious correlations that can be used to augment training datasets for robust learning. |
| Outcome: | The proposed model improves the worst-group classification accuracy of prior methods by 1% - 38%. |
Learning Language Specific Sub-network for Multilingual Machine Translation (2021.acl-long)
Copied to clipboard
| Challenge: | Multilingual neural machine translation models suffer from performance degradation when learning multiple languages. |
| Approach: | They propose to use LaSS to jointly train a single unified multilingual MT model. |
| Outcome: | The proposed model gains on 36 language pairs by up to 1.2 BLEU and zero-shot translation with 8.3 BLUE on 30 language pairs. |
Towards a Better Understanding of Label Smoothing in Neural Machine Translation (2020.aacl-main)
Copied to clipboard
| Challenge: | In recent years, Neural Network (NN) models bring steady and concrete improvements on the task of Machine Translation (MT). |
| Approach: | They propose to penalize over-confident outputs and regularize the model so that its outputs do not diverge too much from some prior distribution. |
| Outcome: | The proposed method is well-motivated and can improve the performance of strong neural machine translation systems. |
Leveraging LLM-GNN Integration for Open-World Question Answering over Knowledge Graphs (2026.eacl-long)
Copied to clipboard
| Challenge: | Traditional KGQA assumes a closed world where answers must exist in the KG, limiting real-world applicability. |
| Approach: | They propose a system that combines a pre-trained GNN and an LLM for open-world QA. |
| Outcome: | The proposed system outperforms existing LLM–GNN systems on standard benchmarks and GLOW-BENCH, achieving up to 53.3% and an average 38% improvement. |
Translate With Care: Addressing Gender Bias, Neutrality, and Reasoning in Large Language Model Translations (2025.findings-acl)
Copied to clipboard
| Challenge: | addressing gender bias and maintaining logical coherence in machine translation remains challenging, especially when translating between natural gender languages, like English, and genderless languages, such as Persian, Indonesian, and Finnish. |
| Approach: | They propose a dataset to assess translation systems' performance in six low- to mid-resource languages and a translation dataset to examine gender bias and logical coherence. |
| Outcome: | The Translate-with-Care dataset, comprising 3,950 challenging scenarios across six low- to mid-resource languages, reveals a universal struggle in translating genderless content, resulting in gender stereotyping and reasoning errors. |
Rethinking Data Mixing from the Perspective of Large Language Models (2026.acl-short)
Copied to clipboard
Yuanjian Xu, Tianze Sun, Changwei Xu, XinLong Zhao, Jianing Hao, Ran Chen, Yang Liu, Ruijie Xu, Stephen Chen, Guang Zhang
| Challenge: | Existing methods to mix data with LLMs have relied on domain definitions derived from intuition. |
| Approach: | They propose a reweighting framework that restructures data scheduling as a graph-constrained optimization problem. |
| Outcome: | The proposed framework achieves competitive performance on GPT-2 models. |
Query-Efficient Textual Adversarial Example Generation for Black-Box Attacks (2024.naacl-long)
Copied to clipboard
| Challenge: | Existing black-box attacks require thousands of queries on the target model, making them expensive in real-world applications. |
| Approach: | They propose a new approach that guides word substitutions using prior knowledge from the training set to improve the attack efficiency. |
| Outcome: | The proposed approach reduces query-free attack and guided search attacks by a factor of 10 500 . it improves transferability and generalization by the ensemble of the ABPens in NLP . |
AVAST: Attentive Variational State Tracker in a Reinforced Navigator (2022.aacl-main)
Copied to clipboard
| Challenge: | Recent advances in reinforcement learning have been proposed to deal with robotic navigation problems, especially vision-and-language navigation task. |
| Approach: | They propose a method to approximate belief state distribution for the construction of a reinforced navigator by using a variational approach to approximate the unseen environment. |
| Outcome: | The proposed method improves generalization to the unseen environment which is barely achieved by traditional deterministic state tracker. |
Beyond Tokens: Concept-Level Training Objectives for LLMs (2026.eacl-short)
Copied to clipboard
| Challenge: | Large language models (LLMs) are trained with a surprisingly narrow objective: predicting the next token in a sequence. |
| Approach: | They propose a shift from token-level to concept-level prediction where concepts group multiple surface forms of the same idea. |
| Outcome: | The proposed model improves on human-level models on diverse NLP benchmarks. |
Defending Compositionality in Emergent Languages (2022.naacl-srw)
Copied to clipboard
| Challenge: | a recent paper has suggested that compositionality is a key factor in language productivity, but some research has questioned this. |
| Approach: | They argue that compositionality is essential for successful generalization . they run a two-agent communication game to test this hypothesis . |
| Outcome: | The proposed results show that ANNs can generalize well even without compositional behavior . authors argue that the results are incomplete and weak . |
Beyond Reptile: Meta-Learned Dot-Product Maximization between Gradients for Improved Single-Task Regularization (2021.findings-emnlp)
Copied to clipboard
| Challenge: | Existing approaches to improve generalization of neural models use a small component of the gradient for maximizing dot-product between batches. |
| Approach: | They propose to use a finite differences first-order algorithm to calculate a gradient from dot-product of gradients and regularize it. |
| Outcome: | The proposed method outperforms previous approaches of Reptile and MAML when used as a regularization technique. |
Learning to Route for Dynamic Adapter Composition in Continual Learning with Language Models (2024.findings-emnlp)
Copied to clipboard
| Challenge: | Recent work shows that PEFT methods can be competitive with, or even superior to, full fine-tuning of PLMs. |
| Approach: | They propose a method that isolates the training of new PEFT modules to ensure their task specialization and learns to compose them by training a network of routers that leverages a small memory containing examples of previously seen tasks. |
| Outcome: | The proposed method improves generalization and performance in two CL setups. |
Location Attention for Extrapolation to Longer Sequences (2020.acl-main)
Copied to clipboard
| Challenge: | Neural networks are surprisingly good at interpolating, but they are often unable to extrapolate patterns beyond the seen data. |
| Approach: | They propose to use a special type of extrapolation for natural language processing to generalize to sequences that are longer than the training ones. |
| Outcome: | The proposed model is more likely to extrapolate than models with common attention mechanisms. |
Nemotron-CrossThink: Scaling Self-Learning beyond Math Reasoning (2026.eacl-long)
Copied to clipboard
Syeda Nahida Akter, Shrimai Prabhumoye, Matvei Novikov, Seungju Han, Ying Lin, Evelina Bakhturina, Eric Nyberg, Yejin Choi, Mostofa Patwary, Mohammad Shoeybi, Bryan Catanzaro
| Challenge: | Prior work has successfully applied Reinforcement Learning (RL) to mathematical reasoning, but generalization to broader domains remains challenging due to limited data and lack of verifiable rewards for unstructured domains. |
| Approach: | They propose a framework that integrates multi-domain corpora into RL training to improve generalization across diverse reasoning tasks. |
| Outcome: | The proposed framework improves generalization across diverse reasoning tasks. |
Towards General-Domain Word Sense Disambiguation: Distilling Large Language Model into Compact Disambiguator (2025.emnlp-main)
Copied to clipboard
| Challenge: | Existing methods for Word Sense Disambiguation rely heavily on manually annotated data, which limits coverage and generalization. |
| Approach: | They propose a framework that leverages large language models as knowledge distillers to build silver-standard WSD corpora by combining generation-based distillation and annotation-based disambiguation. |
| Outcome: | The proposed framework outperforms existing methods on general-domain benchmarks by 50% on the most challenging test set and by 1000 times fewer parameters. |
Distributional Inclusion Vector Embedding for Unsupervised Hypernymy Detection (N18-1)
Copied to clipboard
| Challenge: | Existing unsupervised methods for learning hypernyms from unlabeled text are not scaled to large vocabularies or yield unacceptably poor accuracy. |
| Approach: | They propose an unsupervised method of hypernym discovery using word contexts . they use word2vec to embed word context distributions without supervision . |
| Outcome: | The proposed method provides double the precision and highest average performance on 11 datasets. |
SPARTA: Efficient Open-Domain Question Answering via Sparse Transformer Matching Retrieval (2021.naacl-main)
Copied to clipboard
| Challenge: | SPARTA is a novel neural retrieval method for open-domain question answering . it learns a sparse representation that can be efficiently implemented as an Inverted Index . |
| Approach: | They propose a method that learns a sparse representation that can be implemented as an Inverted Index. |
| Outcome: | The proposed method achieves state-of-the-art results on 4 open-domain question answering tasks and 11 retrieval question answering (ReQA) tasks. |
Towards Better Generalization in Open-Domain Question Answering by Mitigating Context Memorization (2024.findings-naacl)
Copied to clipboard
| Challenge: | Open-domain Question Answering (OpenQA) aims at answering factual questions using an external large-scale knowledge corpus. |
| Approach: | They propose a retrieval-augmented approach to QA that focuses on retrieving relevant knowledge from an external corpus. |
| Outcome: | The proposed model can generalize to completely different knowledge domains while adapting to updated versions of the same knowledge corpus and switching to completely new knowledge domain. |
Leveraging Variation Theory in Counterfactual Data Augmentation for Optimized Active Learning (2025.findings-acl)
Copied to clipboard
| Challenge: | Active Learning (AL) allows users to provide focused annotations to integrate human preferences and domain knowledge into machine learning models. |
| Approach: | They propose a counterfactual data augmentation approach inspired by Variation Theory to generate targeted variations along key conceptual dimensions. |
| Outcome: | The proposed approach achieves significantly higher performance when there are fewer annotated data, showing it can address the cold start problem in Active Learning. |
Learn Continually, Generalize Rapidly: Lifelong Knowledge Accumulation for Few-shot Learning (2021.findings-emnlp)
Copied to clipboard
| Challenge: | Existing models that pursue rapid generalization to new tasks are mostly trained in a single shot on fixed datasets, unable to dynamically expand their knowledge. |
| Approach: | They propose a new learning setup that assumes a model learns from a sequence of diverse NLP tasks arriving sequentially, accumulating knowledge for improved generalization to new tasks. |
| Outcome: | The proposed learning setup improves generalization ability while retaining performance on the tasks learned earlier. |
Measuring and Improving Compositional Generalization in Text-to-SQL via Component Alignment (2022.findings-naacl)
Copied to clipboard
| Challenge: | Existing models suffer performance degradation when evaluated on Spider-CG, even though every sub-sentence is seen during training. |
| Approach: | They propose a clause-level compositional example generation method to generate compositional biases from SQL clauses. |
| Outcome: | The proposed method improves generalization performance even on a training dataset. |
MUTANT: A Training Paradigm for Out-of-Distribution Generalization in Visual Question Answering (2020.emnlp-main)
Copied to clipboard
| Challenge: | Availability of large-scale datasets has enabled statistical machine learning in vision and language understanding. |
| Approach: | They propose a training paradigm that exposes models to perceptually similar mutations of input . they show a 10.57% improvement in the VQA-CP challenge . |
| Outcome: | The proposed training paradigm improves on the visual question answering challenge with 10.57% accuracy. |
iBERT: Interpretable Embeddings via Sense Decomposition (2026.eacl-long)
Copied to clipboard
| Challenge: | iBERT is an encoder that produces inherently interpretable and controllable embeddings without compromising performance. |
| Approach: | They propose an encoder that produces interpretable embeddings that modularize and expose discriminative cues present in language. |
| Outcome: | The proposed model outperforms baselines on style-focused tasks while maintaining competitive performance on authorship verification. |
Minimal Ranks, Maximum Confidence: Parameter-efficient Uncertainty Quantification for LoRA (2025.findings-emnlp)
Copied to clipboard
| Challenge: | Low-Rank Adaptation (LoRA) enables parameter-efficient fine-tuning of large language models . standard LoRA lacks mechanisms for uncertainty quantification, leading to overconfident and poorly calibrated models. |
| Approach: | They propose a parameter-efficient Bayesian LoRA method that decomposes weight updates into low-rank matrices. |
| Outcome: | The proposed method achieves strong performance with improved calibration and generalization while maintaining computational efficiency. |
Rethinking Pruning Large Language Models: Benefits and Pitfalls of Reconstruction Error Minimization (2024.emnlp-main)
Copied to clipboard
| Challenge: | minimizing reconstruction error is not always ideal and can overfit calibration data. |
| Approach: | They propose a method to prune large language models by divide and conquer . they propose minimizing reconstruction error by more than 90% by using calibration data . |
| Outcome: | The proposed pruning approach generates high reconstruction errors . the proposed technique reduces reconstruction error by more than 90% . |
Learning Universal Authorship Representations (2021.emnlp-main)
Copied to clipboard
Rafael A. Rivera-Soto, Olivia Elizabeth Miano, Juanita Ordonez, Barry Y. Chen, Aleem Khan, Marcus Bishop, Nicholas Andrews
| Challenge: | authorship verification has traditionally relied on modeling stylometric linguistic properties . but neural methods introduce a tradeoff: they obviate the need for manual feature design . |
| Approach: | They propose to use domain-specific features to improve authorship representations . they propose to study Amazon reviews, fanfiction short stories, and Reddit comments . |
| Outcome: | The proposed methods outperform existing methods in large-scale authorship verification scenarios. |
Answering Unanswered Questions through Semantic Reformulations in Spoken QA (2023.acl-industry)
Copied to clipboard
| Challenge: | Question Answering (QA) is a longstanding NLP task, and voice assistants like Alexa have made Spoken QA ubiquitous. |
| Approach: | They propose a model that uses linguistically-grounded operations to rewrite questions to facilitate answering. |
| Outcome: | The proposed model improves answer rates on 1M unanswered questions from a leading voice assistant. |
On Curriculum Learning for Commonsense Reasoning (2022.naacl-main)
Copied to clipboard
| Challenge: | Recent research suggests that data order can have a significant impact on the performance of finetuned models for natural language understanding. |
| Approach: | They use paced curriculum learning to rank data and sample training mini-batches with increasing levels of difficulty during finetuning. |
| Outcome: | The proposed model improves performance for socialIQA, CosmosQA, CODAH, HellaSwag, WinoGrande in both tuning settings. |
Meta Self-Refinement for Robust Learning with Weak Supervision (2023.eacl-main)
Copied to clipboard
| Challenge: | Recent methods leverage self-training to build noise-resistant models . however, the teacher trained under weak supervision may have fitted a substantial amount of noise and therefore produce incorrect pseudo-labels. |
| Approach: | They propose a framework that encourages teacher to refine its pseudo-labels to effectively combat label noise from weak supervision. |
| Outcome: | The proposed framework outperforms state-of-the-art methods by 11.4% in accuracy and 9.26% in F1 score on eight NLP benchmarks. |
DISCO Balances the Scales: Adaptive Domain- and Difficulty-Aware Reinforcement Learning on Imbalanced Data (2025.findings-emnlp)
Copied to clipboard
Yuhang Zhou, Jing Zhu, Shengyi Qian, Zhuokai Zhao, Xiyao Wang, Xiaoyu Liu, Ming Li, Paiheng Xu, Wei Ai, Furong Huang
| Challenge: | Large Language Models (LLMs) are increasingly aligned with human preferences through Reinforcement Learning from Human Feedback (RLHF). |
| Approach: | a new study proposes a domain-informed self-consistency policy optimization extension to GRPO that addresses inter-group imbalance. |
| Outcome: | a new extension of GRPO addresses inter-group imbalance with two key innovations . the proposed method outperforms existing GR PO variants by 5% on Qwen3 models . |
MetaASSIST: Robust Dialogue State Tracking with Meta Learning (2022.emnlp-main)
Copied to clipboard
| Challenge: | Existing dialogue datasets contain lots of noise in their state annotations. |
| Approach: | They propose a framework to train robust dialogue state tracking models by combining pseudo and vanilla labels by a common weighting parameter. |
| Outcome: | The proposed framework achieves state-of-the-art accuracy of 80.10% on multiWOZ 2.4. |
Training Language Models to Critique With Multi-agent Feedback (2025.findings-emnlp)
Copied to clipboard
Tian Lan, Wenwei Zhang, Chengqi Lyu, Shuaibin Li, Chen Xu, Heyan Huang, Dahua Lin, Xian-Ling Mao, Kai Chen
| Challenge: | utilizing human annotations can enhance critique ability, but model-generated critiques suffer from inherent flaws due to complexity of critique . a new framework that leverages multi-agent feedback improves critique ability . |
| Approach: | They propose a framework that leverages multi-agent feedback to improve critique ability . they propose to use supervised fine-tuning and reinforcement learning to improve this capability . |
| Outcome: | The proposed framework improves critique ability in both supervised fine-tuning and reinforcement learning stages. |
Hypothetical Training for Robust Machine Reading Comprehension of Tabular Context (2023.findings-acl)
Copied to clipboard
| Challenge: | Counterfactual training is expensive because of the complexity of tabular data. |
| Approach: | They propose a hypothetical training framework that uses paired examples with different hypothetical questions to supervise the direction of model gradient towards the counterfactual answer change. |
| Outcome: | The proposed framework improves on tabular MRC datasets. |
Modular Networks for Compositional Instruction Following (2021.naacl-main)
Copied to clipboard
| Challenge: | Standard instruction following models struggle on novel compositions of subgoals observed during training. |
| Approach: | They propose a modular architecture that follows natural language instructions that describe sequences of diverse subgoals. |
| Outcome: | The proposed architecture improves generalization to novel subgoals and environments unseen in training. |
Improve Vision Language Model Chain-of-thought Reasoning (2025.acl-long)
Copied to clipboard
Ruohong Zhang, Bowen Zhang, Yanghao Li, Haotian Zhang, Zhiqing Sun, Zhe Gan, Yinfei Yang, Ruoming Pang, Yiming Yang
| Challenge: | Current training recipes often rely on datasets dominated by short annotations with limited rationales, hindering the models' ability to generalize to tasks requiring comprehensive reasoning. |
| Approach: | They propose a two-stage post-training strategy that augments short answers with CoT reasoning generated by GPT-4o, enhancing the VLM's CoT capabilities through fine-tuning. |
| Outcome: | The proposed strategy enhances the model's CoT capabilities through fine-tuning and reinforcement learning. |
Dependency Transformer Grammars: Integrating Dependency Structures into Transformer Language Models (2024.acl-long)
Copied to clipboard
| Challenge: | Syntactic Transformer language models aim to achieve better generalization through simultaneously modeling syntax trees and sentences. |
| Approach: | They propose a class of Transformer language models with explicit dependency-based inductive bias. |
| Outcome: | Experiments show that the proposed models outperform constituency-based models on sentences annotated with dependency trees and achieve better generalization. |
The Computational Complexity of Distinctive Feature Minimization in Phonology (N18-2)
Copied to clipboard
| Challenge: | a standard assumption in phonology is that finding a minimal feature specification is an automatic part of acquisition and generalization. |
| Approach: | They analyze the problem of determining whether a set of phonemes forms a natural class and find the minimal feature specification for the class. |
| Outcome: | The proposed model is based on a greedy algorithm that fails to find minimal features . the proposed model can be used to find features that are universal across languages . |
Dynamic Sampling Strategies for Multi-Task Reading Comprehension (2020.acl-main)
Copied to clipboard
| Challenge: | Prior work focused on model architecture or generalization to held out datasets and largely passed over the particulars of the multi-task learning set up. |
| Approach: | They propose a dynamic sampling strategy that selects instances proportional to the model's current performance on a dataset relative to its single task performance. |
| Outcome: | The proposed model outperforms the best model on ORB, a recent multitask reading comprehension benchmark. |
Exploring Schema Generalizability of Text-to-SQL (2023.findings-acl)
Copied to clipboard
| Challenge: | Existing text-to-SQL models are limited in their generalizability, despite their performance being over-estimated. |
| Approach: | They propose a framework to generate novel text-to-SQL data via automatic and synchronous (DS, SQL) pair altering. |
| Outcome: | The proposed framework generates text-to-SQL data via automatic and synchronous (DS, SQL) pair altering. |
Ghostbuster: Detecting Text Ghostwritten by Large Language Models (2024.naacl-long)
Copied to clipboard
| Challenge: | Ghostbuster is a system that passes documents through weaker language models, runs a structured search over possible combinations of their features, and trains a classifier on the selected features. |
| Approach: | They propose a method that passes documents through weaker language models, runs a structured search over possible combinations of their features, and trains a classifier on the selected features. |
| Outcome: | The proposed method outperforms existing detectors and a new baseline on student essays, creative writing, and news articles. |
Efficient Hierarchical Domain Adaptation for Pretrained Language Models (2022.naacl-main)
Copied to clipboard
| Challenge: | Existing methods to allow domain adaptation to diverse domains are expensive and require continuing training in-domain. |
| Approach: | They propose a method to permit domain adaptation to many diverse domains using a computationally efficient adapter approach. |
| Outcome: | The proposed method allows domain adaptation to many diverse domains while avoiding negative interference between unrelated domains. |
Deep Temporal-Recurrent-Replicated-Softmax for Topical Trends over Time (N18-1)
Copied to clipboard
| Challenge: | a novel topic model is proposed to allow topical trends to be captured in temporal collections of documents. |
| Approach: | They propose a novel unsupervised neural dynamic topic model where topics are influenced by topic discovery over time. |
| Outcome: | The proposed model shows better generalization, topic interpretation, evolution and trends compared to state-of-the-art models . |
CeeBERT: Cross-Domain Inference in Early Exit BERT (2024.findings-acl)
Copied to clipboard
| Challenge: | Pre-trained Language Models suffer in inference latency due to their large size. |
| Approach: | They propose an online learning algorithm that dynamically determines early exits of samples based on the level of confidence observed at intermediate layers. |
| Outcome: | The proposed algorithm can speed up the BERT/ALBERT models by 2 - 3.1 with minimal drop in accuracy. |
On the Transferability of Minimal Prediction Preserving Inputs in Question Answering (2021.naacl-main)
Copied to clipboard
| Challenge: | Recent work establishes the presence of short, uninterpretable input fragments that yield high confidence and accuracy in neural models. |
| Approach: | They investigate competing hypotheses for the existence of MPPIs in question answering . they discover a perplexing invariance of MPIs to random training seed, model architecture, pretraining, and training domain. |
| Outcome: | The proposed model performance is higher than comparable short queries. |
Tsetlin Machine Embedding: Representing Words Using Logical Expressions (2024.findings-eacl)
Copied to clipboard
| Challenge: | Embedding words in vector space is a fundamental first step in state-of-the-art natural language processing. |
| Approach: | They propose to embed words in vector space using propositional logic instead of dense vectors . they evaluate embeddings on intrinsic and extrinsic benchmarks and visualize word clusters based on their results . |
| Outcome: | The proposed model outperforms GLoVe on six classification tasks. |
Gradient-Boosted Decision Tree for Listwise Context Model in Multimodal Review Helpfulness Prediction (2023.findings-acl)
Copied to clipboard
| Challenge: | Existing studies have shown that FCNNs perform inefficient splitting for review features, making it difficult to clearly differentiate helpful from unhelpful reviews. |
| Approach: | They propose a listwise attention network that captures the MRHP ranking context and a pairwise optimization objective that enhances model generalization. |
| Outcome: | The proposed framework achieves state-of-the-art results and polished generalization performance on two large-scale MRHP benchmark datasets. |
Real-World Compositional Generalization with Disentangled Sequence-to-Sequence Learning (2023.findings-acl)
Copied to clipboard
| Challenge: | Existing approaches to compositional generalization have been designed with semantic parsing in mind. |
| Approach: | They propose a disentangled sequence-to-sequence model which encourages more disentanglement and improves its compute and memory efficiency. |
| Outcome: | The proposed model improves generalization performance across existing tasks and datasets and a new machine translation benchmark. |
Active Instruction Tuning: Improving Cross-Task Generalization by Training on Prompt Sensitive Tasks (2023.emnlp-main)
Copied to clipboard
| Challenge: | Instruction tuning (IT) achieves impressive zero-shot generalization results by training large language models on diverse tasks with instructions. |
| Approach: | They propose a framework to identify informative tasks and then actively tune models on selected tasks. |
| Outcome: | The proposed method outperforms baseline strategies for task selection on NIV2 and Self-Instruct datasets. |
Divide, Conquer, and Combine: Mixture of Semantic-Independent Experts for Zero-Shot Dialogue State Tracking (2023.acl-long)
Copied to clipboard
| Challenge: | Existing methods to enhance the zeroshot generalization of DST fail to effectively decouple semantics of samples, limiting the zero-shot performance of the system. |
| Approach: | They propose a new learning schema that explicitly disentangles the semantics of seen data and leverages the performance and robustness with the mixture-of-experts mechanism. |
| Outcome: | The proposed model achieves state-of-the-art on multiWOZ2.1 with 10M trainable parameters and is robust to the mixture-of experts mechanism. |
AgentBank: Towards Generalized LLM Agents via Fine-Tuning on 50000+ Interaction Trajectories (2024.findings-emnlp)
Copied to clipboard
Yifan Song, Weimin Xiong, Xiutian Zhao, Dawei Zhu, Wenhao Wu, Ke Wang, Cheng Li, Wei Peng, Sujian Li
| Challenge: | Existing studies focus on specialized agents designed for particular tasks. |
| Approach: | They propose to scale annotated interaction trajectories and fine-tune LLMs on AgentBank to get a series of agent models, Samoyed. |
| Outcome: | The proposed model can scale to get generalized agent capabilities. |
Generalization in Text-based Games via Hierarchical Reinforcement Learning (2021.findings-emnlp)
Copied to clipboard
| Challenge: | Reinforcement Learning (RL) based agents are promising for text-based games, but their generalization remains a challenge. |
| Approach: | They propose a hierarchical framework for reinforcement learning based on knowledge graphs . they propose to decompose the game into subtasks and execute a sub-policy in the low level to conduct goal-conditioned reinforcement learning. |
| Outcome: | The proposed framework enjoys favorable generalizability on a set of difficulty levels and is able to handle complex training tasks. |
GEMNET: Effective Gated Gazetteer Representations for Recognizing Complex Entities in Low-context Input (2021.naacl-main)
Copied to clipboard
| Challenge: | Named Entity Recognition (NER) is difficult in real-world settings due to short texts, emerging entities, and complex entities. |
| Approach: | They propose a flexible Gazetteer Representation encoder and a Mixture-of-Experts gating network for gazetteer knowledge integration. |
| Outcome: | The proposed approach shows large gains (up to +49% F1) in recognizing difficult entities compared to baselines. |
Perform like an Engine: A Closed-Loop Neural-Symbolic Learning Framework for Knowledge Graph Inference (2022.coling-1)
Copied to clipboard
| Challenge: | Existing knowledge graphs are incomplete and therefore lack interpretability. |
| Approach: | They propose a closed-loop neural-symbolic learning framework EngineKG to address the natural incompleteness of knowledge graphs. |
| Outcome: | The proposed model outperforms baselines on link prediction tasks on four real-world datasets. |
DuReader_robust: A Chinese Dataset Towards Evaluating Robustness and Generalization of Machine Reading Comprehension in Real-World Applications (2021.acl-short)
Copied to clipboard
| Challenge: | In order to comprehensively verify the robustness and generalization of MRC models, we construct a real-world Chinese dataset - DuReader_robust . |
| Approach: | They introduce a real-world Chinese dataset to evaluate the robustness and generalization of MRC models from three aspects: over-sensitivity, over-stability and generalisation. |
| Outcome: | The proposed model fails to perform well on the challenge test set and may provide suggestions for future model development. |
LRQuant: Learnable and Robust Post-Training Quantization for Large Language Models (2024.acl-long)
Copied to clipboard
| Challenge: | Existing methods for post-training quantization (PTQ) are limited by the complexity of the quantization parameter and performance degradations when tested on unseen datasets. |
| Approach: | They propose a learnable smooth-based PTQ framework that allows for rapid adaptation during testing. |
| Outcome: | The proposed framework improves performance on unseen datasets and reduces memory constraints. |
Beyond Surface-Level Detection: Towards Cognitive-Driven Defense Against Jailbreak Attacks via Meta-Operations Reasoning (2026.acl-long)
Copied to clipboard
| Challenge: | Existing defenses rely on shallow pattern matching, which struggles to generalize to novel and unseen attack strategies. |
| Approach: | They propose a framework which emulates human cognitive reasoning through a structured reasoning chain. |
| Outcome: | The proposed framework achieves state-of-the-art performance and exhibits strong generalization to unseen attacks. |
Multi-Task Reinforcement Learning for Enhanced Multimodal LLM-as-a-Judge (2026.acl-industry)
Copied to clipboard
| Challenge: | Existing MLLMs are optimized for single-task scenarios and struggle to generalize to diverse contexts. |
| Approach: | They propose a framework that integrates multitask reinforcement learning and generalization capabilities of MLLMs to optimize the judge model across multiple tasks. |
| Outcome: | The proposed framework outperforms baseline models in judgment consistency and correlation with human preferences. |
Principles from Clinical Research for NLP Model Generalization (2024.naacl-long)
Copied to clipboard
| Challenge: | In clinical research, generalizability depends on (a) internal validity of experiments and (b) external validity or transportability of the results to the wider population. |
| Approach: | They propose to ensure internal validity when building machine learning models in NLP by incorporating learning spurious correlations into their models. |
| Outcome: | The proposed model can perform well on data unseen during training, but drawn from the same distribution or population. |
DACIP-RC: Domain Adaptive Continual Instruction Pre-Training via Reading Comprehension on Business Conversations (2025.emnlp-industry)
Copied to clipboard
| Challenge: | Large Language Models (LLMs) have been used in real-world industrial scenarios for various natural language processing tasks, but their high inference cost makes their deployment impractical, necessitating the use of smaller models. |
| Approach: | They propose a continual pre-training technique that generates diverse task instructions and responses via reading comprehension on conversation transcripts, enabling better instruction generalization. |
| Outcome: | The proposed technique improves small LLMs’ domain adaptability for business conversational tasks, compared with traditional methods that rely on next-token prediction. |
MOSPC: MOS Prediction Based on Pairwise Comparison (2023.acl-short)
Copied to clipboard
| Challenge: | et al., 2016a) show that MOS prediction model can improve ranking accuracy of speech quality. |
| Approach: | They propose a general framework for MOS prediction based on pair comparison . they use C-Mixup algorithm to enhance generalization performance of MOSPC . |
| Outcome: | The proposed model outperforms baselines on most correlation coefficient metrics . it also surpasses the strong baseline in ranking accuracy on each fine-grained segment. |
A Query-Parallel Machine Reading Comprehension Framework for Low-resource NER (2023.findings-emnlp)
Copied to clipboard
| Challenge: | Named entity recognition (NER) is a fundamental task in natural language processing. |
| Approach: | They propose a query-parallel MRC-based approach to named entity recognition . the model is trained with parameter-efficient tuning technique, making it more data-efficient . |
| Outcome: | The proposed model performs competitively against strong baseline methods in resource-rich settings and achieves state-of-the-art results in low-resource settings. |
CLGSI: A Multimodal Sentiment Analysis Framework based on Contrastive Learning Guided by Sentiment Intensity (2024.findings-naacl)
Copied to clipboard
| Challenge: | Recent studies have focused on contrastive learning, but lack detailed learning of the distribution of sample pairs with different sentiment intensity differences in the contrastive training representation space. |
| Approach: | They propose a framework for multimodal sentiment analysis based on contrastive learning guided by sentiment intensity (CLGSI) it selects positive and negative sample pairs based upon sentiment intensity differences and assigns corresponding weights accordingly. |
| Outcome: | The proposed framework extracts common features between different modalities and then uses them to predict sentiment intensity. |
Advancing Reasoning with Off-the-Shelf LLMs: A Semantic Structure Perspective (2025.findings-emnlp)
Copied to clipboard
| Challenge: | Existing reasoning models suffer from hallucinations and unfaithfulness, whereas general LLMs perform suboptimal on complex tasks. |
| Approach: | They propose a structure analysis method that helps LLMs better understand the question structure and guide the problem-solving process. |
| Outcome: | The proposed method improves zero-shot performance on knowledge-intensive and mathematical tasks while demonstrating strong robustness against corrupted reasoning paths. |
A Coarse-to-Fine Prototype Learning Approach for Multi-Label Few-Shot Intent Detection (2024.findings-emnlp)
Copied to clipboard
| Challenge: | Existing methods for few-shot intent detection are limited due to data scarcity and lack of information for unseen domains. |
| Approach: | They propose to enhance utterance representations with label synset augmentation and refine prototypes by distilling coarse domain knowledge from a universal teacher model. |
| Outcome: | The proposed approach outperforms existing methods in terms of accuracy and generalization across domains. |
Sibylvariant Transformations for Robust Text Classification (2022.findings-acl)
Copied to clipboard
| Challenge: | Existing text transformation techniques are limited in their ability to expand input space . many techniques can artificially expand labeled training sets or test suites, but are class-preserving . |
| Approach: | They propose a concept of sibylvariance to describe transforms that relax the label-preserving constraint and knowably vary the expected class. |
| Outcome: | The proposed transforms can expand input space, but they are limited in their ability to expand . the proposed transform can knowably vary the expected class and lead to more diverse distributions . |
Testing the limits of logical reasoning in neural and hybrid models (2024.findings-naacl)
Copied to clipboard
| Challenge: | despite the successes of deep learning models, we still need to know more about how and what they learn. |
| Approach: | They create tests to analyze logical reasoning patterns in neural and hybrid models . they find that models can generalize logical thinking only to a limited degree . |
| Outcome: | The proposed models can capture elementary aspects of meaning but only to limited extent . authors say they need to understand how and what they learn . |
Reducing Spurious Correlations for Answer Selection by Feature Decorrelation and Language Debiasing (2022.coling-1)
Copied to clipboard
| Challenge: | Existing deep neural models rely on spurious correlations between prediction labels and input features, which in general suffer from robustness and generalization. |
| Approach: | They propose a feature decorrelation module to remove feature dependencies and reduce spurious correlations by learning a weight for each instance at the training phase. |
| Outcome: | The proposed method improves the robustness of the neural ANswer selection models from the sample and feature perspectives. |
Probing Pre-trained Auto-regressive Language Models for Named Entity Typing and Recognition (2022.lrec-1)
Copied to clipboard
| Challenge: | Existing studies have focused on auto-regressive models for generalization in named entity (NE) typing (NET) and recognition (NER) . however, little has been done in this direction for auto-Regressive LMs despite their popularity and potential to express a wide variety of NLP tasks in the same unified format. |
| Approach: | They propose to probe auto-regressive LMs for NET and NER generalization by resorting to meta-learning to assess the model's memorization of NEs. |
| Outcome: | The proposed model performs well on NET and NER generalization tasks, while relying more on NE than contextual cues in few-shot NER. |
COMEM: In-Context Retrieval-Augmented Mass-Editing Memory in Large Language Models (2024.findings-naacl)
Copied to clipboard
| Challenge: | Existing methods for "knowledge editing" in large language models are inadequate . authors propose a method that can be used to update outdated information or correct false information . |
| Approach: | They propose a unified knowledge editing method called in-COntext retrieval-augmented Mass-Editing Memory . it incorporates retrieval augmented IKE, a novel extension of IKE designed for massive editing tasks . |
| Outcome: | The proposed method outperforms existing methods on the zsRE and CounterFact datasets. |
FLAT-LLM: Fine-grained Low-rank Activation Space Transformation for Large Language Model Compression (2026.findings-eacl)
Copied to clipboard
| Challenge: | Low-rank decomposition methods suffer from accuracy degradation and expensive calibration procedures. |
| Approach: | They propose a fast and accurate, training-free structural compression method based on fine-grained low-rank transformations in the activation space. |
| Outcome: | The proposed method outperforms pruning baselines in generalization and downstream performance while delivering inference speedups. |
Stress-testing Machine Generated Text Detection: Shifting Language Models Writing Style to Fool Detectors (2025.findings-acl)
Copied to clipboard
Andrea Pedrotti, Michele Papucci, Cristiano Ciaccio, Alessio Miaschi, Giovanni Puccetti, Felice Dell’Orletta, Andrea Esuli
| Challenge: | Recent advances in Generative AI and Large Language Models (LLMs) have enabled the creation of highly realistic synthetic content, raising concerns about the potential for malicious use, such as misinformation and manipulation. |
| Approach: | They evaluate the resilience of state-of-the-art MGT detectors to linguistically informed adversarial attacks by using Direct Preference Optimization to shift the MGT style toward human-written text. |
| Outcome: | The proposed pipeline fine-tunes language models to shift the MGT style toward human-written text (HWT) it obtains generations more challenging to detect by current models, and shows that detectors can be easily fooled with relatively few examples, resulting in a significant drop in detecting performances. |
RMM: A Recursive Mental Model for Dialogue Navigation (2020.findings-emnlp)
Copied to clipboard
| Challenge: | Existing work on language-guided robots focuses on the latter, but little attention is paid to the guiding agent. |
| Approach: | They propose a two-agent task where one agent navigates and asks questions that a second, guiding agent answers. |
| Outcome: | The proposed model can be generalized to novel environments. |
Optimizing Deeper Transformers on Small Datasets (2021.acl-long)
Copied to clipboard
Peng Xu, Dhruv Kumar, Wei Yang, Wenjie Zi, Keyi Tang, Chenyang Huang, Jackie Chi Kit Cheung, Simon J.D. Prince, Yanshuai Cao
| Challenge: | a common belief that training deep transformers from scratch requires large datasets is wrong . however, with proper initialization and optimization, the benefits of very deep transformer can carry over to challenging tasks with small datasets. |
| Approach: | They train 48 layers of transformers from pre-trained RoBERTa and 24 relation-aware layers from scratch. |
| Outcome: | The proposed scheme achieves state-of-the-art performance on a text-to-sql parsing benchmark . it uses 24 fine-tuned layers from pre-trained RoBERTa and 24 relation-aware layers from scratch . |
Improving Grammar-based Sequence-to-Sequence Modeling with Decomposition and Constraints (2023.acl-short)
Copied to clipboard
| Challenge: | Neural QCFG excels in interpretability and generalization but suffers from expensive inference. |
| Approach: | They propose to use a symbolic grammar to create QCFGs with a quasisynchronous context-free grammar that is parameterized by neural networks to perform faster inference. |
| Outcome: | The proposed models outperform vanilla Neural QCFG in most settings. |
Complexity-Guided Curriculum Learning for Text Graphs (2023.findings-emnlp)
Copied to clipboard
| Challenge: | Curriculum learning is a systematic approach to training that refines training progressively and tailors training to task requirements. |
| Approach: | They propose a curriculum learning approach that employs "spaced repetition" and complexity formalisms to guide the training process. |
| Outcome: | The proposed model gains more and uses less data, and the best curricula are equally effective. |
Unobserved Local Structures Make Compositional Generalization Hard (2022.emnlp-main)
Copied to clipboard
| Challenge: | Recent studies show sequence-to-sequence models struggle to generalize to new compositions . little is known on what makes generalization hard on a particular test instance . |
| Approach: | They propose a criterion for the difficulty of an example that is hard if it contains a local structure that was not observed at training time. |
| Outcome: | The proposed rule predicts instance-level generalization well across 5 different datasets. |
Probing Linguistic Systematicity (2020.acl-main)
Copied to clipboard
| Challenge: | Existing evidence that deep natural language understanding models do not learn systematically is lacking. |
| Approach: | They examine whether deep natural language understanding models exhibit systematicity . they find that network architectures can generalize non-systematically . |
| Outcome: | The proposed model generalizes non-systematically, but is unsatisfactory, the authors argue . they show that the current state-of-the-art models do not generalize systematically . |
SEER: Self-Aligned Evidence Extraction for Retrieval-Augmented Generation (2024.emnlp-main)
Copied to clipboard
| Challenge: | Existing methods for enhancing RAG performance rely on heuristic-based augmentation . Existing approaches rely heavily on a heuriistic-driven approach, resulting in poor generalization and skews in the evidence length. |
| Approach: | They propose a model-based evidence extraction learning framework that optimizes a vanilla model as an evidence extractor with desired properties through self-aligned learning. |
| Outcome: | The proposed method reduces the evidence length by 9.25 times and improves reliability and reliability. |
A Virtual Patient Dialogue System Based on Question-Answering on Clinical Records (2024.lrec-main)
Copied to clipboard
| Challenge: | a new approach to annotating medical dialogues with intents is proposed for virtual patients . a VP is a system that allows medical students to simulate a real clinical consultation . |
| Approach: | They propose to annotate medical dialogue questions in Spanish and a second dataset of dialogues using a novel annotation approach. |
| Outcome: | The proposed approach eliminates the need for manually structured patient records . the two datasets and the code will be freely available for the research community. |
Z1: Efficient Test-time Scaling with Code (2025.emnlp-industry)
Copied to clipboard
| Challenge: | Large Language Models (LLMs) can achieve enhanced complex problem-solving through test-time computing scaling, but this often entails longer contexts and numerous reasoning token costs. |
| Approach: | They propose an efficient test-time scaling method that trains LLMs on code-related reasoning trajectories and a novel Shifted Thinking Window to mitigate overthinking overhead. |
| Outcome: | The proposed method reduces overthinking overhead while maintaining performance. |
Controlling Multimodal Conversational Agents with Coverage-Enhanced Latent Actions (2026.acl-long)
Copied to clipboard
| Challenge: | Recent reinforcement learning (RL) has been widely explored for adapting MCAs to various human-AI interaction scenarios. |
| Approach: | They propose to use a latent action space for reinforcement learning instead of RL to fine-tune MCAs. |
| Outcome: | The proposed method outperforms baselines on two conversation tasks with a novel cycle consistency loss. |
Rethinking Reading Order: Toward Generalizable Document Understanding with LLM-based Relation Modeling (2026.eacl-long)
Copied to clipboard
| Challenge: | Document understanding requires modeling structural and semantic relationships between layout elements within the document without human supervision. |
| Approach: | They propose a cost-effective paradigm that leverages large language models to infer global RO and inter-element layout relations without human supervision. |
| Outcome: | Experiments on Semantic Entity Recognition, Entity Linking, and Document Question Answering show that the proposed model improves on baseline models while preserving the robustness of existing models. |
From Implicit Exploration to Structured Reasoning: Guideline and Refinement for LLMs (2025.findings-emnlp)
Copied to clipboard
| Challenge: | Existing models rely on implicit exploration, which leads to unstable reasoning paths and lack of error correction. |
| Approach: | They propose a framework that shifts from implicit exploration to structured reasoning through guideline and refinement. |
| Outcome: | The proposed model outperforms strong baselines on the Big-Bench Hard benchmark. |
GENEVA: Benchmarking Generalizability for Event Argument Extraction with Hundreds of Event Types and Argument Roles (2023.acl-long)
Copied to clipboard
| Challenge: | Existing benchmarking datasets for Event Argument Extraction (EAE) cover less than 40 event types and 25 entity-centric argument roles. |
| Approach: | They propose to use a large and diverse EAE ontology to create a semantic role labeling dataset for EAE that incorporates 115 events and 220 argument roles. |
| Outcome: | The proposed ontology concludes with 115 events and 220 argument roles, with a significant portion of roles not being entities. |
Beyond Spurious Signals: Debiasing Multimodal Large Language Models via Counterfactual Inference and Adaptive Expert Routing (2025.findings-emnlp)
Copied to clipboard
| Challenge: | Multimodal Large Language Models (MLLMs) often rely on spurious correlations, undermining their robustness and generalization. |
| Approach: | They propose a causal mediation-based debiasing framework to address correlation bias in MLLMs . they distinguish core semantics from spurious textual and visual contexts using counterfactual examples . |
| Outcome: | The proposed framework surpasses existing state-of-the-art models on sarcasm detection and sentiment analysis tasks. |
CORE: A Retrieve-then-Edit Framework for Counterfactual Data Generation (2022.findings-emnlp)
Copied to clipboard
| Challenge: | Prior work on counterfactual data augmentation only considered restricted classes of perturbations, limiting their effectiveness. |
| Approach: | They propose a retrieval-augmented framework for creating diverse counterfactual perturbations for CDA. |
| Outcome: | Experiments on natural language inference and sentiment analysis show that the proposed framework can be used to encourage diversity in manually authored perturbations. |
Beyond Memorization: A Rigorous Evaluation Framework for Medical Knowledge Editing (2026.eacl-long)
Copied to clipboard
| Challenge: | Existing knowledge editing methods show promising results on general-domain benchmarks, but their effectiveness in the medical domain remains largely unexplored. |
| Approach: | They propose a framework to evaluate medical knowledge editing using model-generated rationales as editing targets. |
| Outcome: | The proposed method improves editing efficacy and generalization in medical models without full retraining. |
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. |
Sharpness-Aware Minimization for Topic Models with High-Quality Document Representations (2025.naacl-long)
Copied to clipboard
Tung Nguyen, Tue Le, Hoang Tran Vuong, Quang Duc Nguyen, Duc Anh Nguyen, Linh Ngo Van, Sang Dinh, Thien Huu Nguyen
| Challenge: | Recent advances in topic models have significantly enhanced the performance compared to conventional probabilistic approaches. |
| Approach: | They propose to use a topic model optimization method to improve generalization and performance. |
| Outcome: | The proposed method improves topic models on popular benchmark datasets. |
RobustSentEmbed: Robust Sentence Embeddings Using Adversarial Self-Supervised Contrastive Learning (2024.findings-naacl)
Copied to clipboard
| Challenge: | Existing pre-trained language models exhibit poor generalization and robustness in adversarial settings. |
| Approach: | They propose a self-supervised sentence embedding framework that improves generalization and robustness against adversarial attacks. |
| Outcome: | The proposed framework reduces the success rate of adversarial attacks by almost half . it also improves semantic text similarity tasks and various transfer tasks . |
Bootstrapped Q-learning with Context Relevant Observation Pruning to Generalize in Text-based Games (2020.emnlp-main)
Copied to clipboard
Subhajit Chaudhury, Daiki Kimura, Kartik Talamadupula, Michiaki Tatsubori, Asim Munawar, Ryuki Tachibana
| Challenge: | Reinforcement Learning methods for text-based games fail to generalize on unseen games, especially in small data regimes. |
| Approach: | They propose a Context Relevant Episodic State Truncation method for irrelevant token removal in observation text for improved generalization. |
| Outcome: | The proposed method shows that it can generalize on unseen games using 10x-20x fewer training games compared to previous state-of-the-art methods despite requiring fewer number of training episodes. |
Joint Learning of Hyperbolic Label Embeddings for Hierarchical Multi-label Classification (2021.eacl-main)
Copied to clipboard
| Challenge: | Existing methods for hierarchical multi-label classification do not assume label hierarchy exists. |
| Approach: | They propose to jointly learn the classifier parameters as well as the label embeddings . they propose to use hyperbolic embeddables to gain better generalisation over the labels . |
| Outcome: | The proposed method achieves state-of-the-art generalization on benchmarks and is more accurate than existing methods. |
Robust Machine Reading Comprehension by Learning Soft labels (2020.coling-main)
Copied to clipboard
| Challenge: | Neural models have achieved great success on the task of machine reading comprehension, which are typically trained on hard labels. |
| Approach: | They propose a robust training method for machine reading comprehension models to address label sparseness problem by using three strategies to train models on soft labels. |
| Outcome: | The proposed method improves the baseline model performance and achieves state-of-the-art performance on NewsQA and QUOREF. |
DIVINE : Coordinating Multimodal Disentangled Representations for Oro-Facial Neurological Disorder Assessment (2026.eacl-long)
Copied to clipboard
| Challenge: | Existing frameworks for diagnosing oro-facial neurological disorders are based on shared and modality-specific representations, but they are not fully disentangled. |
| Approach: | They propose a fully disentangled multimodal framework that captures vocal and facial cues. |
| Outcome: | The proposed framework achieves 98.26% accuracy and 97.51% F1-score under modality-constrained scenarios. |
Sparse Low-rank Adaptation of Pre-trained Language Models (2023.emnlp-main)
Copied to clipboard
| Challenge: | Existing methods for fine-tuning pre-trained large language models in a parameter-efficient manner are gaining traction within the research community. |
| Approach: | They propose a method of low-rank adaptation that enables dynamic adjustments to the intrinsic rank during the adaptation process. |
| Outcome: | The proposed approach outperforms the current method with a fixed and unalterable intrinsic rank and a low-rank adaptation process. |
QueryForm: A Simple Zero-shot Form Entity Query Framework (2023.findings-acl)
Copied to clipboard
Zifeng Wang, Zizhao Zhang, Jacob Devlin, Chen-Yu Lee, Guolong Su, Hao Zhang, Jennifer Dy, Vincent Perot, Tomas Pfister
| Challenge: | Form-like document understanding is a key yet under-investigated problem . endlessly training specialized models on new document types is not scalable in many practical scenarios. |
| Approach: | They propose to use large-scale query-entity pairs generated from form-like webpages to pre-train QueryForm. |
| Outcome: | The proposed framework sets state-of-the-art average F1 score on XFUND and Payment benchmarks. |
RAG-KT: Cross-platform Explainable Knowledge Tracing with Multi-view Fusion Retrieval Generation (2026.findings-acl)
Copied to clipboard
| Challenge: | Conventional Deep Learning (DL)-based KT models are tied to platform-specific identifiers and latent representations, making them hard to transfer and interpret. |
| Approach: | They propose a retrieval-augmented paradigm that frames cross-platform KT as reliable context constrained inference with LLMs. |
| Outcome: | Experiments on three public KT benchmarks show that the proposed paradigm improves accuracy and robustness, and also shows strong performance under cross-platform conditions. |
Lexical Entailment with Hierarchy Representations by Deep Metric Learning (2022.findings-emnlp)
Copied to clipboard
| Challenge: | Existing lexical entailment studies cannot be applied to words that are not included in the training dataset. |
| Approach: | They propose a method that learns a mapping from word embeddings to hierarchical embedds to predict hypernymy relations among words. |
| Outcome: | The proposed method achieves state-of-the-art performance and robustness for unknown words. |
Meta-Learning to Compositionally Generalize (2021.acl-long)
Copied to clipboard
| Challenge: | Existing studies show that neural networks struggle with compositional generalization . prior work asserts that there are fundamental differences between cognitive and connectionist architectures that make compositional globalization unlikely. |
| Approach: | They propose a meta-learning augmented version of supervised learning that optimizes for out-of-distribution generalization. |
| Outcome: | The proposed model improves generalization performance on COGS and SCAN datasets. |
RPO: Retrieval Preference Optimization for Robust Retrieval-Augmented Generation (2025.acl-long)
Copied to clipboard
| Challenge: | Large language models struggle to evaluate the correctness of non-parametric knowledge when it differs from internal memorization, leading to knowledge conflicts during response generation. |
| Approach: | They propose a lightweight alignment method to leverage multi-source knowledge based on retrieval relevance. |
| Outcome: | Experiments on four datasets show that the proposed method outperforms RAG by 4-10% in accuracy without any extra component. |
WavLLM: Towards Robust and Adaptive Speech Large Language Model (2024.findings-emnlp)
Copied to clipboard
Shujie Hu, Long Zhou, Shujie Liu, Sanyuan Chen, Lingwei Meng, Hongkun Hao, Jing Pan, Xunying Liu, Jinyu Li, Sunit Sivasankaran, Linquan Liu, Furu Wei
| Challenge: | Recent advances in large language models (LLMs) have expanded their scope to encompass multimodal functions. |
| Approach: | They propose a robust and adaptive speech large language model with dual encoders . they validate the model on universal speech benchmarks and apply it to specialized speech-question-answer datasets based on a CoT approach . |
| Outcome: | The proposed model achieves state-of-the-art performance across a range of speech tasks on the same model size. |
DISK-CSV: Distilling Interpretable Semantic Knowledge with a Class Semantic Vector (2021.eacl-main)
Copied to clipboard
| Challenge: | Neural networks (NNs) are becoming deeper and more complex, making them difficult to understand and interpret. |
| Approach: | They propose a method to distill knowledge concurrently from any neural network architecture for text classification. |
| Outcome: | The proposed method achieves better performance than the target black-box and provides better explanations than existing techniques. |
What’s Missing in Vision-Language Models? Probing Their Struggles with Causal Order Reasoning (2026.eacl-long)
Copied to clipboard
| Challenge: | Existing benchmarks often include a mixture of reasoning questions, making it difficult to truly assess VLMs’ causal reasoning abilities. |
| Approach: | They propose two new benchmarks specifically designed to isolate and rigorously evaluate VLMs’ causal reasoning abilities. |
| Outcome: | The proposed benchmarks show that vision-language models perform poorly on causal reasoning tasks, often only marginally surpassing random guessing. |
Multilingual Conceptual Coverage in Text-to-Image Models (2023.acl-long)
Copied to clipboard
| Challenge: | Neural text-to-image systems generate coherent, visually-appealing images with novel combinations of objects, scenarios, and styles. |
| Approach: | They propose a technique to benchmark the degree to which a generative text-to-image system provides multilingual parity to its training language in terms of tangible nouns. |
| Outcome: | The proposed technique can be used to benchmark T2I models in terms of multilinguality and identify model-specific weaknesses, spurious correlations, and biases without a-priori assumptions. |
Aligned Weight Regularizers for Pruning Pretrained Neural Networks (2022.findings-acl)
Copied to clipboard
| Challenge: | Pruning aims to reduce the number of parameters while maintaining performance close to the original network. |
| Approach: | They propose a self-distilled pruning strategy that maximizes representational similarity between pruned and unpruned networks. |
| Outcome: | The proposed pruning strategy outperforms smaller models and outperformed smaller ones with an equal number of parameters and is competitive against (6 times) larger distilled networks. |
From Phrases to Subgraphs: Fine-Grained Semantic Parsing for Knowledge Graph Question Answering (2025.findings-acl)
Copied to clipboard
| Challenge: | Existing approaches to knowledge graph question answering (KGQA) face semantic misalignment and reasoning noise. |
| Approach: | They propose a fine-grained semantic parsing framework for KGQA that maps natural language queries to executable logical forms. |
| Outcome: | The proposed framework achieves 18.5% performance improvement over the SOTA on a multi-hop CWQ dataset. |
Event Coreference Resolution with their Paraphrases and Argument-aware Embeddings (2020.coling-main)
Copied to clipboard
| Challenge: | Existing methods for event coreference resolution do not identify paraphrase relations between events. |
| Approach: | They propose a new event-specific paraphrase and argument-aware semantic Embedding model for event coreference resolution based on event-related paraphrases and argument embeddings . EPASE recognizes deep paraphrase relations in an event- specific context of sentences and can cover event paraphrase of more situations . |
| Outcome: | Experiments on within- and cross-document event coreference show it is superior compared to existing methods. |
Leveraging Code to Improve In-Context Learning for Semantic Parsing (2024.naacl-long)
Copied to clipboard
| Challenge: | In-context learning is an attractive approach for semantic parsing, but learning to parse to rare domain-specific languages from a few demonstrations is challenging. |
| Approach: | They propose to use Python instead of DSLs to augment prompts with a structured domain description. |
| Outcome: | The proposed approach improves accuracy and generalization across three datasets. |
Does it Really Generalize Well on Unseen Data? Systematic Evaluation of Relational Triple Extraction Methods (2022.naacl-main)
Copied to clipboard
| Challenge: | Existing extraction models memorize and recall already seen triples but cannot generalize effectively for unseen triples. |
| Approach: | They propose a method to generalize existing extraction models by rearranging datasets and augmenting test sets. |
| Outcome: | The proposed method can significantly increase the generalization performance of existing models. |
Value-Agnostic Conversational Semantic Parsing (2021.acl-long)
Copied to clipboard
Emmanouil Antonios Platanios, Adam Pauls, Subhro Roy, Yuchen Zhang, Alexander Kyte, Alan Guo, Sam Thomson, Jayant Krishnamurthy, Jason Wolfe, Jacob Andreas, Dan Klein
| Challenge: | Existing models rely on rich representations of dialogue history that include all previously generated components of the output. |
| Approach: | They propose a model that abstracts over values to focus prediction on type- and function-level context. |
| Outcome: | The proposed model outperforms baseline models by 7.3% and 10.6% on SMCalFlow and TreeDST datasets. |
Platt-Bin: Efficient Posterior Calibrated Training for NLP Classifiers (2022.findings-acl)
Copied to clipboard
| Challenge: | Existing methods for posterior calibration return uncalibrated estimations of class posteriors, thus leading to poorer generalization. |
| Approach: | They propose an end-to-end trained calibrator that directly optimizes the objective while minimizing the difference between predicted and empirical posterior probabilities. |
| Outcome: | The proposed calibrator reduces calibration error and improves performance on benchmark NLP classification tasks. |
Disentangled Sequence to Sequence Learning for Compositional Generalization (2022.acl-long)
Copied to clipboard
| Challenge: | Existing models struggle to generalize to unseen compositions of seen components . a new approach allows for disentangled representations and better generalization . |
| Approach: | They propose an extension to sequence-to-sequence models which encourage disentanglement by re-encoding source input. |
| Outcome: | The proposed extension delivers better generalization and more disentangled representations . human expressions can be understood by combining known atomic components . |
DISCO: Distilling Counterfactuals with Large Language Models (2023.acl-long)
Copied to clipboard
| Challenge: | high-quality counterfactual data is scarce for most tasks and not easily generated at scale. |
| Approach: | They propose a method for automatically generating high-quality counterfactual data at scale . they use a large general language model to generate phrasal perturbations and filter them . |
| Outcome: | The proposed method is task-agnostic and can be applied to the task of natural language inference. |
Explaining Generalization of AI-Generated Text Detectors Through Linguistic Analysis (2026.eacl-long)
Copied to clipboard
| Challenge: | Existing studies have reported generalization gaps in AI-text detectors, but they lack insights into the causes. |
| Approach: | They propose to analyze generalization behavior of AI-text detectors using linguistic analysis to explain performance variance. |
| Outcome: | The proposed model can generalize across unseen prompts, model families, and domains, but it can't generalize under distribution shifts. |
Beyond Sequences: Two-dimensional Representation and Dependency Encoding for Code Generation (2025.acl-long)
Copied to clipboard
| Challenge: | Existing code generation approaches represent code as a linear sequence of tokens, but positional encodings compromise generalization . explicit positional encoders sacrifice permutation invariance, imposes a strict order on the input sequence . |
| Approach: | They propose to represent code snippets as two-dimensional entities with explicit encodings . they propose to use dictionary learning to perform semantic matching between code lines . |
| Outcome: | The proposed model captures the hierarchical and spatial structure of code, especially the dependencies between code lines. |
Fast Randomized Low-Rank Adaptation of Pre-trained Language Models with PAC Regularization (2024.findings-acl)
Copied to clipboard
| Challenge: | Low-rank adaptation (LoRA) is an efficient way to fine-tune large language models (LLMs) but its memory overhead restricts it to scale up when the model size increases. |
| Approach: | They propose a low-rank adaptation method which decomposes model weight updates into a pair of low-ranked projection matrices and incorporates a regularizer to improve generalization. |
| Outcome: | The proposed method achieves better performance under few-shot settings and similar performance to the SOTA low-rank adaptation methods. |
ProQA: Structural Prompt-based Pre-training for Unified Question Answering (2022.naacl-main)
Copied to clipboard
Wanjun Zhong, Yifan Gao, Ning Ding, Yujia Qin, Zhiyuan Liu, Ming Zhou, Jiahai Wang, Jian Yin, Nan Duan
| Challenge: | Existing QA research on question answering is focused on specific question types, knowledge domains, or reasoning skills. |
| Approach: | They propose a unified QA paradigm that solves various tasks through a single model. |
| Outcome: | The proposed model improves QA-centric ability on 11 QA benchmarks. |
Leveraging Pretrained Models for Automatic Summarization of Doctor-Patient Conversations (2021.findings-emnlp)
Copied to clipboard
Longxiang Zhang, Renato Negrinho, Arindam Ghosh, Vasudevan Jagannathan, Hamid Reza Hassanzadeh, Thomas Schaaf, Matthew R. Gormley
| Challenge: | Using pretrained transformer models for automatically summarizing doctor-patient conversations presents challenges . limited training data, domain shift, long and noisy transcripts, and high target summary variability are challenges compared to human annotators. |
| Approach: | They propose a method for fine-tuning pretrained transformer models for automatically summarizing doctor-patient conversations directly from transcripts. |
| Outcome: | The proposed method surpasses the performance of an average human annotator and the quality of previous published work for the task. |
Margin-aware Unsupervised Domain Adaptation for Cross-lingual Text Labeling (2020.findings-emnlp)
Copied to clipboard
Dejiao Zhang, Ramesh Nallapati, Henghui Zhu, Feng Nan, Cicero Nogueira dos Santos, Kathleen McKeown, Bing Xiang
| Challenge: | Existing approaches to learn a model from labeled data are expensive or prohibitive. |
| Approach: | They propose an unsupervised domain adaptation algorithm that leverages labeled data in a source domain to learn a well-performing model in . they use the Margin Disparity Discrepancy algorithm to optimize the margin loss on the source domain. |
| Outcome: | The proposed approach improves on a recent theoretical work on cross-lingual document classification and NER by a large margin. |
Coding Agents with Multimodal Browsing are Generalist Problem Solvers (2026.findings-eacl)
Copied to clipboard
| Challenge: | specialized AI agents with task-specific tools or architectures fail to generalize beyond their intended scope. |
| Approach: | They propose a single-agent system with a modest number of general tools . they propose to generalize across software engineering, deep research and web browsing . |
| Outcome: | The proposed system achieves superior or competitive performance over specialized agents on three benchmarks. |
Improving Stability of Fine-Tuning Pretrained Language Models via Component-Wise Gradient Norm Clipping (2022.emnlp-main)
Copied to clipboard
| Challenge: | Recent studies have attributed such instability to the catastrophic forgetting problem in the top layers of PLMs. |
| Approach: | They propose a component-wise gradient norm clipping method to adjust convergence speed for different components to improve generalization performance, convergence speed, and training stability. |
| Outcome: | The proposed method achieves consistent improvements in terms of generalization performance, convergence speed, and training stability. |
Before Generation, Align it! A Novel and Effective Strategy for Mitigating Hallucinations in Text-to-SQL Generation (2024.findings-acl)
Copied to clipboard
| Challenge: | Large Language Models (LLMs) driven by In-Context Learning (ICL) have improved performance of text-to-SQL. |
| Approach: | They propose a strategy to mitigate hallucinations in large language models driven by In-Context Learning (ICL) they propose TA-SQL, a text-to-Sql framework that encourages LLMs to take advantage of similar tasks rather than starting from scratch. |
| Outcome: | The proposed framework improves the performance of the GPT-4 model by 21.23% on BIRD dev. |
Graph Transformer Networks with Syntactic and Semantic Structures for Event Argument Extraction (2020.findings-emnlp)
Copied to clipboard
| Challenge: | Existing models for Event Argument Extraction fail to exploit semantic structures of sentences to induce effective representations for EAE. |
| Approach: | They propose a novel model that exploits syntactic and semantic structures of sentences to learn more effective sentence structures for EAE. |
| Outcome: | The proposed model improves the performance of the existing models on standard datasets. |
Beyond Templates: Dynamic Adaptation of Reasoning Demonstrations via Feasibility-Aware Exploration (2026.findings-acl)
Copied to clipboard
| Challenge: | Existing reasoning datasets that are designed for powerful LLMs often lead to degraded performance when directly applied to weaker models. |
| Approach: | They propose a data adaptation framework that bridges the capability gap between expert reasoning trajectories and diverse SLMs by employing a selective imitation strategy guided by step-wise adaptability estimation via solution simulation. |
| Outcome: | The proposed framework improves generalization and data efficiency over static fine-tuning and can be applied to large models with limited model capacity. |
MMUIE: Massive Multi-Domain Universal Information Extraction for Long Documents (2026.findings-eacl)
Copied to clipboard
| Challenge: | Existing document-level information extraction systems operate at the sentence level or within narrow domains due to annotation constraints. |
| Approach: | They propose a large-scale universal dataset for multi-domain, document-level information extraction from long texts. |
| Outcome: | The proposed dataset integrates traditional knowledge bases with large language models to extract fine-grained entities, aliases, and relation triples across 34 domains. |
Quantifying Adaptability in Pre-trained Language Models with 500 Tasks (2022.naacl-main)
Copied to clipboard
| Challenge: | a recent study examines the features and limits of LM adaptability to new tasks . many questions about the nature and limits remain unanswered . |
| Approach: | They evaluate adaptability to new tasks using a new benchmark, TaskBench500 . they find adaptation procedures differ dramatically in their ability to memorize small datasets . |
| Outcome: | The proposed benchmark compares 500 procedurally generated sequence modeling tasks to a new benchmark. |
Dynamic Feature Fusion for Sign Language Translation Using HyperNetworks (2025.findings-naacl)
Copied to clipboard
| Challenge: | Using RGB and keypoint streams, sign language translation is highly dependent on the brain's ability to process color, shape, and motion simultaneously. |
| Approach: | They propose a hypernetwork-based fusion method that extracts salient features from RGB and keypoint streams and introduces self-distillation and SST contrastive learning to maintain feature advantages while aligning the global semantic space. |
| Outcome: | The proposed method achieves state-of-the-art performance on two public sign language datasets, reducing model parameters by about two-thirds. |
Selective Self-to-Supervised Fine-Tuning for Generalization in Large Language Models (2025.findings-naacl)
Copied to clipboard
| Challenge: | Large Language Models (LLMs) can be fine-tuned on task-specific data to improve performance on target tasks but can be overfitted resulting in a loss of generalization. |
| Approach: | They propose a method that uses the correct model responses from a training set to fine-tune the model using the correct response and the gold response for the remaining samples. |
| Outcome: | The proposed approach reduces model specialization during the fine-tuning stage while improving generalization. |
GIFT: Guided Fine-Tuning and Transfer for Enhancing Instruction-Tuned Language Models (2026.acl-long)
Copied to clipboard
Zhiwen Ruan, Yichao Du, Jianjie Zheng, Longyue Wang, Yun Chen, Peng Li, Jinsong Su, Yang Liu, Guanhua Chen
| Challenge: | Existing adapter-based transfer methods treat instruction-tuned models as passive targets . direct fine-tuning can disrupt this delicate balance and lead to instability or performance degradation. |
| Approach: | They propose a framework that incorporates instruction-level guidance into task adaptation. |
| Outcome: | The proposed framework outperforms direct fine-tuning and representative transfer-based baselines while maintaining robust generalization and favorable test-time scaling behavior. |
FutureTOD: Teaching Future Knowledge to Pre-trained Language Model for Task-Oriented Dialogue (2023.acl-long)
Copied to clipboard
| Challenge: | Existing pre-trained language models rely on a contrastive framework and are difficult to use in practice. |
| Approach: | They propose a dialogue pre-training model which distills future knowledge to the representation of the previous dialogue context using a self-training framework. |
| Outcome: | The proposed model can be applied to various downstream dialogue tasks. |
pair2vec: Compositional Word-Pair Embeddings for Cross-Sentence Inference (N19-1)
Copied to clipboard
| Challenge: | Existing inference models that rely heavily on unsupervised single-word embeddings struggle to learn implied relationships between pairs of words. |
| Approach: | They propose to use word embeddings to learn and use background knowledge about implied relationships between words that are crucial for cross-sentence inference problems. |
| Outcome: | The proposed models gain 2.7% on the recently released SQuAD 2.0 and 1.3% on MultiNLI, and 8.8% on the adversarial SQu AD datasets. |
Improving Generalization of Pre-trained Language Models via Stochastic Weight Averaging (2022.findings-emnlp)
Copied to clipboard
| Challenge: | Recent studies show that the flatness of the local minimum correlates well with better generalization. |
| Approach: | They propose to use a method encouraging convergence to a flatter minimum to fine-tune PLMs. |
| Outcome: | The proposed method outperforms state-of-the-art methods on NLP tasks without extra computation cost. |
Structurally Diverse Sampling for Sample-Efficient Training and Comprehensive Evaluation (2022.findings-emnlp)
Copied to clipboard
| Challenge: | Existing approaches to generalize compositionally are inadequate, but there is no evidence for this. |
| Approach: | They propose a model-agnostic algorithm for subsampling instances with diverse structures from a labeled instance pool with structured outputs. |
| Outcome: | The proposed algorithm leads to comparable or better generalization than prior algorithms in 9 out of 10 dataset-split type pairs. |
Adapting Word Embeddings to New Languages with Morphological and Phonological Subword Representations (D18-1)
Copied to clipboard
| Challenge: | Existing approaches to generalization to resource-rich languages are difficult . a recent study shows that word representations can be useful in low resource languages . |
| Approach: | They propose two approaches for improving generalization to low-resource languages by adapting continuous word representations using linguistically motivated subword units. |
| Outcome: | The proposed method improves generalization to low resource languages . it requires neither parallel corpora nor bilingual dictionaries and requires no parallel training . |
Personalized Pieces: Efficient Personalized Large Language Models through Collaborative Efforts (2024.emnlp-main)
Copied to clipboard
| Challenge: | Experimental results show Per-Pcs outperforms non-personalized and PEFT retrieval baselines, offering performance comparable to OPPU with significantly lower resource use across six tasks. |
| Approach: | They propose a framework that allows users to safely share and assemble personalized large language models using their history data. |
| Outcome: | Experimental results show that Per-Pcs outperforms non-personalized and PEFT retrieval baselines with significantly lower resource use across six tasks. |
NeuroCounterfactuals: Beyond Minimal-Edit Counterfactuals for Richer Data Augmentation (2022.findings-emnlp)
Copied to clipboard
| Challenge: | Existing approaches to produce counterfactuals rely on small perturbations via minimal edits, resulting in simplistic changes. |
| Approach: | They propose a novel approach to produce counterfactuals that allow for larger edits and linguistic diversity while still bearing similarity to the original document. |
| Outcome: | The proposed approach outperforms existing methods for generalizing natural language models under select settings. |
HOLM: Hallucinating Objects with Language Models for Referring Expression Recognition in Partially-Observed Scenes (2022.acl-long)
Copied to clipboard
| Challenge: | a challenge in building AI systems physically present in the world is partial observability, a problem that exists when the entire state of the environment is not known or available to the system. |
| Approach: | They propose a method to infer object hallucinations for the unobserved part of the environment using large pre-trained language models. |
| Outcome: | The proposed method performs better than state-of-the-art approaches on two datasets for dRER. |
A Regex Minimization Benchmark: A PSPACE-Complete Challenge for Language Models (2026.eacl-long)
Copied to clipboard
| Challenge: | Language models (LMs) have demonstrated impressive reasoning capabilities across domains . but their ability to handle PSPACE-complete problems remains underexplored . a new benchmark for regex minimization is proposed to evaluate LMs' reasoning capabilities . |
| Approach: | They propose a benchmark for regex minimization to evaluate LMs' reasoning power . they use a million regexes paired with their minimal equivalents to evaluate their performance . |
| Outcome: | The proposed model can solve NP-complete problems, but their ability to handle PSPACE-complete ones remains underexplored. |
Teaching Small Language Models to Learn Logic through Meta-Learning (2026.eacl-long)
Copied to clipboard
| Challenge: | Large language models are increasingly evaluated on reasoning tasks, yet their logical abilities remain contested. |
| Approach: | They propose to apply few-shot meta-learning to large language models' reasoning domain to enable them to acquire abstract inference patterns that generalize to novel structures. |
| Outcome: | The proposed model outperforms GPT-4o and o3-mini on a syllogistic reasoning task. |
Token Drop mechanism for Neural Machine Translation (2020.coling-main)
Copied to clipboard
| Challenge: | Neural machine translation models are vulnerable to unfamiliar inputs. |
| Approach: | They propose to drop tokens of the input sentences to improve generalization and avoid overfitting for the NMT model. |
| Outcome: | The proposed approach improves on Chinese-English and English-Romanian benchmarks and achieves significant performance improvements over baselines. |
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. |
An Empirical Study on Neural Keyphrase Generation (2021.naacl-main)
Copied to clipboard
| Challenge: | Recent years have seen a flourishing of neural keyphrase generation (KPG) works, including the release of several large-scale datasets and a host of new models to tackle them. |
| Approach: | They propose to compare the generalizability of KPG models with other models by analyzing the most crucial factors that may affect their generalizarability. |
| Outcome: | The proposed model can be used to predict keyphrases from a set of input sequences, and it can be compared with existing models. |
QBridge: Bridging Natural Language and SQL via Gold Query Rewriting with Agentic Refinement (2026.acl-long)
Copied to clipboard
| Challenge: | Natural language to SQL (NL2SQL) is an intuitive interface for querying structured data . but real user questions are noisy, ambiguous, and weakly grounded to database semantics. |
| Approach: | They propose an agentic feedback-driven NL2SQL framework that bridges natural language and SQL via Gold Query. |
| Outcome: | The proposed framework outperforms strong prompting and agentic baselines on spider, BIRD, and three robustness variants on NL2SQL. |
DEMix Layers: Disentangling Domains for Modular Language Modeling (2022.naacl-main)
Copied to clipboard
| Challenge: | Extensive experiments with autoregressive transformer LMs show that DEMix layers reduce test-time perplexity and increase training efficiency. |
| Approach: | They introduce a new domain expert mixture layer that enables conditioning a language model on the domain of the input text. |
| Outcome: | Experiments with 1.3B LMs show that DEMix layers reduce test-time perplexity, increase training efficiency, and enable rapid adaptation. |
Compositionality and Generalization In Emergent Languages (2020.acl-main)
Copied to clipboard
| Challenge: | a new study examines whether emergent languages possess compositionality . compositionality is a core concept in linguistics, but linguists' definitions assume full knowledge of primitive expressions and their combination rules. |
| Approach: | They propose to use compositionality to combine expressions according to systematic rules to refer to composite concepts. |
| Outcome: | The proposed language has compositionality, but it is not generalized, the authors show . they show that the more compositional a language is, the more easily it will be picked up by new learners . |
A Two-Stage Approach towards Generalization in Knowledge Base Question Answering (2022.findings-emnlp)
Copied to clipboard
Srinivas Ravishankar, Dung Thai, Ibrahim Abdelaziz, Nandana Mihindukulasooriya, Tahira Naseem, Pavan Kapanipathi, Gaetano Rossiello, Achille Fokoue
| Challenge: | Existing approaches for Knowledge Base Question Answering focus on a specific knowledge base or evaluating it on underlying knowledge base requires non-trivial changes. |
| Approach: | They propose a framework that separates semantic parsing from knowledge base interaction . they propose KBQA framework that allows generalization across knowledge bases . |
| Outcome: | The proposed framework achieves comparable or state-of-the-art performance on datasets with a different knowledge base. |
Meta-Learning with Variational Semantic Memory for Word Sense Disambiguation (2021.acl-long)
Copied to clipboard
| Challenge: | Existing methods for word sense disambiguation (WSD) lack large annotated datasets with sufficient coverage of words . performance of such methods lags behind fully-supervised methods . a meta-learning model is proposed to solve this problem . |
| Approach: | They propose a model of semantic memory for supervised word sense disambiguation using meta-learning. |
| Outcome: | The proposed model improves performance in few-shot WSD and produces meaning prototypes that capture similar senses of distinct words. |
Rethinking Model Selection and Decoding for Keyphrase Generation with Pre-trained Sequence-to-Sequence Models (2023.emnlp-main)
Copied to clipboard
| Challenge: | Keyphrase generation is a longstanding task in NLP with widespread applications. |
| Approach: | They propose a likelihood-based decode-select algorithm for seq2seq PLMs that improves greedy search by an average of 4.7% semantic F1 across five datasets. |
| Outcome: | The proposed algorithm improves greedy search by an average of 4.7% semantic F1 across five datasets. |
Low-Resource Domain Adaptation for Compositional Task-Oriented Semantic Parsing (2020.emnlp-main)
Copied to clipboard
| Challenge: | Recent advances in deep learning have enabled several approaches to successfully parse more complex queries, but these models require a large amount of annotated training data to parser on new domains (e.g. reminder, music). |
| Approach: | They propose a method that adapts task-oriented semantic parsers to low-resource domains and outperforms a supervised neural model at a 10-fold data reduction. |
| Outcome: | The proposed method outperforms baseline methods on a newly collected multi-domain task-oriented semantic parsing dataset (TOPv2) . |
Linguistic representations for fewer-shot relation extraction across domains (2023.acl-long)
Copied to clipboard
| Challenge: | Recent work has demonstrated the positive impact of incorporating linguistic representations as additional context and scaffolds on performance in several NLP tasks. |
| Approach: | They extend previous work to examine whether linguistic representations enhance generalizability . they incorporate syntactic and semantic graphs from off-the-shelf tools into a transformer-based architecture . |
| Outcome: | The proposed approach enhances generalization by providing cross-domain pivots . it also shows that syntactic and semantic graphs exhibit roughly equivalent utility . |
RNG-KBQA: Generation Augmented Iterative Ranking for Knowledge Base Question Answering (2022.acl-long)
Copied to clipboard
| Challenge: | Existing KBQA approaches struggle with generalization of unseen KB schema items . Rank-and-generate approach solves coverage issue with strong generalization . |
| Approach: | They propose a Rank-and-Generate approach for KBQA that uses a generation model to generalize to unseen KB schema items. |
| Outcome: | The proposed approach outperforms the prior state-of-the-art on GrailQA and WebQSP datasets. |
Named Entity Recognition via Noise Aware Training Mechanism with Data Filter (2021.findings-acl)
Copied to clipboard
| Challenge: | Existing methods for named entity recognition (NER) do not distinguish noisy from hard samples. |
| Approach: | They propose a noise-aware-with-filter method to help model identify noisy samples . they propose 'incomplete trust' loss function which boosts L CRF with a robust term . |
| Outcome: | The proposed method outperforms the existing methods on six real-world Chinese and English NER datasets. |
WaveDetect: Robust Framework for Machine-Generated Text Detection via Wavelet Transform (2026.findings-acl)
Copied to clipboard
| Challenge: | Existing methods for detecting LLM-generated texts falter when faced with adversarial perturbations, cross-domain shifts, and the rapid temporal evolution of the foundation model. |
| Approach: | They propose a framework that reformulates text detection as a signal processing task within the time-frequency domain. |
| Outcome: | The proposed framework achieves superior accuracy and robustness against sophisticated attacks and generalization across out-of-distribution topics. |
Massively Multilingual Lexical Specialization of Multilingual Transformers (2023.acl-long)
Copied to clipboard
| Challenge: | Existing work focused on lexical specialization of monolingual PLMs with immense quantities of monolinguistic constraints, but recent work shows that pretrained language models can be rewired to produce high-quality word representations and perform type-level lexicals. |
| Approach: | They propose to expose massively multilingual transformers to multilingual lexical knowledge at scale using BabelNet as a source of multilingual and cross-lingual type-level lexicon knowledge. |
| Outcome: | The proposed method shows that pretrained language models can be rewired to produce high-quality word representations and perform type-level lexical tasks. |
Experience-driven Multi-turn Reinforcement Learning for GUI Agents (2026.acl-long)
Copied to clipboard
Zhengxi Lu, Jiabo Ye, Fei Tang, Yongliang Shen, Haiyang Xu, Ziwei Zheng, Weiming Lu, Ming Yan, Fei Huang, Jun Xiao, Yueting Zhuang
| Challenge: | GUI agents have demonstrated remarkable progress in automating complex user interface interactions . training such agents for long-horizon tasks remains challenging due to limited rewards and prohibitive costs. |
| Approach: | They propose a method that leverages expert trajectories as environment experiences for on-policy multi-turn training. |
| Outcome: | The proposed method achieves significant gains over the base model with 1K public trajectories as RL experiences . it achieves competitive performance against strong baselines such as UI-TARS-7B and GPT-4o . |
Teaching LLMs to Plan, Not Just Solve: Plan Learning Boosts LLMs Generalization in Reasoning Tasks (2025.findings-emnlp)
Copied to clipboard
| Challenge: | Existing methods for reinforcement learning (RL) on self-generated data are limited in many domains. |
| Approach: | a new framework combines plan-based search with Step-level Advantage Preference Optimization to optimize plan learning. |
| Outcome: | The proposed framework improves in-domain performance and out-of-domain benchmarks. |
Unsupervised Sentence Representation Learning with Syntactically Aligned Negative Samples (2025.findings-naacl)
Copied to clipboard
| Challenge: | Existing approaches to sentence representation learning often encounter semantic inconsistencies and feature suppression. |
| Approach: | They propose a method for generating syntactically aligned negative (SAN) samples using a semantic importance-aware Masked Language Model (MLM) approach. |
| Outcome: | The proposed method produces negative samples with substantial textual overlap with the original sentences while conveying different meanings. |
Enhancing LLM Knowledge Learning through Generalization (2025.findings-emnlp)
Copied to clipboard
| Challenge: | Continued pre-training on paraphrased data has shown empirical promise for enhancing knowledge acquisition, but this approach is costly and unreliable as it relies on external models or manual effort for rewriting. |
| Approach: | They propose formatting-based data augmentation which diversifies documents conveying the same knowledge by altering document formats rather than their content. |
| Outcome: | The proposed methods improve generalization to diverse paraphrased contexts and enhance pre-training and instruction tuning. |
AD-KD: Attribution-Driven Knowledge Distillation for Language Model Compression (2023.acl-long)
Copied to clipboard
| Challenge: | Existing knowledge distillation methods focus on the transfer of model-specific knowledge but overlook data-specific information. |
| Approach: | They propose an attribution-driven knowledge distillation approach which explores the token-level rationale behind the teacher model and transfers attribution knowledge to the student model. |
| Outcome: | The proposed method outperforms state-of-the-art methods on the GLUE benchmark and shows that it is more efficient than existing methods. |
Prompting Test-Time Scaling Is A Strong LLM Reasoning Data Augmentation (2026.findings-acl)
Copied to clipboard
| Challenge: | Large language models exhibit strong reasoning when guided by chain-of-thought exemplars . collecting large, high-quality reasoning datasets remains laborious and resource-intensive . |
| Approach: | They propose a prompt-space data augmentation framework for enhancing LLM reasoning . they use a pool of 90 randomly selected reasoning instances to elicit diverse reasoning trajectories . |
| Outcome: | The proposed framework improves accuracy over small-data benchmarks and generalization on out-of-domain reasoning evaluations. |
Debate, Reflect, and Distill: Multi-Agent Feedback with Tree-Structured Preference Optimization for Efficient Language Model Enhancement (2025.findings-acl)
Copied to clipboard
| Challenge: | Existing methods for enhancing small models struggle to yield substantial and lasting performance gains. |
| Approach: | They propose a Debate and Reflect framework that orchestrates multi-turn debates between smaller models and stronger teacher models. |
| Outcome: | The proposed framework outperforms existing methods by a large margin in smaller models. |
SCENE: Self-Labeled Counterfactuals for Extrapolating to Negative Examples (2023.emnlp-main)
Copied to clipboard
| Challenge: | Manually collecting challenging negative examples can be costly and domain-specific. |
| Approach: | They propose a method that synthesizes negative examples from only positive ones using a mask infilling model. |
| Outcome: | The proposed method closes 69.6% of the performance gap on a dataset where half of the evaluation examples are unanswerable compared to a model trained on SQuAD 2.0. |
Selecting and Merging: Towards Adaptable and Scalable Named Entity Recognition with Large Language Models (2025.acl-long)
Copied to clipboard
| Challenge: | Existing approaches to align large language models with information extraction tasks are costly and not all training data benefits target domains. |
| Approach: | They propose a framework which dynamically Selects and Merges expert models at inference time and combines experts beneficial to target domains. |
| Outcome: | The proposed framework outperforms the unified model by 10% on multiple benchmarks. |
EDDA: An Encoder-Decoder Data Augmentation Framework for Zero-Shot Stance Detection (2024.lrec-main)
Copied to clipboard
| Challenge: | Existing methods for enhancing text or data are limited by lack of logical connections between generated texts and training data. |
| Approach: | They propose an encoder-decoder data augmentation framework that combines large language models and chain-of-thought prompting to summarize texts into target-specific if-then rationales, establishing logical relationships. |
| Outcome: | The proposed framework significantly improves over state-of-the-art methods on benchmark datasets while enabling interpretable rationale-based learning. |
DAGA: Data Augmentation with a Generation Approach for Low-resource Tagging Tasks (2020.emnlp-main)
Copied to clipboard
Bosheng Ding, Linlin Liu, Lidong Bing, Canasai Kruengkrai, Thien Hai Nguyen, Shafiq Joty, Luo Si, Chunyan Miao
| Challenge: | Data augmentation techniques are widely used to improve machine learning performance . however, due to the complexity of language, it is difficult to generalize such rules for languages. |
| Approach: | They propose a method to generate high quality synthetic data for low-resource tagging tasks . they use unlabeled data only and unlabelled data plus a knowledge base . |
| Outcome: | The proposed method outperforms baselines on NER, part of speech and target based sentiment analysis tasks. |
Impact of Adversarial Training on Robustness and Generalizability of Language Models (2023.findings-acl)
Copied to clipboard
| Challenge: | Adversarial training is widely acknowledged as the most effective defense against adversarial attacks, but achieving both robustness and generalization requires a trade-off. |
| Approach: | They propose to compare pre-training data augmentation and training time input perturbations with embedding space perturbations to find out whether they improve generalization. |
| Outcome: | The proposed methods improve generalization and robustness of the trained models. |
Building an English-Chinese Parallel Corpus Annotated with Sub-sentential Translation Techniques (2020.lrec-1)
Copied to clipboard
| Challenge: | a recent study shows that human translators often resort to different non-literal translation techniques besides literal translation . however, they receive less attention in developing natural language processing (NLP) applications. |
| Approach: | They propose to have a better semantic control of extracting paraphrases from bilingual parallel corpora. |
| Outcome: | The proposed method can automatically recognize different non-literal translation techniques . the results confirm the hypothesis of the proposed method . |
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. |
CoMix: Guide Transformers to Code-Mix using POS structure and Phonetics (2023.findings-acl)
Copied to clipboard
| Challenge: | Existing multilingual transformer models lack the ability to intermix words of one language into the structure of another. |
| Approach: | They propose a pretraining approach to improve representation of code-mixed data in transformer models by incorporating phonetic signals, a modified attention mechanism and weak supervision guided generation by parts-of-speech constraints. |
| Outcome: | The proposed model improves performance across four code-mixed tasks and generalizes on out-of-domain translation. |
PORTS: Preference-Optimized Retrievers for Tool Selection with Large Language Models (2025.emnlp-main)
Copied to clipboard
| Challenge: | Existing retrieval-based methods to pre-select tools are often misaligned with tool-calling LLMs due to separate training processes. |
| Approach: | They propose a method to fine-tune retrievers to find useful tools by using a frozen LLM. |
| Outcome: | The proposed method fine-tunes retrievers to find useful tools using a frozen LLM . it improves tool selection accuracy and can be generalized to new queries and tools . |
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 . |
Online Conversation Disentanglement with Pointer Networks (2020.emnlp-main)
Copied to clipboard
| Challenge: | Existing methods for disentangling textual conversations rely on dataset specific features that hinder generalization and adaptability. |
| Approach: | They propose an end-to-end online framework for conversation disentanglement that embeds the whole utterance that comprises timestamp, speaker, and message text. |
| Outcome: | The proposed method performs state-of-the-art on the Ubuntu IRC dataset and on other social and organizational platforms. |
Effects of Human Adversarial and Affable Samples on BERT Generalization (2023.findings-emnlp)
Copied to clipboard
| Challenge: | Limiting quantities of training data is considered a key impediment to achieving generalizability in machine learning. |
| Approach: | They examine the impact of training data quality, not quantity, on a model’s generalizability by comparing human-adversarial and human-affable training samples. |
| Outcome: | The proposed model performance improves with 10-30% h-adversarial instances in text classification and relation extraction tasks. |
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. |
This is not a Dataset: A Large Negation Benchmark to Challenge Large Language Models (2023.emnlp-main)
Copied to clipboard
| Challenge: | Large language models (LLMs) have grammatical knowledge but fail to interpret negation . a recent study shows that LLMs struggle with negative sentences . |
| Approach: | They propose to use a dataset to grasp LLMs' generalization and inference capability . they also fine-tuned models to assess whether the understanding of negation can be trained . |
| Outcome: | The proposed model is able to generalize and infer negation in 400,000 sentences . but it is suboptimal when it comes to negation, a key step in natural language processing . |
PKAG-DDI: Pairwise Knowledge-Augmented Language Model for Drug-Drug Interaction Event Text Generation (2025.acl-long)
Copied to clipboard
| Challenge: | Drug-drug interactions arise when multiple drugs are administered concurrently. |
| Approach: | They propose a pairwise knowledge-augmented generative method for DDIE text generation that integrates biological functions from a knowledge set into a language model. |
| Outcome: | The proposed method outperforms existing methods in DDIE text generation on two professional datasets. |
Do Neural Models Learn Systematicity of Monotonicity Inference in Natural Language? (2020.acl-main)
Copied to clipboard
| Challenge: | Despite the success of language models using neural networks, it remains unclear to what extent neural models have the generalization ability to perform inferences. |
| Approach: | They propose a method to evaluate whether neural models can learn systematicity of monotonicity inference in natural language. |
| Outcome: | The proposed method shows that neural models can perform inferences on unseen combinations of lexical and logical phenomena when syntactic structures are similar between training and test sets. |
PRISM: Probabilistic Reward Model with Inherent Structural Modeling (2026.acl-long)
Copied to clipboard
| Challenge: | Existing evaluators compress diverse human judgments into a single scalar, leading to brittle alignment and reward hacking. |
| Approach: | They propose a Gaussian-based reinterpretation of reward evaluation as a conditional distribution and a mixture of Gaussians to capture conflicting preference dimensions. |
| Outcome: | The proposed model outperforms scalar baselines in accuracy and generalization. |
Unleashing the Power of Language Models in Text-Attributed Graph (2023.findings-emnlp)
Copied to clipboard
| Challenge: | Existing studies on graph learning on text-attributed graphs have been limited by memory cost and underutilization of relationships between nodes and words. |
| Approach: | They propose a Node Representation Update Pre-training Architecture based on Co-modeling text and graph to learn representations of papers and words simultaneously. |
| Outcome: | The proposed model outperforms baselines on the ogbn-arxiv benchmark dataset. |
Entity-Based Knowledge Conflicts in Question Answering (2021.emnlp-main)
Copied to clipboard
| Challenge: | Knowledge-dependent tasks typically use two sources of knowledge: parametric, learned at training time, and contextual, given as a passage at inference time. |
| Approach: | They propose a method to mitigate over-reliance on parametric knowledge, which minimizes hallucination, and improves out-of-distribution generalization by 4% - 7%. |
| Outcome: | The proposed method minimizes hallucination and improves generalization to evolving information by 4% - 7%. |
MetaScale: Test-Time Scaling with Evolving Meta-Thoughts (2026.findings-acl)
Copied to clipboard
| Challenge: | Existing approaches impose fixed cognitive structures that enhance performance in specific tasks but lack adaptability across diverse scenarios. |
| Approach: | They propose a test-time scaling framework based on meta-thoughts to improve performance . meta-thinkts are adaptive thinking strategies tailored to a given task . |
| Outcome: | Experimental results show that MetaScale outperforms standard inference approaches . it can scale more effectively with increasing sampling budgets and produces more structured responses . |
Explaining Answers with Entailment Trees (2021.emnlp-main)
Copied to clipboard
Bhavana Dalvi, Peter Jansen, Oyvind Tafjord, Zhengnan Xie, Hannah Smith, Leighanna Pipatanangkura, Peter Clark
| Challenge: | ENTAILMENTBANK is the first dataset to contain multistep entailment trees. |
| Approach: | They propose to generate explanations in the form of entailment trees, a tree of multipremise entanglements steps from facts that are known to the hypothesis of interest. |
| Outcome: | The proposed model can generate explanations in the form of entailment trees . this is a tree of multipremise enttailment steps from facts known to the hypothesis of interest. |
Investigating Transformer-Guided Chaining for Interpretable Natural Logic Reasoning (2023.findings-acl)
Copied to clipboard
| Challenge: | Natural logic reasoning has received increasing attention lately, with several datasets and neural models proposed, though with limited success. |
| Approach: | They propose to iteratively perform 1-step neural inferences and chain together the results to generate a multi-step reasoning trace. |
| Outcome: | The proposed method has high accuracies on a multi-hop First-Order Logic (FOL) reasoning benchmark. |
Robust and Unbounded Length Generalization in Autoregressive Transformer-Based Text-to-Speech (2025.naacl-long)
Copied to clipboard
Eric Battenberg, RJ Skerry-Ryan, Daisy Stanton, Soroosh Mariooryad, Matt Shannon, Julian Salazar, David Teh-Hwa Kao
| Challenge: | Autoregressive (AR) Transformer-based sequence models have difficulty generalizing to sequences longer than those seen during training. |
| Approach: | They propose a system that provides cross-attention operations with relative location information. |
| Outcome: | The proposed system matches the naturalness and expressiveness of a baseline T5-based system while eliminating problems with repeated or dropped words. |
Facilitating Cognitive Accessibility with LLMs: A Multi-Task Approach to Easy-to-Read Text Generation (2025.emnlp-main)
Copied to clipboard
| Challenge: | Existing approaches to make complex texts more accessible for people with cognitive impairments are time-consuming and resource-intensive. |
| Approach: | They propose a multi-task learning approach that trains models jointly on text summarization, text simplification, and ETR generation. |
| Outcome: | The proposed approach outperforms other approaches in in-domain settings while achieving better generalization in out-of-domain scenarios. |
ALPS: Attention Localization and Pruning Strategy for Efficient Adaptation of Large Language Models (2025.findings-acl)
Copied to clipboard
Hao Chen, Haoze Li, Zhiqing Xiao, Lirong Gao, Qi Zhang, Xiaomeng Hu, Ningtao Wang, Xing Fu, Junbo Zhao
| Challenge: | Prior research has focused on optimizing general-purpose large language models to downstream tasks . however, these approaches inherently introduce data dependency, which hinders generalization and reusability. |
| Approach: | They propose an algorithm that localizes the most task-sensitive attention heads and prunes by restricting attention training updates to these heads, thereby reducing alignment costs. |
| Outcome: | The proposed algorithm achieves 2% performance improvement over baselines on three tasks while localizing the most task-sensitive attention heads. |
TART: Improved Few-shot Text Classification Using Task-Adaptive Reference Transformation (2023.acl-long)
Copied to clipboard
| Challenge: | Existing methods for fewshot text classification depend on inter-class variance . Existing approaches suffer from MLADA, which performs poorly on tasks with high inter- class variance whereas it fails to distinguish samples from tasks with low inter-group variance. |
| Approach: | They propose a task-adaptive reference transformation network to transform class prototypes to per-class fixed reference points in task-adapted metric spaces. |
| Outcome: | The proposed method surpasses state-of-the-art methods in 1-shot and 5-shot classifications on the 20 Newsgroups dataset. |
Generalization-Enhanced Code Vulnerability Detection via Multi-Task Instruction Fine-Tuning (2024.findings-acl)
Copied to clipboard
| Challenge: | Existing CodePre-trained models struggle to generalize due to superficial mapping from source code to labels instead of understanding the root causes of code vulnerabilities. |
| Approach: | They propose a framework that integrates multi-task learning with Large Language Models to effectively mine deep-seated vulnerability features. |
| Outcome: | The proposed framework surpasses seven state-of-the-art models in effectiveness, generalization, and robustness. |
Bridging Robustness and Generalization Against Word Substitution Attacks in NLP via the Growth Bound Matrix Approach (2025.findings-acl)
Copied to clipboard
| Challenge: | Recent studies have shown that adversarial examples can alter models' predicted sentiment due to their sensitivity to specific word choices. |
| Approach: | They propose a regularization technique to improve NLP model robustness by reducing the impact of input perturbations on model outputs. |
| Outcome: | The proposed method outperforms state-of-the-art methods in adversarial defense. |
How to Plant Trees in Language Models: Data and Architectural Effects on the Emergence of Syntactic Inductive Biases (2023.acl-long)
Copied to clipboard
| Challenge: | a recent study found that pre-training can teach language models to rely on hierarchical syntactic features . aaron ramirez: we find that pretraining on simpler language induces a hierarchic bias . |
| Approach: | They find that pre-training can teach language models to rely on hierarchical syntactic features . authors: this suggests that in cognitively plausible language acquisition settings, models may be more data-efficient . |
| Outcome: | a recent study shows that pre-training can teach language models to rely on hierarchical features . the findings suggest that in plausible language acquisition settings, language models may be more data-efficient than previously thought . |
Incorporating Instructional Prompts into a Unified Generative Framework for Joint Multiple Intent Detection and Slot Filling (2022.coling-1)
Copied to clipboard
| Challenge: | Existing approaches to multiple intent detection and slot filling focus on task-specific components to capture the relationships between intents and slots. |
| Approach: | They propose a Unified Generative framework that captures the relationships between intents and slots in an utterance and formulates the task as a question-answering problem. |
| Outcome: | The proposed framework surpasses baselines on full-data and multi-intent benchmarks on 5-shot and 10-shot scenarios. |
Quantifying Generalizations: Exploring the Divide Between Human and LLMs’ Sensitivity to Quantification (2024.acl-long)
Copied to clipboard
| Challenge: | Generics are expressions used to communicate abstractions about categories . they allow for exceptions, and they are a powerful way to express knowledge about the world . |
| Approach: | They examine how large language models interpret generics to understand their meanings . they find that the presence of a generic sentence as context influences quantifiers based on the generalization . |
| Outcome: | The proposed models do not exhibit a strong sensitivity to quantification, the study finds . the results suggest that the presence of a generic sentence as context influences quantifiers . |
End-to-End Task-Oriented Dialogue Systems Based on Schema (2023.findings-acl)
Copied to clipboard
| Challenge: | Existing approaches for task-oriented dialogue systems rely on a unified schema across domains, but we propose a schema-aware model for task oriented dialogues based on 'slots' |
| Approach: | They propose a schema-aware end-to-end neural network model for handling task-oriented dialogues based on a dynamic set of slots within a unified schema. |
| Outcome: | The proposed model performs better on a well-known dataset than baselines on 'schema-guided dialogue' systems. |
Multi-source Meta Transfer for Low Resource Multiple-Choice Question Answering (2020.acl-main)
Copied to clipboard
| Challenge: | Existing MCQA datasets are small in size, which increases difficulty of model learning and generalization. |
| Approach: | They propose a multi-source meta transfer framework for low-resource multiple-choice question answering . they extend meta learning by incorporating multiple training sources to learn a generalized feature representation across domains . |
| Outcome: | The proposed framework is independent of backbone language models and can bridge the distribution gap between training sources and target. |
LayoutDIT: Layout-Aware End-to-End Document Image Translation with Multi-Step Conductive Decoder (2023.findings-emnlp)
Copied to clipboard
| Challenge: | Existing methods struggle to capture the visual layout in complex document images. |
| Approach: | They propose to integrate layout knowledge into document image translation by using a layout-aware encoder and a multi-step conductive decoder to achieve the translation step by step. |
| Outcome: | The proposed model outperforms state-of-the-art methods with better parameter efficiency. |
TaskWeb: Selecting Better Source Tasks for Multi-task NLP (2023.emnlp-main)
Copied to clipboard
| Challenge: | Recent work in NLP has shown that knowing task relationships via pairwise task transfer improves choosing one or more source tasks that help to learn a new target task. |
| Approach: | They propose a method to quantify task relationships via pairwise task transfer and build smaller training sets that improve zero-shot performances across 11 different target tasks. |
| Outcome: | The proposed method improves overall rankings and top-k precision of source tasks by 10% and 38%, respectively. |
Who Wrote This? The Key to Zero-Shot LLM-Generated Text Detection Is GECScore (2025.coling-main)
Copied to clipboard
| Challenge: | Existing methods for detecting LLM-generated text require no training data. |
| Approach: | They propose a black-box zero-shot detection approach that calculates the Grammar Error Correction Score for a given text to differentiate between human-written and LLM-generated texts. |
| Outcome: | The proposed method outperforms current state-of-the-art zero-shot and supervised methods, achieving an average AUROC of 98.62% across XSum and Writing Prompts datasets. |
DisLoRA: Task-specific Low-Rank Adaptation via Orthogonal Basis from Singular Value Decomposition (2025.emnlp-main)
Copied to clipboard
| Challenge: | Extensive experiments on GLUE and Commonsense Reasoning benchmarks demonstrate that DisLoRA surpasses established PEFT methods, including LoRA, PiSSA, DoRA, LoRA-Dash, and SORSA. |
| Approach: | They propose a framework that leverages singular value decomposition to decompose pretrained weight matrices into orthogonal backbone and task-specific subspaces. |
| Outcome: | Extensive experiments on GLUE and Commonsense Reasoning benchmarks show that DisLoRA surpasses established PEFT methods, including LoRA, PiSSA, DoRA, LoRA-Dash, and SORSA. |
Multijugate Dual Learning for Low-Resource Task-Oriented Dialogue System (2023.findings-acl)
Copied to clipboard
| Challenge: | End-to-end task-oriented dialogue systems are expensive to annotate and lack data in real scenarios. |
| Approach: | They propose to implement dual learning in task-oriented dialogues to exploit the correlation of heterogeneous data. |
| Outcome: | The proposed method improves the effectiveness of end-to-end task-oriented dialogue systems under multiple benchmarks and obtains state-of-the-art results in low-resource scenarios. |
Large-scale Lifelong Learning of In-context Instructions and How to Tackle It (2023.acl-long)
Copied to clipboard
| Challenge: | In-context instruction learning is a method to improve the target PLM’s instance- and task-level generalization performance as it observes more tasks. |
| Approach: | They propose to fine-tune a Pre-trained Language Model (PLM) on a set of tasks with in-context instructions and to extend this property to a scenario in which tasks are fed to the target PLM in a sequential manner. |
| Outcome: | The proposed method achieves noticeable improvements in both types of generalization, nearly reaching the upper bound performance obtained through joint training. |
DemoNSF: A Multi-task Demonstration-based Generative Framework for Noisy Slot Filling Task (2023.findings-emnlp)
Copied to clipboard
Guanting Dong, Tingfeng Hui, Zhuoma GongQue, Jinxu Zhao, Daichi Guo, Gang Zhao, Keqing He, Weiran Xu
| Challenge: | Recent prompt-based generative frameworks have shown impressive capabilities in sequence labeling tasks. |
| Approach: | They propose a multi-task demonstration-based generative framework for noisy slot filling that captures input perturbations at different granularities. |
| Outcome: | The proposed framework outperforms baseline methods and achieves strong generalization. |
MMA: Cross-Domain Knowledge Integration via Mixture of Multi-Domain Agents (2025.findings-emnlp)
Copied to clipboard
| Challenge: | achieving synergistic improvements between generalization and domain specialization remains a challenge in pre-training and post-training. |
| Approach: | They propose a test-time cross-domain knowledge integration method that integrates general-purpose and domain-specific models to enhance their performance on complex, domainspecific tasks. |
| Outcome: | The proposed method combines the outputs of general-purpose and domain-specific models to improve their performance on complex, domainspecific tasks. |
Bridging the Empirical-Theoretical Gap in Neural Network Formal Language Learning Using Minimum Description Length (2024.acl-long)
Copied to clipboard
| Challenge: | Neural networks offer good approximation to many tasks but fail to reach perfect generalization. |
| Approach: | They propose to use a formal language to test whether a theoretically correct solution is not an optimum of commonly used objectives. |
| Outcome: | The proposed model fails to reach the theoretically correct solution even with regularization techniques. |
Listening Like Humans: Semantics-Guided Noise-Robust Multimodal Speech Recognition (2026.acl-long)
Copied to clipboard
| Challenge: | Severe acoustic degradation results in unreliable ASR outputs . et al., 2024b): critical concerns regarding reliability and fairness of ASR . |
| Approach: | They propose a multimodal framework that reframes ASR as semantics-guided speech reconstruction. |
| Outcome: | The proposed framework achieves an average reduction in WER while also attaining 98.71% BERTScore and 96.7% USE over advanced baselines. |
SCULPT: Systematic Tuning of Long Prompts (2025.acl-long)
Copied to clipboard
Shanu Kumar, Akhila Yesantarao Venkata, Shubhanshu Khandelwal, Bishal Santra, Parag Agrawal, Manish Gupta
| Challenge: | Existing methods for prompt optimization struggle with longer, more complex ones, often risking information loss and being sensitive to small perturbations. |
| Approach: | They propose a framework that treats prompt optimization as a hierarchical tree refinement problem and uses a Critic-Actor framework to generate reflections and apply actions to refine the prompt. |
| Outcome: | The proposed framework produces more stable and interpretable prompt modifications, ensuring better generalization across tasks. |
FIPO: Free-form Instruction-oriented Prompt Optimization with Preference Dataset and Modular Fine-tuning Schema (2025.coling-main)
Copied to clipboard
| Challenge: | naive prompts can enhance the task performance of large language models, but they are resource-intensive. |
| Approach: | They propose an automatic prompt optimization method that refines naive prompts according to task outputs from in-box testing models. |
| Outcome: | The proposed method is based on a large-scale dataset and performed fairly across multiple models. |
MULFE: A Multi-Level Benchmark for Free Text Model Editing (2024.acl-long)
Copied to clipboard
| Challenge: | Large Language Models (LLMs) have impressive capabilities in comprehending human language and vast parametric knowledge obtained from large corpora. |
| Approach: | They propose a multi-level benchmark for free text model editing to bridge the gap . they categorize probe queries into three levels of generalization . |
| Outcome: | The proposed method improves the generalization performance of large langugae models. |
Domain Generalizable AI Guardrails with Augmented Policy Training (2026.acl-long)
Copied to clipboard
| Challenge: | Current guardrails overfit the training policies, preventing adaptation to new domains and policies. |
| Approach: | They propose a training recipe that uses a suite of policy perturbation strategies to reduce overfitting and increase generalization to guardrails. |
| Outcome: | The proposed training recipe reduces overfitting and increases generalization on unseen policies and achieves comparable or better performance than existing 8B guardrails on unsen policies. |
Raise a Child in Large Language Model: Towards Effective and Generalizable Fine-tuning (2021.emnlp-main)
Copied to clipboard
| Challenge: | Recent pretrained language models extend from millions to billions of parameters. |
| Approach: | They propose a technique which forwards on a whole network while backwarding on resetting the gradients of the non-child network during the backward process. |
| Outcome: | The proposed technique outperforms the vanilla fine-tuning technique on various downstream tasks and can achieve better generalization performance by large margins. |
Improving Sequential Model Editing with Fact Retrieval (2023.findings-emnlp)
Copied to clipboard
| Challenge: | Existing methods to fix erroneous knowledge in Pre-trained Language models experience a performance decline when the number of edits increases. |
| Approach: | They propose a framework that leverages factual information to enhance editing generalization and guide the identification of edits by retrieving related facts from the fact-patch memory. |
| Outcome: | The proposed framework can improve model generalization and accuracy even with thousands of edits. |
EvoBench: Towards Real-world LLM-Generated Text Detection Benchmarking for Evolving Large Language Models (2025.findings-acl)
Copied to clipboard
| Challenge: | Existing methods to detect LLM-generated texts rely on static benchmarks that neglect the evolving nature of LLMs. |
| Approach: | They propose a benchmark to evaluate the generalization of LLM-generated text detection methods. |
| Outcome: | The proposed benchmark measures generalization of 14 detection methods across LLMs. |
Quantifying Contamination in Evaluating Code Generation Capabilities of Language Models (2024.acl-long)
Copied to clipboard
| Challenge: | Recent studies have shown that large language models are contaminated with data from pretraining and finetuning tasks. |
| Approach: | They perform extensive analysis on the factors that affect model memorization and generalization, such as model size, problem difficulty, and question length. |
| Outcome: | The results show that models perform better on the subset of the benchmarks where similar solutions are seen during training. |
1+1>2: A Synergistic Sparse and Low-Rank Compression Method for Large Language Models (2025.findings-emnlp)
Copied to clipboard
| Challenge: | Low-rank approximation compresses the model by retaining its essential structure with minimal information loss. |
| Approach: | They propose a method that leverages the strengths of pruning and low-rank approximation for LLMs. |
| Outcome: | The proposed methods surpass the existing methods on LLaMA and Qwen2.5 models. |
Rethinking RL Evaluation: Can Benchmarks Truly Reveal Failures of RL Methods? (2026.findings-acl)
Copied to clipboard
| Challenge: | Existing benchmarks for reinforcement learning for large language models do not accurately assess generalization. |
| Approach: | They propose three core principles for designing more faithful benchmarks: sufficient difficulty, balanced evaluation, and distributional robustness. |
| Outcome: | The proposed benchmarks do not accurately assess generalization across distribution shifts, difficulty levels, and counterfactual scenarios. |
Task Knowledge Injection via Interpolations and Reinstatement for Large Language Model Generalization (2025.findings-acl)
Copied to clipboard
| Challenge: | Pre-trained large language models have been widely adopted to elicit their superior performance on downstream tasks, but instruction tuning may overfit them to specific task formats, compromising their generalization on unseen tasks. |
| Approach: | They propose to inject latent task adaptation and knowledge reinstatement into large language models to mitigate spurious correlations between inputs and targets. |
| Outcome: | The proposed method improves generalization on in-domain and out-of-domain unseen tasks. |
Resource-Limited Joint Multimodal Sentiment Reasoning and Classification via Chain-of-Thought Enhancement and Distillation (2026.findings-acl)
Copied to clipboard
| Challenge: | Current approaches for Multimodal Sentiment Analysis (MSA) rely on parameter-heavy LLMs for classification, overlooking multimodal sentiment reasoning generation in resource-limited environments. |
| Approach: | They propose a multimodal sentiment reasoning distillation model that employs a teacher-assistant-student paradigm to address deployment constraints in resource-limited environments. |
| Outcome: | The proposed model performs well on a resource-limited JMSRC task with only 3B parameters and shows generalization and interpretability. |
Seen to Unseen: Exploring Compositional Generalization of Multi-Attribute Controllable Dialogue Generation (2023.acl-long)
Copied to clipboard
| Challenge: | Existing controllable dialogue generation models focus on single attribute and lack generalization capability to out-of-distribution multiple attribute combinations. |
| Approach: | They propose a compositional generalization model that learns from seen attributes and generalizes to unseen combinations. |
| Outcome: | The proposed model can learn from seen attribute values and generalize to unseen combinations. |
RaDA: Retrieval-augmented Web Agent Planning with LLMs (2024.findings-acl)
Copied to clipboard
| Challenge: | Agents powered by large language models inherit important limitations such as the restricted context length, dependency on human-engineered exemplars, and insufficient generalization. |
| Approach: | They propose a novel planning method for Web agents that disentangles planning into two stages: for a new given task, it decomposes tasks into high-level subtasks; and then iteratively synthesizes actions based on dynamically retrieved exemplars. |
| Outcome: | The proposed method decomposes tasks into high-level subtasks and iteratively synthesizes actions based on dynamically retrieved exemplars. |
ZeroNER: Fueling Zero-Shot Named Entity Recognition via Entity Type Descriptions (2025.findings-acl)
Copied to clipboard
Alessio Cocchieri, Marcos Martínez Galindo, Giacomo Frisoni, Gianluca Moro, Claudio Sartori, Giuseppe Tagliavini
| Challenge: | Existing zero-shot learning methods rely on entity type names for generalization . current solutions require large datasets and prioritize a handful of commonly occurring types . |
| Approach: | They propose a description-driven framework that enhances hard zero-shot NER in low-resource settings. |
| Outcome: | The proposed framework outperforms existing models by up to 16% in the F1 score . it also surpasses baseline models that use type names alone . |
GLUE-X: Evaluating Natural Language Understanding Models from an Out-of-Distribution Generalization Perspective (2023.findings-acl)
Copied to clipboard
Linyi Yang, Shuibai Zhang, Libo Qin, Yafu Li, Yidong Wang, Hanmeng Liu, Jindong Wang, Xing Xie, Yue Zhang
| Challenge: | Pre-trained language models (PLMs) have improved generalization performance but the out-of-distribution (OOD) generalization problem remains a challenge in many NLP tasks. |
| Approach: | They propose to create a benchmark for evaluating out-of-distribution (OOD) generalization in NLP models. |
| Outcome: | The proposed benchmarks highlight the importance of OOD robustness and provide insights on how to measure it and improve it. |
Compositional Generalization without Trees using Multiset Tagging and Latent Permutations (2023.acl-long)
Copied to clipboard
| Challenge: | Seq2seq models struggle with compositional generalization in semantic parsing, i.e. generalizing to unseen compositions or deeper recursion of phenomena that the model handles correctly in isolation. |
| Approach: | They propose a new way of parameterizing and predicting permutations by combining input tokens with multisets of output tokens and a method to backpropagate through the solver. |
| Outcome: | The proposed model outperforms pretrained models and prior work on realistic semantic parsing tasks that require generalization to longer examples. |
Neuron-Level Differentiation of Memorization and Generalization in Large Language Models (2025.emnlp-main)
Copied to clipboard
Ko-Wei Huang, Yi-Fu Fu, Ching-Yu Tsai, Yu-Chieh Tu, Tzu-ling Cheng, Cheng-Yu Lin, Yi-Ting Yang, Heng-Yi Liu, Keng-Te Liao, Da-Cheng Juan, Shou-De Lin
| Challenge: | Existing models exhibit memorization and generalization behaviors in ways that are not easily interpretable or controllable. |
| Approach: | They propose to use a GPT-2 and LLaMA-3.2 model to identify distinct neuron subsets responsible for each behavior to steer the model toward memorization or generalization. |
| Outcome: | The proposed models show that inference-time interventions on these neurons can steer the model’s behavior toward memorization or generalization. |
Sentiment Knowledge Enhanced Self-supervised Learning for Multimodal Sentiment Analysis (2023.findings-acl)
Copied to clipboard
| Challenge: | Existing studies have used general approaches to alleviate the overfitting of supervised models based on video data with sentiment annotations. |
| Approach: | They propose to capture common sentimental patterns in unlabeled videos using sentiment knowledge and non-verbal behavior to embed sentiment information into pre-trained multimodal representations. |
| Outcome: | The proposed model outperforms the baseline and achieves new State-Of-The-Art (SOTA) results. |
Generalizable Cross-Lingual Cognitive Distortion Detection with Standardized Annotations and Multi-Task Learning (2025.findings-acl)
Copied to clipboard
| Challenge: | Existing studies on cognitive distortion have limited generalizability and performance of models in large-scale and cross-linguistic contexts. |
| Approach: | They propose a multi-task learning model based on teacher student architecture solution which improves generalization performance. |
| Outcome: | The proposed model improves generalizability and interpretability of the proposed model. |
Align then Summarize: Automatic Alignment Methods for Summarization Corpus Creation (2020.lrec-1)
Copied to clipboard
| Challenge: | Summarizing text is not a straightforward task. |
| Approach: | They propose to use automated transcriptions to generate reports from automatic transcriptions as a dataset for neural summarization. |
| Outcome: | The proposed model improves on publicmeetings corpus on a dataset of aligned public meetings. |
RECALL: REpresentation-aligned Catastrophic-forgetting ALLeviation via Hierarchical Model Merging (2025.emnlp-main)
Copied to clipboard
Bowen Wang, Haiyuan Wan, Liwen Shi, Chen Yang, Peng He, Yue Ma, Haochen Han, Wenhao Li, Tiao Tan, Yongjian Li, Fangming Liu, Gong Yifan, Sheng Zhang
| Challenge: | Existing models that require task labels or performance trade-offs are susceptible to catastrophic forgetting. |
| Approach: | They propose a representation-aware model merging framework for continual learning without access to historical data. |
| Outcome: | The proposed framework outperforms baselines in knowledge retention and generalization across five NLP tasks and multiple continual learning scenarios. |
Can Post-Training Transform LLMs into Causal Reasoners? (2026.findings-acl)
Copied to clipboard
| Challenge: | Causal inference is a core component of human cognition and requires decision-makers to distinguish between causation and association. |
| Approach: | They propose a dataset comprising seven core causal tasks for training and five diverse test sets and evaluate five different post-training approaches. |
| Outcome: | The proposed model achieves 93.5% accuracy on the CaLM benchmark, compared to 55.4% by OpenAI o3. |
Cross-Domain Argument Quality Estimation (2023.findings-acl)
Copied to clipboard
| Challenge: | Argument mining is a field of automated discovery and organization of arguments. |
| Approach: | They propose to generalize argument quality estimation from multiple angles by combining empirical results with a training part. |
| Outcome: | The proposed method combines the results of two empirical evaluations with a training part to show that argument quality is among the more challenging tasks but can improve others. |
Agent-RewardBench: Towards a Unified Benchmark for Reward Modeling across Perception, Planning, and Safety in Real-World Multimodal Agents (2025.acl-long)
Copied to clipboard
| Challenge: | Multimodal Large Language Models (MLLMs) are developing but lack external feedback . there is no clear on how to select reward models for agents . |
| Approach: | They propose a benchmark to evaluate agent reward modeling ability in MLLMs . they use multiple dimensions and real-world agent scenarios evaluation . |
| Outcome: | The proposed benchmark evaluates agent performance in multimodal large language models . it covers perception, planning, and safety with 7 scenarios and is highly difficult and high-quality . |
Text Fluoroscopy: Detecting LLM-Generated Text through Intrinsic Features (2024.emnlp-main)
Copied to clipboard
| Challenge: | Large language models (LLMs) have revolutionized the field of natural language processing because of their excellent performance on various tasks. |
| Approach: | They propose a black-box method with better generalizability for detecting LLM-generated text by mining the intrinsic features of the text to be detected. |
| Outcome: | The proposed method achieves 7.36% and 2.84% improvement in detection performance compared to baselines in detecting texts from different domains generated by GPT-4 and Claude3 respectively. |
LA-UCL: LLM-Augmented Unsupervised Contrastive Learning Framework for Few-Shot Text Classification (2024.lrec-main)
Copied to clipboard
| Challenge: | Experimental results show that our model exceeds the baseline models due to the lack of cognitive ability. |
| Approach: | They propose a LLM-Augmented Unsupervised Contrastive Learning Framework which introduces a cognition-enabled Large Language Model (LLM) for efficient data augmentation and presents corresponding contrastive learning strategies. |
| Outcome: | The proposed model exceeds baseline models on six datasets. |
ReFL: Reflective Feedback Learning for Hallucination Detection of Large Language Models (2026.acl-long)
Copied to clipboard
| Challenge: | Existing methods for detecting hallucinations depend on external knowledge sources, incurring high computational costs and limiting real-time applicability, or extract the model’s internal states, leading to poor generalization. |
| Approach: | They propose a hallucination detection framework that leverages corrective in-context learning to guide LLMs to recognize their own prediction errors and adjust internal representations, critically without updating model weights. |
| Outcome: | The proposed framework outperforms existing methods on two benchmark datasets and achieves state-of-the-art performance. |
CMR Scaling Law: Predicting Critical Mixture Ratios for Continual Pre-training of Language Models (2024.emnlp-main)
Copied to clipboard
| Challenge: | Large Language Models (LLMs) excel in diverse tasks but often underperform in specialized fields due to limited domain-specific or proprietary corpus. |
| Approach: | They propose a power-law relationship between loss, mixture ratio, and training tokens scale and formalize the trade-off between general and domain-specific capabilities. |
| Outcome: | The proposed model achieves the desired domain transfer while maintaining general ability and highest utilization of available resources. |
DeepGuard: Secure Code Generation via Multi-Layer Semantic Aggregation (2026.acl-long)
Copied to clipboard
| Challenge: | Large Language Models (LLMs) can replicate insecure patterns from training data. |
| Approach: | They propose a framework that leverages distributed security-relevant cues by aggregating representations from multiple upper layers via an attention-based module. |
| Outcome: | Experiments show that the framework improves the secure-and-correct generation rate by 11.9% over baselines. |
DVMap: Fine-Grained Pluralistic Value Alignment via High-Consensus Demographic-Value Mapping (2026.acl-long)
Copied to clipboard
| Challenge: | Current Large Language Models (LLMs) rely on coarse-grained national labels for pluralistic value alignment. |
| Approach: | They propose a framework for fine-grained pluralistic value alignment using demographic constraints. |
| Outcome: | The proposed framework can identify groups with predictable, high-consensus value preference . it achieves 48.6% accuracy, surpassing open-source LLM DeepSeek-v3.2 . |
Refining Corpora from a Model Calibration Perspective for Chinese Spelling Correction (2024.findings-acl)
Copied to clipboard
| Challenge: | Chinese Spelling Correction (CSC) lacks large-scale high-quality corpora due to labor-intensive labeling of spelling errors in real-life writing or typing scenarios. |
| Approach: | They propose to use OCR/ASR-based generation to refine Chinese Spelling Correction models on random replacement-based corpora and filter them based on prediction confidence. |
| Outcome: | The proposed model outperforms existing models on three widely-used benchmarks while significantly alleviating over-correction. |
PlanGenLLMs: A Modern Survey of LLM Planning Capabilities (2025.acl-long)
Copied to clipboard
| Challenge: | Existing studies have focused on developing LLMs to automate complex planning tasks. |
| Approach: | They propose to provide a comprehensive overview of current LLM planners to fill this gap . they examine performance criteria including completeness, executability, optimality, representation, generalization, and efficiency . |
| Outcome: | The proposed survey examines performance criteria for LLM planners and highlights their strengths and weaknesses. |
Fine-Tuning Language Models on Multiple Datasets for Citation Intention Classification (2024.findings-emnlp)
Copied to clipboard
Zeren Shui, Petros Karypis, Daniel Karls, Mingjian Wen, Saurav Manchanda, Ellad Tadmor, George Karypis
| Challenge: | Prior research has shown that pretrained language models (PLMs) can achieve state-of-the-art performance on CIC benchmarks. |
| Approach: | They propose a multi-task learning framework that fine-tunes pretrained language models on a dataset of primary interest together with multiple auxiliary CIC datasets to take advantage of additional supervision signals. |
| Outcome: | The proposed framework outperforms current state-of-the-art models on small datasets while aligning with the best-performing model on a large dataset. |
DiffCL: Difference-Aware Contrastive Learning for Automatic Answer Grading with Multi-Level Semantic Modeling (2026.findings-acl)
Copied to clipboard
| Challenge: | Existing approaches to automate answer grading lack semantic understanding and scoring consistency. |
| Approach: | They propose a difference-aware AAG framework that integrates heuristic difference labeling with dual-contrastive learning. |
| Outcome: | The proposed method outperforms cross-entropy-based baselines on SciEntsBank and Beetle datasets. |
We-Math: Does Your Large Multimodal Model Achieve Human-like Mathematical Reasoning? (2025.acl-long)
Copied to clipboard
Runqi Qiao, Qiuna Tan, Guanting Dong, MinhuiWu MinhuiWu, Chong Sun, Xiaoshuai Song, Jiapeng Wang, Zhuoma GongQue, Shanglin Lei, YiFan Zhang, Zhe Wei, Miaoxuan Zhang, Runfeng Qiao, Xiao Zong, Yida Xu, Peiqing Yang, Zhimin Bao, Muxi Diao, Chen Li, Honggang Zhang
| Challenge: | Existing benchmarks focus more on end-to-end performance, but neglect the underlying principles of knowledge acquisition and generalization. |
| Approach: | They propose a benchmark specifically designed to explore the problem-solving principles by decomposing 6.5K visual math problems into 10.9K step-level questions for evaluation. |
| Outcome: | The proposed benchmark covers 6.5K visual math problems and 10.9K step-level questions spanning 5 layers of knowledge granularity and 67 hierarchical knowledge concepts. |
AdaptAgent: Adapting Multimodal Web Agents with Few-Shot Learning from Human Demonstrations (2025.acl-long)
Copied to clipboard
| Challenge: | State-of-the-art multimodal web agents can perform many web tasks by processing user instructions and interacting with graphical user interfaces (GUIs). |
| Approach: | They propose to build multimodal web agents for few-shot adaptability using human demonstrations to improve their generalization and adaptability. |
| Outcome: | The proposed framework enables both proprietary and open-weights multimodal web agents to adapt to new websites and domains using few human demonstrations. |
LLM-Symbolic Integration for Robust Temporal Tabular Reasoning (2025.findings-acl)
Copied to clipboard
| Challenge: | Existing methods for temporal tabular question answering are inconsistent and fail to provide the variability needed to thoroughly evaluate models. |
| Approach: | TEMPTABQA-C uses a synthetic dataset and symbolic representation to generate and execute SQL queries. |
| Outcome: | TEMPTABQA-C improves on previous methods for temporal tabular question answering . incorporating adaptive fewshot prompting with tailored examples improves performance . lack of robustness, scalability, and interpretable solutions is key obstacle . |
RexUIE: A Recursive Method with Explicit Schema Instructor for Universal Information Extraction (2023.findings-emnlp)
Copied to clipboard
Chengyuan Liu, Fubang Zhao, Yangyang Kang, Jingyuan Zhang, Xiang Zhou, Changlong Sun, Kun Kuang, Fei Wu
| Challenge: | Named Entity Recognition (NER) and Relation Extraction (RE) models have limited success when extracting general schemas such as quadruples and quintuples. |
| Approach: | They propose a formal formulation that covers almost all extraction schemas and a Recursive Method with Explicit Schema Instructor for UIE. |
| Outcome: | The proposed method shows strong performance under full-shot and few-shot settings and achieves state-of-the-art results on the tasks of extracting complex schemas. |
SelectLLM: Query-Aware Efficient Selection Algorithm for Large Language Models (2025.findings-acl)
Copied to clipboard
| Challenge: | Existing large language models struggle with complex tasks such as factually-grounded reasoning and planning due to inherent training biases, model size constraints, and the quality or diversity of pre-training datasets. |
| Approach: | They propose a novel algorithm to select the most suitable LLMs from a large pool and use it to efficiently generalize and perform tasks. |
| Outcome: | The proposed model outperforms existing ensemble-based baselines and achieves competitive performance with similarly sized top-performing LLMs while maintaining efficiency. |
Instant Personalized Large Language Model Adaptation via Hypernetwork (2026.acl-long)
Copied to clipboard
Zhaoxuan Tan, Zixuan Zhang, Haoyang Wen, Zheng Li, Rongzhi Zhang, Pei Chen, Fengran Mo, Zheyuan Liu, Qingkai Zeng, Qingyu Yin, Meng Jiang
| Challenge: | Existing parameter-efficient fine-tuning methods require training a separate adapter for each user, making them computationally expensive and impractical for real-time updates. |
| Approach: | They propose a scalable framework that maps a user's profile directly to a full set of adapter parameters. |
| Outcome: | The proposed framework outperforms prompt-based personalization and OPPU while using substantially fewer computational resources at deployment. |
Gradient-Guided Multi-Judge Prompt Optimization (2026.acl-long)
Copied to clipboard
ChenZhuo Zhao, Xinda Wang, Pu Zhao, Yue Huang, Junting Lu, Ziqian Liu, Qingwei Lin, Saravan Rajmohan, Dongmei Zhang
| Challenge: | Existing approaches to prompt optimization trade off signal quality against computational cost. |
| Approach: | They propose a framework that uses a first-order gradient approximation to score segment importance in a continuous masking direction. |
| Outcome: | The proposed framework improves efficiency and robustness by using a first-order gradient approximation to score segment importance in a continuous masking direction. |
SPARK: Strategic Policy-Aware Exploration via Dynamic Branching for Long-Horizon Agentic Learning (2026.acl-long)
Copied to clipboard
| Challenge: | Existing methods for training large language models waste computation budget on trivial steps while failing to guarantee sample quality. |
| Approach: | They propose a framework that selectively branches at critical decision states for resource-efficient exploration. |
| Outcome: | The proposed framework activates adaptive branching exploration at critical decision states to probe promising trajectories, thereby achieving precise resource allocation that prioritizes sampling quality over blind coverage. |
CREPE: Rapid Chest X-ray Report Evaluation by Predicting Multi-category Error Counts (2025.emnlp-main)
Copied to clipboard
| Challenge: | CREPE is a metric for rapid, interpretable, and clinically grounded automated chest X-ray report generation. |
| Approach: | They propose to use a domain-specific BERT model fine-tuned with a multi-head regression architecture to predict multi-category error counts across six clinically meaningful categories. |
| Outcome: | CREPE outperforms traditional and recent metrics on a large-scale synthetic dataset of 32,000 annotated report pairs. |
Understanding the Influence of Synthetic Data for Text Embedders (2025.findings-acl)
Copied to clipboard
| Challenge: | Recent advances in general purpose text embedders have been driven by training on synthetic training data. |
| Approach: | They propose to use GPT-4 to produce high quality synthetic data that expands existing training datasets for embeddings to new tasks. |
| Outcome: | The proposed dataset is high quality and leads to consistent improvements in performance. |
Mixture-of-Experts with Intermediate CTC Supervision for Accented Speech Recognition (2026.acl-long)
Copied to clipboard
| Challenge: | Accented speech remains a persistent challenge for automatic speech recognition (ASR) Accent-agnostic approaches improve robustness but struggle with heavily accented or unseen varieties . |
| Approach: | They propose a Mixture-of-Experts architecture with intermediate CTC supervision that promotes expert specialization and generalization. |
| Outcome: | Experiments show that the proposed architecture improves on accented speech . the proposed framework is based on a mixture-of-experts architecture with intermediate supervision . |
From Isolated Scoring to Collaborative Ranking: A Comparison-Native Framework for LLM-Based Paper Evaluation (2026.findings-acl)
Copied to clipboard
Pujun Zheng, Jiacheng Yao, Jinquan Zheng, Chenyang Gu, Guoxiu He, Jiawei Liu, Yong Huang, Tianrui Guo, Wei Lu
| Challenge: | Large language models (LLMs) are currently used to evaluate scientific papers by assigning an absolute score to each paper independently. |
| Approach: | They propose a comparison-native framework for paper evaluation that integrates comparison into both data construction and model learning. |
| Outcome: | The proposed framework achieves an average relative improvement of 21.8% over the strong baseline DeepReview-14B, while exhibiting robust generalization to five previously unseen datasets. |
Can Out-of-Distribution Evaluations Uncover Reliance on Prediction Shortcuts? A Case Study in Question Answering (2025.findings-emnlp)
Copied to clipboard
| Challenge: | Existing work assesses models’ generalization capabilities through the lens of performance on out-of-distribution (OOD) datasets. |
| Approach: | They challenge this assumption by comparing OOD evaluations with failure modes documented in existing question-answering (QA) models. |
| Outcome: | The proposed evaluations show that the models' generalization capabilities are under-performing on out-of-distribution datasets, while others are underperforming on in-difference datasets. |
Fast and Effective On-Policy Distillation from Reasoning Prefixes (2026.findings-acl)
Copied to clipboard
Dongxu Zhang, Zhichao Yang, Sepehr Janghorbani, Jun Han, Andrew Ressler II, Qian Qian, Gregory D Lyng, Sanjit Singh Batra, Robert E. Tillman
| Challenge: | On-policy distillation (OPD) requires expensive on-the-fly sampling of the student policy during training, which substantially increases training cost. |
| Approach: | They propose to use on-policy distillation to sample trajectories from student model . they propose to terminate the sampling early during distillation . |
| Outcome: | The proposed method matches the performance of full OPD in long reasoning outputs while reducing training FLOP by 2x–40x. |
MathCanvas: Intrinsic Visual Chain-of-Thought for Multimodal Mathematical Reasoning (2026.acl-long)
Copied to clipboard
Weikang Shi, Aldrich Yu, Rongyao Fang, Houxing Ren, Ke Wang, Aojun Zhou, Changyao Tian, Xinyu Fu, Yuxuan Hu, Zimu Lu, Linjiang Huang, Si Liu, Rui Liu, Hongsheng Li
| Challenge: | Existing approaches to visual chain-of-thought are limited by external tools or fail to generate high-fidelity diagrams. |
| Approach: | They propose a framework to enable large multimodal models with VCoT capabilities . they pre-train a model on a 15.2M-pair corpus and teach it how to leverage visual aids . |
| Outcome: | The proposed framework unlocks complex, human-like visual reasoning in large language models . it pre-trains the model on a 15.2M-pair corpus and fine-tunes it on MathCanvas-Instruct . |
Proactive Hearing Assistants that Isolate Egocentric Conversations (2025.emnlp-main)
Copied to clipboard
| Challenge: | Existing hearing assistants are "reactive" in that users manually prompt them to pick specific sound sources via spatial filtering or phone-based interfaces. |
| Approach: | They propose a dual-model architecture that uses the wearer's self-speech as an anchor to infer conversational partners and suppress others. |
| Outcome: | The proposed system can identify and separate conversation partners in multi-conversation settings without explicit user commands or prompts. |
Cultivating Forensic Reasoning for Generalizable Multimodal Manipulation Detection (2026.acl-long)
Copied to clipboard
| Challenge: | Existing methods for manipulation detection and grounding focus on manipulator type classification under result-oriented supervision. |
| Approach: | They propose a reasoning-driven framework that shifts learning from outcome fitting to process modeling. |
| Outcome: | The proposed framework achieves state-of-the-art with superior generalization on large-scale datasets. |
Parallel-SFT: Improving Zero-Shot Cross-Programming-Language Transfer for Code RL (2026.findings-acl)
Copied to clipboard
Zhaofeng Wu, Shiqi Wang, Boya Peng, Anuj Kumar Goyal, Melanie Kambadur, Sebastian Ruder, Yoon Kim, Chloe Bi
| Challenge: | Modern language models demonstrate impressive coding capabilities in common programming languages (PLs) but their performance in lower-resource PLs is often limited by training data availability. |
| Approach: | They propose a zero-shot cross-programming-language transfer task for code RL . they propose RL training in a source PL fails to improve performance on other target PLs . |
| Outcome: | The proposed approach improves transferability in Llama-3.1 code generation on parallel-stack model . it also improves performance on other target PLs, compared to single-PL SFT . |
Compatibility-Aware Dynamic Fine-Tuning for Large Language Models (2026.acl-long)
Copied to clipboard
| Challenge: | Recent work attributes optimization instability to the low probability of demonstrations being incompatible with the sample level. |
| Approach: | They propose a Dynamic Fine-Tuning extension of DFT that controls sample-level optimization variance. |
| Outcome: | The proposed model can generalize token-level stabilization to the sample level while remaining fully supervised and free of reward modeling. |
BYOKG-RAG: Multi-Strategy Graph Retrieval for Knowledge Graph Question Answering (2025.emnlp-main)
Copied to clipboard
Costas Mavromatis, Soji Adeshina, Vassilis N. Ioannidis, Zhen Han, Qi Zhu, Ian Robinson, Bryan Thompson, Huzefa Rangwala, George Karypis
| Challenge: | Existing approaches to knowledge graph question answering (KGQA) rely on Large Language Model (LLM) agents for graph traversal and retrieval. |
| Approach: | They propose a framework that synergizes Large Language Models with specialized graph retrieval tools to enhance KGQA. |
| Outcome: | The proposed framework outperforms the second-best graph retrieval method by 4.5% points while showing better generalization to custom KGs. |
OSCBench: Benchmarking Object State Change in Text-to-Video Generation (2026.acl-long)
Copied to clipboard
Xianjing Han, Bin Zhu, Shiqi Hu, Franklin Mingzhe Li, Patrick Carrington, Roger Zimmermann, Jingjing Chen
| Challenge: | Existing benchmarks focus on perceptual quality, text–video alignment, or physical plausibility, leaving a critical aspect of action understanding unexplored. |
| Approach: | They introduce a benchmark specifically designed to assess OSC performance in T2V models. |
| Outcome: | The proposed benchmark assesses the performance of open-source and proprietary T2V models on object state change (OSC) in the context of novel and compositional scenarios. |
Weaver: Interweaving SQL and LLM for Table Reasoning (2025.emnlp-main)
Copied to clipboard
| Challenge: | Existing approaches that combine SQL and LLM rely on rigid workflows . Tables play a critical role across various domains such as finance, healthcare and scientific research . |
| Approach: | Weaver is a modular pipeline that integrates SQL and LLM for table-based question answering. |
| Outcome: | Weaver outperforms state-of-the-art methods on four Table QA datasets. |
MIND Your Reasoning: A Meta-Cognitive Intuitive-Reflective Network for Dual-Reasoning in Multimodal Stance Detection (2026.acl-long)
Copied to clipboard
| Challenge: | Existing methods operate by learning to fuse modalities, leading to frequent misjudgments. |
| Approach: | They propose a paradigm shift from *learning to fuse* to *learning the reason's process' inspired by the dual-process theory of human cognition, MIND operationalizes a self-improving loop. |
| Outcome: | The proposed model significantly outperforms baseline models and exhibits strong generalization. |
Towards Understanding the Relationship between In-context Learning and Compositional Generalization (2024.lrec-main)
Copied to clipboard
| Challenge: | In-context learning is an inductive bias for compositional generalization, but many deep neural architectures struggle with this ability. |
| Approach: | They propose to force a causal Transformer to in-context learn to promote compositional generalization by using earlier examples to generalize to later ones. |
| Outcome: | The proposed model can solve 'ordinary' learning problems by utilizing earlier examples to generalize to later ones, i.e., in-context learning. |
Distilling the Essence, Discarding the Dross: Improving Fairness in Multimodal Large Language Models via Historical Reflection-Guided Prompt Optimization (2026.findings-acl)
Copied to clipboard
| Challenge: | Existing approaches to debiase MLLMs rely on handcrafted prompts that are brittle and difficult to generalize across tasks and bias types. |
| Approach: | They propose an adaptive self-debiasing framework that optimizes task-specific debiasers to suppress stereotypical outputs. |
| Outcome: | The proposed framework suppresses stereotypical outputs while maintaining performance. |
DiFRa: A Unified Framework for Harmonizing Semantic Diversity and Factual Consistency in Question-Answer Generation (2026.findings-acl)
Copied to clipboard
| Challenge: | Question-Answer Generation (QAG) is essential for domain-specific large language models post-training. |
| Approach: | They propose a framework that balances semantic diversity and factual consistency . they propose entropy and consistency scores that harmonize the trade-off between diversity and correctness . |
| Outcome: | The proposed framework outperforms baseline models in generating diverse QA pairs . the proposed framework harmonizes semantic entropy and consistency scores to quantify trade-off between diversity and correctness. |
Verbing Weirds Language (Models): Evaluation of English Zero-Derivation in Five LLMs (2024.lrec-main)
Copied to clipboard
| Challenge: | Lexical-syntactic flexibility is a hallmark of English morphology . conversion involves placing a word with one part of speech in a non-prototypical context . |
| Approach: | They propose to test lexical-syntactic flexibility in the form of conversion . conversion is a process where a word with one part of speech is placed in a non-prototypical context . |
| Outcome: | The proposed task tests the ability of five language models to generalize over words with a non-prototypical part of speech. |
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. |
Generalizable Prompt Tuning for Audio-Language Models via Semantic Expansion (2026.findings-acl)
Copied to clipboard
| Challenge: | Prompt tuning has achieved remarkable progress in vision–language models, but its generalization ability in ALMs remains underexplored. |
| Approach: | They propose a plug-and-play framework that regularizes the prompt embedding space . they propose introducing a semantic expansion loss with margin constraints that promote compactness . |
| Outcome: | The proposed framework regularizes the prompt embedding space by incorporating semantic neighbors generated by large language models. |
Text Detoxification: Data Efficiency, Semantic Preservation and Model Generalization (2025.emnlp-main)
Copied to clipboard
| Challenge: | Existing methods for detoxification of text often rely on manually annotated data . xiangli: "detoxification of texts is a powerful way to remove toxic content" |
| Approach: | They propose a reinforcement learning framework that optimizes detoxification and semantic preservation without annotating large amounts of data. |
| Outcome: | The proposed method overcomes major limitations and surpasses humanannotated references across multiple benchmarks. |
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. |
NormGenesis: Multicultural Dialogue Generation via Exemplar-Guided Social Norm Modeling and Violation Recovery (2025.emnlp-main)
Copied to clipboard
| Challenge: | Social norms govern culturally appropriate behavior in communication, enabling dialogue systems to produce coherent and socially acceptable outputs. |
| Approach: | They propose a framework for generating and annotating socially grounded dialogues in Chinese, English, and Korean. |
| Outcome: | The proposed framework outperforms existing frameworks in refinement quality, dialogue naturalness, and generalization performance. |
Why Does Reinforcement Learning Generalize? A Feature-Level Mechanistic Study of Post-Training in Large Language Models (2026.acl-long)
Copied to clipboard
| Challenge: | Reinforcement learning (RL)-based post-training often improves the reasoning performance of large language models beyond the training domain, while supervised fine-tuning (SFT) frequently leads to general capabilities forgetting. |
| Approach: | They propose a feature-level mechanistic analysis methodology to probe RL generalization using a controlled experimental setup. |
| Outcome: | The proposed method identifies a compact, task-agnostic set of features that directly mediate generalization across diverse tasks. |
From What Is Said to Why It Is Framed: Intent-Aware News Video Understanding (2026.findings-acl)
Copied to clipboard
| Challenge: | Existing verification methods for short-form news videos neglect communicative intent . stylistic presentation and factual manipulation are often intertwined, resulting in shortcut learning . |
| Approach: | They propose a theory-grounded representation of communicative intent that captures creator stance, audience need activation, and communication strategy. |
| Outcome: | The proposed framework captures creator stance, audience need activation, and communication strategy. |
CoDial: Interpretable Task-Oriented Dialogue Systems Through Dialogue Flow Alignment (2026.acl-long)
Copied to clipboard
| Challenge: | Recent schema-based TOD frameworks improve generalization by decoupling task logic from language understanding, but their reliance on neural or generative models obscures how task schemas influence behaviour and hence impair interpretability. |
| Approach: | They propose a framework that converts a predefined task schema to a structured heterogeneous graph and then to popular programmatic LLM guardrailing code, such as NVIDIA’s Colang. |
| Outcome: | The proposed framework achieves state-of-the-art performance on the widely used benchmark datasets while providing inherent interpretability in the design. |
Small Data, Big Noise: Adversarial Training for Robust ParameterEfficient Fine-Tuning (2026.findings-acl)
Copied to clipboard
| Challenge: | Parameter-Efficient Fine-Tuning (PEFT) is essential for adapting foundation models to downstream tasks, but current methods struggle with robustness to noise and performance degradation on limited training data. |
| Approach: | They propose a framework that brings adversarial training to PEFT to enhance model robustness and generalization, outperforming alternative approaches. |
| Outcome: | Experiments with two variants of the proposed framework show that it outperforms existing methods in low-resource settings and under word-level and character-level corruptions. |
Trajectory2Task: Training Robust Tool-Calling Agents with Synthesized Yet Verifiable Data for Complex User Intents (2026.acl-long)
Copied to clipboard
Ziyi Wang, Yuxuan Lu, Yimeng Zhang, Pei Chen, Ziwei Dong, Jing Huang, Jiri Gesi, Xianfeng Tang, Chen Luo, Qun Liu, Yisi Sang, Hanqing Lu, Manling Li, Jin Lai, Dakuo Wang
| Challenge: | Tool-calling agents are increasingly deployed in real-world customer-facing workflows . but most studies on tool-callers focus on idealized settings with general, fixed, and well-specified tasks. |
| Approach: | They propose a tool-calling agent-based data pipeline that converts trajectories into user-facing tasks with controlled intent adaptations. |
| Outcome: | The proposed pipeline can be used to study tool use under three scenarios. |
Can Small LLMs Learn a Robust Theory of Mind via RLVR? Investigating Generalization through the False-Belief Task (2026.findings-acl)
Copied to clipboard
| Challenge: | Recent advances in large language models (LLMs) have demonstrated emergent capabilities in complex reasoning, largely spurred by rule-based Reinforcement Learning (RL) techniques applied during post-training. |
| Approach: | They evaluate whether small-scale LLMs can acquire a robust and generalizable Theory of Mind (ToM) capability through RL with verifiable rewards. |
| Outcome: | The proposed model performs well on in-distribution tasks but fails to transfer to unseen ToM tasks with different characteristics. |
Rethinking Retrieval-Augmented Generation as a Cooperative Decision-Making Problem (2026.findings-acl)
Copied to clipboard
| Challenge: | Existing RAG systems rely on ranking-centric, asymmetric dependency paradigms to generate results. |
| Approach: | They propose a framework that treats the reranker and the generator as peer decision-makers rather than being connected through an asymmetric dependency pipeline. |
| Outcome: | The proposed framework treats the reranker and the generator as peer decision-makers rather than being connected through an asymmetric dependency pipeline. |