Papers by Gao Liu

348 papers
ICL CIPHERS: Quantifying ”Learning” in In-Context Learning via Substitution Ciphers (2025.emnlp-main)

Copied to clipboard

Challenge: Recent studies suggest that In-Context Learning operates in dual modes . however, disentangling these modes remains a challenging goal .
Approach: They propose a class of task reformulations based on substitution ciphers borrowed from classic cryptography.
Outcome: The proposed model can solve tasks with a BIJECTIVE mapping, but it requires 'deciphering' the latent cipher.
Tracing the Roots: A Multi-Agent Framework for Uncovering Data Lineage in Post-Training LLMs (2026.acl-long)

Copied to clipboard

Challenge: High-quality post-training data is the primary engine driving LLM capabilities . datasets are often treated as isolated artifacts, overlooking their true developmental context .
Approach: They propose a framework to reconstruct the evolutionary graph of dataset development using data lineage.
Outcome: The proposed framework characterizes domain-specific structural patterns in Math-oriented datasets and general-domain corpora.
OmniCharacter: Towards Immersive Role-Playing Agents with Seamless Speech-Language Personality Interaction (2025.acl-long)

Copied to clipboard

Challenge: Existing methods focus on replicating dialogues in textual form, neglecting the role’s voice traits as a crucial effect in interaction, which tends to be more immersive experiences in realistic scenarios.
Approach: They propose a first seamless speech-language personality interaction model to achieve immersive RPAs with low latency.
Outcome: The proposed model exhibits role-specific personality traits and vocal traits throughout the interaction, enabling a mixture of speech and language responses.
Neural Machine Translation with Contrastive Translation Memories (2022.emnlp-main)

Copied to clipboard

Challenge: Experimental results show that retrieval-augmented NMT model obtains substantial improvements over strong baselines in the benchmark dataset.
Approach: They propose a retrieval-augmented NMT model that is holistically similar to the source sentence while individually contrastive to each other.
Outcome: The proposed model improves on baselines in the translation task.
Language Models as Inductive Reasoners (2024.eacl-long)

Copied to clipboard

Challenge: Inductive reasoning is a core component of human intelligence.
Approach: They propose a task to induce natural language rules from natural language facts using natural language as representation for knowledge instead of formal language.
Outcome: The proposed task surpasses baselines in both automatic and human evaluations.
Topology Imbalance and Relation Inauthenticity Aware Hierarchical Graph Attention Networks for Fake News Detection (2022.coling-1)

Copied to clipboard

Challenge: Existing methods to detect fake news focus on mining lexical and syntactic features.
Approach: They propose a topology imbalance and Relation inauthenticity aware Hierarchical Graph Attention Networks to identify fake news on social media.
Outcome: The proposed method outperforms state-of-the-art methods on real-world datasets.
Composable Text Controls in Latent Space with ODEs (2023.emnlp-main)

Copied to clipboard

Challenge: Existing approaches to composable text operations often require plug-and-play . a single LM can perform arbitrary text operation composition in the latent space .
Approach: They propose an efficient approach for composable text operations in the latent space of text . they connect pretrained LMs to the laten space and adapt them to the space .
Outcome: The proposed approach improves on existing methods in the latent space of text.
Mixture of Diverse Size Experts (2024.emnlp-industry)

Copied to clipboard

Challenge: Recent large language models (LLMs) have shown superior performance in a variety of tasks due to the sub-linearly increasing computational costs.
Approach: They propose a new MoE architecture with designed layers where experts have different sizes to mitigate this defect.
Outcome: The proposed architecture surpasses existing MoEs by adaptively assigning the parameter budget to experts while maintaining the same total parameter size and number of experts.
Adversarial Domain Adaptation for Machine Reading Comprehension (D19-1)

Copied to clipboard

Challenge: Existing models for machine reading comprehension rely on large amounts of human-annotated in-domain data.
Approach: They propose an unsupervised domain adaptation framework for Machine Reading Comprehension where the source domain has a large amount of labeled data, while only unlabeled passages are available in the target domain.
Outcome: The proposed framework can be generalizable to different MRC models and datasets and can be extended to semi-supervised learning.
Do Large Language Models excel in Complex Logical Reasoning with Formal Language? (2025.emnlp-main)

Copied to clipboard

Challenge: Existing studies on LLMs have focused on formal language, but evaluations of their performance are limited.
Approach: They propose to use a formal language to evaluate LLMs across logical reasoning problems using formal languages.
Outcome: The proposed model outperforms Instruct models in three dimensions, taxonomy of tasks, and format of trajectories, and achieves the best generalization performance across other languages.
The Elephant in the Room: Exploring the Role of Neutral Words in Language Model Group-Agnostic Debiasing (2025.findings-acl)

Copied to clipboard

Challenge: Large Language Models (LLMs) are increasingly integrated into our daily lives, raising ethical concerns, especially about perpetuating stereotypes.
Approach: They propose a method that incorporates a neutral word semantics-based loss function to alleviate the deterioration of the LMS during debiasing.
Outcome: The proposed method alleviates the deterioration of the Language Modeling Score (LMS) by incorporating a neutral word semantics-based loss function.
Semantics of the Unwritten: The Effect of End of Paragraph and Sequence Tokens on Text Generation with GPT2 (2021.acl-srw)

Copied to clipboard

Challenge: Experimental results show that pre-trained language model GPT2 can generate better continuations by learning to generate the in the fine-tuning stage.
Approach: They conduct experiments on an English essay dataset using Chinese-GPT2 . they find that the model can generate better continuations by learning to generate the in the fine-tuning stage.
Outcome: The pre-trained language model GPT2 can generate better continuations by learning to generate the in the fine-tuning stage.
A Generative Pre-Trained Language Model for Channel Prediction in Wireless Communications Systems (2025.emnlp-main)

Copied to clipboard

Challenge: Existing model-based channel prediction methods suffer from limited accuracy due to imperfect temporal modeling, while existing AI-based methods suffers from limited generalization due to inadequate training strategies.
Approach: They propose a generative pre-trained language model for channel prediction based on channel correlation and train it based upon transformer decoder architecture.
Outcome: The proposed model can learn various channel characteristics and perform impressive tasks across multiple dimensions.
Beyond Demographics: Enhancing Cultural Value Survey Simulation with Multi-Stage Personality-Driven Cognitive Reasoning (2025.emnlp-main)

Copied to clipboard

Challenge: Introducing **MARK**, a framework for cultural value survey simulation . based on type dynamics theory, it improves accuracy and interpretation of models .
Approach: They propose a framework that integrates psychological theory into cultural value survey simulations.
Outcome: The proposed framework outperforms baseline models on the World Values Survey by 10% accuracy and reduces divergence between model predictions and human preferences.
LLMs Assist NLP Researchers: Critique Paper (Meta-)Reviewing (2024.emnlp-main)

Copied to clipboard

Challenge: a comparative analysis of paper (meta-)reviews by large language models (LLMs) aims to identify and distinguish LLMs from human activities .
Approach: They present a comparative analysis to identify and distinguish LLM activities from human activities.
Outcome: The proposed analysis aims to improve recognition of instances when someone implicitly uses LLMs for reviewing activities.
Automatic Label Sequence Generation for Prompting Sequence-to-sequence Models (2022.coling-1)

Copied to clipboard

Challenge: Prompting has shown to be sample efficient compared to fine-tuning with pre-trained models.
Approach: They propose a fully automatic prompting method that uses natural language prompts on sequence-to-sequence models and a beam search method to generate a large amount of label sequence candidates.
Outcome: The proposed method significantly outperforms other no-manual-design methods on single label words and generates large amount of label sequence candidates.
Pre-training Multi-task Contrastive Learning Models for Scientific Literature Understanding (2023.findings-emnlp)

Copied to clipboard

Challenge: Pre-trained language models (LMs) have shown effectiveness in literature understanding tasks, especially when tuned via contrastive learning.
Approach: They propose a multi-task contrastive learning framework that enables common knowledge sharing across different scientific literature understanding tasks while preventing task-specific skills from interfering with each other.
Outcome: The proposed framework outperforms state-of-the-art pre-trained language models on a comprehensive dataset.
RoadMapper: A Multi-Agent System for Roadmap Generation of Solving Complex Research Problems (2026.findings-acl)

Copied to clipboard

Challenge: Existing tools to generate structured content for research tasks are limited in their ability to generate high-quality roadmaps.
Approach: They propose a benchmark to evaluate the ability of large language models (LLMs) to generate high-quality roadmaps for solving complex research problems.
Outcome: The proposed system can improve LLMs’ ability for roadmap generation while saving 84% of the time required by human experts.
Understanding the Difficulty of Training Transformers (2020.emnlp-main)

Copied to clipboard

Challenge: Admin (Adaptive model initialization) is more stable, converges faster, and leads to better performance.
Approach: They propose a model initialization algorithm to stabilize early training and unleash its full potential in the late stage.
Outcome: The proposed model initialization method stabilizes early training and unleashes full potential in late stage.
From Adversarial Arms Race to Model-centric Evaluation: Motivating a Unified Automatic Robustness Evaluation Framework (2023.findings-acl)

Copied to clipboard

Challenge: Existing models of robustness evaluation are incomprehensive, impractical, and invalid .
Approach: They propose a framework for automatic robustness evaluation that shifts towards model-centric evaluation to further exploit the advantages of adversarial attacks.
Outcome: The proposed framework is based on a model-centric evaluation protocol and a robustness evaluation protocol.
ReviewRL: Towards Automated Scientific Review with RL (2025.emnlp-main)

Copied to clipboard

Challenge: Existing automated review systems struggle with factual accuracy, rating consistency, and analytical depth.
Approach: They propose a framework for generating comprehensive and factually grounded scientific paper reviews using supervised fine-tuning and reinforcement learning.
Outcome: The proposed framework outperforms existing methods on ICLR 2025 papers.
AgentGym2: Benchmarking Large Language Model Agents in De-Idealized Real-World Environments (2026.acl-long)

Copied to clipboard

Challenge: Existing benchmarks evaluate agents in simplified, idealized settings, relying on pre-packaged tool interfaces, overlooking critical steps, and assume inputs are clean and fully specified.
Approach: They propose a framework that evaluates language agents in simplified, idealized settings . they show that even SOTA systems like Gemini and GPT-5 struggle on AgentGym2 .
Outcome: Experiments on 15 proprietary and open-source models show that even SOTA systems like Gemini and GPT-5 struggle on AgentGym2 .
LoRAMoE: Alleviating World Knowledge Forgetting in Large Language Models via MoE-Style Plugin (2024.acl-long)

Copied to clipboard

Challenge: Experimental results show that, as the instruction data increases, LoRAMoE can significantly improve the ability to process downstream tasks, while maintaining the world knowledge stored in the LLM.
Approach: They propose a framework that introduces several low-rank adapters and integrates them by using a router network to freeze the backbone model and force a portion of LoRAs to focus on leveraging world knowledge to solve downstream tasks.
Outcome: The proposed framework freezes the backbone model and forces a portion of LoRAs to focus on leveraging world knowledge to solve downstream tasks, to alleviate world knowledge forgetting.
Towards Consistent Natural-Language Explanations via Explanation-Consistency Finetuning (2025.coling-main)

Copied to clipboard

Challenge: Large language models generate convincing, fluent explanations, but they often generate inconsistent explanations on different inputs.
Approach: They propose a method that adapts large language models to generate more consistent explanations on related examples.
Outcome: The proposed method yields a 10.0% relative explanation consistency improvement across a variety of question-answering datasets and generalizes to 7 out-of-distribution datasets not seen during finetuning (+4.5%)
IMTLab: An Open-Source Platform for Building, Evaluating, and Diagnosing Interactive Machine Translation Systems (2023.emnlp-main)

Copied to clipboard

Challenge: Existing systems that use a left-to-right completion paradigm are inefficient and expensive.
Approach: They propose an open-source end-to-end interactive machine translation system platform . they propose to use a prefix-constrained decoding approach to achieve end- to-end evaluation .
Outcome: The proposed system can guarantee high-quality, error-free translations . it uses prefix-constrained decoding and improves on previous systems .
SKEP: Sentiment Knowledge Enhanced Pre-training for Sentiment Analysis (2020.acl-main)

Copied to clipboard

Challenge: sentiment knowledge is ignored in sentiment analysis, despite its use in pretraining.
Approach: They propose to use sentiment knowledge to learn a unified sentiment representation for multiple sentiment analysis tasks.
Outcome: The proposed method outperforms strong pre-training baseline on three kinds of sentiment tasks.
Nearest Neighbor Machine Translation is Meta-Optimizer on Output Projection Layer (2023.emnlp-main)

Copied to clipboard

Challenge: Nearest Neighbor Machine Translation (kNN-MT) is a powerful domain adaptation tool . the reasons for its success have not been thoroughly investigated .
Approach: They propose to integrate pre-trained Neural Machine Translation models with token-level retrieval . they propose to implicitly execute gradient descent on the output projection layer of NMT .
Outcome: The proposed approach outperforms model fine-tuning on in-domain tests while achieving better performance on out-of-domain sets.
OpenHuEval: Evaluating Large Language Model on Hungarian Specifics (2025.findings-acl)

Copied to clipboard

Challenge: Recent advances in Large Language Models (LLMs) represent significant strides toward artificial general intelligence (AGI).
Approach: They introduce OpenHuEval, the first benchmark for LLMs focusing on the Hungarian language and specifics.
Outcome: The framework reveals intrinsic patterns and mechanisms of LLMs in non-English languages, with Hungarian serving as an example.
TritonBench: Benchmarking Large Language Model Capabilities for Generating Triton Operators (2025.findings-acl)

Copied to clipboard

Challenge: Triton is a high-level Python-like programming language for building efficient GPU kernels.
Approach: They propose a TritonBench benchmark that provides a comprehensive evaluation of Tritonic operators on widely deployed GPUs.
Outcome: The proposed benchmarks show that current LLMs struggle to generate efficient Triton operators on widely deployed GPUs aligned with industry applications.
ChartVerse: Scaling Chart Reasoning via Reliable Programmatic Synthesis from Scratch (2026.acl-long)

Copied to clipboard

Challenge: Existing open-source vision language models lack high-quality training data for chart reasoning . current models are simplistic and repetitive, while associated QA pairs are prone to hallucinations .
Approach: They propose a framework to synthesize complex charts and reliable reasoning data from scratch.
Outcome: Experimental results show that ChartVerse-8B surpasses existing models in QA and difficulty . lack of high-quality training data hampers development of open-source models .
Enhancing Parameter-efficient Fine-tuning with Simple Calibration Based on Stable Rank (2024.lrec-main)

Copied to clipboard

Challenge: Existing methods for lightweight fine-tuning are ineffective in low-resource settings but fail in high-resourced settings, leading to unreliable outcomes.
Approach: They propose a calibration strategy that takes into account the inherent variance of generalization ability in model components and potential changes during the fine-tuning process.
Outcome: The proposed calibration improves GLUE score by 3.1 points over the previous calibration method.
One Cognitive Loop Is Enough: SODA unlocks Pure-Text Spatial Reasoning in Large Language Models (2026.acl-long)

Copied to clipboard

Challenge: Existing large language models (LLMs) lack visual input, leading to errors in basic numerical comparisons.
Approach: They propose a spatial OODA framework that integrates the OODAC cognitive loop into multiple control tasks and integrates it into LLMs.
Outcome: The proposed model significantly improves the spatial reasoning capabilities of large language models across multiple scenarios including SPOD-Bench, SPACE and applications.
ExpeTrans: LLMs Are Experiential Transfer Learners (2025.acl-long)

Copied to clipboard

Challenge: Recent studies provide large language models with textual task-solving experiences via prompts to improve their performance.
Approach: They propose to use prompts to provide LLMs with textual task-solving experiences during their inference stage.
Outcome: The proposed framework improves the performance of large language models on 13 datasets.
Can Pretrained Language Models Derive Correct Semantics from Corrupt Subwords under Noise? (2023.starsem-1)

Copied to clipboard

Challenge: Existing studies have shown that Pretrained Language Models (PLMs) perform poorly under noise due to subword segmentation.
Approach: They propose a framework for subword segmentation that provides a systematic categorization of segmentation corruption under noise and evaluation protocols by generating contrastive datasets with canonical-noisy word pairs.
Outcome: The proposed framework provides a systematic categorization of segmentation corruption under noise and evaluation protocols by generating contrastive datasets with canonical-noisy word pairs.
SingaKids: A Multilingual Multimodal Dialogic Tutor for Language Learning (2025.acl-industry)

Copied to clipboard

Challenge: Empirical studies show that SingaKids provides effective dialogic teaching, benefiting learners at different performance levels.
Approach: They propose a dialogic tutor designed to facilitate language learning through picture description tasks.
Outcome: Empirical studies show that SingaKids provides effective dialogic teaching, benefiting learners at different performance levels.
Know Your Place: Diagnosing Implicit Social Adaptation Failures in Chinese Large Language Models (2026.acl-long)

Copied to clipboard

Challenge: Existing studies suggest that failures of large language models in social contexts are not due to limited linguistic competence, but to inappropriate recognition.
Approach: They propose a framework that decomposes social adaptation into three orthogonal dimensions and conduct controlled comparisons across multiple Chinese LLMs under implicit and explicit conditions.
Outcome: The proposed framework decomposes social adaptation into three orthogonal dimensions and conducts controlled comparisons across multiple Chinese LLMs under implicit and explicit conditions.
Towards Generalizable and Faithful Logic Reasoning over Natural Language via Resolution Refutation (2024.lrec-main)

Copied to clipboard

Challenge: Large language models (LLMs) have achieved significant performance in various natural language reasoning tasks, but struggle with performing first-order logic reasoning over formal logical theories expressed in natural language.
Approach: They propose a framework which introduces the paradigm of resolution refutation to solve first-order logic reasoning problems by extending reasoning rules and employing the principle of proof by contradiction.
Outcome: The proposed framework outperforms existing models while maintaining performance in simple scenarios.
Aligning Large Language Models with Implicit Preferences from User-Generated Content (2025.acl-long)

Copied to clipboard

Challenge: Existing preference learning methods rely heavily on curated data from humans or advanced LLMs, which is costly and difficult to scale.
Approach: They propose a framework that leverages implicit preferences in unlabeled user-generated content to generate preference data.
Outcome: The proposed framework transforms user-generated content into user queries and generates responses from the policy model.
Chain-of-Jailbreak Attack for Image Generation Models via Step by Step Editing (2025.findings-acl)

Copied to clipboard

Challenge: Text-based image generation models, such as Stable Diffusion and DALL-E 3, hold significant potential in content creation and publishing workflows . however, considerable efforts are being made to prevent the generation of harmful content, such abusive, violent, or pornographic material.
Approach: They propose a chain-of-jailbreak method which decomposes malicious queries into multiple sub-queries and iteratively edits images based on these sub-questions.
Outcome: The proposed method can bypass safeguards of image generation models for over 60% cases, significantly outperforms other jailbreaking methods (14%)
CodeReviewQA: The Code Review Comprehension Assessment for Large Language Models (2025.findings-acl)

Copied to clipboard

Challenge: State-of-the-art large language models (LLMs) have demonstrated impressive code generation capabilities but struggle with real-world software engineering tasks such as revising source code to address code reviews.
Approach: They propose a benchmark to evaluate large language models' ability to bridge both technical and conversational contexts by decomposing the generation task of code refinement into three essential reasoning steps.
Outcome: The proposed benchmark exposes specific model weaknesses in code review comprehension disentangled from their generative automated code refinement results.
SharedRequest: Privacy-Preserving Model-Agnostic Inference for Large Language Models (2026.acl-long)

Copied to clipboard

Challenge: Existing privacy-preserving inference methods sacrifice utility or efficiency, authors say . current approaches suffer a trilemma between privacy, utility, and efficiency, they say .
Approach: They propose a model-agnostic framework for privacy-preserving LLM inference that reformulates privacy protection at the batch level rather than the individual-prompt level.
Outcome: The proposed model-agnostic framework achieves 20% higher utility than previous models . it reduces query cost by up to 5 compared to non-batched inference .
Can’t See the Forest for the Trees: Benchmarking Multimodal Safety Awareness for Multimodal LLMs (2025.acl-long)

Copied to clipboard

Challenge: Multimodal Large Language Models (MLLMs) have expanded the capabilities of traditional language models by enabling interaction through both text and images.
Approach: They propose a multimodal safety awareness benchmark to evaluate MLLMs across 29 safety scenarios with 1,500 carefully curated image-prompt pairs.
Outcome: The proposed model is able to identify unsafe content and avoid over-sensitivity that can hinder helpfulness.
ProQA: Structural Prompt-based Pre-training for Unified Question Answering (2022.naacl-main)

Copied to clipboard

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.
A Prism Module for Semantic Disentanglement in Name Entity Recognition (P19-1)

Copied to clipboard

Challenge: Xu et al., 2015) proposed a noise reduction mechanism to disentangle semantics of words . hard and soft attention mechanisms are used to reduce noise in NLP tasks .
Approach: They propose a prism module to disentangle semantic aspects of words and reduce noise . they propose combining prism modules with downstream models to improve model performance .
Outcome: The proposed method significantly improves the performance of baselines on named entity recognition (NER) tasks.
DataFinder: Scientific Dataset Recommendation from Natural Language Descriptions (2023.acl-long)

Copied to clipboard

Challenge: Modern machine learning relies on datasets to develop and validate research ideas.
Approach: They propose a dataset recommendation system that uses a training set and an evaluation set to help people find relevant datasets.
Outcome: The proposed model finds more relevant search results than existing third-party search engines.
Z-Code++: A Pre-trained Language Model Optimized for Abstractive Summarization (2023.acl-long)

Copied to clipboard

Challenge: Z-Code++ is a pre-trained language model optimized for abstractive text summarization.
Approach: They propose a pre-trained language model optimized for abstractive text summarization that uses a two-phase pre-training technique to improve model's performance.
Outcome: The proposed model outperforms the competing models on low-resource summarization tasks in zero-shot and few-shot settings.
Adversarial Regularization as Stackelberg Game: An Unrolled Optimization Approach (2021.emnlp-main)

Copied to clipboard

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.
ALERT: An LLM-powered Benchmark for Automatic Evaluation of Recommendation Explanations (2025.naacl-long)

Copied to clipboard

Challenge: Existing benchmarks for recommendation explanation evaluation lack item diversity and user preferences data.
Approach: They propose a model-agnostic recommendation explanation evaluation benchmark based on Amazon e-commerce categories with implicit preferences . they propose two novel automatic evaluators that enable scalable and human-preference aligned evaluation of explanations .
Outcome: The proposed model-agnostic evaluation benchmark outperforms existing methods in a variety of domains.
AutoMoE: Heterogeneous Mixture-of-Experts with Adaptive Computation for Efficient Neural Machine Translation (2023.findings-acl)

Copied to clipboard

Challenge: Existing MoE designs do not consider computational constraints (e.g., FLOPs, latency) Existing works in MoE consider homogeneous design where the same number of experts of the same size are placed uniformly throughout the network.
Approach: They propose a framework for designing heterogeneous MoEs under computational constraints.
Outcome: The proposed framework achieves 4x inference speedup and FLOPs reduction over manual models and within 1 BLEU point of MoE SwitchTransformer over benchmark datasets for NMT.
More Data, More Relations, More Context and More Openness: A Review and Outlook for Relation Extraction (2020.aacl-main)

Copied to clipboard

Challenge: Existing methods for extracting relational facts from text have been successful . but with explosion of Web text, human knowledge is increasing drastically .
Approach: They propose to improve relation extraction methods to extract relational facts from text . they analyze existing methods and show promising directions towards more powerful RE .
Outcome: The proposed methods can extract relational facts from text, but they are still lacking in the current field.
The Microsoft Toolkit of Multi-Task Deep Neural Networks for Natural Language Understanding (2020.acl-demos)

Copied to clipboard

Challenge: MT-DNN is an open-source natural language understanding toolkit . it allows researchers and developers to train customized deep learning models .
Approach: They present MT-DNN, an open-source natural language understanding toolkit . it is designed to facilitate rapid customization for a broad spectrum of NLU tasks . MT supports multi-task knowledge distillation, which can substantially compress a deep neural model without significant performance drop.
Outcome: The proposed model can significantly compress a large model without significant performance drop.
R³A: Reinforced Reasoning for Relevance Assessment for RAG in User-Generated Content Platforms (2026.acl-industry)

Copied to clipboard

Challenge: Existing approaches to query–document relevance assessment are limited . ambiguous user intent and asymmetric relevance are challenges for RAG platforms .
Approach: They propose a decomposed reasoning model for relevance assessment that decomposes query intent into intent inference and evidence grounding.
Outcome: The proposed model outperforms strong baselines on offline benchmarks and achieves significant gains in large-scale online A/B testing.
Conversing by Reading: Contentful Neural Conversation with On-demand Machine Reading (P19-1)

Copied to clipboard

Challenge: a new approach to contentful neural conversation is proposed . end-to-end models are effective in learning fluent responses, but their responses are often vacuous and uninformative.
Approach: They propose a model that provides the conversation model with relevant text on the fly as a source of external knowledge.
Outcome: The proposed model improves the informativeness and diversity of generated output compared to previous methods.
Hephaestus: Improving Fundamental Agent Capabilities of Large Language Models through Continual Pre-Training (2025.naacl-long)

Copied to clipboard

Challenge: Existing LLMs often rely on complex prompting or extensive fine-tuning to introduce new capabilities while preserving strong generalizability.
Approach: They propose a large-scale pre-training corpus to enhance LLM agents' capabilities . they use 103B agent-specific data encompassing 76,537 APIs .
Outcome: The proposed training corpus outperforms open-source LLMs and commercial LLM agents on three agent benchmarks.
LLMs Trust Humans More, That’s a Problem! Unveiling and Mitigating the Authority Bias in Retrieval-Augmented Generation (2025.acl-long)

Copied to clipboard

Challenge: Large language models (LLMs) generate outputs that stray from user input or contravene established knowledge.
Approach: They propose a new phenomenon, Authority Bias, where LLMs favor one knowledge source over the other . they propose atomic information that generates conflicts and a Conflict Detection Enhanced Query framework .
Outcome: The proposed framework reduces Authority bias in large language models . it detects conflicts, performs credibility assessment on conflicting paragraphs, and detects perturbed text .
ReEval: Automatic Hallucination Evaluation for Retrieval-Augmented Large Language Models via Transferable Adversarial Attacks (2024.findings-naacl)

Copied to clipboard

Challenge: Existing static benchmarks do not guarantee that models can use the provided evidence for answering, which is essential to avoid hallucination when the required knowledge is new or private.
Approach: They propose to automatically perturb existing static one for dynamic evaluation by using a chatGPT framework and a set of open-domain QA datasets.
Outcome: The proposed framework generates new test cases on two open-domain QA datasets and is human-readable and useful to trigger hallucination in LLMs.
Textual Backdoor Attacks Can Be More Harmful via Two Simple Tricks (2022.emnlp-main)

Copied to clipboard

Challenge: Existing textual backdoor attacks are vulnerable to backdoors . researchers add extra training task to distinguish poisoned and clean data .
Approach: They propose two tricks that make existing backdoor attacks much more harmful . first trick is to add an extra task to distinguish poisoned and clean data . second trick is using all the clean training data rather than the original clean data.
Outcome: The proposed tricks can significantly improve attack performance in three tough situations including clean data fine-tuning, low-poisoning-rate, and label-consistent attacks.
LEGO-ABSA: A Prompt-based Task Assemblable Unified Generative Framework for Multi-task Aspect-based Sentiment Analysis (2022.coling-1)

Copied to clipboard

Challenge: Existing generative methods focus on a single task at a time.
Approach: They propose a unified generative multi-task framework that can solve multiple ABSA tasks . they propose to control the type of task prompts consisting of multiple element prompts .
Outcome: The proposed framework achieves state-of-the-art results in almost all ABSA tasks and competitive results in task transfer scenarios.
Adapt to Thrive! Adaptive Power-Mean Policy Optimization for Improved LLM Reasoning (2026.findings-acl)

Copied to clipboard

Challenge: Existing methods for reinforcement learning with verifiable rewards (RLVR) rely on static objective functions and rigid clipping strategies that misalign with the model’s evolving reasoning capabilities.
Approach: They propose to incorporate Power-Mean Policy Optimization (PMPO) and Feedback-Adaptive Clipping (FAC) to overcome limitations of static mechanisms.
Outcome: Extensive experiments on nine reasoning tasks show the proposed paradigm outperforms state-of-the-art methods.
Consolidation or Adaptation? PRISM: Disentangling SFT and RL Data via Gradient Concentration (2026.acl-long)

Copied to clipboard

Challenge: Existing data arbitration strategies for large language model training rely on surface-level heuristics that fail to diagnose intrinsic learning needs.
Approach: They propose a framework that arbitrates data based on its degree of cognitive conflict with the model's existing knowledge.
Outcome: Extensive experiments on WebShop and ALFWorld show that PRISM outperforms state-of-the-art hybrid methods while reducing computational costs by up to 3.22 .
HyKnow: End-to-End Task-Oriented Dialog Modeling with Hybrid Knowledge Management (2021.findings-acl)

Copied to clipboard

Challenge: Task-oriented dialog systems typically manage structured knowledge to guide goal-oriented conversations.
Approach: They propose a TOD system with hybrid knowledge management, HyKnow, which extends the belief state to manage both structured and unstructured knowledge.
Outcome: The proposed model outperforms existing TOD systems in the evaluation of a multiWOZ dataset on unstructured knowledge with strong end-to-end performance.
MINED: Probing and Updating with Multimodal Time-Sensitive Knowledge for Large Multimodal Models (2026.findings-acl)

Copied to clipboard

Challenge: Existing benchmarks for Large Multimodal Models (LMMs) are constrained by static representations, inadequately evaluating their ability to understand time-sensitive knowledge.
Approach: They propose a benchmark containing 2,104 time-sensitive knowledge samples spanning six knowledge types to evaluate temporal awareness along 6 key dimensions and 11 challenging tasks.
Outcome: The proposed benchmark measures temporal awareness along 6 key dimensions and 11 tasks, while most open-source LMMs still lack time understanding ability.
Detect Camouflaged Spam Content via StoneSkipping: Graph and Text Joint Embedding for Chinese Character Variation Representation (D19-1)

Copied to clipboard

Challenge: Currently, Chinese characters share glyph and phonetic variations to escape detection algorithms due to their complexity and complexity.
Approach: They propose a Chinese variation-enhanced Graph Embedding algorithm that can learn Chinese character embeddings and latent variation families.
Outcome: The proposed model outperforms state-of-the-art models on Chinese spam detection datasets and review datasets.
Why Should Adversarial Perturbations be Imperceptible? Rethink the Research Paradigm in Adversarial NLP (2022.emnlp-main)

Copied to clipboard

Challenge: Textual adversarial samples are often misrepresented in research on security, evaluation, explainability, and data augmentation.
Approach: They propose to use adversarial samples to evaluate their methods on security tasks to demonstrate the real-world concerns rather than developing impractical methods.
Outcome: The proposed method has higher practical value than the current benchmark.
Free Energy-Driven Reinforcement Learning with Adaptive Advantage Shaping for Unsupervised Reasoning in LLMs (2026.acl-long)

Copied to clipboard

Challenge: Existing unsupervised reinforcement learning methods lack the capacity to adapt to the model’s evolving reasoning capabilities during training.
Approach: They propose an unsupervised reinforcement learning algorithm that adapts rewards to balance consensus and exploration based on the Free Energy Principle.
Outcome: Empirical evaluations on nine datasets show that FREIA outperforms baseline methods on reasoning tasks.
Toward Structured Knowledge Reasoning: Contrastive Retrieval-Augmented Generation on Experience (2025.findings-acl)

Copied to clipboard

Challenge: Large language models struggle to infer implicit relationships embedded in tabular formats . authors introduce a framework that builds experience memory representations and enhances generalization through contrastive In-Context Learning (ICL).
Approach: They propose a framework that builds experience memory representations and enhances generalization through contrastive In-Context Learning to simulate human-like knowledge transfer.
Outcome: Experiments on Text-to-SQL and TableQA show CoRE significantly improves performance . it achieves gains of 3.44% and 4.24%, with up to 17.2% on challenging tasks .
Exploring the Universal Vulnerability of Prompt-based Learning Paradigm (2022.findings-naacl)

Copied to clipboard

Challenge: Prompt-based learning inherits the vulnerability from pre-training, where model predictions can be misled by inserting triggers into the text.
Approach: They propose a potential solution to mitigate this vulnerability by injecting triggers into pre-trained language models using only plain text.
Outcome: The proposed learning paradigm inherits the vulnerability from the pre-training stage . it can totally control or severely decrease the performance of prompt-based models .
KEPLER: A Unified Model for Knowledge Embedding and Pre-trained Language Representation (2021.tacl-1)

Copied to clipboard

Challenge: Existing language representation models (PLMs) cannot capture factual knowledge from text.
Approach: They propose a unified model for Knowledge Embedding and Pre-trained LanguagERepresentation which integrates factual knowledge into PLMs and produces effective text-enhanced KE with the strong PLM.
Outcome: The proposed model improves on existing pre-trained language representation models and improves their performance on various NLP tasks.
Knowledge-Selective Pretraining for Attribute Value Extraction (2023.findings-emnlp)

Copied to clipboard

Challenge: Existing methods for AVE are limited on rare attributes due to poor generalization ability.
Approach: They propose to leverage pretraining and transfer learning to address weaknesses in existing methods.
Outcome: The proposed method achieves new state-of-the-art performance without pretraining on rare attributes with limited training resources.
DataSeer: A Manager-Centric Collaborative Multi-Agent Framework with Multi-Branch Reasoning for Automated Insight Discovery (2026.findings-acl)

Copied to clipboard

Challenge: Existing methods for automated insight discovery lack contextual coherence and coverage due to single-path exploration.
Approach: They propose a Manager-Centric Collaborative Framework that integrates planner and executor . it ensures cross-episode contextual coherence and allows for adaptive sub-goal generation .
Outcome: The proposed framework outperforms baselines on InsightBench and Inseval.
Towards Robust Few-Shot Relation Classification: Incorporating Relation Description with Agreement (2025.findings-emnlp)

Copied to clipboard

Challenge: Existing approaches to recognize relational relationships with a few support samples are limited for unlimited queries.
Approach: They propose a simple but effective framework that uses relation descriptions as external knowledge to enhance the model’s comprehension of the relation semantics.
Outcome: The proposed framework outperforms strong baselines while being robust against various NOTA rates.
Efficient Sequence Learning with Group Recurrent Networks (N18-1)

Copied to clipboard

Challenge: Recurrent neural networks have achieved state-of-the-art results in many artificial intelligence tasks, such as language modeling, neural machine translation and speech recognition.
Approach: They propose an efficient architecture to improve the efficiency of such RNN model training by adopting the group strategy for recurrent layers while exploiting the representation rearrangement strategy between layers as well as time steps.
Outcome: The proposed architecture achieves comparable or better accuracy compared with baselines, with a much smaller number of parameters and at a lower computational cost.
Beyond Similarity: A Gradient-based Graph Method for Instruction Tuning Data Selection (2025.acl-long)

Copied to clipboard

Challenge: Existing methods for selecting training data from general datasets fail to account for the joint distribution of instructions, resulting in inefficient learning and suboptimal knowledge transfer.
Approach: They propose a method that constructs a mixed gradient-based instruction graph to capture the joint distribution and interdependencies among instructions.
Outcome: The proposed method outperforms existing methods on domain adaptation tasks and in complex, data-scarce scenarios.
MMEvol: Empowering Multimodal Large Language Models with Evol-Instruct (2025.findings-acl)

Copied to clipboard

Challenge: a new framework for image-text instruction data evolution improves MLLM performance . lack of high-quality instruction data remains a major bottleneck in ML modeling .
Approach: They propose a multimodal instruction data evolution framework that iteratively enhances data quality through fine-grained perception, cognitive reasoning, and interaction evolution.
Outcome: The proposed approach improves MLLM performance in nine vision-language tasks while using significantly less data.
Meta-Information Guided Meta-Learning for Few-Shot Relation Classification (2020.coling-main)

Copied to clipboard

Challenge: Existing meta-learning models rely on implicit instance statistics and are unreliability and weak interpretability.
Approach: They propose a meta-information guided meta-learning framework that uses semantics to guide meta- learning . experimental results demonstrate the effectiveness of the proposed framework .
Outcome: The proposed framework can establish connections between instance-based information and semantic-based data, enabling faster initialization and adaptation.
Graph Convolution for Multimodal Information Extraction from Visually Rich Documents (N19-2)

Copied to clipboard

Challenge: Visually rich documents (VRDs) present information in the form of both text and vision.
Approach: They propose a graph convolution based model to combine textual and visual information presented in VRDs.
Outcome: The proposed model outperforms existing models on two real-world datasets.
Small Pre-trained Language Models Can be Fine-tuned as Large Models via Over-Parameterization (2023.acl-long)

Copied to clipboard

Challenge: Large pre-trained language models (PLMs) have shown remarkable performance in various natural language processing tasks, outperforming small PLMs by a large margin.
Approach: They propose to scale up parameters of pre-trained language models only during fine-tuning to benefit from over-parameterization.
Outcome: The proposed approach can significantly boost the fine-tuning performance of small PLMs and even help small PDMs outperform 3 parameterized larger ones.
Mixture-of-Minds: Multi-Agent Reinforcement Learning for Table Understanding (2026.acl-long)

Copied to clipboard

Challenge: Large language models (LLMs) have shown promise on understanding and reasoning over tables, but current approaches remain limited.
Approach: They propose a multi-agent framework that decomposes table reasoning into three specialized roles: planning, coding, and answering.
Outcome: The proposed framework decomposes table reasoning into three specialized roles: planning, coding, and answering.
GODBench: A Benchmark for Multimodal Large Language Models in Video Comment Art (2025.acl-long)

Copied to clipboard

Challenge: Existing benchmarks for video comment art are constrained by their limited modalities and insufficient categories, hindering creativity in video-based comment art creation.
Approach: They propose a benchmark that integrates video and text modalities to evaluate MLLMs’ abilities to compose video Comment art.
Outcome: The proposed framework integrates video and text modalities to evaluate MLLMs’ abilities to compose video comment art.
2INER: Instructive and In-Context Learning on Few-Shot Named Entity Recognition (2023.findings-emnlp)

Copied to clipboard

Challenge: Named Entity Recognition (NER) tasks are a fundamental task of natural language processing (NLP).
Approach: They propose a text-to-text framework for Few-Shot Named Entity Recognition (NER) that employs instruction finetuning and auxiliary tasks to enhance the model's understanding of entity types in the overall semantic context of a sentence.
Outcome: The proposed framework outperforms existing Few-Shot NER methods and remains competitive with state-of-the-art NER algorithms.
Beyond Black-Box Interventions: Latent Probing for Faithful Retrieval-Augmented Generation (2026.findings-acl)

Copied to clipboard

Challenge: Existing approaches to improve contextual faithfulness treat the LLM as a black box, generating responses that are inconsistent with the provided context.
Approach: They propose a framework for faithful RAG that operates in three stages: (i) fine-grained knowledge pruning to filter irrelevant context, (ii) latent conflict probing to identify hard conflicts in the model’s latent space, and (iv) conflict-aware attention to modulate attention heads toward faithful context integration.
Outcome: Experiments show that ProbeRAG significantly improves both accuracy and contextual faithfulness.
“What Do You Mean by That?” A Parser-Independent Interactive Approach for Enhancing Text-to-SQL (2020.emnlp-main)

Copied to clipboard

Challenge: In Natural Language Interfaces to Databases systems, text-to-SQL parsers allow users to query databases by using natural language questions.
Approach: They propose a parser-independent interactive approach that interacts with users using multi-choice questions and can easily work with arbitrary parsers.
Outcome: The proposed approach improves performance with limited interaction turns by using simulation and human evaluation on two cross-domain datasets with five state-of-the-art parsers.
LLM Critics Help Catch Bugs in Mathematics: Towards a Better Mathematical Verifier with Natural Language Feedback (2025.findings-acl)

Copied to clipboard

Challenge: Existing mathematical verifiers are trained with binary classification labels, which are not informative enough for the model to accurately assess the solutions.
Approach: They propose a natural language feedback-enhanced verifier that can validate the correctness of response generated by policy models by constructing automatically generated training data and a two-stage training paradigm.
Outcome: The proposed verifier significantly improves in verification and reinforcement learning and alleviates data-demanding problems of the reward model.
Reasoning Like Program Executors (2022.emnlp-main)

Copied to clipboard

Challenge: Existing language models are inadequate in reasoning, according to studies . a new reasoning pre-training paradigm is based on pretraining language models with programs .
Approach: They propose a reasoning pre-training paradigm that empowers language models to harvest reasoning knowledge possessed by program executors.
Outcome: The proposed reasoning pre-training paradigm can boost models' reasoning skills . it can be instantiated by different kinds of program executors and run on a single database .
RL-Guider: Leveraging Historical Decisions and Feedback for Drug Editing with Large Language Models (2025.findings-acl)

Copied to clipboard

Challenge: RLs can be used to refine drugs by iterative conversations with domain experts . existing methods do not leverage past knowledge, but human experts develop intuition over time through historical experience .
Approach: They propose a reinforcement-learning agent to provide suggestions to large language models . RL-Guider leverages the “world-level” knowledge of LLMs and historical feedback .
Outcome: a new reinforcement-learning agent improves the performance of large language models . the proposed agent leverages the “world-level” knowledge of LLMs and historical feedback .
IHEval: Evaluating Language Models on Following the Instruction Hierarchy (2025.naacl-long)

Copied to clipboard

Challenge: Instruction-tuned language models (LMs) are increasingly deployed as interactive services across various applications.
Approach: They propose a benchmark to evaluate models' ability to follow the instruction hierarchy by comparing their models to a set of benchmarks.
Outcome: The proposed benchmark covers 3,538 examples across nine tasks covering cases where instructions in different priorities either align or conflict.
UNIMO: Towards Unified-Modal Understanding and Generation via Cross-Modal Contrastive Learning (2021.acl-long)

Copied to clipboard

Challenge: Existing pre-training methods focus on single-modal tasks or multi-modal ones . large-scale pre- training has drawn much attention in both the community of Compute Vision (CV) and Natural Language Processing (NLP).
Approach: They propose a UNIfied-MOdal pre-training architecture which can adapt to both single-modal and multi-modal understanding and generation tasks.
Outcome: The proposed model can learn more generalizable representations with rich non-paired single-modal data.
Token-wise Curriculum Learning for Neural Machine Translation (2021.findings-emnlp)

Copied to clipboard

Challenge: Existing curriculum learning approaches to Neural Machine Translation (NMT) require sampling sufficient amounts of “easy” samples from training data at the early stage of training.
Approach: They propose a token-wise curriculum learning approach that creates sufficient amounts of easy samples from training data.
Outcome: The proposed approach outperforms baselines on five language pairs on low-resource languages.
M-SENA: An Integrated Platform for Multimodal Sentiment Analysis (2022.acl-demo)

Copied to clipboard

Challenge: M-SENA is an open-source platform for multimodal sentiment analysis.
Approach: They propose to use a platform for multimodal sentiment analysis to facilitate advanced research by providing flexible toolkits, reliable benchmarks, and intuitive demonstrations.
Outcome: The proposed framework provides reliable benchmarks and baseline results of different modality features and MSA benchmarks.
Empowering Large Language Model for Continual Video Question Answering with Collaborative Prompting (2024.emnlp-main)

Copied to clipboard

Challenge: Existing VideoQA models struggle to adapt to new questions or tasks posed by newly available content.
Approach: They propose a continual learning framework that fine-tunes a large language model for a sequence of tasks and integrates specific question constraint prompting, knowledge acquisition prompting and visual temporal awareness prompting.
Outcome: The proposed model achieves 55.14% accuracy on both NExT-QA and DramaQA datasets and 71.24% accuracy for DramaQA.
Reward Mixology: Crafting Hybrid Signals for Reinforcement Learning Driven In-Context Learning (2025.findings-emnlp)

Copied to clipboard

Challenge: Existing methods for in-context learning (ICL) performance rely on quality and ordering of demonstrations.
Approach: They propose a method that models iterative demonstration selection as a Markov Decision Process and craft hybrid reward signals.
Outcome: The proposed method combines outcome-based accuracy signals with process-oriented signals like stepwise influence and label entropy improvement.
UniConv: Unifying Retrieval and Response Generation for Large Language Models in Conversations (2025.acl-long)

Copied to clipboard

Challenge: Existing conversational search systems are usually built with two different models . this separation restricts the system from leveraging the model's intrinsic knowledge simultaneously . Existing studies for developing unified models cannot fully address the aspects of understanding conversational context, managing retrieval independently, and generating responses.
Approach: They propose to unify dense retrieval and response generation for large language models in conversation by fine-tuning and mitigating data discrepancy.
Outcome: The proposed model can outperform existing models on five conversational search datasets and reduce inconsistency risks while mitigating data discrepancy.
Self-Polish: Enhance Reasoning in Large Language Models via Problem Refinement (2023.findings-emnlp)

Copied to clipboard

Challenge: Existing prompting methods have been used to enhance multistep reasoning capabilities of large language models, but they have overlooked the potential of formulating higher-quality problems.
Approach: They propose a method that starts from the problem side and refines problems to be more comprehensible and solvable for models.
Outcome: The proposed method achieves notable and consistent effectiveness on five reasoning benchmarks across different models.
Depth Growing for Neural Machine Translation (P19-1)

Copied to clipboard

Challenge: Neural machine translation models with tens and even more than a hundred blocks have shown effectiveness in image recognition.
Approach: They propose a two-stage approach with three specially designed components to construct deeper NMT models.
Outcome: The proposed approach improves on WMT14 EnglishGerman and EnglishFrench translation tasks.
Beyond Decoder-only: Large Language Models Can be Good Encoders for Machine Translation (2025.findings-acl)

Copied to clipboard

Challenge: Recent advances in machine translation have focused on a single pre-trained decoder . encoder-decoder architectures have received relatively little attention in NMT .
Approach: They propose a method that leverages LLMs as MT encoders and pairs them with lightweight decoders to develop universal translation models.
Outcome: The proposed method matches or surpasses baselines in terms of translation quality but achieves 75% reduction in memory footprint of the KV cache.
BacktrackAgent: Enhancing GUI Agent with Error Detection and Backtracking Mechanism (2025.emnlp-main)

Copied to clipboard

Challenge: Existing GUI agents focus on enhancing the accuracy of individual actions and lack effective mechanisms for detecting and recovering from errors.
Approach: They propose a framework that incorporates a backtracking mechanism to enhance the task completion capabilities of GUI agents by verifier, judger, and reflector components.
Outcome: The proposed framework improves task success rate and step accuracy on Mobile3M and Auto-UI benchmarks.
Enabling Lightweight Fine-tuning for Pre-trained Language Model Compression based on Matrix Product Operators (2021.acl-long)

Copied to clipboard

Challenge: Existing methods for pre-trained language models (PLMs) use parameter reduction techniques.
Approach: They propose a pre-trained language model compression approach based on the matrix product operator from quantum many-body physics.
Outcome: The proposed approach can decompose an original matrix into central tensors and auxiliary tenses . it can be applied to the original or compressed PLMs in a general way, with a lighter network .
Amphista: Bi-directional Multi-head Decoding for Accelerating LLM Inference (2025.naacl-long)

Copied to clipboard

Challenge: Existing methods such as Medusa lack adequate information interaction between different drafting heads.
Approach: They propose an enhanced speculative decoding framework that builds upon Medusa and integrates a drafting block capable of parallel inference.
Outcome: The proposed framework outperforms Medusa in terms of head accuracy and latency.
RACQC: Advanced Retrieval-Augmented Generation for Chinese Query Correction (2025.findings-emnlp)

Copied to clipboard

Challenge: Large language models (LLMs) exhibit remarkable capabilities across many tasks, but face critical challenges in the CSC scenario: (1) poor generalization to rare entities in open-domain searches; and (2) failure to adapt to temporal entity variations due to static parameters, resulting in serious over-correction issues.
Approach: They propose a Chinese Spelling Check system with RAG and multi-task learning that integrates dynamic knowledge retrieval and entity-centric RAG to address rare entities.
Outcome: The proposed system outperforms existing baselines in the CSC task and achieves a maximum improvement of +9.92% on the search scenario benchmark and +3.2% on the general-domain dataset.
Graph vs. Sequence: An Empirical Study on Knowledge Forms for Knowledge-Grounded Dialogue (2023.emnlp-main)

Copied to clipboard

Challenge: Knowledge-grounded dialogue systems can generate informative responses based on dialogue history and external knowledge source.
Approach: They conduct a thorough experiment to determine the optimal knowledge form, mutual effects between knowl- edge and model selection, and the few-shot performance of knowledge.
Outcome: The proposed method combines knowledge-grounded dialogue with human-generated dialogues to generate informative and meaningful responses.
Beyond Single-View Detection: A Dual-Space Reasoning Framework for Interpretable Harmful Meme Understanding (2026.acl-long)

Copied to clipboard

Challenge: Existing methods for identifying harmful memes rely on modal alignment or black-box classifiers . BPDMoE-Hate provides visual explanations for viewpoint selection and hierarchical structuring .
Approach: They propose a framework that conceptualizes harmful meme detection as a process of "viewpoint decoupling and hierarchical fusion" they propose BPDMoE-Hate, which generates adversarial binary perspectives via VLMs and incorporates an adaptive viewpoint gating to facilitate viewpoint selection.
Outcome: The proposed framework surpasses existing methods in performance and provides visual explanations for viewpoint selection and hierarchical structuring.
MMAC: A Multilingual, Multimodal Alignment Framework for Cultural Grounding Evaluation (2026.acl-long)

Copied to clipboard

Challenge: Existing models lack cultural alignment across modalities and languages . a new framework to assess cultural awareness across linguistics and languages is needed .
Approach: They propose a framework that integrates tri-modally aligned cultural benchmarks and a five-dimensional evaluation protocol to assess cross-country awareness disparities.
Outcome: The proposed framework assesses cultural awareness disparities across modalities and languages . it is the first dataset aligned at the input level across text, image, and speech .
BioGen: Generating Biography Summary under Table Guidance on Wikipedia (2021.findings-acl)

Copied to clipboard

Challenge: Existing methods for summarizing text have not captured the salient information from an article.
Approach: They propose a table-guided abstractive biography summarization that utilizes factual tables to capture important information and generate a summary of a biography.
Outcome: The proposed method is the first large-scale biography summarization dataset with tables.
Alexa Conversations: An Extensible Data-driven Approach for Building Task-oriented Dialogue Systems (2021.naacl-demos)

Copied to clipboard

Challenge: Traditional goal-oriented dialogue systems require annotations which are hard to obtain for every new domain, limiting scalability.
Approach: They propose a data-driven approach to building goal-oriented dialogue systems . they use a seed dialogue simulator to generate annotated conversations instead of collecting annotations .
Outcome: The proposed system improves turn-level action signature prediction accuracy by 50% . the system is scalable, extensible and data efficient .
A Survey of Post-Training Scaling in Large Language Models (2025.acl-long)

Copied to clipboard

Challenge: Large language models (LLMs) have demonstrated proficiency in understanding and generating human natural languages.
Approach: They propose a framework for scaling large language models using supervised fine-tuning, RLxF and test-time compute methodologies.
Outcome: The proposed model can be used to understand and generate human natural languages.
McBE: A Multi-task Chinese Bias Evaluation Benchmark for Large Language Models (2025.findings-acl)

Copied to clipboard

Challenge: Existing datasets on bias evaluation for large language models focus on English and North American culture and are limited to one task.
Approach: They propose to evaluate Chinese language models' biases from multiple perspectives using a multi-task Chinese Bias Evaluation Benchmark.
Outcome: The proposed model covers 12, 82 subcategories and 5 evaluation tasks covering a wide range of categories and content diversity.
WaterSeeker: Pioneering Efficient Detection of Watermarked Segments in Large Documents (2025.findings-naacl)

Copied to clipboard

Challenge: Existing methods focus on distinguishing fully watermarked text from non-watermarked text, overlooking real-world scenarios where LLMs generate only brief segments within longer documents.
Approach: They propose a method to detect watermarked segments in large documents using an anomaly extraction method and a local traversal.
Outcome: The proposed method achieves a superior balance between detection accuracy and computational efficiency.
Classical Sequence Match Is a Competitive Few-Shot One-Class Learner (2022.coling-1)

Copied to clipboard

Challenge: Existing models that use transformers are unable to learn new knowledge in the few-shot scenarios.
Approach: They propose a few-shot one-class problem which takes a known sample as a reference to detect whether an unknown instance belongs to the same class.
Outcome: The proposed method significantly outperforms transformer models under meta-learning and fine-tuning.
Iterative Self-Tuning LLMs for Enhanced Jailbreaking Capabilities (2025.naacl-long)

Copied to clipboard

Challenge: Recent research shows that Large Language Models (LLMs) are vulnerable to automated jailbreak attacks.
Approach: They propose a framework that crafts adversarial LLMs with enhanced jailbreak ability.
Outcome: ADV-LLM significantly reduces the computational cost of generating adversarial suffixes while achieving nearly 100% ASR on various open-source LLMs.
Can Language Models Follow Multiple Turns of Entangled Instructions? (2025.findings-emnlp)

Copied to clipboard

Challenge: Despite of significant achievements in improving instruction-following capabilities of large language models, the ability to process multiple potentially entangled or conflicting instructions remains a considerable challenge.
Approach: They construct multi-turn instruction with 1.1K high-quality multi-turned conversations using the human-in-the-loop approach and examine their capabilities.
Outcome: The proposed model shows that it is difficult to integrate multiple turns and balance competing objectives when instructions intersect or conflict.
Spotlighter: Revisiting Prompt Tuning from a Representative Mining View (2025.findings-emnlp)

Copied to clipboard

Challenge: Spotlighter is a lightweight token-selection framework that enhances accuracy and efficiency in prompt tuning.
Approach: They propose a token-selection framework that enhances accuracy and efficiency in prompt tuning by preserving only the top-scoring tokens for downstream prediction.
Outcome: The proposed framework outperforms CLIP by up to 11.19% in harmonic mean accuracy and achieves 0.8K additional FPS, with only 21 extra parameters.
Simple but Effective Compound Geometric Operations for Temporal Knowledge Graph Completion (2024.acl-long)

Copied to clipboard

Challenge: Current methods embed factual knowledge into continuous vector space and apply geometric operations to learn potential patterns in temporal knowledge graphs.
Approach: They propose a temporal knowledge graph completion method that uses two geometric operations to learn missing facts in temporal graphs.
Outcome: The proposed method significantly outperforms existing temporal knowledge graph embedding models.
Parameter-Efficient Mixture-of-Experts Architecture for Pre-trained Language Models (2022.coling-1)

Copied to clipboard

Challenge: Recent results show that the mix-of-experts architecture is parameter inefficient . large-scale pre-trained language models can achieve excellent performance in many NLP tasks.
Approach: They propose to build a parameter-efficient mix-of-experts architecture by sharing information across experts.
Outcome: The proposed architecture increases model capacity without increasing computation costs.
Stochastic Answer Networks for Machine Reading Comprehension (P18-1)

Copied to clipboard

Challenge: Several recent MRC models employ multi-step reasoning . we show that the use of a stochastic prediction dropout improves robustness .
Approach: They propose a stochastic answer network that simulates multi-step reasoning in machine reading comprehension.
Outcome: The proposed model improves robustness and results competitive with state-of-the-art models on the Stanford Question Answering Dataset and Microsoft MAchine Reading COmprehension Dataset.
HyperEdit: Unlocking Instruction-based Text Editing in LLMs via Hypernetworks (2026.findings-acl)

Copied to clipboard

Challenge: Existing approaches treat instruction-based text editing as a generic text generation problem. Existing methods either over-edit or fail to apply modifications consistently.
Approach: They propose a framework that processes each editing request to best align with it.
Outcome: The proposed framework achieves 9% improvement over the state-of-the-art model.
CompassVerifier: A Unified and Robust Verifier for LLMs Evaluation and Outcome Reward (2025.emnlp-main)

Copied to clipboard

Challenge: Existing approaches lack robustness to handle complex edge cases and generalizability across different domains.
Approach: They develop an accurate and lightweight verifier model for evaluation and outcome reward that matches unstructured outputs against standard answers.
Outcome: The proposed model can process multiple answer types including multi-subproblems, formulas, and sequence answers while identifying abnormal/invalid responses.
LogicPro: Improving Complex Logical Reasoning via Program-Guided Learning (2025.acl-long)

Copied to clipboard

Challenge: LogicPro is a data synthesis method that uses LeetCode-style algorithm problems and their corresponding Program solutions to generate complex logic data.
Approach: They propose a new method which leverages LeetCode-style algorithm Problems and their corresponding Program solutions to synthesize complex logic data in text format.
Outcome: The proposed method outperforms existing models for BBH27, LogicBench, DROP, AR-LSAT, and GSM8K, and a wide range of reasoning datasets.
OpenNRE: An Open and Extensible Toolkit for Neural Relation Extraction (D19-3)

Copied to clipboard

Challenge: OpenNRE provides a framework to implement neural relation extraction (RE) . the toolkit provides various functional modules based on TensorFlow and PyTorch .
Approach: OpenNRE is an open-source framework to implement neural relation extraction models. they also release an online system to meet real-time extraction without any training and deployment.
Outcome: OpenNRE provides a framework to implement neural models for relation extraction (RE) the toolkit also includes an online system to meet real-time extraction without training and deployment .
Task-Aware Specialization for Efficient and Robust Dense Retrieval for Open-Domain Question Answering (2023.acl-short)

Copied to clipboard

Challenge: Existing dense retrieval models are parameter-inefficient and underperform sparse counterparts.
Approach: They propose a task-aware specialization for dEnse Retrieval architecture that enables parameter sharing by interleaving shared and specialized blocks in a single encoder.
Outcome: The proposed architecture surpasses BM25 on questions and passages using 60% of the parameters as bi-encoder dense retrievers.
IntactKV: Improving Large Language Model Quantization by Keeping Pivot Tokens Intact (2024.findings-acl)

Copied to clipboard

Challenge: Existing quantization methods are compromising performance of large language models (LLMs) despite their high computational intensity, LLMs are still demanding intensive computation.
Approach: They propose to generate the KV cache of pivot tokens losslessly from the full-precision model.
Outcome: The proposed method generates the KV cache of pivot tokens losslessly from the full-precision model with no extra inference overhead.
Multilingual Machine Translation with Open Large Language Models at Practical Scale: An Empirical Study (2025.naacl-long)

Copied to clipboard

Challenge: Large language models (LLMs) have shown continuously improving multilingual capabilities.
Approach: They evaluate the ability of open LLMs to handle multilingual machine translation tasks using a parallel-first monolingual-second data mixing strategy.
Outcome: The proposed model outperforms state-of-the-art models and achieves competitive performance with Google Translate and GPT-4-turbo.
TRUST: Towards Robust Social Bot Detection via Uncertainty-Guided Pseudo-Labeling and Graph Structure Purification (2026.findings-acl)

Copied to clipboard

Challenge: Existing graph-based detection models are vulnerable to deceptive message propagation, where bots deliberately interact with legitimate users.
Approach: They propose a framework to mitigate deceptive message propagation by node-level uncertainty estimation and graph structure purification.
Outcome: The proposed framework improves on three benchmark datasets and six GNN backbones on real-world social bots.
One LLM Does Not Simulate All Students: Ability-Aware Student Simulation via Cognitive Diagnosis Guided LLM Assignment (2026.findings-acl)

Copied to clipboard

Challenge: Existing methods rely on a single high-capacity LLM to represent an entire population of diverse learners.
Approach: They propose an ability-aware student simulation framework that matches students with appropriate LLM backbones through cognitive alignment.
Outcome: The proposed framework significantly reduces simulation bias and outperforms single-model baselines across the entire proficiency spectrum.
Outcome Accuracy is Not Enough: Aligning the Reasoning Process of Reward Models (2026.acl-long)

Copied to clipboard

Challenge: Recent studies observe a phenomenon where reward models achieve high accuracy on static datasets but fail to generalize effectively during RLHF.
Approach: They propose a method that combines rationale consistency with outcome accuracy to improve performance on RM-Bench and JudgeBench.
Outcome: The proposed method surpasses baselines on RM-Bench and JudgeBench by an average of 5% and improves creative writing tasks by 7%.
Tears or Cheers? Benchmarking LLMs via Culturally Elicited Distinct Affective Responses (2026.acl-long)

Copied to clipboard

Challenge: Culture is a fundamental determinant of human affective processing and affective perceptions are often limited by declarative knowledge or established societal customs.
Approach: They propose a multimodal benchmark that leverages LLM-generated provisional labels to isolate cross-cultural emotional distinctions.
Outcome: The proposed benchmark captures cross-cultural emotional distinctions and derives reliable ground-truth annotations through human evaluation.
Process-Supervised Reward Models for Verifying Clinical Note Generation: A Scalable Approach Guided by Domain Expertise (2025.emnlp-main)

Copied to clipboard

Challenge: Currently, no automated, scalable method exists to evaluate the quality of LLM-generated clinical notes, leaving manual evaluation the gold standard.
Approach: They propose a framework for training PRMs to deliver step-level reward signals for LLM-generated clinical notes.
Outcome: The proposed framework outperforms reasoning and non-reasoning models on key evaluations and selects physician-preferred clinical notes with 56.2% accuracy.
DIALOGPT : Large-Scale Generative Pre-training for Conversational Response Generation (2020.acl-demos)

Copied to clipboard

Challenge: DIALOGPT is a large, tunable neural conversational response generation model . trained on 147M conversation-like exchanges extracted from Reddit comment chains .
Approach: They present a large, tunable neural conversational response generation model, DIALOGPT . the model is trained on 147M conversation-like exchanges extracted from Reddit comment chains .
Outcome: The proposed model can generate more relevant, contentful and context-consistent responses than baseline systems.
F²Bench: An Open-ended Fairness Evaluation Benchmark for LLMs with Factuality Considerations (2025.emnlp-main)

Copied to clipboard

Challenge: Existing fairness evaluation benchmarks for large language models rely on closed-ended evaluation formats that overlook factuality considerations rooted in historical, social, physiological, and cultural contexts.
Approach: They propose an open-ended fairness evaluation benchmark for large language models . they incorporate factuality considerations and multi-turn reasoning into the benchmark .
Outcome: The proposed benchmark incorporates factual grounding and text generation to better reflect the complexities of real-world model usage.
ARM: An Alignment-and-Replacement Module for Chinese Spelling Check Based on LLMs (2024.emnlp-main)

Copied to clipboard

Challenge: Chinese Spelling Check (CSC) aims to identify and correct spelling errors in Chinese texts, where enhanced semantic understanding of a sentence can significantly improve correction accuracy.
Approach: They propose a plug-and-play Alignment-and -Replacement module that enhances existing Chinese CSC models without retraining or fine-tuning.
Outcome: The proposed module improves existing models while reducing retraining and fine-tuning.
Dialogue Generation on Infrequent Sentence Functions via Structured Meta-Learning (2020.findings-emnlp)

Copied to clipboard

Challenge: Sentence function is an important linguistic feature indicating the communicative purpose of a sentence in a conversation.
Approach: They propose a structured meta-learning approach for dialogue generation on infrequent sentence functions.
Outcome: The proposed approach improves informativeness and relevance of dialogue generation on infrequent sentence functions while preserving knowledge generalization for similar sentence functions.
Towards Knowledge-Intensive Text-to-SQL Semantic Parsing with Formulaic Knowledge (2022.emnlp-main)

Copied to clipboard

Challenge: Existing approaches to text-to-SQL require domain knowledge to parse expert questions into SQL queries.
Approach: They propose a framework to leverage domain knowledge during parsing by building a new benchmark KnowSQL with domain-specific questions.
Outcome: The proposed framework improves the performance of the proposed benchmark by 28.2%.
Think-Search-Patch: A Retrieval-Augmented Reasoning Framework for Repository-Level Code Repair (2025.emnlp-industry)

Copied to clipboard

Challenge: Large language models suffer from multiple-file coding scenarios with strong inter-file dependencies . experimental results show that large language models exhibit inadequate performance in multi-file scenarios .
Approach: They propose a retrieval-augmented reasoning framework for repository-level code repair . they use a dataset to generate standardized patches based on the key snippets .
Outcome: The proposed framework improves retrieval accuracy and repair success on SWE-bench Lite . it surpasses models with larger size in managing extensive code contexts and fixing bugs spanning across multiple files.
TestAgent: An Adaptive and Intelligent Expert for Human Assessment (2025.findings-acl)

Copied to clipboard

Challenge: Existing adaptive testing methods face several challenges due to mechanized nature of most algorithms and noisy response data.
Approach: They propose to use large language models to enhance adaptive testing through interactive engagement to capture test-takers’ responses and anomalies.
Outcome: The proposed agent achieves more accurate results with 20% fewer questions than state-of-the-art baselines and testers preferred it in speed, smoothness, and other dimensions.
Positive Text Reframing under Multi-strategy Optimization (2025.coling-main)

Copied to clipboard

Challenge: Existing positive reframing models can be fine-tuned to achieve acceptable results, but generating fluent, diverse text remains a challenge.
Approach: They propose a positive reframing sentiment reward and content preservation reward framework . they propose re-ranking methods that optimize for style and consistency .
Outcome: The proposed framework improves on unconstrained and controlled positive reframing tasks.
Deep Dyna-Q: Integrating Planning for Task-Completion Dialogue Policy Learning (P18-1)

Copied to clipboard

Challenge: Training a task-completion dialogue agent via reinforcement learning (RL) is costly because it requires many interactions with real users.
Approach: They propose a framework that integrates planning for task-completion dialogue policy learning into a dialogue agent using a world model to mimic real user response and generate simulated experience.
Outcome: The proposed framework integrates planning for task-completion dialogue policy learning with real user interaction and simulated user behavior.
Towards Less Generic Responses in Neural Conversation Models: A Statistical Re-weighting Method (D18-1)

Copied to clipboard

Challenge: Experimental results show that Sequence-to-sequence models tend to generate generic/dull responses .
Approach: They propose a statistical re-weighting method that assigns different weights for multiple responses of the same query.
Outcome: The proposed method improves acceptance rate of generated responses and significantly reduces generated generic responses.
Reinforcement Learning on Pre-Training Data (2026.acl-long)

Copied to clipboard

Challenge: Recent progress in large language models is driven by scaling of training compute through pre-training with nexttoken prediction (NTP) or post-training (RL) Pre-training using NTP enables models to acquire extensive knowledge and skills from general data, but it suffers from data inefficiency and catastrophic forgetting in continual learning settings.
Approach: They propose to scale training compute through pre-training with next-token prediction (NTP) or post-training by scaling reinforcement learning (RL) to improve learning from general data.
Outcome: Experiments on multiple benchmarks and models show that the proposed approach improves continual pre-training and provides a strong foundation for post-training on Qwen3-8B-Base.
ARCH: Efficient Adversarial Regularized Training with Caching (2021.findings-emnlp)

Copied to clipboard

Challenge: Existing approaches to regularize models require generating a perturbation for each sample in each epoch.
Approach: They propose an adversarial regularization method where perturbations are generated and cached once every several epochs.
Outcome: The proposed method significantly eases the computational burden (saves up to 70% of computational time) it produces a notably better (in most of the tasks) or comparable model generalization.
MAESTRO: Meta-learning Adaptive Estimation of Scalarization Trade-offs for Reward Optimization (2026.acl-long)

Copied to clipboard

Challenge: Group-Relative Policy Optimization (GRPO) has emerged as an efficient paradigm for aligning Large Language Models (LLMs), but its efficacy is confined to domains with verifiable ground truths.
Approach: They propose a meta-cognitive orchestration layer that treats reward scalarization as a dynamic latent policy, leveraging the model’s terminal hidden states as 'a semantic bottleneck' . Across seven benchmarks, MAESTRO consistently outperforms single-reward and static multi-objective baselines while preserving the efficiency advantages of GRPO.
Outcome: The proposed model outperforms single-reward and static multi-objective baselines while preserving efficiency advantages.
Exploring Response Uncertainty in MLLMs: An Empirical Evaluation under Misleading Scenarios (2025.emnlp-main)

Copied to clipboard

Challenge: Existing studies have focused mainly on visual–textual misalignment, leaving largely unexplored the MLLMs’ ability to preserve an original correct answer when confronted with misleading information.
Approach: They propose a two-stage evaluation pipeline to quantify the response uncertainty phenomenon by eliciting each model’s original response on unperturbed inputs and injecting explicit (false-answer hints) and implicit (contextual contradictions) misleading instructions.
Outcome: The proposed model overturns a correct answer in 65% of cases after receiving a single deceptive cue.
Scaling up the State Size of RNN LLMs for Long-Context Scenarios (2025.acl-long)

Copied to clipboard

Challenge: Existing RNN-based LLMs struggle with long-context scenarios due to their quadratic computational complexity and linear memory requirements.
Approach: They propose an efficient scaling method to scale RNN models to match the 2k context length of Transformers with small parameters overhead.
Outcome: The proposed method improves long-context understanding and improves performance on FDA recall-intensive tasks.
SelfAug: Mitigating Catastrophic Forgetting in Retrieval-Augmented Generation via Distribution Self-Alignment (2025.findings-emnlp)

Copied to clipboard

Challenge: Existing solutions for supervised fine-tuning often lead to catastrophic forgetting, where models lose their previously acquired knowledge and general capabilities.
Approach: They propose a self-distribution alignment method that aligns input sequence logits to preserve the model’s semantic distribution, thereby mitigating catastrophic forgetting and improving downstream performance.
Outcome: The proposed method achieves a superior balance between downstream learning and general capability retention.
CLaMP 2: Multimodal Music Information Retrieval Across 101 Languages Using Large Language Models (2025.findings-naacl)

Copied to clipboard

Challenge: Current music information retrieval systems struggle to meet linguistic diversity challenges . current systems struggle with text queries in non-English languages .
Approach: They propose a music information retrieval system that supports both ABC notation and MIDI . CLaMP 2 includes a multilingual text encoder and a multiple-modal music encoder .
Outcome: The proposed system achieves state-of-the-art results in multilingual semantic search and music classification across modalities.
Bypass Back-propagation: Optimization-based Structural Pruning for Large Language Models via Policy Gradient (2025.acl-long)

Copied to clipboard

Challenge: Recent pruning methods rely on heuristically hand-crafted metrics, leading to suboptimal performance.
Approach: They propose a method that optimizes pruning masks by minimizing back-propagation . they learn an underlying Bernoulli distribution to sample binary pruning mask samples .
Outcome: The proposed method is able to support global and heterogeneous pruning without back-propagation.
Improving Empathetic Response Generation by Recognizing Emotion Cause in Conversations (2021.findings-emnlp)

Copied to clipboard

Challenge: Existing approaches to empathetic response generation ignore the emotion cause . existing dialogue systems lack emotion understanding and empathy .
Approach: They propose a framework that integrates emotion cause information into empathetic response generation by predicting context emotion labels and sequence of emotion cause-oriented labels.
Outcome: The proposed framework improves empathetic response generation by incorporating emotion cause information into the model.
ViFT: Towards Visual Instruction-Free Fine-tuning for Large Vision-Language Models (2025.findings-emnlp)

Copied to clipboard

Challenge: Visual instruction tuning is the predominant technology in eliciting multimodal task-solving capabilities of large vision-language models.
Approach: They propose a visual instruction-free fine-tuning framework for large vision-language models . they require only text-only instructions and image caption data during training .
Outcome: The proposed framework is based on visual instruction tuning, but requires images as input . it can achieve state-of-the-art performance on several downstream benchmarks with less training data.
Using Customer Service Dialogues for Satisfaction Analysis with Context-Assisted Multiple Instance Learning (D19-1)

Copied to clipboard

Challenge: Existing studies fail to provide comprehensive service satisfaction analysis . Existing models fail to include satisfaction polarity classification and sentimental utterance identification .
Approach: They propose a model that predicts customer sentiments and aggregates them into service satisfaction polarity.
Outcome: The proposed model predicts customer sentiments and aggregates them into service satisfaction polarity and reasoning clues.
QFinZero: A Unified Financial Toolchain for LLM-Based Trading Agents (2026.acl-demo)

Copied to clipboard

Challenge: Existing trading systems rely on fragmented and task-specific APIs, resulting in inconsistent schemas and limited reproducibility.
Approach: They propose a unified trading environment for large language model (LLM) agents that standardizes three core capabilities . they argue that such a standardized trading environment is essential for scalable research on LLM-based financial agents.
Outcome: The proposed trading environment reduces engineering overhead and supports reproducible evaluation through comprehensive logging and deterministic replay.
Text2Tree: Aligning Text Representation to the Label Tree Hierarchy for Imbalanced Medical Classification (2023.findings-emnlp)

Copied to clipboard

Challenge: Existing approaches to medical text classification are struggling with imbalanced data distribution and rare labels.
Approach: They propose a framework-agnostic algorithm that only utilizes internal label hierarchy in training deep learning models.
Outcome: The proposed approach performs better on public datasets and real-world medical records than existing methods.
HadSkip: Homotopic and Adaptive Layer Skipping of Pre-trained Language Models for Efficient Inference (2023.findings-emnlp)

Copied to clipboard

Challenge: Existing methods to exit pre-trained language models suffer from the limitation that they have to sequentially traverse through all layers prior to the selected exit layer, which degrades their performance.
Approach: They propose a homotopic and adaptive layer skipping fine-tuning method that adaptively selects the layers to skip based on a predefined budget.
Outcome: The proposed method outperforms all state-of-the-art baselines on the GLUE benchmark and shows that it is highly efficient.
LLM-Guided Semantic Bootstrapping for Interpretable Text Classification with Tsetlin Machines (2026.findings-acl)

Copied to clipboard

Challenge: Pretrained language models (PLMs) provide strong semantic representations but are costly and opaque.
Approach: They propose a framework that transfers pretrained language models into symbolic form and integrates them into symbolic models.
Outcome: The proposed framework improves interpretability and accuracy across multiple text classification tasks while remaining fully symbolic and efficient.
ResearchBench: Benchmarking LLMs in Scientific Discovery via Inspiration-Based Task Decomposition (2026.findings-acl)

Copied to clipboard

Challenge: Large language models have shown potential in assisting scientific research, yet their ability to discover high-quality research hypotheses remains unexamined due to the lack of a dedicated benchmark.
Approach: They propose a benchmark for evaluating large language models on a sufficient set of scientific discovery sub-tasks.
Outcome: The proposed framework extracts critical components from papers across 12 disciplines with expert validation confirming its accuracy.
PychoAgent: Psychology-driven LLM Agents for Explainable Panic Prediction on Social Media during Sudden Disaster Events (2025.emnlp-main)

Copied to clipboard

Challenge: Social media's rich information content and spatiotemporal granularity provide unique opportunities for emotion prediction and management.
Approach: They propose a Psychology-driven generative Agent framework for explainable panic prediction based on emotion arousal theory.
Outcome: The proposed framework improves panic emotion prediction performance by 13% to 21% compared to baseline models.
Exploring the Capability Boundaries of LLMs in Mastering of Chinese Chouxiang Language (2026.findings-acl)

Copied to clipboard

Challenge: Current state-of-the-art LLMs exhibit clear limitations on multiple tasks, while performing well on tasks that involve contextual semantic understanding.
Approach: They propose a mouse-based benchmark to evaluate LLMs' performance on NLP tasks involving Chouxiang Language.
Outcome: The proposed benchmark evaluates the performance of LLMs on six NLP tasks involving Chouxiang Language.
BloomEval: A Bloom’s Cognitive Taxonomy-Based Benchmark for Evaluating LRMs via Cognitive Hierarchy Trace (2026.findings-acl)

Copied to clipboard

Challenge: Existing benchmarks for Large Reasoning Models rely on answer correctness, but fail to assess the structural coherence and cognitive soundness of the reasoning process itself.
Approach: They propose a framework that maps a model's reasoning trajectory onto hierarchical cognitive levels and an annotation pipeline to ensure a scalable yet reliable annotation pipeline.
Outcome: The proposed framework detects hierarchy jumps, breaks, and overthinking errors and enables scalable yet reliable annotation.
Camouflaged Chinese Spam Content Detection with Semi-supervised Generative Active Learning (2020.acl-main)

Copied to clipboard

Challenge: Existing active learning models for text spam detection tasks are based on pool-based active learning, but the annotating process is laborious and time consuming for humans.
Approach: They propose a semi-supervised active learning model to address spam imbalances . they propose masked attention learning approach and character variation graph-enhanced augmentation procedure .
Outcome: The proposed model can improve the performance of existing models for Chinese spam detection task.
CodeTool: Enhancing Programmatic Tool Invocation of LLMs via Process Supervision (2025.acl-long)

Copied to clipboard

Challenge: Existing approaches to tool invocation are often unnecessarily long and require lengthy reasoning paths.
Approach: They propose a framework for stepwise code generation that improves LLM tool invocation . they incorporate two distinct process rewards: the On-the-spot and the Latent Reward .
Outcome: The proposed framework improves LLM tool invocation by leveraging the concise nature of code.
Fundamental Capabilities of Large Language Models and their Applications in Domain Scenarios: A Survey (2024.acl-long)

Copied to clipboard

Challenge: Existing benchmark-based evaluations cannot accurately reflect the performance of real-world applications.
Approach: They propose a reliable strategy for domains to choose more robust LLMs for real-world applications.
Outcome: The proposed strategy addresses the challenges faced by domains to choose more robust LLMs for real-world applications.
Enhancing Text-to-SQL Parsing through Question Rewriting and Execution-Guided Refinement (2024.findings-acl)

Copied to clipboard

Challenge: Existing prompt engineering methods exploit database content and execution feedback to improve text-to-sql performance.
Approach: They propose a framework for large language model-based text-to-sql task that exploits database content and execution feedback to improve execution accuracy.
Outcome: The proposed framework improves execution accuracy and usability by 12.41% and 5.38% on four widely used benchmarks.
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.
Feedback to Reasoning: LLM-Assisted Molecular Optimization with Domain Feedback and Historical Reasoning (2026.findings-acl)

Copied to clipboard

Challenge: Existing methods for molecular optimization do not leverage domain feedback and historical knowledge with reasoning traces and chemical insights.
Approach: They propose a conversational molecular optimization pipeline that enables LLMs to accumulate and retrieve past actions, rationales, and feedback.
Outcome: The proposed framework transforms LLMs from passive text generators into agentic experts that learn both actions and reasoning from experience.
Memory-enhanced Large Language Model for Cross-lingual Dependency Parsing via Deep Hierarchical Syntax Understanding (2025.findings-emnlp)

Copied to clipboard

Challenge: Experimental results show that our approach can significantly improve the parsing accuracy of all baseline models, leading to new state-of-the-art results.
Approach: They propose a deep hierarchical syntax understanding approach to improve the cross-lingual semantic memory capability of large language models by implicitly aligning linguistic knowledge between source and target languages.
Outcome: The proposed approach improves the cross-lingual semantic memory capability of large language models by combining implicit multi-task fine-tuning and explicit label bank guiding.
Unsupervised Deep Structured Semantic Models for Commonsense Reasoning (N19-1)

Copied to clipboard

Challenge: Existing methods for commonsense reasoning rely on human-crafted features and knowledge bases, but unsupervised learning is not feasible due to the lack of labeled training data or comprehensive knowledge bases.
Approach: They propose two unsupervised models based on the Deep Structured Semantic Models framework to tackle two commonsense reasoning tasks: Winograd Schema Challenge (WSC) and Pronoun Disambiguation (PDP).
Outcome: The proposed models capture contextual information in the sentence and co-reference information between pronouns and nouns, and achieve significant improvement over previous state-of-the-art approaches.
White-Box Multi-Objective Adversarial Attack on Dialogue Generation (2023.acl-long)

Copied to clipboard

Challenge: Pre-trained transformers are popular in state-of-the-art dialogue generation systems . however, they are vulnerable to adversarial samples crafted by small and imperceptible perturbations.
Approach: They propose a multi-objective attack method that balances two objectives: generation accuracy and length.
Outcome: The proposed method significantly degrades state-of-the-art DG models with a higher success rate than traditional accuracy-based methods.
Unlocking Data-free Low-bit Quantization with Matrix Decomposition for KV Cache Compression (2024.acl-long)

Copied to clipboard

Challenge: Existing methods to compress KV cache compromise precision or require extra data for calibration, limiting their practicality in LLM deployment.
Approach: They propose a low-bit quantization technique based on tensor decomposition to effectively compress KV cache.
Outcome: The proposed method reduces memory footprint and performance by 75% . it is compared with existing methods that compromise precision or require extra data for calibration .
Are Your LLMs Capable of Stable Reasoning? (2025.findings-acl)

Copied to clipboard

Challenge: Existing evaluation protocols and metrics do not capture the full spectrum of LLM capabilities, especially in complex reasoning tasks.
Approach: They propose a new evaluation metric that continuously assesses model performance across multiple sampling attempts, quantifying both the model’s potential capabilities and operational consistency.
Outcome: The proposed evaluation metric measures model performance across multiple sampling attempts and provides comprehensive insights into their potential capabilities and operational consistency.
Learning from Cognition: Enhancing RL Efficiency for LLM Reasoning via Hierarchical Metacognitive Decomposition and Refinement (2026.acl-long)

Copied to clipboard

Challenge: Recent advances in Large Language Models have demonstrated notable inferential capacities via reinforcement learning (RL) however, “zero-RL” approaches relying on fixed prompt templates introduce substantial sampling inefficiencies for weak LLMs.
Approach: They propose a hierarchical metacognitive RL framework that decomposes zero-accuracy problems into subproblems and prompts the policy to refine answers by referencing previous wrong solutions.
Outcome: The proposed framework improves sample utilization and sample efficiency and accelerates convergence compared to baselines.
FewRel 2.0: Towards More Challenging Few-Shot Relation Classification (D19-1)

Copied to clipboard

Challenge: Few-shot domain adaptation and NOTA detection are two real-world challenges for few-shot relation classification models.
Approach: They propose a task to investigate two aspects of few-shot relation classification models . they build upon the FewRel dataset by adding a new test set in a different domain .
Outcome: The proposed task can evaluate few-shot domain adaptation and few- shot none-of-the-above detection on a new domain and NOTA relation choice.
DialogConv: A Lightweight Fully Convolutional Network for Multi-view Response Selection (2022.emnlp-main)

Copied to clipboard

Challenge: Existing retrieval-based dialogue systems suffer from slow inference or huge number of parameters.
Approach: They propose a lightweight fully convolutional architecture for response selection using convolution.
Outcome: The proposed architecture extracts matching features of context and response from 3D views.
Neural Related Work Summarization with a Joint Context-driven Attention Mechanism (D18-1)

Copied to clipboard

Challenge: Existing approaches to automatic related work summarization rely on human-engineered features.
Approach: They propose a neural data-driven attention mechanism to measure contextual relevance within full texts and a heterogeneous bibliography graph simultaneously.
Outcome: The proposed approach achieves significant improvement over a typical seq2seq summarization baseline and five classical summarizing baselines.
ParetoRAG: Leveraging Sentence-Context Attention for Robust and Efficient Retrieval-Augmented Generation (2025.findings-emnlp)

Copied to clipboard

Challenge: Retrieval-augmented generation systems face persistent challenges in retrieval inefficiency and the inability of LLMs to filter out irrelevant information.
Approach: They propose an unsupervised framework that optimizes RAG systems through sentence-level refinement guided by the Pareto principle.
Outcome: The proposed framework achieves dual improvements in retrieval precision and generation quality without additional training or API resources while using only 40% of the tokens compared to traditional approaches.
Knowledge-Rich Self-Supervision for Biomedical Entity Linking (2022.findings-emnlp)

Copied to clipboard

Challenge: Entity linking is challenging in high-value domains with myriad entities . standard classification approaches suffer from the annotation bottleneck .
Approach: They propose a self-supervised approach to learn domain knowledge for biomedical entity linking . it generates self-reported mention examples on unlabeled text and trains contextual encoder .
Outcome: The proposed method outperforms existing methods by 20 points in accuracy on biomedical datasets.
Revisiting Entropy in Reinforcement Learning for Large Reasoning Models (2026.findings-acl)

Copied to clipboard

Challenge: Reinforcement learning with verifiable rewards (RLVR) has emerged as a paradigm for enhancing the reasoning capabilities of large language models.
Approach: They propose a positive-advantage reweighting approach that regulates model entropy by adjusting the loss weights assigned to tokens with positive advantages during RLVR training.
Outcome: The proposed approach regulates model entropy by adjusting loss weights assigned to tokens with positive advantages during RLVR training while maintaining competitive performance.
Improve Meta-learning for Few-Shot Text Classification with All You Can Acquire from the Tasks (2024.findings-emnlp)

Copied to clipboard

Challenge: Existing methods for few-shot text classification often encounter problems drawing accurate class prototypes from support set samples.
Approach: They propose a meta-learning method that leverages the information within the task itself . they propose Query-Data-Augmenter and Label-Adapter to build a task-adaptive metric space .
Outcome: The proposed method shows obvious advantages over state-of-the-art models on eight benchmark datasets.
HittER: Hierarchical Transformers for Knowledge Graph Embeddings (2021.emnlp-main)

Copied to clipboard

Challenge: Existing knowledge graph embedding methods to learn representations of knowledge graphs are conceptually simple and can be applied to tasks like factoid question answering (Saxena et al., 2020) and reasoning.
Approach: They propose a Hierarchical Transformer model to jointly learn Entity-relation composition and Relational contextualization based on a source entity’s neighborhood.
Outcome: The proposed model achieves state-of-the-art on multiple link prediction datasets and can be integrated into BERT and demonstrate its effectiveness on two Freebase factoid question answering datasets.
Towards Universal Debiasing for Language Models-based Tabular Data Generation (2025.findings-emnlp)

Copied to clipboard

Challenge: Existing large language models have exacerbated fairness issues in tabular data generation . inherent historical biases in tabulated data cause LLMs to exacerbate fairness problems .
Approach: They propose a universal debiasing framework that minimizes group-level dependencies . it leverages the autoregressive structure and analytic sampling distributions of LLM-based tabular data generators .
Outcome: The proposed framework minimizes group-level dependencies while reducing mutual information between advantaged and protected attributes.
EduBench: A Comprehensive Benchmarking Dataset for Evaluating Large Language Models in Diverse Educational Scenarios (2026.acl-long)

Copied to clipboard

Challenge: Existing benchmarks that focus on knowledge-intensive tasks do not reflect diverse educational scenarios.
Approach: They propose a benchmark that incorporates 9 major scenarios and 4,000 educational contexts.
Outcome: The proposed model performs comparable to state-of-the-art large models on the test set.
Discriminative Deep Dyna-Q: Robust Planning for Dialogue Policy Learning (D18-1)

Copied to clipboard

Challenge: Existing approaches to improve the effectiveness and robustness of Deep Dyna-Q (DDQ) are based on a discriminator to control the quality of simulated experiences and to improve learning.
Approach: They propose to use an RNN-based discriminator to control the quality of simulated experience to improve the effectiveness and robustness of Deep Dyna-Q.
Outcome: The proposed framework outperforms DDQ by controlling the quality of simulated experience used for planning.
ARTIST: A Transformer-based Chinese Text-to-Image Synthesizer Digesting Linguistic and World Knowledge (2022.findings-emnlp)

Copied to clipboard

Challenge: Text-to-Image Synthesis (TIS) is a popular task to convert natural language texts into realistic images.
Approach: They propose a transformer-based Chinese text-to-image synthesizer for high-resolution image generation that incorporates linguistic and relational knowledge facts into the model to ensure better performance without the usage of ultra-large models.
Outcome: The proposed model outperforms existing models in Chinese with linguistic and relational knowledge facts.
DecEx-RAG: Boosting Agentic Retrieval-Augmented Generation with Decision and Execution Optimization via Process Supervision (2025.emnlp-industry)

Copied to clipboard

Challenge: Recent advances in outcome-supervised reinforcement learning (RL) have shown strong performance, but this approach still suffers from inefficient exploration, sparse reward signals, and ambiguous global reward feedback.
Approach: They propose a model that models RAG as a Markov Decision Process (MDP) and introduces an efficient pruning strategy to optimize data expansion.
Outcome: The proposed model outperforms existing methods and achieves an average performance improvement of 6.2% across six datasets.
Pointing to a Llama and Call it a Camel: On the Sycophancy of Multimodal Large Language Models (2025.emnlp-main)

Copied to clipboard

Challenge: Multimodal large language models exhibit a pronounced form of visual sycophantic behavior when they process image inputs.
Approach: They propose a technique that allows multimodal large language models to engage in reflective reasoning and determine whether a user’s instruction is misleading or corrective.
Outcome: The proposed model resists misleading instructions but is stubborn even if it is wrong.
ProjectEval: A Benchmark for Programming Agents Automated Evaluation on Project-Level Code Generation (2025.findings-acl)

Copied to clipboard

Challenge: Existing benchmarks lack the ability to automatically evaluate from users’ perspective and lack the explainability of the results of LLM agents’ code generation capabilities.
Approach: They propose a new benchmark for LLM agents' automated evaluation by simulating user interaction.
Outcome: The proposed benchmark can evaluate the generated projects by user interaction simulation and by code similarity through existing objective indicators.
SHIELD: Evaluation and Defense Strategies for Copyright Compliance in LLM Text Generation (2024.emnlp-main)

Copied to clipboard

Challenge: Large Language Models (LLMs) have transformed machine learning but have raised significant legal concerns due to their potential to produce text that infringes on copyrights.
Approach: They propose a lightweight, real-time defense mechanism to prevent the generation of copyrighted text by evaluating methods and testing attack strategies.
Outcome: The proposed defense significantly reduces the volume of copyrighted text generated by LLMs by effectively refusing malicious requests.
Live-Aid: A Large-Scale Dialogue Dataset and Benchmark for Interleaved Multi-party Interactions in Live Streaming (2026.findings-acl)

Copied to clipboard

Challenge: Existing Multimodal Large Language Models struggle with dynamic interactions due to the scarcity of high-quality interleaved data.
Approach: They propose a large-scale interleaved live interaction Chinese dataset with human-annotated video responses.
Outcome: The proposed model can be used to evaluate live interactions in Chinese over 1,100 hours and 80,037 dialogue turns.
Adversarial Mixing Policy for Relaxing Locally Linear Constraints in Mixup (2021.emnlp-main)

Copied to clipboard

Challenge: Experiments on five text classification benchmarks and five backbone models have shown that our methods reduce the error rate over Mixup variants in a significant margin (up to 31.3%), especially in low-resource conditions (upto 17.5%).
Approach: They propose to add a small adversarial perturbation to the mixing coefficients rather than the examples to relax locally linear constraints.
Outcome: Experiments on five text classification benchmarks and five backbone models show that the proposed methods reduce the error rate over Mixup variants by 31.3%, especially in low-resource conditions.
Multi-task Learning with Sample Re-weighting for Machine Reading Comprehension (N19-1)

Copied to clipboard

Challenge: Existing models for Machine Reading Comprehension (MRC) are small, compared to their size, and there are many studies on using pre-trained word embeddings and back-translation approaches to improve model generalization.
Approach: They propose a multi-task learning framework to learn a machine reading comprehension model that can be applied to a wide range of MRC tasks in different domains.
Outcome: The proposed model can be applied to a wide range of MRC tasks in different domains.
Large Language Models Are Cross-Lingual Knowledge-Free Reasoners (2025.naacl-long)

Copied to clipboard

Challenge: Large language models have demonstrated impressive reasoning capabilities across multiple languages, but the relationship between capabilities in different languages is less explored.
Approach: They decompose the process of reasoning tasks into two separate components: knowledge retrieval and knowledge-free reasoning.
Outcome: The proposed model can be transferred across source-target languages despite secondary impact of resource in some specific target languages, while cross-lingual knowledge retrieval significantly hinders the transfer.
Task-oriented Word Embedding for Text Classification (C18-1)

Copied to clipboard

Challenge: Existing word embeddings only consider contextual information, which is suboptimal when used in various tasks due to a lack of task-specific features.
Approach: They propose a task-oriented word embedding method that regularizes the distribution of words to enable a clear classification boundary.
Outcome: The proposed method outperforms the state-of-the-art methods on a text classification task.
MoLA: MoE LoRA with Layer-wise Expert Allocation (2025.findings-naacl)

Copied to clipboard

Challenge: Recent efforts to integrate low-rank adaptation (LoRA) with the Mixture-of-Experts (MoE) have achieved performance comparable to full-parameter fine-tuning by tuning much fewer parameters.
Approach: They propose a parameter-efficient MoE method for low-rank adaptation with the Mixture-of-Experts (MoE) they use layers of LoRA experts to allocate more LoRA expert to middle layers .
Outcome: The proposed method outperforms baseline models on six well-known NLP and commonsense QA benchmarks on LLAMA-2, Mistral, and Gemma.
SaySelf: Teaching LLMs to Express Confidence with Self-Reflective Rationales (2024.emnlp-main)

Copied to clipboard

Challenge: Existing approaches to elicit confidence from large language models are limited to binary or inaccurate group-level confidence estimates.
Approach: They propose a training framework that teaches LLMs to express more fine-grained confidence estimates.
Outcome: The proposed training framework reduces the confidence calibration error and maintains the performance of the model.
A Survey on Natural Language Processing for Programming (2024.lrec-main)

Copied to clipboard

Challenge: Natural language processing for programming is a field of NLP and software engineering . it is used to assist programming, and is increasingly prevalent for its effectiveness in improving productivity.
Approach: They propose to use NLP techniques to assist programming by obtaining a structure-based representation and a functionality-oriented algorithm.
Outcome: The proposed approach could relieve developers from laborious work while improving efficiency for non-professional users.
Iterative Constrained Back-Translation for Unsupervised Domain Adaptation of Machine Translation (2022.coling-1)

Copied to clipboard

Challenge: Existing back-translation methods focus on in-domain lexical knowledge, which may lead to poor translation of unseen in- domain words.
Approach: They propose an iterative constrained back-translation method to incorporate in-domain lexical knowledge into synthetic parallel data from BT.
Outcome: The proposed method improves the BLEU score by up to 3.08 on four domains.
Enhancing Emotion Prediction in News Headlines: Insights from ChatGPT and Seq2Seq Models for Free-Text Generation (2024.lrec-main)

Copied to clipboard

Challenge: Existing methods for classifying discrete emotions from news headlines have been limited to using headlines.
Approach: They propose to use people’s free-text explanations to classify emotions elicited by news headlines to generate emotion explanations from headlines.
Outcome: The proposed method improves on methods that only use headlines and train a pretrained model for explanation generation.
Controllable Contamination Detection for Reliable LLM Evaluation with Statistical Guarantees (2026.acl-long)

Copied to clipboard

Challenge: Existing training data detectors fail to detect clean samples from contaminated test sets . existing methods fail to identify clean samples due to black-box nature of LLMs .
Approach: They propose a framework that detects and filters contaminated evaluation data . they propose 'failure detection' to reduce the proportion of contaminated samples mistakenly retained .
Outcome: The proposed framework reduces false discovery rate (FDR) under valid FDR control while maintaining evaluation consistency.
GLTW: Joint Improved Graph Transformer and LLM via Three-Word Language for Knowledge Graph Completion (2025.findings-acl)

Copied to clipboard

Challenge: Existing knowledge graphs lack the ability to integrate structural information into LLMs and output predictions deterministically.
Approach: They propose a method which encodes structural information of KGs and merges it with LLMs to enhance KGC performance.
Outcome: The proposed method improves the performance of KG Completion datasets on KGs by integrating structural information with LLMs.
RoseLoRA: Row and Column-wise Sparse Low-rank Adaptation of Pre-trained Language Model for Knowledge Editing and Fine-tuning (2024.emnlp-main)

Copied to clipboard

Challenge: Pre-trained language models have strong generalizability, but fine-tuning involves updating all parameters, rendering full fine-uning resource-intensive.
Approach: They propose a parameter-efficient fine-tuning method that updates all pre-trained parameters during inference.
Outcome: The proposed method outperforms baseline methods on five benchmarks across 20 datasets.
Chain-of-Skills: A Configurable Model for Open-Domain Question Answering (2023.acl-long)

Copied to clipboard

Challenge: Using customized retrieval models, model transferability and scalability are limited.
Approach: They propose a modular retrieval model where individual modules correspond to key skills that can be reused across datasets.
Outcome: The proposed model outperforms self-supervised retrievers in zero-shot evaluations and achieves state-of-the-art fine-tuned retrieval performance on NQ, HotpotQA and OTT-QA.
‘No’ Matters: Out-of-Distribution Detection in Multimodality Multi-Turn Interactive Dialogue Download PDF (2025.findings-acl)

Copied to clipboard

Challenge: Out-of-distribution (OOD) detection is essential for multimodal learning systems . a novel scoring framework is proposed to efficiently detect OOD in multi-round long dialogues .
Approach: They propose a scoring framework that integrates visual language models with a score framework that detects OOD in two key scenarios.
Outcome: The proposed framework detects OOD in two key scenarios: mismatches between dialogue and image input pair and previously unseen labels.
Re-evaluating Automatic LLM System Ranking for Alignment with Human Preference (2025.findings-naacl)

Copied to clipboard

Challenge: Evaluating and ranking the capabilities of different LLMs is crucial for understanding their performance and alignment with human preferences.
Approach: They propose a system-level evaluation framework that ranks LLMs based on their alignment with human preferences.
Outcome: The proposed framework aims to rank LLMs based on their performance and alignment with human preferences.
Decoupling Mixture-of-Graphs: Unseen Relational Learning for Knowledge Graph Completion by Fusing Ontology and Textual Experts (2022.coling-1)

Copied to clipboard

Challenge: Existing methods for knowledge Graph Completion (KGC) fail in unseen relation representations.
Approach: They propose to use three kinds of graphs to obtain unseen relation representations . they propose to decouple mixture-of-graph experts (DMoG) for unseened relations learning .
Outcome: The proposed method outperforms the state-of-the-art methods on unseen relation representations.
WIST: Web-Grounded Iterative Self-Play Tree for Domain-Targeted Reasoning Improvement (2026.acl-long)

Copied to clipboard

Challenge: Existing methods for self-improvement of large language models with verifiable rewards (RLVR) can drift over iterations, while corpus-grounded approaches rely on curated data environments.
Approach: They propose a Web-grounded Iterative Self-play Tree framework for domain-targeted reasoning improvement that learns directly from the open-web without requiring any pre-arranged domain corpus.
Outcome: The proposed framework outperforms both purely endogenous self-evolution and corpus-grounded self-play baselines and is domain-steerable.
Agentic Conversational Search with Contextualized Reasoning via Reinforcement Learning (2026.findings-acl)

Copied to clipboard

Challenge: Existing studies focus on single-turn scenarios, which might lack the ability to handle multi-turn interactions.
Approach: They propose a conversational agent that interleaves search and reasoning across turns and provides tailored rewards towards evolving user goals.
Outcome: The proposed agent interleaves search and reasoning across turns, enabling exploratory and adaptive behaviors learned through reinforcement learning (RL) training with tailored rewards towards evolving user goals.
InvestAlign: Overcoming Data Scarcity in Aligning Large Language Models with Investor Decision-Making Processes Under Herd Behavior (2025.acl-long)

Copied to clipboard

Challenge: relying on authentic data for Supervised Fine-Tuning (SFT) is costly and expensive.
Approach: They propose a framework that constructs high-quality SFT datasets by leveraging theoretical solutions to similar and simple optimal investment problems rather than the complex scenarios.
Outcome: The proposed framework achieves faster parameter convergence than using real-user data, suggesting superior learning efficiency.
AGTAO: Robust and Stabilized LLM Unlearning via Adversarial Gating Training with Adaptive Orthogonality (2026.findings-acl)

Copied to clipboard

Challenge: Large Language Models (LLMs) unintentionally memorize sensitive data, posing privacy and security risks.
Approach: They propose a framework that reconciles unlearning efficacy and utility preservation by using a latent-space gating mechanism to simulate internal recovery attempts.
Outcome: The proposed framework achieves superior trade-off between unlearning efficacy and model utility.
The Right Time Matters: Data Arrangement Affects Zero-Shot Generalization in Instruction Tuning (2025.findings-acl)

Copied to clipboard

Challenge: Existing work on instruction tuning has focused on task level, without considering that tasks are artificially defined and, to LLMs, merely consist of tokens and representations.
Approach: They propose a training data arrangement framework that allows for continual learning and loss reduction.
Outcome: The proposed framework promotes continual learning and loss reduction on unseen tasks.
Can LLMs Simulate L2-English Dialogue? An Information-Theoretic Analysis of L1-Dependent Biases (2025.acl-long)

Copied to clipboard

Challenge: Large Language Models (LLMs) can simulate non-native-like English use observed in human second language (L2) learners interfered with by their native first language (N1) knowledge.
Approach: They use large language models to simulate non-native-like English use observed in human second language (L2) learners, and then compare their outputs to real L2 learner data.
Outcome: The proposed models replicate L1-dependent patterns observed in human second language (L2) learners, with distinct influences from various languages.
UrbanLLM: Autonomous Urban Activity Planning and Management with Large Language Models (2024.findings-emnlp)

Copied to clipboard

Challenge: UrbanLLM is a fine-tuned large language model designed to tackle diverse urban problems.
Approach: They propose a fine-tuned large language model to tackle diverse urban problems . UrbanLLM decomposes urban-related queries into manageable sub-tasks .
Outcome: The proposed model outperforms existing models in urban planning and management tasks.
Does Large Language Model Contain Task-Specific Neurons? (2024.emnlp-main)

Copied to clipboard

Challenge: Large language models (LLMs) have demonstrated remarkable capabilities in comprehensively handling various types of natural language processing (NLP) tasks.
Approach: They propose a method for task-specific neuron localization based on Causal Gradient Variation with Special Tokens (CGVST) this method identifies task- specific neurons by concentrating on the most significant tokens during task processing, eliminating redundant tokens and minimizing interference from non-essential neurons.
Outcome: The proposed method can locate task-specific neurons across eight public tasks.
Learning to Edit: Aligning LLMs with Knowledge Editing (2024.acl-long)

Copied to clipboard

Challenge: Existing knowledge editing techniques rely on memorizing updated knowledge, impeding LLMs from effectively combining the new knowledge with their inherent knowledge when answering questions.
Approach: They propose a Learning to Edit framework that equips LLMs with the ability to apply updated knowledge to input questions through a two-phase process .
Outcome: The proposed framework outperforms existing methods in knowledge editing tasks and compares it with four benchmarks and two LLM architectures.
Understanding the RoPE Extensions of Long-Context LLMs: An Attention Perspective (2025.coling-main)

Copied to clipboard

Challenge: Enabling LLMs to handle lengthy context is currently a research hotspot . a notable challenge limiting further customization is the inability of LLM to utilize context beyond pretrained length due to the inherent flaw of rotary position embedding (RoPE).
Approach: They propose to extend the RoPE from an attention perspective and on two benchmarking tasks.
Outcome: The proposed extension of the RoPE improves extrapolation and retrieval errors.
Beyond Uniform SVD: Dual-Level Optimization across Columns and Modules for LLM Compression (2026.findings-acl)

Copied to clipboard

Challenge: Existing methods for low-rank decomposition overlook decomposing errors and suboptimal approximation.
Approach: They propose a low-rank decomposition framework that integrates low-level optimization at column and module levels.
Outcome: The proposed framework outperforms state-of-the-art methods and baselines in SVD and pruning.
Incorporating Causal Analysis into Diversified and Logical Response Generation (2022.coling-1)

Copied to clipboard

Challenge: Existing generation-based models generate generic and safe responses such as "So am I" or "I don't know"
Approach: They propose to predict the mediators to preserve relevant information and auto-regressively incorporate the mediator into generating process.
Outcome: The proposed model generates relevant and informative responses and outperforms the state-of-the-art in terms of automatic metrics and human evaluations.
IGenBench: Benchmarking the Reliability of Text-to-Infographic Generation (2026.acl-long)

Copied to clipboard

Challenge: Generated infographics may appear correct at first glance but contain easily overlooked issues, such as distorted data encoding or incorrect textual content.
Approach: They propose to evaluate reliability of text-to-infographic generation using IGenBench . they employ multimodal large language models to verify each question .
Outcome: The proposed framework decomposes reliability verification into atomic yes/no questions based on a taxonomy of 10 question types.
ImCoref-CeS: An Improved Lightweight Pipeline for Coreference Resolution with LLM-based Checker-Splitter Refinement (2026.acl-long)

Copied to clipboard

Challenge: Existing supervised neural methods for coreference resolution are underexplored . current methods rely on small language models, but their potential is underexploited .
Approach: They propose a framework that integrates an enhanced supervised model with LLM-based reasoning.
Outcome: The proposed method surpasses existing state-of-the-art methods in coreference resolution.
A LSTM Approach with Sub-Word Embeddings for Mongolian Phrase Break Prediction (C18-1)

Copied to clipboard

Challenge: Existing word embedding methods for Mongolian PB prediction are expensive and time-consuming.
Approach: They propose to use Mongolian word embedding to build a robust Mongolian PB prediction model . they encode sub-word units and feed it to LSTM to decode the best corresponding PB label .
Outcome: The proposed model outperforms traditional model using manual features and achieves 7.49% gain.
Not All Citations Are Equal:Entropy-Guided Citation Selection for Noise-Resistant Medical LLM (2026.findings-acl)

Copied to clipboard

Challenge: Large language models have demonstrated extensive potential in medical applications . however, their practical deployment in healthcare faces significant challenges .
Approach: They propose a training-free multi-turn reasoning framework and a post-training methodology that provides external knowledge support for large language models.
Outcome: The proposed framework elicits internal thought, external thought, and fusion thought, with an entropy-based reward that encourages selective citation of beneficial external knowledge while penalizing noisy citations.
STEP: Success-Rate-Aware Trajectory-Efficient Policy Optimization (2026.findings-acl)

Copied to clipboard

Challenge: Existing GRPO-based methods allocate sampling uniformly across tasks regardless of difficulty, propagate misleading learning signals and incur high sample-collection costs.
Approach: They propose a framework that allocates sampling based on per-task success rates and performs fine-grained step-level optimization.
Outcome: The proposed method improves sample efficiency and training stability over existing GRPO variants and three ablation variants on OSWorld and AndroidWorld.
Machine Translation With Weakly Paired Documents (D19-1)

Copied to clipboard

Challenge: Recent studies explore the possibility of unsupervised machine translation with monolingual data only.
Approach: They propose a method to mine bilingual sentences from weakly paired documents . they use word distribution-level alignments to constrain word distributions of two weakly-paired documents.
Outcome: The proposed method outperforms previous results on six translation tasks using weakly paired bilingual documents and a large number of bilingual sentences.
UnitedQA: A Hybrid Approach for Open Domain Question Answering (2021.acl-long)

Copied to clipboard

Challenge: Recent work on open-domain question answering focuses on either extractive or generative readers exclusively.
Approach: They propose a hybrid approach to extractive and generative readers that leverages both models.
Outcome: The proposed approach outperforms state-of-the-art models on NaturalQuestions and TriviaQA respectively.
ProReason: Multi-Modal Proactive Reasoning with Decoupled Eyesight and Wisdom (2025.emnlp-main)

Copied to clipboard

Challenge: Large vision-language models often prioritize language knowledge over image information on visual reasoning tasks, incurring performance degradation.
Approach: They propose a visual reasoning framework that decouples vision-reasoning capabilities and multi-run proactive perception.
Outcome: The proposed framework outperforms existing models on benchmarks for open-source and closed-source models with 13.2% performance gain.
GEM: Gestalt Enhanced Markup Language Model for Web Understanding via Render Tree (2023.emnlp-main)

Copied to clipboard

Challenge: Existing models that use plain HTMLs do not include crucial visual information in the rendered web.
Approach: They propose a Gestalt Enhanced Markup Language Model for hosting visual information without visual input.
Outcome: The proposed model can handle multiple downstream tasks without visual input.
Large Language Models Are Poor Clinical Decision-Makers: A Comprehensive Benchmark (2024.emnlp-main)

Copied to clipboard

Challenge: Existing studies focus on evaluating large language models in close-ended QA tasks, but many clinical decisions involve answering open-ended questions without pre-set options.
Approach: They construct a benchmark to better understand large language models in the clinic . they use existing datasets to evaluate LLMs in clinical situations .
Outcome: The proposed model outperforms human experts in multiple medical tasks.
Task-aware Contrastive Mixture of Experts for Quadruple Extraction in Conversations with Code-like Replies and Non-opinion Detection (2025.emnlp-main)

Copied to clipboard

Challenge: Applying Large Language Models (LLMs) for this specific task presents two primary challenges: the accurate extraction of multiple elements and the understanding of complex dialogue reply structure.
Approach: They propose a novel LLM-based multi-task approach to extract sentiment quadruples from conversations by integrating expert-level contrastive loss within task-oriented mixture of experts layer.
Outcome: The proposed method outperforms existing fine-tuning techniques in terms of accuracy and computational efficiency.
EfficientLLM: Unified Pruning-Aware Pretraining for Auto-Designed Compact Language Models (2026.acl-long)

Copied to clipboard

Challenge: Large language models (LLMs) driven by scaling laws can be developed in large model sizes.
Approach: They propose a pruning-aware pretraining approach that decouples LLM pruning from direct pretraining.
Outcome: The proposed model outperforms pretraining models with 100M 1B parameters in commen sense benchmarks.
Thinking-Based Non-Thinking: Solving the Reward Hacking Problem in Training Hybrid Reasoning Models via Reinforcement Learning (2026.acl-long)

Copied to clipboard

Challenge: Existing work on large reasoning models (LRMs) focuses on using reinforcement learning (RL) to train hybrid reasoning models that automatically decide whether to engage in thinking or not based on the complexity of the query.
Approach: They propose to use reinforcement learning to train hybrid reasoning models that automatically decide whether to engage in thinking or not based on the complexity of the query.
Outcome: The proposed model reduces token usage by around 50%$ compared to DeepSeek-R1-Distill-Qwen-1.5B/7B and DeepScaleR-1.5b, while significantly improving accuracy.
CEPT: A Contrast-Enhanced Prompt-Tuning Framework for Emotion Recognition in Conversation (2024.lrec-main)

Copied to clipboard

Challenge: Emotion recognition in conversation research suffers from data imbalance and the presence of similar linguistic expressions for different emotions.
Approach: They propose a Contrast-Enhanced Prompt-Tuning framework that transforms an ERC task into a Masked Language Modeling task and generates the emotion for each utterance in the conversation.
Outcome: The proposed framework outperforms the state-of-the-art methods on all three benchmark datasets and excels in recognizing minority emotions.
Multi-step Reasoning via Recurrent Dual Attention for Visual Dialog (P19-1)

Copied to clipboard

Challenge: Existing models for visual dialog infer the answer through multiple reasoning steps.
Approach: They propose a model for visual dialog that uses multi-step reasoning to answer questions about an image.
Outcome: The proposed model achieves a new state-of-the-art of 64.47% on the VisDial v1.0 dataset .
Open-domain Question Answering via Chain of Reasoning over Heterogeneous Knowledge (2022.findings-emnlp)

Copied to clipboard

Challenge: Existing open-domain question answering methods rely on the retriever to gather all evidence in isolation, but our approach uses an intermediary module to perform a chain of reasoning over the retrieved set.
Approach: They propose a new open-domain question answering framework that integrates an intermediary module into the current retriever-reader pipeline and integrates it into the model.
Outcome: The proposed framework outperforms the state-of-the-art on two OTT-QA datasets with an exact match score of 47.3 (45% relative gain).
Do Emergent Abilities Exist in Quantized Large Language Models: An Empirical Study (2024.lrec-main)

Copied to clipboard

Challenge: Large Language Models (LLMs) require significant computational resources for deployment and use.
Approach: They propose to use low-bit quantization methods to reduce memory footprint and increase inference rate to improve performance of Large Language Models.
Outcome: The proposed methods can reduce the memory footprint and increase the inference rate of LLMs.
Raw Pointer Rewriting with LLMs for Translating C to Safer Rust (2026.findings-acl)

Copied to clipboard

Challenge: C2Rust is a system programming language that enforces strict memory and type safety guarantees.
Approach: They propose a raw pointer rewriting technique that lifts raw pointers in individual functions to appropriate Rust data structures.
Outcome: The proposed technique eliminates 18.57% of local raw pointers and improves memory safety on 28 real-world C projects.
User Feedback Alignment for LLM-powered Exploration in Large-scale Recommendation Systems (2025.acl-industry)

Copied to clipboard

Challenge: Large Language Models (LLMs) can be used to broaden user experiences beyond established preferences and reinforce feedback loops.
Approach: They propose a hierarchical approach that combines hierarchic planning with LLM inference-time scaling to improve recommendation relevancy without compromising novelty.
Outcome: The proposed approach shows significant gains in both user satisfaction and exploration diversity.
Uncovering and Categorizing Social Biases in Text-to-SQL (2023.acl-long)

Copied to clipboard

Challenge: Existing Text-to-SQL models are trained on clean, neutral datasets, such as Spider and WikiSQl, but these models contain social bias at different rates.
Approach: They propose to use data to map natural language utterances to SQL queries.
Outcome: The proposed model can contain social bias at different rates in the downstream Text-to-SQL task.
Model-Generated Pretraining Signals Improves Zero-Shot Generalization of Text-to-Text Transformers (2023.acl-long)

Copied to clipboard

Challenge: Recent work in NLP has shown that pretrained language models have made notable progress toward generalization to unseen tasks.
Approach: They propose to pretrain T5 using an auxiliary model to construct more challenging token replacements for the main model to denoise.
Outcome: The proposed model outperforms similar-sized baseline models on prompted NLP benchmarks and rivals the state-of-the-art model with only **8%** of its parameters.
LegalDrill: Diagnosis-Driven Synthesis for Legal Reasoning in Small Language Models (2026.acl-industry)

Copied to clipboard

Challenge: Small language models (SLMs) are promising for real-world deployment but struggle with high-stakes legal reasoning tasks.
Approach: They propose a diagnostic-driven synthesis framework that extracts and refines reasoning trajectories from a capable teacher via fine-grained prompting and a self-reflective verification is employed to adaptively select the most effective data for the SLM student.
Outcome: The proposed framework extracts and refines reasoning trajectories from a capable teacher via fine-grained prompting, then a self-reflective verification is employed to adaptively select the most effective data for the student.
Incorporating Inner-word and Out-word Features for Mongolian Morphological Segmentation (2020.coling-main)

Copied to clipboard

Challenge: Mongolian morphological segmentation is a crucial preprocessing step in many Mongolian related NLP applications.
Approach: They propose a neural network incorporating inner-word and out-word features for Mongolian morphological segmentation.
Outcome: The proposed network is compared with baselines and evaluates its performance.
Enhancing Scalability of Pre-trained Language Models via Efficient Parameter Sharing (2023.findings-emnlp)

Copied to clipboard

Challenge: Existing approaches to scale pre-trained language models to a deeper model depth share all parameters or use extra blocks.
Approach: They propose a parameter-efficient approach to scaling pre-trained language models to a deeper model depth using matrix product operator.
Outcome: The proposed model scales pre-trained language models to a deeper model depth by 4x and achieves 0.1 points higher than BERT-large for GLUE score.
Self-Evolving GPT: A Lifelong Autonomous Experiential Learner (2024.acl-long)

Copied to clipboard

Challenge: Existing approaches to provide LLMs with textual task-solving experience rely on manual efforts to acquire and apply such experience for each task.
Approach: They propose a lifelong autonomous experiential learning framework based on LLMs that learns and accumulates experience through experience transfer and induction.
Outcome: The proposed framework performs reliably in each intermediate step and improves GPT-3.5 and GPT-4 on widely used NLP datasets.
Efficient k-Nearest-Neighbor Machine Translation with Dynamic Retrieval (2024.findings-acl)

Copied to clipboard

Challenge: Existing models for non-parametric domain adaptation lack kNN retrieval at each timestep, leading to substantial time overhead.
Approach: They propose a kNN-MT-based model that uses a domain-specific translation knowledge store to interpolate the prediction distribution of the model.
Outcome: The proposed model significantly extends kNN-MT with dynamic retrieval on widely-used datasets.
Manual Evaluation Matters: Reviewing Test Protocols of Distantly Supervised Relation Extraction (2021.findings-acl)

Copied to clipboard

Challenge: Distantly supervised relation extraction (RE) has attracted much attention in the past few years . previous methods to evaluate models manually or directly on autolabeled data have produced inaccurate evaluations .
Approach: They propose to use distant supervision to generate large-scale autolabeled data . they build manually-annotated test sets for two DS-RE datasets and evaluate models .
Outcome: The proposed method produces 53% wrong labels at the entity pair level in the popular NYT10 dataset.
MarkLLM: An Open-Source Toolkit for LLM Watermarking (2024.emnlp-demo)

Copied to clipboard

Challenge: Large Language Models (LLMs) embed imperceptible yet algorithmically detectable signals in outputs to identify LLM-generated text.
Approach: They propose to develop an open-source toolkit for LLM watermarking that embeds imperceptible yet algorithmically detectable signals in model outputs to identify LLM-generated text.
Outcome: MarkLLM provides a unified framework for implementing LLM watermarking algorithms, while providing user-friendly interfaces to ensure ease of access.
MMLU-ProX: A Multilingual Benchmark for Advanced Large Language Model Evaluation (2025.emnlp-main)

Copied to clipboard

Challenge: Existing large language model evaluation benchmarks focus on English, while current multilingual tasks lack parallel questions that specifically assess cross-lingual reasoning abilities.
Approach: They propose a comprehensive benchmark covering 29 languages, built on an English benchmark.
Outcome: The MMLU-ProX is a comprehensive benchmark covering 29 languages, built on an English benchmark.
Efficient Paths and Dense Rewards: Probabilistic Flow Reasoning for Large Language Models (2026.acl-long)

Copied to clipboard

Challenge: Existing approaches to mitigate inference inefficiency and optimization difficulty are fragmented and constrained by inherent trade-offs.
Approach: They propose a framework that reconceptualizes discrete reasoning steps as a continuous probabilistic flow, quantifying the contribution of each step toward the ground-truth answer.
Outcome: The proposed framework achieves a superior balance between inference efficiency and reasoning performance on challenging benchmarks.
Do BERT-Like Bidirectional Models Still Perform Better on Text Classification in the Era of LLMs? (2025.findings-emnlp)

Copied to clipboard

Challenge: Rapid adoption of LLMs has overshadowed the potential advantages of traditional BERT-like models in text classification.
Approach: They compare BERT-like models fine-tuning, LLM internal state utilization, and LLM zero-shot inference across six datasets.
Outcome: The proposed method outperforms LLMs on six challenging datasets.
Emotion Trajectory-aware Retrieval for Markov-driven Emotion Anticipation in LLM-based Emotional Support Conversation (2026.findings-acl)

Copied to clipboard

Challenge: Existing strategies focus on planning the next-turn dialogue strategies, while external strategy planners focus on generating empathetic responses.
Approach: They propose a Markov-driven emotion anticipation framework with emotion trajectory-aware retrieval for LLM-based ESC, which anticipates future emotion states to guide strategy planning and achieve sustained emotional support.
Outcome: The proposed framework can anticipate future emotions and achieve sustained emotional support on two datasets with two models.
Split and Merge: Aligning Position Biases in LLM-based Evaluators (2024.emnlp-main)

Copied to clipboard

Challenge: Large language models (LLMs) have shown promise as automated evaluators for assessing the quality of answers generated by AI systems.
Approach: They propose an alignment-based system that calibrates position bias in a lightweight yet effective manner by taking into account both length and semantics and combining them into a single prompt.
Outcome: Extensive experiments with six LLMs on 11,520 answer pairs show that PORTIA significantly improves consistency and consistency rates with humans.
EcomScriptBench: A Multi-task Benchmark for E-commerce Script Planning via Step-wise Intention-Driven Product Association (2025.acl-long)

Copied to clipboard

Challenge: Goal-oriented script planning is used by humans to plan for typical activities . however, this capability remains underexplored due to several challenges .
Approach: They propose a framework that enables product-enriched scripts by associating products with each step based on the semantic similarity between the actions and their purchase intentions.
Outcome: The proposed framework can generate product-enriched scripts from 2.4 million scripts . human annotations are conducted to provide gold labels for a sampled subset .
MobileWorld: Benchmarking Autonomous Mobile Agents in Agent-User Interactive and MCP-Augmented Environments (2026.acl-long)

Copied to clipboard

Challenge: AndroidWorld is the dominant mobile GUI agent evaluation benchmark, but its success rates are low . despite reproducible emulator environment, it lacks key application categories such as e-commerce and enterprise communication.
Approach: They propose a benchmark for mobile GUI agents that reflects real-world usage through long-horizon, cross-application workflows.
Outcome: The proposed framework achieves over 90% success rates, while AndroidWorld is the dominant benchmark.
When Personalization Tricks Detectors: The Feature-Inversion Trap in Machine-Generated Text Detection (2026.acl-long)

Copied to clipboard

Challenge: Personalized MGT detection remains largely underexplored due to personalization challenges . large language models (LLMs) can imitate personal writing styles, but they can generate fake news and misinformation.
Approach: They propose a benchmark to evaluate detector robustness under personalization . they attribute this limitation to a feature-inversion trap that flips the effect in personalized contexts .
Outcome: The proposed framework predicts detector robustness under personalization with an 85% correlation to actual results.
Exploring the Synergy of Dual-path Encoder and Alignment Module for Better Graph-to-Text Generation (2024.lrec-main)

Copied to clipboard

Challenge: KG-to-text generation model lacks explicit graph-text alignment strategy due to discrepancy between textual and structure information.
Approach: They propose a synergetic knowledge graph-to-text model with a dual-path encoder, alignment module and guidance module to solve these problems.
Outcome: The proposed model achieves competitive performance on three benchmark datasets.
Generation-Augmented Retrieval for Open-Domain Question Answering (2021.acl-long)

Copied to clipboard

Challenge: Existing approaches to answer open-domain questions use sparse representations and sparsity.
Approach: They propose a method which augments a query by generating relevant contexts from heuristically discovered contexts without external supervision.
Outcome: The proposed approach outperforms state-of-the-art dense retrieval methods on natural questions and triviaQA datasets.
Enhancing Legal Case Retrieval via Scaling High-quality Synthetic Query-Candidate Pairs (2024.emnlp-main)

Copied to clipboard

Challenge: Existing studies focus on case-to-case retrieval using lengthy queries, which does not match real-world scenarios.
Approach: They propose a method to construct query-candidate pairs and build the largest LCR dataset to date, LEAD.
Outcome: Experimental results show that the method can provide ample training signals for LCR models.
TLUE: A Tibetan Language Understanding Evaluation Benchmark (2025.emnlp-main)

Copied to clipboard

Challenge: Low-resource languages, like Tibetan, remain underrepresented in large language models' evaluations.
Approach: They propose a Tibetan Language Understanding Evaluation Benchmark to assess LLMs' proficiency in Tibetan . they use a multi-task understanding benchmark and a safety benchmark to evaluate models .
Outcome: The proposed benchmark shows that most large language models perform below the random baseline, especially in Tibetan language processing.
Noisy-Labeled NER with Confidence Estimation (2021.naacl-main)

Copied to clipboard

Challenge: Recent studies in deep learning have shown significant progress in named entity recognition (NER) . however, most existing works assume clean data annotation, while real-world data typically involve a large amount of noises.
Approach: They propose a confidence estimation approach for named entity recognition using noisy labels using local and global independence assumptions.
Outcome: The proposed method marginalizes out labels of low confidence with a CRF model and integrates it into a self-training framework for boosting performance.
DSRAG: A Double-Stream Retrieval-Augmented Generation Framework for Countless Intent Detection (2025.naacl-industry)

Copied to clipboard

Challenge: Current intent detection work experiments with minor intent categories.
Approach: They propose a retrieval-augmented generation framework that uses query-to-query and query- to-metadata approaches to retrieve intents from metadata.
Outcome: The proposed framework improves on query-to-query (Q2Q) and query- to-metadata (Q 2M) approaches.
Boosting LLM Agents with Recursive Contemplation for Effective Deception Handling (2024.findings-acl)

Copied to clipboard

Challenge: Recent advances in large language models (LLMs) have led to significant success in using LLMs as agents.
Approach: They propose a cognitive framework that incorporates first-order and second-order perspective transitions into LLMs to enhance their ability to identify and counteract deceptive information.
Outcome: The proposed framework enhances LLMs’ ability to identify and counteract deceptive information without extra fine-tuning and data.
Chain-of-Procedure: Hierarchical Visual-Language Reasoning for Procedural QA (2026.findings-acl)

Copied to clipboard

Challenge: Recent advances in vision-language models (VLMs) have achieved impressive results on standard image-text tasks, yet their capability in visual procedure question answering (VP-QA) remains largely unexplored.
Approach: They propose a multimodal benchmark specifically designed for visual procedural reasoning that synergizes cross-modal procedure retrieval, context-aware step decomposition, and the next step prediction.
Outcome: The proposed framework significantly outperforms baselines on visual procedure question answering (VP-QA) Experiments on six VLMs show that it performs better than baselines.
Dynamic Spatial-Temporal Aggregation for Skeleton-Aware Sign Language Recognition (2024.lrec-main)

Copied to clipboard

Challenge: Current sign language recognition methods use spatial graphs and temporal modules to capture spatial and temporal features, but their spatial graph modules are typically built on fixed graph structures.
Approach: They propose a new spatial architecture that captures input-sensitive joint relationships and a temporal module to model multi-scale temporal information to capture complex human dynamics.
Outcome: The proposed method achieves state-of-the-art accuracy on four large-scale SLR benchmarks.
Improving Domain Generalization for Prompt-Aware Essay Scoring via Disentangled Representation Learning (2023.acl-long)

Copied to clipboard

Challenge: Existing AES models are either prompt-specific or prompt-adaptive and cannot generalize well on “unseen” prompts.
Approach: They propose a prompt-aware neural AES model to extract comprehensive representation for essay scoring, including both prompt-invariant and prompt-specific features.
Outcome: The proposed model extracts comprehensive representation for essay scoring, including both prompt-invariant and prompt-specific features.
Taming Text-to-Image Synthesis for Novices: User-centric Prompt Generation via Multi-turn Guidance (2025.emnlp-main)

Copied to clipboard

Challenge: Existing solutions for text-to-image synthesis are sensitive on textual prompts, posing a challenge for novice users.
Approach: They propose a dialogue-based TIS prompt generation model that emphasizes user experience for novice users.
Outcome: The proposed model emphasizes user experience for novice users . it improves user-centricity score while maintaining a competitive quality of synthesized images.
BrowseComp-Plus: A Fair and Disentangled Evaluation Benchmark for Deep Search Agents (2026.acl-long)

Copied to clipboard

Challenge: Existing benchmarks for deep search agents rely on blackbox web search APIs . dynamic and opaque web APIs hinder reproducibility and fair comparisons - authors .
Approach: They propose a benchmark that employs a fixed corpus for controlled retrieval for deep search agents.
Outcome: The new benchmark shows that agents that combine large language models with retrieval tools excel at complex, reasoning-intensive queries.
Do Vision-Language Models Have Internal World Models? Towards an Atomic Evaluation (2025.findings-acl)

Copied to clipboard

Challenge: Recent studies have evaluated and shown limitations in specific capabilities such as visual understanding, but a systematic evaluation of VLMs’ fundamental WM abilities remains absent.
Approach: They propose a framework that assesses perception and prediction to provide an atomic evaluation of VLMs as WMs.
Outcome: The proposed framework assesses perception and prediction abilities on 15 latest VLMs and compares them to human-level models.
A Hybrid Neural Network Model for Commonsense Reasoning (D19-60)

Copied to clipboard

Challenge: a hybrid neural network (HNN) model for commonsense reasoning is proposed . it combines language models and semantic similarity models to achieve new state-of-the-art results .
Approach: They propose a hybrid neural network model for commonsense reasoning . it combines a masked language model and a semantic similarity model .
Outcome: The proposed model outperforms the WNLI, WSC and PDP60 benchmarks on three commonsense reasoning tasks.
Entropy-based Exploration Conduction for Multi-step Reasoning (2025.findings-acl)

Copied to clipboard

Challenge: Existing methods to automatically decide the depth of exploration of the reasoning procedure lead to high cost and a lack of flexibility.
Approach: They propose a method that dynamically adjusts the exploration depth during multi-step reasoning by monitoring LLM’s output entropy and variance entropic.
Outcome: The proposed method captures the uncertainty of the current step and the fluctuation of uncertainty across consecutive reasoning steps and then selects whether to deepen, expand, or stop exploration according to the probability.
PersonaAgent: Bridging Memory and Action for Personalized LLM Agents (2026.findings-acl)

Copied to clipboard

Challenge: Existing Large Language Model (LLM) enabled agents lack flexibility to respond to users’ varying needs and preferences.
Approach: They propose a test-time user-preference alignment strategy that optimizes the persona prompt, ensuring real-time preference alignment through textual loss feedback between simulated and ground-truth responses.
Outcome: The proposed framework outperforms baseline methods in real-time and in real applications.
BOOKAGENT: Orchestrating Safety-Aware Visual Narratives via Multi-Agent Cognitive Calibration (2026.findings-acl)

Copied to clipboard

Challenge: Existing work on illustrated storybooks decomposes this task into separate stages, limiting multi-modal grounding . et al. proposes a safety-aware multi-agent collaboration framework for high-quality, safety-conscious visual narratives .
Approach: They propose a safety-aware multi-agent collaboration framework for illustrated storybooks . the framework jointly plans, scripts, illustrates, and globally corrects inconsistencies .
Outcome: a novel framework outperforms existing methods in safety and coherence, and improves visual consistency . the framework is available on github at https://github.com/bogao-code/BookAgent/main .
DASA-Trans-STM: Adaptive Efficient Transformer for Short Text Matching using Data Augmentation and Semantic Awareness (2025.emnlp-main)

Copied to clipboard

Challenge: Recent advances in large language models have shown impressive versatility across various tasks.
Approach: They propose a novel adaptive Transformer for Chinese short text matching using data augmentation and semantic awareness.
Outcome: The proposed model can deal with word ambiguity in Chinese on four available datasets.
UNIMO-2: End-to-End Unified Vision-Language Grounded Learning (2022.findings-acl)

Copied to clipboard

Challenge: Existing methods for vision-language pre-training can only learn from aligned image-caption data and rely heavily on expensive regional features.
Approach: They propose an end-to-end unified-modal pre-training framework for joint learning . they propose to conduct grounded learning on both images and texts via a sharing grounded space .
Outcome: The proposed model improves visual and visual semantic alignment on images and texts.
Is ChatGPT a Good Causal Reasoner? A Comprehensive Evaluation (2023.findings-emnlp)

Copied to clipboard

Challenge: Existing methods to evaluate ChatGPT's causal reasoning abilities are based on pre-trained language models, but they rely on supervised training.
Approach: They conduct the first comprehensive evaluation of ChatGPT’s causal reasoning capabilities using four state-of-the-art (STA) simulations.
Outcome: The proposed model is not a good causal reasoner, but a great causal interpreter.
Graph Counselor: Adaptive Graph Exploration via Multi-Agent Synergy to Enhance LLM Reasoning (2025.acl-long)

Copied to clipboard

Challenge: Existing methods for enhancing LLM reliability suffer from inefficient information aggregation and rigid reasoning schemes.
Approach: They propose a method that explicitly models external knowledge integration capabilities by explicitly modeling knowledge relationships.
Outcome: The proposed method outperforms existing methods in multiple graph reasoning tasks.
DiffStyleTTS: Diffusion-based Hierarchical Prosody Modeling for Text-to-Speech with Diverse and Controllable Styles (2025.coling-main)

Copied to clipboard

Challenge: Existing models for text-to-speech (TTS) synthesize speech with acoustic features . autoregressive models have problems with word skipping and repeated reading . non-autoregressive acustic models lack probabilistic modeling and unimodal characteristics of Gaussian distribution don't conform to true distribution of aural features, which restricts the diversity of generated prosodic features.
Approach: They propose a multi-speaker acoustic model that hierarchically models speech prosodic features and controls different prosodic styles to guide prosody prediction.
Outcome: The proposed method outperforms baseline models in naturalness and achieves superior synthesis speed compared to baseline models.
AEGIS: A Holistic Benchmark for Evaluating Forensic Analysis of AI-Generated Academic Images (2026.acl-long)

Copied to clipboard

Challenge: AEGIS examines whether current models can effectively audit AI-generated images in academic papers.
Approach: They propose a holistic benchmark for forensic analysis of AI-Generated academic ImageS that reveals limitations in academic image forensics.
Outcome: AEGIS compared with existing benchmarks on seven academic categories and features key advances in forensic analysis.
Adaptive Token Biaser: Knowledge Editing via Biasing Key Entities (2024.findings-emnlp)

Copied to clipboard

Challenge: Existing methods to update parametric knowledge of large language models (LLMs) are outdated and incontext editing (KE) is not effective due to the substantial cost associated with retraining.
Approach: They propose a new decoding technique that enhances in-context editing (ICE) they propose to use parametric knowledge to update the models' knowledge .
Outcome: The proposed technique improves ICE performance while incurring only half the latency.
GRASS: Gradient-based Adaptive Layer-wise Importance Sampling for Memory-efficient Large Language Model Fine-tuning (2026.findings-acl)

Copied to clipboard

Challenge: Low-rank adaptation methods for large language models limit expressiveness and performance . layer-wise fine-tuning methods overlook variations in layer importance across tasks and training stages, resulting in suboptimal performance on downstream tasks.
Approach: They propose a gradient-based adaptive layer-wise importance sampling framework that updates only a subset of parameters to reduce memory usage.
Outcome: The proposed framework outperforms state-of-the-art methods in accuracy and memory usage.
DialogueMMT: Dialogue Scenes Understanding Enhanced Multi-modal Multi-task Tuning for Emotion Recognition in Conversations (2025.coling-main)

Copied to clipboard

Challenge: Existing ERC methods fail to handle emotional cues from both visual sources and discourse structures due to the complexity of visual scenes and contextual dependencies in conversations.
Approach: They propose a framework for Emotion Recognition in conversations that utilizes multi-task instruction tuning to enhance the model's understanding of multi-modal dialogue scenes.
Outcome: The proposed framework outperforms existing state-of-the-art models on three benchmark ERC datasets and is based on a video-language connector and a chain-of thought strategy.
Sparse-to-Dense: A Free Lunch for Lossless Acceleration of Video Understanding in LLMs (2025.acl-short)

Copied to clipboard

Challenge: Recent advances in Video Large Language Models (Video-LLMs) have achieved exceptional performance on tasks like video question answering and captioning.
Approach: They propose a decoding strategy that leverages sparse top-K attention and dense full attention to accelerate Video-LLMs without loss.
Outcome: The proposed approach achieves a 1.94 walltime speedup in video processing.
A Data-Centric Framework for Composable NLP Workflows (2020.emnlp-demos)

Copied to clipboard

Challenge: Empirical natural language processing (NLP) systems involve interoperation among multiple components . a wealth of NLP toolkits exist ( 4), such as spaCy, DKPro, CoreNLP.
Approach: They propose a unified open-source framework that supports fast development of NLP workflows . framework includes processors for NLP tasks, visualization, and annotation .
Outcome: The framework offers processors for NLP tasks, visualization, and annotation, and is extensible . it is delivered through two modularized yet integratable open-source projects, Forte and Stave .
OpenCoder: The Open Cookbook for Top-Tier Code Large Language Models (2025.acl-long)

Copied to clipboard

Challenge: Code LLMs lack reproducible data pipelines and training protocols for reproducible advancements in code intelligence.
Approach: They propose a top-tier code LLM that releases model weights and inference code . reproducible data pipelines, rigorous experimental ablation results and training protocols are included .
Outcome: The proposed model achieves comparable performance to leading models and serves as an "open cookbook" reproducible training data, rigorous experimental ablation results, and detailed training protocols are also included in the model.
TemplateGEC: Improving Grammatical Error Correction with Detection Template (2023.acl-long)

Copied to clipboard

Challenge: Existing methods for grammatical error correction (GEC) have been developed.
Approach: They propose a method which integrates the detection labels from a Seq2Edit model to construct a template as the input.
Outcome: The proposed method can perform human-in-the-loop error correction tasks.
Towards Adapting Open-Source Large Language Models for Expert-Level Clinical Note Generation (2025.findings-acl)

Copied to clipboard

Challenge: Proprietary Large Language Models (LLMs) have demonstrated promising capabilities in clinical text summarization tasks.
Approach: They propose a domain- and task-specific adaptation process for an open-source LLaMA-2 model . LLama-2 can generate high-quality clinical notes from outpatient patient-doctor dialogues .
Outcome: The proposed model can generate clinical notes comparable to those authored by physicians.
Multi-Task Deep Neural Networks for Natural Language Understanding (P19-1)

Copied to clipboard

Challenge: Existing approaches to learning vector-space representations of text are multitask learning and language model pre-training.
Approach: They propose a multi-task deep neural network (MT-DNN) that leverages cross-task data and incorporates a pre-trained bidirectional transformer language model.
Outcome: The proposed model achieves state-of-the-art on ten NLU tasks and pushes the GLUE benchmark to 82.7% (2.2% absolute improvement)
Com2 : A Causal-Guided Benchmark for Exploring Complex Commonsense Reasoning in Large Language Models (2025.acl-long)

Copied to clipboard

Challenge: Existing works focus on complex tasks like math and code, while complex commonsense reasoning remains underexplored due to its uncertainty and lack of structure.
Approach: They propose to build a benchmark for large language models based on complex commonsense reasoning based upon causal event graphs and causal theory.
Outcome: The proposed benchmark combines a complex commonsense reasoning benchmark with a detective story to achieve a more challenging subset.
InstructGraph: Boosting Large Language Models via Graph-centric Instruction Tuning and Preference Alignment (2024.findings-acl)

Copied to clipboard

Challenge: Existing large language models (LLMs) can solve graph reasoning and generation tasks with parameter updates without sacrificing performance.
Approach: They propose a structured format verbalizer to unify all graph data into a universal code-like format, which can simply represent the graph without any external graph-specific encoders.
Outcome: The proposed framework outperforms GPT-4 and LLaMA2 in graph reasoning and generation tasks by more than 13% and 38%, respectively.
Proactive Guidance of Multi-Turn Conversation in Industrial Search (2025.acl-industry)

Copied to clipboard

Challenge: Large Language Models (LLMs) have advanced multi-turn conversation systems, emphasizing the need for proactive guidance to enhance users’ interactions.
Approach: They propose a goal-adaptive supervised fine-tuning framework that generates proactive guidance for users to click for the next turn of the conversation.
Outcome: The proposed framework achieves 86.10% accuracy in offline evaluation (+23.95% over baseline) and 25.28% CTR in online deployment (149.06% relative improvement).
A Survey on Open Information Extraction from Rule-based Model to Large Language Model (2024.findings-emnlp)

Copied to clipboard

Challenge: Open Information Extraction (OpenIE) is a key NLP task aimed at extracting structured information from unstructured text sources.
Approach: They propose to categorize OpenIE into rule-based, neural, and pre-trained large language models and discuss each within a chronological framework.
Outcome: The paper categorizes OpenIE approaches into rule-based, neural, and pre-trained large language models, discussing each within a chronological framework.
Posterior Differential Regularization with f-divergence for Improving Model Robustness (2021.naacl-main)

Copied to clipboard

Challenge: Recent studies show that pre-trained models suffer catastrophic degradation in out-of-domain generalization to datasets with domain shift or adversarial scenarios.
Approach: They propose to regularize the posterior difference between clean and noisy inputs by using a Jacobian regularization framework and a virtual adversarial training framework.
Outcome: The proposed framework can improve model robustness in fully supervised and semi-supervised settings.
ReAL: How Can LLMs Simulate the Real Teacher? Retrieval-enhanced Agent for Adaptive Learning (2025.findings-emnlp)

Copied to clipboard

Challenge: Prior methods model learner-item interactions based only on ID sequences, leading to insufficient use of both learner and item information.
Approach: They propose a Retrieval-enhanced Agent for Adaptive Learning powered by large language models to simulate teacher decision-making with extensive prior knowledge and teaching experience.
Outcome: The proposed model outperforms existing models on three real-world datasets in both internal and external perspectives.
LongDocURL: a Comprehensive Multimodal Long Document Benchmark Integrating Understanding, Reasoning, and Locating (2025.acl-long)

Copied to clipboard

Challenge: Existing document understanding benchmarks only handle a small number of pages . existing models are limited to handling only a limited number of documents .
Approach: They propose a long document understanding benchmark that integrates three primary tasks and 20 sub-tasks based on different primary tasks.
Outcome: The proposed model outperforms existing benchmarks on open-source and closed-source models . the model outpersforms other models on more than 33,000 pages of documents .
SMR: State Memory Replay for Long Sequence Modeling (2024.findings-acl)

Copied to clipboard

Challenge: Existing state space models (SSMs) address non-uniform sampling, but their recursive structures impede efficient SSM computation via convolution.
Approach: They propose a plug-and-play mechanism to solve the Non-Stable State problem by adjusting input sequences with early memories.
Outcome: The proposed method overcomes the non-uniform sample processing problem . it can achieve Sampling Step Adaptation (SSA) by adjusting input sequences with early memories.
Decoding Scientific Experimental Images: The SPUR Benchmark for Perception, Understanding, and Reasoning (2026.acl-long)

Copied to clipboard

Challenge: Xu and Peng, 2025) . . SPUR is a comprehensive benchmark for scientific experimental image perception, understanding, and reasoning, comprising 4,264 question-answering (QA) pairs derived from 1,084 expert-curated images.
Approach: They propose to use 4,264 question-answering (QA) pairs derived from 1,084 expert-curated images to evaluate the visual perception of multimodal large language models (MLLMs) . they also propose to utilize cross-panel relation understanding to evaluate MLLM’s ability to decipher intricate cross-panel relations.
Outcome: The proposed model is based on 4,264 question-answering pairs derived from 1,084 expert-curated images.
ZigZagKV: Dynamic KV Cache Compression for Long-context Modeling based on Layer Uncertainty (2025.coling-main)

Copied to clipboard

Challenge: Existing methods to accelerate inference of Large Language models (LLMs) are limited in their ability to retain key tokens as input length increases.
Approach: They propose a method that leverages layer uncertainty to allocate budget size for each layer to reduce memory usage.
Outcome: The proposed method reduces memory usage of the KV caches to only 20% when compared to full KV inference while achieving nearly lossless performance.
Beyond Superficial Tests: Adversarial Refinement for Reliable Property-Based Testing (2026.findings-acl)

Copied to clipboard

Challenge: Large Language Models (LLMs) have demonstrated remarkable proficiency in code generation, yet their application to Property-Based Testing (PBT) remains fraught with a superficiality gap.
Approach: They propose an agentic framework that hardens software properties through Adversarial Refinement.
Outcome: a new framework hardens software properties through Adversarial Refinement that detects and fixes bugs in top-tier libraries.
AdaMix: Mixture-of-Adaptations for Parameter-efficient Model Tuning (2022.emnlp-main)

Copied to clipboard

Challenge: Standard fine-tuning of large pre-trained language models requires updating hundreds of millions to billions of parameters and storing a large copy of the PLM weights for every task.
Approach: They propose a parameter-efficient fine-tuning technique where small trainable components are injected into the PLM and updated during fine-uning.
Outcome: The proposed method outperforms SOTA parameter-efficient fine-tuning and full model fine-uning on GLUE development set with RoBERTa-large encoder.
A Discrete CVAE for Response Generation on Short-Text Conversation (D19-1)

Copied to clipboard

Challenge: Neural conversation models are easy to generate bland and generic responses . however, their improvement of generating high-quality responses is still unsatisfactory .
Approach: They propose to use a discrete latent variable with an explicit semantic meaning to improve the conditional variational autoencoder on short-text conversation.
Outcome: The proposed model outperforms various kinds of generation models under automatic and human evaluations and generates more diverse and informative responses.
Mitigating Hallucinations in LM-Based TTS Models via Distribution Alignment Using GFlowNets (2025.emnlp-main)

Copied to clipboard

Challenge: Existing mitigation strategies for Text-to-Speech systems require excessive training resources or inference latency.
Approach: They propose a GFlOwNet-guided distribution AlignmenT framework that mitigates hallucinations without relying on massive resources or inference latency.
Outcome: The proposed framework reduces over 50% character error rates and lowers uncertainty by up to 58% on challenging test cases.
MIND: A Large-scale Dataset for News Recommendation (2020.acl-main)

Copied to clipboard

Challenge: Personalized news recommendation is an important technique for personalized news service.
Approach: They propose to build a large-scale news recommendation dataset from Microsoft News . they demonstrate that news recommendation relies on the quality of news content understanding .
Outcome: The proposed dataset contains 1 million users and more than 160k English news articles, each of which has rich textual content such as title, abstract and body.
Refining Salience-Aware Sparse Fine-Tuning Strategies for Language Models (2025.acl-long)

Copied to clipboard

Challenge: Existing methods for fine-tuning large language models require expensive training on consumer-grade hardwares.
Approach: They propose a sparsity-based approach that introduces trainable sparse adaptations to the weight matrices in the model and offers greater flexibility in selecting fine-tuned parameters.
Outcome: The proposed method outperforms other methods for a simple yet effective baseline for nLP tasks while sacrificing performance.
PSP: Pre-trained Soft Prompts for Few-Shot Abstractive Summarization (2022.coling-1)

Copied to clipboard

Challenge: Experimental results show that our method outperforms full-model tuning in few-shot abstractive summarization tasks.
Approach: They propose a soft prompts architecture with prompt pre-training and prompt fine-tuning paradigm to support few-shot abstractive summarization.
Outcome: The proposed model outperforms Prompt Tuning and Profix-Tuning on CNN/DailyMail and XSum datasets and outperfies Profix Tuning by a large margin.
Soft Contextual Data Augmentation for Neural Machine Translation (P19-1)

Copied to clipboard

Challenge: Existing methods for enhancing training data are limited in natural language tasks due to text characteristics.
Approach: They propose a data augmentation method that softly augments a randomly chosen word in a sentence by its contextual mixture of multiple related words.
Outcome: The proposed method outperforms baseline methods on small and large scale machine translation datasets.
Continual Relation Learning via Episodic Memory Activation and Reconsolidation (2020.acl-main)

Copied to clipboard

Challenge: Existing methods to learn incessantly emerging novel relations are overfitting the few memorized examples of old relations, causing confusion among existing relations.
Approach: They introduce episodic memory activation and reconsolidation (EMAR) to continual relation learning.
Outcome: The proposed method outperforms state-of-the-art models in catastrophic forgetting old relations.
Towards A Better Initial Policy Model For Scalable Long-CoT Reinforcement Learning (2025.findings-acl)

Copied to clipboard

Challenge: Long-CoT reasoning and reinforcement learning are demonstrating remarkable performance and scalability, however, there is a lack of systematic guidelines for obtaining a better initial policy model.
Approach: They propose a systematic guideline and a novel Re-RFT method to obtain more efficient reasoning patterns from different initial models.
Outcome: The proposed method surpasses DeepSeek-R1-Distill-Qwen-14B model by 4.6%, demonstrating its effectiveness and superiority.
IAD: In-Context Learning Ability Decoupler of Large Language Models in Meta-Training (2024.lrec-main)

Copied to clipboard

Challenge: In-context Learning (ICL) is a paradigm in which LLMs acquire task-specific knowledge by processing input-output pairs provided as prompts.
Approach: They propose an In-context learning Ability Decoupler to separate ICL ability from general ability of LLMs in meta-training phase . they first identify parameters suitable for ICL by transference-driven gradient importance and propose a new max-margin loss to emphasize the separation of the two abilities.
Outcome: The proposed model separates the ICL ability from the general ability of LLMs in the meta-training phase, where the I-related parameters are tuned to adapt for ICL tasks.
Fine-Grained Sentence Functions for Short-Text Conversation (P19-1)

Copied to clipboard

Challenge: Existing research has analyzed various factors indicating the conversational purpose such as emotions, topics, word orders, syntactic patterns and other aspects.
Approach: They propose to annotate a short-text conversation dataset with annotated sentences and train conversation models conditioned on the sentence functions.
Outcome: The proposed model can predict the quality of the returned responses.
OAgents: An Empirical Study of Building Effective Agents (2025.findings-emnlp)

Copied to clipboard

Challenge: a recent study shows that agent research practices are far from standard, rigorous . lack of a standard evaluation protocol makes previous works not reproducible, authors say .
Approach: They conduct an empirical study on the GAIA benchmark to investigate agent design choices . they find that lack of a standard evaluation protocol makes previous works not reproducible .
Outcome: The proposed framework achieves state-of-the-art performance among open-source projects.
A Survey of Large Language Model-Based Search Agents (2026.acl-long)

Copied to clipboard

Challenge: Large Language Models (LLMs) have revolutionized web search, but their integration is static and cannot handle complex contexts.
Approach: They analyze existing research and analyze existing work from the perspectives of architecture, optimization, application, and evaluation.
Outcome: The proposed models can comprehend user intentions and context and execute multi-turn retrieval with dynamic planning, extending search capabilities far beyond the web.
DialogueTRM: Exploring Multi-Modal Emotional Dynamics in a Conversation (2021.findings-emnlp)

Copied to clipboard

Challenge: Existing studies focus on the self and inter-personal dependencies in multi-modal conversations, but they ignore the temporal and spatial dependencies.
Approach: They propose a Dialogue Transformer for simultaneously modeling the intra-modal and inter-modal emotion dynamics.
Outcome: The proposed models outperform the state-of-the-art on three benchmark datasets.
Planning, Creation, Usage: Benchmarking LLMs for Comprehensive Tool Utilization in Real-World Complex Scenarios (2024.findings-acl)

Copied to clipboard

Challenge: Existing benchmarks focus on simple synthesized queries that do not reflect real-world complexity, thereby offering limited perspectives in evaluating tool utilization.
Approach: They propose a benchmark to evaluate LLMs’ ability in tool utilization within real-world scenarios.
Outcome: The proposed benchmark improves LLMs’ ability in tool utilization within real-world scenarios and eliminates the restriction of pre-defined toolset.
SciEx: Benchmarking Large Language Models on Scientific Exams with Human Expert Grading and Automatic Grading (2024.emnlp-main)

Copied to clipboard

Challenge: Large Language Models (LLMs) are rapidly developing and are becoming more and more useful in scientific tasks.
Approach: They propose to use LLM-as-a-judge to grade LLMs on SciEx to assess their ability on scientific tasks.
Outcome: The proposed benchmarks show that the LLMs perform decently on free-form exams, achieving 0.948 Pearson correlation with expert grading.
AndroidGen: Building an Android Language Agent under Data Scarcity (2025.acl-long)

Copied to clipboard

Challenge: Existing LLMs lack high-quality data sources and lack robust data filtration strategies.
Approach: They develop a framework to enhance the capabilities of LLM-based agents under data scarcity.
Outcome: The proposed framework improves the capabilities of LLM-based agents under data scarcity.
Lightweight Haar Wavelet Subband Pruning for LLMs (2026.findings-acl)

Copied to clipboard

Challenge: Large language models (LLMs) have impressive performance but require computational and memory resources.
Approach: They propose a post-training framework that uses a Haar wavelet transform to prune weights.
Outcome: The proposed pruning framework reduces pruning time and computational costs by removing less important weights while preserving model architecture.
Open Domain Question Answering with A Unified Knowledge Interface (2022.acl-long)

Copied to clipboard

Challenge: a retriever-reader framework is popular for open domain question answering . however, accessing heterogeneous knowledge sources through a unified interface remains unknown .
Approach: They propose a retriever-reader framework that uses explicit knowledge to access heterogeneous knowledge sources through a unified interface.
Outcome: The proposed framework can benefit from the expanded knowledge index, the authors show . their approach sets the single-model state-of-the-art on Natural Questions .
Mixture of insighTful Experts (MoTE): The Synergy of Reasoning Chains and Expert Mixtures in Self-Alignment (2025.acl-long)

Copied to clipboard

Challenge: Recent studies show that reasoning abilities contribute significantly to model safety, while integrating Mixture-of-Experts (MoE) architectures can further enhance alignment.
Approach: They propose a framework that synergistically combines reasoning chains and expert mixtures to improve self-alignment.
Outcome: The proposed framework improves model safety, jailbreak resistance, and over-refusal capabilities, achieving performance comparable to OpenAI’s state-of-the-art o1 model.
Multilingual Knowledge Graph Completion from Pretrained Language Models with Knowledge Constraints (2023.findings-acl)

Copied to clipboard

Challenge: Existing methods for multilingual knowledge graph completion do not align with mKGC tasks because of their English-centric bias.
Approach: They propose to use multilingual pretrained language models to solve queries in different languages by reasoning a tail entity.
Outcome: The proposed method outperforms the previous SOTA on Hits@1 and Hits @10 by 12.32% and 16.03% on public datasets.
CORN: Co-Reasoning Network for Commonsense Question Answering (2022.coling-1)

Copied to clipboard

Challenge: Existing work uses two independent modules to model QA content and external commonsense knowledge graph (KG) Existing research uses two separate modules to create QA contextual text representations and relationships between QA entities.
Approach: They propose a commonsense question answering (QA) model that uses two independent modules to model QA contextual text representation and relationships between QA entities in KG.
Outcome: The proposed model achieves state-of-the-art on QA benchmarks in the CommonsenseQA and OpenBookQA datasets.
Learn to Relax with Large Language Models: Solving Constraint Optimization Problems via Bidirectional Coevolution (2026.acl-long)

Copied to clipboard

Challenge: Large Language Model (LLM)-based optimization has shown promise for autonomous problem solving, but most approaches cast LLMs as passive constraint checkers rather than proactive strategy designers.
Approach: They propose an end-to-end Automated Constraint Optimization method that tightly couples operations-research principles of constraint relaxation with LLM reasoning.
Outcome: Extensive experiments on three challenging COP benchmarks validate AutoCO’s consistent effectiveness and superior performance, especially in hard regimes where current methods degrade.
Nirvana: A Specialized Generalist Model With Task-Aware Memory Mechanism (2026.acl-long)

Copied to clipboard

Challenge: Existing models lack task-guided specialized memory mechanisms . specialized generalist models excel at general language tasks but struggle in specialized domains.
Approach: They propose a specialized generalist model with specialized memory and updater that can optimize for specialized domains.
Outcome: The proposed model matches or surpasses baselines on general benchmarks and achieves lowest perplexity across specialized domains.
MoverScore: Text Generation Evaluating with Contextualized Embeddings and Earth Mover Distance (D19-1)

Copied to clipboard

Challenge: Existing evaluation metrics are not capable of evaluating text quality.
Approach: They propose a metric that compares system output against reference texts based on semantics rather than surface forms.
Outcome: The proposed metric shows a high correlation with human judgment of text quality on a number of text generation tasks.
Representation Alignment and Adversarial Networks for Cross-lingual Dependency Parsing (2024.findings-emnlp)

Copied to clipboard

Challenge: Pre-trained language models have improved dependency parsing accuracy in resource-rich languages . however, the accuracy drops sharply when the model is transferred to low-resource language .
Approach: They propose a representation alignment and adversarial model to filter out useful knowledge from rich-resource language and ignore useless ones.
Outcome: The proposed model outperforms baseline models on the benchmark datasets by 1.37 LAS and 1.34 UAS.
SessionIntentBench: A Multi-task Inter-session Intention-shift Modeling Benchmark for E-commerce Customer Behavior Understanding (2026.findings-acl)

Copied to clipboard

Challenge: Existing models fail to capture and model customer intention effectively because of insufficient information exploitation and only apparent information like descriptions and titles are used.
Approach: They propose to exploit existing session data to capture and model intention in E-commerce product purchase sessions using a multimodal benchmark.
Outcome: The proposed framework can bridge the gap between intention understanding in simplified research cases like co-buy intention and more complex yet practical scenarios like session history.
Has It All Been Solved? Open NLP Research Questions Not Solved by Large Language Models (2024.lrec-main)

Copied to clipboard

Challenge: Recent advances in large language models have led to misleading public discourse that “it’s all been solved.”
Approach: They identify 14 research areas encompassing 45 research directions that require new research and are not directly solvable by LLMs.
Outcome: The research areas identified are 45 research directions that require new research and are not directly solvable by LLMs.
FolkScope: Intention Knowledge Graph Construction for E-commerce Commonsense Discovery (2023.findings-acl)

Copied to clipboard

Challenge: Existing intention-based studies on recommendation tasks are limited and use models to implicitly model the intention memberships.
Approach: They propose a framework that leverages the generation power of large language models and human-in-the-loop annotation to semi-automatically construct the intention knowledge graph.
Outcome: The proposed framework can model e-commerce knowledge and have many potential applications.
Targeted Adversarial Training for Natural Language Understanding (2021.naacl-main)

Copied to clipboard

Challenge: Existing adversarial training approaches focus on making adversarials less expensive or regularizing rather than replacing the standard training objective.
Approach: They propose an algorithm to introspect current mistakes and prioritize adversarial training steps to where the model errs the most.
Outcome: The proposed algorithm improves adversarial training for natural language understanding by introspecting mistakes and prioritizing training steps to where the model errs the most.
Outlier-weighed Layerwise Sampling for LLM Fine-tuning (2025.findings-acl)

Copied to clipboard

Challenge: Large Language Models (LLMs) are a powerful tool for processing complex natural language processing tasks.
Approach: They propose an approach to fine-tune LLMs with outliers and a gradient low-rank projection to increase the number of fine-sampled layers without a proportional increase in memory costs.
Outcome: The proposed approach outperforms baseline approaches while being more memory efficient.
SADA: Bridging In-Context Learning and Fine-Tuning via State-Aligned Distillation Adapters (2026.acl-long)

Copied to clipboard

Challenge: Prompt-based in-context learning and parameter fine-tuning are dominant paradigms for incorporating external information into large language models, but they incur high inference costs or require expensive retraining.
Approach: They propose to convert prompts into temporary adapter weights to bridge this gap by converting prompts to temporary adapters.
Outcome: The proposed model outperforms baselines on long-context language modeling and downstream NLU and summarization benchmarks while significantly reducing memory footprint and latency.
Learning from Context or Names? An Empirical Study on Neural Relation Extraction (2020.emnlp-main)

Copied to clipboard

Challenge: Existing datasets may leak shallow heuristics via entity mentions, thus contributing to the high performance on RE benchmarks.
Approach: They propose an entity-masked contrastive framework for relation extraction to gain a deeper understanding on textual context and type information while avoiding rote memorization of entities.
Outcome: The proposed framework improves the effectiveness and robustness of neural models in different RE scenarios.
Context-Situated Pun Generation (2022.emnlp-main)

Copied to clipboard

Challenge: a new task for context-situated pun generation uses a given context to generate puns . human evaluation shows that 69% of top retrieved pun words can be used to generate context-based puns.
Approach: They propose a task where puns are generated based on contextual keywords and pun words.
Outcome: The proposed system generates successful puns 31% of the time given a plausible tuple of context words and pun pairs.
Polymorphic Universal Transformer (2026.acl-long)

Copied to clipboard

Challenge: Compute Distribution Skew is a pathological phenomenon in ultra-deep recurrent models . it causes over-smoothing, representation rank collapse, and degraded reasoning performance.
Approach: They propose a dynamic architecture that redefines recursive computation by decoupling parameter count from depth.
Outcome: The proposed model significantly improves representation rank and reasoning robustness while reducing computation by 64.7%.
Any Information Is Just Worth One Single Screenshot: Unifying Search With Visualized Information Retrieval (2025.acl-long)

Copied to clipboard

Challenge: Existing multimodal retrieval models are lacking in visual representations of multimodal data.
Approach: They propose a visualized information retrieval paradigm where multimodal information is represented by a unified visual format called Screenshots for various retrieval applications.
Outcome: The proposed model is based on a large dataset of screenshots from diverse sources . it is compared with existing models and lays a solid foundation for the new model .
Diversifying the Expert Knowledge for Task-Agnostic Pruning in Sparse Mixture-of-Experts (2025.findings-acl)

Copied to clipboard

Challenge: Large Language Models (LLMs) have outstanding performance by learning a large number of model parameters on large amounts of data.
Approach: They propose a method of grouping and pruning similar experts to improve the model’s parameter efficiency by a range of natural language tasks.
Outcome: The proposed method outperforms other model pruning methods on a range of natural language tasks.
LiST: Lite Prompted Self-training Makes Parameter-efficient Few-shot Learners (2022.findings-naacl)

Copied to clipboard

Challenge: LiST is an efficient method for fine-tuning large pre-trained language models in few-shot learning settings.
Approach: They propose a method for efficient fine-tuning of large pre-trained language models in few-shot settings using self-training and meta-learning.
Outcome: The proposed method outperforms GPT-3 in-context learning by 33% on few-shot tasks.
VenusFactory: An Integrated System for Protein Engineering with Data Retrieval and Language Model Fine-Tuning (2025.acl-demo)

Copied to clipboard

Challenge: Pre-trained protein language models have been used in protein engineering, but their adoption is limited due to data collection, task benchmarking, and application challenges.
Approach: They propose a versatile engine that integrates biological data retrieval, standardized task benchmarking, and modular fine-tuning of PLMs.
Outcome: The proposed engine integrates biological data retrieval, task benchmarking, and modular fine-tuning of PLMs.
BvSP: Broad-view Soft Prompting for Few-Shot Aspect Sentiment Quad Prediction (2024.acl-long)

Copied to clipboard

Challenge: Aspect sentiment quad prediction aims to predict aspects due to distinct data distribution.
Approach: They propose a method that aggregates multiple templates with a broader view . they first construct a few-shot ASQP dataset that contains richer categories .
Outcome: The proposed method outperforms the state-of-the-art methods under four few-shot settings and other public datasets.
DSRM: Boost Textual Adversarial Training with Distribution Shift Risk Minimization (2023.acl-long)

Copied to clipboard

Challenge: Existing adversarial training methods require multi-step gradient ascents or word substitutions to obtain adversarials, which impairs the effectiveness of adversariarial training.
Approach: They propose a procedure for instead adversarial training with only clean data that estimates the adversarials loss by perturbing the input data’s probability distribution rather than their embeddings.
Outcome: The proposed procedure reduces time consumption by up to 70% compared to current best-performing adversarial training methods.
Transferring General Multimodal Pretrained Models to Text Recognition (2023.findings-acl)

Copied to clipboard

Challenge: Existing methods for text recognition rely on large-scale pretraining on human-annotated or synthetic data.
Approach: They propose a method to transfer multimodal pretrained models to text recognition using image captioning.
Outcome: The proposed method outperforms the baselines and achieves state-of-the-art performance in the Chinese text recognition benchmark.
Cyclical Annealing Schedule: A Simple Approach to Mitigating KL Vanishing (N19-1)

Copied to clipboard

Challenge: Variational autoencoders (VAEs) with an auto-regressive decoder have been applied for many natural language processing tasks.
Approach: They propose a cyclical annealing schedule which repeats the process of increasing multiple times to learn more meaningful latent codes progressively by leveraging previous learning cycles as warm re-restart.
Outcome: The proposed method improves on a broad range of NLP tasks, including language modeling, dialog response generation and semi-supervised text classification.
Multilingual Knowledge Graph Completion via Efficient Multilingual Knowledge Sharing (2025.findings-emnlp)

Copied to clipboard

Challenge: Existing MKGC research ignores the shareability of cross-lingual knowledge.
Approach: They propose a multilingual knowledge Graph Completion framework that leverages multilingual shared knowledge to significantly enhance performance through two components: Knowledge-level Grouped Mixture of Experts (KL-GMoE) and Iterative Entity Reranking (IER).
Outcome: The proposed framework achieves improvements of 5.47%, 3.27%, and 1.01% in the Hits@1, Hits @3, and Hits_10 metrics, respectively, compared with existing state-of-the-art (SOTA) MKGC method.
Can LLMs See Without Pixels? Benchmarking Spatial Intelligence from Textual Descriptions (2026.findings-acl)

Copied to clipboard

Challenge: Existing advances in Spatial Intelligence rely on vision-Language Models . however, a critical question remains: does spatial understanding originate from visual encoders?
Approach: They propose to evaluate the SI performance of Large Language Models without pixel-level input.
Outcome: The proposed benchmark challenges large language models to perform symbolic reasoning rather than visual pattern matching.
SMART: Robust and Efficient Fine-Tuning for Pre-trained Natural Language Models through Principled Regularized Optimization (2020.acl-main)

Copied to clipboard

Challenge: Existing methods for fine-tuning pre-trained models fail to generalize to unseen data.
Approach: They propose a framework for robust and efficient fine-tuning for pre-trained models . proposed framework achieves new state-of-the-art performance on a number of NLP tasks .
Outcome: The proposed framework outperforms the state-of-the-art T5 model on GLUE, SNLI, SciTail and ANLI.
Free your mouse! Command Large Language Models to Generate Code to Format Word Documents (2024.emnlp-main)

Copied to clipboard

Challenge: Recent LLMs have significantly improved code generation, making it increasingly accessible to users.
Approach: They propose an automatic document formatting method, Text-to-Format, driven by various prompting strategies and a high-quality dataset DocFormEval data.
Outcome: The proposed method improves the efficiency and experience of users in formatting the document and improves document formatting task.
SIB-200: A Simple, Inclusive, and Big Evaluation Dataset for Topic Classification in 200+ Languages and Dialects (2024.eacl-long)

Copied to clipboard

Challenge: despite progress in building multilingual language models evaluation is limited to a few languages with available datasets . despite this, we create a large-scale open-sourced benchmark dataset for topic classification in 205 languages and dialects to address the lack of evaluation dataset for Natural Language Understanding (NLU).
Approach: They create a large-scale open-sourced benchmark dataset for topic classification in 205 languages and dialects to address the lack of evaluation dataset for Natural Language Understanding (NLU).
Outcome: The proposed dataset addresses the lack of evaluation dataset for Natural Language Understanding (NLU) for many languages, it is the first publicly available evaluation dataset.
Once is Enough: A Light-Weight Cross-Attention for Fast Sentence Pair Modeling (2023.emnlp-main)

Copied to clipboard

Challenge: Recent studies suggest that transformer-based models perform cross-attention over input pairs, leading to computational cost.
Approach: They propose a lightweight cross-attention mechanism that performs query encoding only once while modeling the query-candidate interaction in parallel.
Outcome: The proposed model speeds up sentence pairing by over 113x while achieving comparable performance as the more expensive models.
Active Retrieval Augmented Generation (2023.emnlp-main)

Copied to clipboard

Challenge: Generative language models (LMs) have a tendency to hallucinate and create inaccurate output.
Approach: They propose a method which iteratively uses a prediction of the upcoming sentence to anticipate future content.
Outcome: The proposed method achieves superior or competitive performance on all tasks . iteratively uses a prediction of the upcoming sentence to anticipate future content .
ECoK: Emotional Commonsense Knowledge Graph for Mining Emotional Gold (2024.findings-acl)

Copied to clipboard

Challenge: Existing knowledge graphs focus on the representation and reasoning of general factual knowledge, while there are significant deficiencies in the understanding and reasoning for emotional knowledge.
Approach: They propose a commonsense knowledge graph that can be used to represent emotional knowledge by combining theories from psychology, cognitive science, and linguistics.
Outcome: The proposed model surpasses GPT-4-Turbo in the emotion-related tasks.
MobileBench-OL: A Comprehensive Chinese Benchmark for Evaluating Mobile GUI Agents in Real-World Environment (2026.findings-acl)

Copied to clipboard

Challenge: Recent advances in mobile Graphical User Interface (GUI) agents highlight the growing need for comprehensive evaluation benchmarks.
Approach: They propose an online benchmark with 1080 tasks from 80 Chinese apps that measures task execution, complex reasoning, noise robustness and auto-eval framework with a reset mechanism.
Outcome: The proposed benchmark measures task execution, complex reasoning, and noise robustness of agents by including 5 subsets, which set multiple evaluation dimensions.
LogitSpec: Accelerating Retrieval-based Speculative Decoding via Next Next Token Speculation (2026.findings-acl)

Copied to clipboard

Challenge: Speculative decoding (SD) is a promising technique for LLM inference acceleration.
Approach: They propose a method to generate draft tokens in a retrieval-based manner to reduce drafting overhead and improve inference speed.
Outcome: Extensive tests show that *LogitSpec* can achieve 2.61 speedup and 3.28 mean accepted tokens per decoding step.
Towards Complex Text-to-SQL in Cross-Domain Database with Intermediate Representation (P19-1)

Copied to clipboard

Challenge: IRNet synthesizes SQL queries in an end-to-end manner, but it yields unsatisfactory performance on public benchmarks.
Approach: They propose a neural approach called IRNet for complex and cross-domain Text-to-SQL.
Outcome: IRNet achieves 46.7% accuracy on the Spider benchmark, a 19.5% improvement over state-of-the-art approaches.
Parameter-Efficient Fine-Tuning via Circular Convolution (2025.findings-acl)

Copied to clipboard

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

Copied to clipboard

Challenge: Current open-domain question answering systems follow a Retriever-Reader architecture . current systems do not use a reranker, which reranked passages based on top predictions of the reader .
Approach: They propose a reader-guIDEd reranking method that reranked passages based on top predictions . they show that RIDER achieves 10 to 20 absolute gains in top-1 retrieval accuracy .
Outcome: The proposed method achieves 10 to 20 gains in top-1 retrieval accuracy and 1 to 4 Exact Match gains without training.

What is GenGO?

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

Information

About
Limitations