Papers by Qi Sun

140 papers
Snapshot-Guided Domain Adaptation for ELECTRA (2022.findings-emnlp)

Copied to clipboard

Challenge: Existing domain-specific knowledge of domain-related tasks is lacking in pre-trained language models.
Approach: They propose a domain-adaptation method which can dynamically select domain-specific tokens and guide the discriminator to emphasize them, without introducing new training parameters.
Outcome: The proposed method can capture domain-specific knowledge of domain-related tasks without introducing new training parameters.
Muse: Towards Reproducible Long-Form Song Generation with Fine-Grained Style Control (2026.findings-acl)

Copied to clipboard

Challenge: Recent commercial systems such as Suno demonstrate strong capabilities in long-form song generation, but academic research remains non-reproducible due to the lack of publicly available training data.
Approach: They propose a system for long-form song generation with fine-grained style conditioning that includes a licensed synthetic dataset and a song generation model, Muse.
Outcome: The proposed system achieves competitive performance on phoneme error rate, text–music style similarity, and audio aesthetic quality while enabling controllable segment-level generation across different musical structures.
RE-Matching: A Fine-Grained Semantic Matching Method for Zero-Shot Relation Extraction (2023.acl-long)

Copied to clipboard

Challenge: Existing methods for zero-shot relation extraction lack explicit modeling of matching pattern . et al. (2018) show that our method achieves higher matching accuracy and faster inference speed .
Approach: They propose a fine-grained semantic matching method tailored for zero-shot relation extraction . they decompose sentence-level similarity score into entity matching score and context matching score .
Outcome: The proposed method achieves higher matching accuracy and faster inference speed than state-of-the-art methods.
FOLIO: Natural Language Reasoning with First-Order Logic (2024.emnlp-main)

Copied to clipboard

Challenge: Existing benchmarks for logical reasoning in large language models lack language naturalness or limited complexity.
Approach: They propose to use first-order logic annotations to evaluate logical reasoning capabilities of large language models.
Outcome: The proposed dataset evaluates the FOL reasoning ability of supervised fine-tuning on medium-sized language models.
A Goal Without a Plan Is Just a Wish: Efficient and Effective Global Planner Training for Long-Horizon Agent Tasks (2026.acl-long)

Copied to clipboard

Challenge: Recent advances in large language models (LLMs) have leapt from static chatbots to versatile agents that tackle complex tasks such as science experiments.
Approach: They propose a plan-and-execute framework and propose 'EAGLET' to enhance the executor agent's planning abilities without human effort.
Outcome: The proposed method outperforms existing methods on three long-horizon tasks and reduces training costs by 8 compared to baselines.
Rethinking Smoothness for Fast and Adaptable Entity Alignment Decoding (2025.findings-naacl)

Copied to clipboard

Challenge: Existing methods for integrating knowledge graphs rely on entity and relation embeddings . Fig. 1 shows how to decode knowledge graph in under 6 seconds .
Approach: They propose a framework that only utilizes entity embeddings to decode knowledge graphs.
Outcome: The proposed framework reconstructs KG representation by maximizing smoothness of entity embeddings.
A Skeleton-Based Model for Promoting Coherence Among Sentences in Narrative Story Generation (D18-1)

Copied to clipboard

Challenge: Existing models for narrative story generation lack semantic dependency among sentences.
Approach: They propose a skeleton-based model that generates the most critical phrases and expands them to a complete sentence.
Outcome: The proposed model can generate significantly more coherent stories according to human evaluation and automatic evaluation.
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 .
Aegis:An Advanced LLM-Based Multi-Agent for Intelligent Functional Safety Engineering (2024.emnlp-industry)

Copied to clipboard

Challenge: Aegis is an advanced LLM-based multi-agent for intelligent functional safety engineering that can perform all phases of a vehicle's lifecycle, including design, development, production, operation, and decommissioning.
Approach: They introduce Aegis: An Advanced LLM-Based Multi-Agent for Intelligent Functional Safety Engineering.
Outcome: The proposed solution can perform Hazard Analysis and Risk Assessment (HARA), document Functional Safety Requirements (FSR), and plan test cases for Automatic Emergency Braking (AEB) systems.
EPO: Hierarchical LLM Agents with Environment Preference Optimization (2024.emnlp-main)

Copied to clipboard

Challenge: Long-horizon decision-making tasks require extensive planning over multiple steps, maintaining coherence and goal orientation, which is difficult for LLMs that are typically designed for more immediate and localized predictions.
Approach: They propose a hierarchical framework that decomposes complex tasks into manageable subgoals, utilizing separate LLMs for subgoal prediction and low-level action generation.
Outcome: The proposed framework achieves first place on the ALFRED public leaderboard and demonstrates its potential to improve long-horizon decision-making in diverse environments.
Causal Intervention Improves Implicit Sentiment Analysis (2022.coling-1)

Copied to clipboard

Challenge: Existing neural models struggle with implicit sentiment analysis because they latch onto spurious correlations, resulting in poor generalization and robustness.
Approach: They propose a CausaL intervention model for implicit sEntiment ANalysis using instrumental variable to eliminate confounding causal effects and extract the pure causal effect between sentence and sentiment.
Outcome: The proposed model extracts the pure causal effect between sentence and sentiment using instrumental variable.
Context-DPO: Aligning Language Models for Context-Faithfulness (2025.findings-acl)

Copied to clipboard

Challenge: Context-DPO is the first alignment method specifically designed to enhance contextfaithfulness for large language models.
Approach: They propose a benchmark that simulates Retrieval-Augmented Generation scenarios with knowledge conflicts to evaluate context-faithfulness.
Outcome: The proposed method improves LLMs' context-faithfulness by 35% to 280% over open-source models.
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.
VALU: A Benchmark for Video Anomaly Temporal Localization and Understanding at Multiple Semantic Levels (2026.acl-long)

Copied to clipboard

Challenge: Recent advances in Video Large Language Models (Video-LLMs) enhance the ability of VAU models to describe and interpret anomalies.
Approach: They propose a benchmark that explicitly defines anomalies across five semantic levels and provides detailed temporal boundaries and detailed textual descriptions for each.
Outcome: The proposed benchmark defines anomalies across five semantic levels and provides detailed descriptions for each.
Group, Extract and Aggregate: Summarizing a Large Amount of Finance News for Forex Movement Prediction (D19-51)

Copied to clipboard

Challenge: Existing studies on forex prediction ignore related text completely and focus on forex trade data only, which loses important semantic information.
Approach: They propose a BERT-based Hierarchical Aggregation Model to summarize forex news . they group news from different aspects and extract the most crucial news in each group .
Outcome: The proposed model outperforms baseline methods and grouping methods and summarizes the influence patterns for forex trading.
Uncertainty Guided Label Denoising for Document-level Distant Relation Extraction (2023.acl-long)

Copied to clipboard

Challenge: Document-level relation extraction (DocRE) aims to extract semantic relations between entities in a document.
Approach: They propose a Document-level distant relation extraction framework with unreliable pseudo labels to denoise DS data.
Outcome: The proposed framework outperforms strong baselines on two public datasets.
On LLM-Based Scientific Inductive Reasoning Beyond Equations (2025.emnlp-main)

Copied to clipboard

Challenge: Existing research on inductive reasoning models emphasizes rule design without grounding them in specific scenarios.
Approach: They propose to use LLMs to learn underlying patterns from limited examples in entirely new environments.
Outcome: The proposed benchmark evaluates the inductive reasoning abilities of large language models in scientific settings.
MDR: Model-Specific Demonstration Retrieval at Inference Time for In-Context Learning (2024.naacl-long)

Copied to clipboard

Challenge: Existing methods for retrieval-based in-context learning ignore model biases and fail to retrieve the most appropriate demonstrations for different LLMs.
Approach: They propose a model-specific demonstration retrieval method that considers the biases of different LLMs at inference time.
Outcome: The proposed method improves performance on seen and unseen tasks with multi-scale inference LLMs by up to 41.2%.
ClusterAttn: KV Cache Compression under Intrinsic Attention Clustering (2025.acl-long)

Copied to clipboard

Challenge: Existing methods for sparse attention apply the same pattern across different attention heads and inputs, but fail to capture the intrinsic attention clustering in large language models.
Approach: They propose a training-free sparse attention method that provides an efficient prompt cache compression scheme under intrinsic attention clustering for efficient LLM inference.
Outcome: The proposed method reduces memory usage by 10%–65% and increases throughput by 2.6–4.8 times with no accuracy loss.
MAIN: Mutual Alignment Is Necessary for instruction tuning (2025.emnlp-main)

Copied to clipboard

Challenge: Instruction tuning has enabled large language models to achieve remarkable performance, yet its success heavily depends on the availability of high-quality instruction-response pairs.
Approach: They propose a mutual alignment framework which enforces coherence between instructions and responses through mutual constraints.
Outcome: The proposed framework generalizes well across model architectures and sizes, achieving state-of-the-art performance on LLaMA, Mistral, and Qwen models across diverse benchmarks.
Pass off Fish Eyes for Pearls: Attacking Model Selection of Pre-trained Models (2022.acl-long)

Copied to clipboard

Challenge: Existing feature-based model selection methods are vulnerable to fine-tuning and are not reliable indicators for the PTM’s transferability.
Approach: They propose feature-based model selection methods which assess PTMs’ transferability to a specific task in a fast way without fine-tuning.
Outcome: The proposed methods can make FMS mistakenly judge transferability of models and can be combined with the backdoor attack to misguide the FMS to select poisoned models.
FaithLens: Detecting and Explaining Faithfulness Hallucination (2026.findings-acl)

Copied to clipboard

Challenge: Recent progress in large language models (LLMs) has revolutionized text generation.
Approach: They propose a faithfulness hallucination detection model that can provide binary predictions and corresponding explanations to improve trustworthiness.
Outcome: The proposed model outperforms advanced models on 12 diverse tasks.
Auto-Dialabel: Labeling Dialogue Data with Unsupervised Learning (D18-1)

Copied to clipboard

Challenge: Existing dialog datasets rely on human labeling, which is expensive, limited in size, and in low coverage.
Approach: They propose a framework to automatically cluster dialogue intents and slots . they collect context features, leverage an autoencoder for feature assembly, and adapt a dynamic hierarchical clustering method for intent and slot labeling.
Outcome: The proposed framework can promote human labeling cost to a great extent and achieve good intent clustering accuracy (84.1%) it also provides reasonable and instructive slot labeling results.
Modeling Aspect Correlation for Aspect-based Sentiment Analysis via Recurrent Inverse Learning Guidance (2022.coling-1)

Copied to clipboard

Challenge: Existing methods to learn complex sentence with multiple aspects do not consider correlation between aspects to distinguish overlapped feature.
Approach: They propose a method that uses aspect correlation to improve aspect correlation modeling . they use Recurrent Mechanism to improve the joint representation of aspects .
Outcome: The proposed method is state-of-the-art in multiaspect scenarios.
KARL: Reinforcement Learning for LLM Agents on Multi-Turn Knowledge-Intensive Agentic Tasks (2026.acl-long)

Copied to clipboard

Challenge: Large Language Models have shown remarkable potential as autonomous agents, but their effectiveness in knowledge-intensive tasks remains limited by passive knowledge utilization.
Approach: They propose a framework that enables LLM agents to dynamically explore structured knowledge sources through multi-turn interactions.
Outcome: The proposed framework outperforms existing retrieval-augmented approaches on knowledge graph and database tasks while maximizing tool-use behaviors end-to-end.
ConKI: Contrastive Knowledge Injection for Multimodal Sentiment Analysis (2023.findings-acl)

Copied to clipboard

Challenge: Existing methods for multimodal sentiment analysis focus on general knowledge, which is inadequate to identify specific sentiments across modalities.
Approach: They propose a method where specific-knowledge representations for each modality can be learned together with general knowledge representations via knowledge injection based on an adapter architecture.
Outcome: The proposed method outperforms all prior methods on three popular benchmarks on multimodal sentiment analysis metrics.
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.
The Mirage of Model Editing: Revisiting Evaluation in the Wild (2025.acl-long)

Copied to clipboard

Challenge: despite near-perfect results, effectiveness of model editing in real-world applications remains unclear.
Approach: They propose QAEdit and WILD to better reflect real-world use of model editing . they propose a benchmark aligned with widely used question answering datasets and a task-agnostic evaluation framework .
Outcome: The proposed QAEdit benchmark and WILD evaluation framework show that current models perform worse than previously reported.
HD-Eval: Aligning Large Language Model Evaluators Through Hierarchical Criteria Decomposition (2024.acl-long)

Copied to clipboard

Challenge: Large language models (LLMs) are a promising alternative to expensive human evaluations.
Approach: They propose a framework that iteratively aligns LLM-based evaluators with human preference . they decompose a given evaluation task into finer-grained criteria .
Outcome: The proposed framework iteratively aligns LLM-based evaluators with human preference . it decomposes a given evaluation task into finer-grained criteria . the framework is efficient to train and more explainable than relying solely on prompts .
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.
Unveiling Internal Reasoning Modes in LLMs: A Deep Dive into Latent Reasoning vs. Factual Shortcuts with Attribute Rate Ratio (2025.emnlp-main)

Copied to clipboard

Challenge: Existing research in multi-hop questions has identified two reasoning modes, but has not investigated how these modes differ during inference.
Approach: They propose a classification metric that compares latent reasoning and factual shortcuts in multi-hop questions.
Outcome: The proposed metric achieves 90% accuracy on the proposed datasets and demonstrates effectiveness in RAG conflict scenarios.
Asking Clarification Questions in Knowledge-Based Question Answering (D19-1)

Copied to clipboard

Challenge: Existing clarification datasets with limited annotated examples do not address ambiguous phenomena.
Approach: They propose a dataset that allows users to ask clarification questions using open-domain examples.
Outcome: The proposed model achieves better performance than strong baselines and provides new challenges.
An Auto-Encoder Matching Model for Learning Utterance-Level Semantic Dependency in Dialogue Generation (D18-1)

Copied to clipboard

Challenge: Experimental results show that our model can generate semantically coherent responses compared to baseline models.
Approach: They propose an Auto-Encoder Matching model to learn utterance-level semantic dependency . their model contains two auto-encoders and one mapping module .
Outcome: Experimental results show that the proposed model can generate high coherence and fluency compared to baseline models.
ChartCoder: Advancing Multimodal Large Language Model for Chart-to-Code Generation (2025.acl-long)

Copied to clipboard

Challenge: Existing open-source MLLMs fail to fully capture dense information embedded in charts . current models still face significant challenges in understanding and analyzing visual tasks such as captioning and question answering.
Approach: They propose a chart-to-code MLLM which leverages Code LLMs as the language backbone to enhance the executability of the generated code.
Outcome: The proposed model surpasses existing open-source models on chart-to-code benchmarks with only 7B parameters and provides lossless representations that contain all critical details.
Document Segmentation Matters for Retrieval-Augmented Generation (2025.findings-acl)

Copied to clipboard

Challenge: Existing rule-based chunking methods lead to suboptimal splits, where overly large chunks introduce irrelevant information and small chunks lack semantic coherence.
Approach: They propose a method that leverages document summaries as pseudo-instructions to guide chunking by computing semantic similarity between sentences and the summary.
Outcome: Experiments on multiple open-domain question-answering benchmarks show that PIC significantly improves retrieval accuracy (Hits@k) and end-to-end QA performance (Exact Match) without any additional training.
Turn the Combination Lock: Learnable Textual Backdoor Attacks via Word Substitution (2021.acl-long)

Copied to clipboard

Challenge: Recent studies show that neural natural language processing models are vulnerable to backdoor attacks.
Approach: They propose to inject neural models with backdoors activated by word substitution . their results raise a serious alarm to the security of NLP models, they argue .
Outcome: The proposed backdoors are activated by a learnable combination of word substitution and exhibit higher invisibility than previous methods.
Se2: Sequential Example Selection for In-Context Learning (2024.findings-acl)

Copied to clipboard

Challenge: Prior work has explored the selection of examples for in-context learning, neglecting the internal relationships between examples and exist an inconsistency between training and inference.
Approach: They propose a sequential-aware method that leverages the LLM’s feedback on varying context, aiding in capturing inter-relationships and sequential information among examples.
Outcome: Experiments on 23 NLP tasks show that Se2 surpasses baselines and achieves 42% relative improvement over random selection.
Deconvolution-Based Global Decoding for Neural Machine Translation (C18-1)

Copied to clipboard

Challenge: Existing models for Neural Machine Translation (NMT) use Recurrent Neural Network (RNN) to generate translation word by word following a sequential order.
Approach: They propose a Neural Machine Translation (NMT) model that decodes the sequence with the guidance of its structural prediction of the target-side context.
Outcome: The proposed model is more competitive compared with the state-of-the-art methods and reduces repetition with the instruction from the target-side context for decoding.
To Copy Rather Than Memorize: A Vertical Learning Paradigm for Knowledge Graph Completion (2023.acl-long)

Copied to clipboard

Challenge: Existing methods for embedding knowledge graphs implicitly memorize relation rules to infer missing links, but they are difficult to memorize due to the inherent deficiencies of such implicit memorization strategy.
Approach: They propose a vertical learning paradigm that allows to explicitly copy target information from related factual triples for more accurate prediction.
Outcome: The proposed model improves generalization ability and makes distant link prediction significantly easier.
SSS: Editing Factual Knowledge in Language Models towards Semantic Sparse Space (2024.findings-acl)

Copied to clipboard

Challenge: Existing methods to modify LMs suffer from sub-optimal locality, where irrelevant neighborhood examples can be adversely influenced.
Approach: They propose to use a model editing method to modify specific examples in LMs to improve locality and reasoning capability by directing the hidden state of edit example towards spaces where semantics are sparse.
Outcome: The proposed method improves locality and reasoning capability on two datasets.
Word-level Textual Adversarial Attacking as Combinatorial Optimization (2020.acl-main)

Copied to clipboard

Challenge: Existing word-level attack models are far from perfect because of unsuitable search space reduction methods and inefficient optimization algorithms.
Approach: They propose a novel adversarial adversarialist model that incorporates word substitution and particle swarm optimization to solve two problems separately.
Outcome: The proposed model achieves much higher success rates and crafts more high-quality adversarial examples as compared to baseline methods.
Sub-Character Tokenization for Chinese Pretrained Language Models (2023.tacl-1)

Copied to clipboard

Challenge: Existing tokenization methods for Chinese PLMs treat each character as an indivisible token, but ignore the unique feature of the writing system where additional linguistic information exists below the character level.
Approach: They propose to encode Chinese characters into short sequences and construct Chinese vocabulary based on the encoded text.
Outcome: The proposed tokenizers can tokenize inputs into much shorter sequences, improving computational efficiency.
JointLK: Joint Reasoning with Language Models and Knowledge Graphs for Commonsense Question Answering (2022.naacl-main)

Copied to clipboard

Challenge: Existing KG-augmented models for commonsense question answering ignore the effectively fusing and reasoning over question context representations and the KG representations.
Approach: They propose a novel model which combines a logical reasoning and a dynamic pruning mechanism to solve these limitations.
Outcome: The proposed model improves existing models and performs interpretable reasoning on the CommonsenseQA and OpenBookQA datasets.
PathQG: Neural Question Generation from Facts (2020.emnlp-main)

Copied to clipboard

Challenge: Existing research for question generation encodes text as a sequence of tokens without explicitly modeling fact information.
Approach: They propose to incorporate facts in the input text for question generation in a comprehensive way.
Outcome: The proposed model outperforms state-of-the-art models and human evaluation shows it generates relevant and informative questions.
GeAR: Generation Augmented Retrieval (2025.findings-acl)

Copied to clipboard

Challenge: Document retrieval techniques are used to compute semantic similarity between a query and documents, but the scalar similarity fails to reflect enough information, hindering the interpretation of retrieval results.
Approach: They propose a method which improves the global document-query similarity through contrastive learning and integrates well-designed fusion and decoding modules.
Outcome: The proposed method improves the global document-query similarity through contrastive learning and integrates well-designed fusion and decoding modules.
Investigating Capsule Network and Semantic Feature on Hyperplanes for Text Classification (D19-1)

Copied to clipboard

Challenge: Various neural networks are designed for text classification on the basis of word embedding, but polysemy is a fundamental feature of the natural language, which brings challenges to text classification.
Approach: They propose to use capsule networks to construct the vectorized representation of semantics and utilize hyperplanes to decompose each capsule to acquire the specific senses.
Outcome: The proposed model extracts more discriminative semantic features and yields significant performance gain compared to baseline methods.
REAP: Towards Effective Training-Free Chemical Reasoning with Explicit Atomic Priors (2026.findings-acl)

Copied to clipboard

Challenge: Current approaches to instill explicit priors into LLMs often suffer from an information bottleneck .
Approach: They propose a training-free framework that equips LLMs with an external knowledge base, enabling them to reason over retrieved chemical priors dynamically.
Outcome: Experiments show that REAP outperforms current reasoning methods and rivals state-of-the-art training-based models.
Democratizing Reasoning Ability: Tailored Learning from Large Language Model (2023.emnlp-main)

Copied to clipboard

Challenge: Large language models (LLMs) exhibit impressive emergent abilities in natural language processing, but their democratization is hindered due to huge computation requirements and closed-source nature.
Approach: They propose a tailored learning approach to distill the exclusive reasoning ability to smaller LMs to facilitate democratization.
Outcome: The proposed approach enables the democratization of the exclusive reasoning ability by leveraging the black-box model as a reasoning teacher.
ONION: A Simple and Effective Defense Against Textual Backdoor Attacks (2021.emnlp-main)

Copied to clipboard

Challenge: Backdoor attacks can manipulate the output of deep neural networks and possess high insidiousness.
Approach: They propose a textual backdoor defense based on outlier word detection that can handle all the textual attacks.
Outcome: The proposed method can handle all the textual backdoor attack situations.
WarriorCoder: Learning from Expert Battles to Augment Code Large Language Models (2025.acl-long)

Copied to clipboard

Challenge: Recent code large language models have demonstrated impressive performance on code-related tasks.
Approach: They propose a paradigm that learns from expert battles to address these limitations . they create an arena where leading LLMs challenge each other with evaluations .
Outcome: The proposed model improves on existing models by leveraging expert battles . it achieves state-of-the-art performance even without relying on proprietary models .
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.
Beyond Quantity: Trajectory Diversity Scaling for Code Agents (2026.findings-acl)

Copied to clipboard

Challenge: Code large language models (LLMs) are becoming tool-interactive agents . quantity-centric scaling exhibits an early bottleneck that underutilizes trajectory data . et al.: a new approach to scale trajectory diversity improves tool-use generalization .
Approach: They propose a Trajectory Diversity Scaling-based data synthesis framework for code agents that scales performance through diversity rather than raw volume.
Outcome: Experiments on general tool-use benchmarks and code agent tasks show that TDScaling improves tool-user generalization and inherent coding proficiency.
Going “Deeper”: Structured Sememe Prediction via Transformer with Tree Attention (2022.findings-acl)

Copied to clipboard

Challenge: Existing studies ignore hierarchical structures of sememes in sememe-based semantic description systems.
Approach: They propose a structured sememe prediction problem to predict a sememes tree with hierarchical structures rather than a set of sememas.
Outcome: The proposed model outperforms baseline models and shows its effectiveness . it predicts a sememe tree with hierarchical structures rather than a set of sememes .
Auto Search Indexer for End-to-End Document Retrieval (2023.findings-emnlp)

Copied to clipboard

Challenge: Generative retrieval heavily relies on the “preprocessed” document identifiers, thus limiting its retrieval performance and ability to retrieve new documents.
Approach: They propose a fully end-to-end retrieval paradigm that can learn the best docids for existing and new documents automatically via a semantic indexing module.
Outcome: The proposed model outperforms baselines on public and industrial datasets and can handle new documents.
Structure Regularized Neural Network for Entity Relation Classification for Chinese Literature Text (N18-2)

Copied to clipboard

Challenge: Existing methods for relation classification have been used in natural language processing.
Approach: They propose a relation classification task for Chinese literature text using a new dataset.
Outcome: The proposed model outperforms the state-of-the-art methods on Chinese literature text.
Semi-Supervised Dialogue Policy Learning via Stochastic Reward Estimation (2020.acl-main)

Copied to clipboard

Challenge: Existing methods for dialogue policy optimization do not provide sufficient supervision signals at the end of dialogues.
Approach: They propose to learn from state-action pairs of an optimal policy to provide turn-by-turn rewards.
Outcome: The proposed approach outperforms competitive policy learning baselines on a benchmark multi-domain dataset.
Adversarial Knowledge Stimulated Contrastive Prompting for Few-shot Language Learners (2023.findings-acl)

Copied to clipboard

Challenge: Prompt-based fine-tuning has boosted performance of Pre-trained language models on few-shot Natural Language Understanding (NLU) tasks by employing task-specific prompts.
Approach: They propose a Cloze-driven prompt framework for prompt tuning that implicitly stimulates knowledge from pre-trained language models.
Outcome: The proposed framework outperforms state-of-the-art for prompt-based fine-tuning on few-shot NLU tasks.
Automatic Construction of Sememe Knowledge Bases via Dictionaries (2021.findings-acl)

Copied to clipboard

Challenge: Sememe knowledge bases (SKBs) are used to analyze natural language processing.
Approach: They propose a method to build sememe knowledge bases from an existing dictionary . they propose to use existing dictionaries to build an English and a French SKB .
Outcome: The proposed method is superior to HowNet, the most widely used SKB that takes decades to build manually.
HIPO: A Hierarchical Prompt Optimization Framework with Task Awareness and Fine-Grained Debugging (2026.findings-acl)

Copied to clipboard

Challenge: Existing methods for prompt optimization apply the same prompt across all samples . existing methods ignore variation in sample difficulty .
Approach: They propose a framework that shifts the paradigm from dataset-level to sample-level optimization.
Outcome: The proposed framework outperforms baselines on 27 tasks and reduces API calls, token consumption and overall cost by 1.2 to 80.
When to Trust LLMs: Aligning Confidence with Response Quality (2024.findings-acl)

Copied to clipboard

Challenge: Existing methods express reliability by confidence level, but lack objective guidance . Existing approaches express reliability but lack guidance on when to trust LLMs .
Approach: They propose a reward-based approach to align confidence with quality to ensure reliability . they propose 'conqORD' to help model to verbalize greater confidence for higher quality responses .
Outcome: Experiments show that CONQORD significantly improves confidence and response accuracy . the proposed approach can be used to determine reliability of large language models .
A Global Past-Future Early Exit Method for Accelerating Inference of Pre-trained Language Models (2021.naacl-main)

Copied to clipboard

Challenge: Existing methods to accelerate inference speed of pre-trained language models are limited to local representations of exit layer . current models are associated with large memory requirement and high computational cost, which slow down inference and further encumber the application of PLMs.
Approach: They propose a method to exit early without passing through all inference layers . they take into consideration all the linguistic information embedded in the past layers a global perspective .
Outcome: The proposed method outperforms existing methods by a large margin . it uses linguistic information embedded in the past layers and future features . the proposed method is scalable and cost-effective .
Latent Reasoning for Low-Resource Question Generation (2021.findings-acl)

Copied to clipboard

Challenge: Existing approaches to multihop question generation require extensive data collection and decomposition.
Approach: They propose a generative approach that optimizes the two-phase model without question decomposition data.
Outcome: The proposed approach outperforms baselines on HOTPOTQA, a benchmark multi-hop question answering dataset.
Cross-lingual Lexical Sememe Prediction (D18-1)

Copied to clipboard

Challenge: Sememes are defined as the minimum semantic units of human languages . but most languages do not have sememe-based linguistic knowledge bases . a new framework is proposed to predict sememes for words in other languages based on semems .
Approach: They propose a framework to model correlations between sememes and multi-lingual words in low-dimensional semantic space for sememe prediction.
Outcome: The proposed model improves on baseline methods on real-world datasets.
ClueAnchor: Clue-Anchored Knowledge Reasoning Exploration and Optimization for Retrieval-Augmented Generation (2025.findings-emnlp)

Copied to clipboard

Challenge: Existing RAG systems often underutilize the retrieved documents, authors say . they fail to extract and integrate key clues needed to support faithful and interpretable reasoning .
Approach: a new framework extracts key clues from retrieved content and generates multiple reasoning paths . the framework optimizes the model by selecting the most appropriate reasoning path .
Outcome: Experiments show that ClueAnchor outperforms baseline RAG frameworks in completeness and robustness.
Emma-X: An Embodied Multimodal Action Model with Grounded Chain of Thought and Look-ahead Spatial Reasoning (2025.acl-long)

Copied to clipboard

Challenge: Visual-Language-Action models lack the ability to generate actionable policies tailored to specific robotic embodiments.
Approach: They propose an embodied multimodal action model with Grounded Chain of Thought and Look-ahead Spatial Reasoning that enhances spatial reasoning and task planning.
Outcome: The proposed model improves on existing baselines in tasks requiring spatial reasoning and grounding reasoning.
Toward Recognizing More Entity Types in NER: An Efficient Implementation using Only Entity Lexicons (2020.findings-emnlp)

Copied to clipboard

Challenge: Existing named entity recognition systems require large scale labeled data to perform, while annotation of NER data is laborious and time-consuming.
Approach: They propose to adjust an existing named entity recognition system to recognize entity types not defined in the system.
Outcome: The proposed method can be quickly adjusted to a named entity recognition system.
Dim-Krum: Backdoor-Resistant Federated Learning for NLP with Dimension-wise Krum-Based Aggregation (2022.findings-emnlp)

Copied to clipboard

Challenge: Existing methods to reduce backdoor risk of federated learning are validated in the CV field.
Approach: They propose a federated aggregation algorithm that detects errors determined by backdoor strengths for NLP attacks.
Outcome: The proposed method is hard to defend against than CV, and the results validate it.
InMind: Evaluating LLMs in Capturing and Applying Individual Human Reasoning Styles (2025.emnlp-main)

Copied to clipboard

Challenge: Recent large language models (LLMs) have demonstrated strong reasoning abilities across complex mathematical and scientific domains.
Approach: They propose a framework to assess whether LLMs can capture and apply personalized reasoning styles in social deduction games.
Outcome: The proposed framework evaluates LLMs on the game Avalon and shows that they can capture and apply individualized reasoning styles.
AutoReproduce: Automatic AI Experiment Reproduction with Paper Lineage (2026.acl-long)

Copied to clipboard

Challenge: Efficient reproduction of research papers requires deep domain expertise.
Approach: They propose a framework that systematically mines implicit knowledge from the cited literature to reproduce experimental code in a complete, end-to-end manner.
Outcome: The proposed framework surpasses baselines across all metrics and reproduces experimental code in a complete, end-to-end manner.
Review-Driven Multi-Label Music Style Classification by Exploiting Style Correlations (N19-1)

Copied to clipboard

Challenge: Several methods have been proposed for automatic music style classification, but they are limited in two aspects.
Approach: They propose a deep learning approach to automatically learn and exploit style correlations by reviewing music reviews on websites.
Outcome: The proposed approach performs well in capturing style correlations.
OpenAttack: An Open-source Textual Adversarial Attack Toolkit (2021.acl-demo)

Copied to clipboard

Challenge: Various attack models are distinct and implemented with different programming frameworks and settings, which hinders quick utilization and fair comparison of attack models.
Approach: They propose an open-source textual adversarial attack toolkit to solve these issues by combining 15 typical attack models into one toolkit.
Outcome: The proposed toolkit supports all attack types, multilinguality, and parallel processing.
Global Encoding for Abstractive Summarization (P18-2)

Copied to clipboard

Challenge: Existing models for abstractive summarization suffer from repetition and semantic irrelevance.
Approach: They propose a global encoding framework which controls the information flow from the encoder to the decoder based on the global information of the source context.
Outcome: The proposed model outperforms baseline models on the LCSTS and English Gigaword and can generate summary of higher quality and reduce repetition.
RecStream: Graph-aware Stream Management for Concurrent Recommendation Model Online Serving (2025.coling-industry)

Copied to clipboard

Challenge: Existing systems that use recommendation models perform poorly under highly concurrent scenarios.
Approach: They propose a system that optimizes stream configurations based on model characteristics and concurrency levels.
Outcome: The proposed system outperforms existing methods under high concurrency scenarios.
Connectivity Patterns are Task Embeddings (2023.findings-acl)

Copied to clipboard

Challenge: Existing methods for predicting inter-task transferability are sparse and task-specific.
Approach: They propose a method that uses connectivity patterns of neurons as a unique identifier associated with a task.
Outcome: The proposed method outperforms baselines in predicting inter-task transferability across data regimes and transfer settings while keeping high efficiency in computation and storage.
Thought-Action Graph Reasoning: Faithful and Efficient Reasoning of Large Language Models via Reusing Past Experience (2026.findings-acl)

Copied to clipboard

Challenge: Existing methods for integrating knowledge graphs with LLMs suffer from poor generalization or low reasoning efficiency.
Approach: They propose a thought-action Graph (TAG) that decomposes LLM-KG interaction trajectories into fine-grained semantic operators and guides LLM to execute on them.
Outcome: The proposed paradigm outperforms state-of-the-art methods on KGQA benchmarks while reducing the number of LLM calls and generated tokens.
NL2Lean: Translating Natural Language into Lean 4 through Multi-Aspect Reinforcement Learning (2025.emnlp-main)

Copied to clipboard

Challenge: Existing formal proof assistants rely on instruction tuning and lack fine-grained structural and semantic alignment.
Approach: They propose a reinforcement learning framework that enables LLMs to translate natural language into formal language such as Lean 4 . they use a model with basic translation ability to refine the model's reinforcement learning .
Outcome: The proposed method outperforms baseline models on NL-to-Lean 4 tasks.
Multi-stage Distillation Framework for Cross-Lingual Semantic Similarity Matching (2022.findings-naacl)

Copied to clipboard

Challenge: Existing studies have shown that cross-lingual knowledge distillation can improve the performance of pre-trained models for cross-linguistic similarity matching tasks.
Approach: They propose a multi-stage distillation framework for constructing a small-size but high-performance cross-lingual model using contrastive learning, bottleneck, and parameter recurrent strategies.
Outcome: The proposed model can compress the size of XLM-R and MiniLM by more than 50% while the performance is only reduced by about 1%.
DUET: Joint Exploration of User–Item Profiles in Recommendation System (2026.findings-acl)

Copied to clipboard

Challenge: Existing LLMs are opaque and difficult to interpret, resulting in limited interpretability.
Approach: They propose an interaction-aware profile generator that jointly produces user and item profiles conditioned on both user history and item evidence.
Outcome: The proposed model outperforms baselines on three real-world datasets.
Generalizable and Explainable Dialogue Generation via Explicit Action Learning (2020.findings-emnlp)

Copied to clipboard

Challenge: Conditioned response generation for task-oriented dialogues implicitly optimizes task completion and language quality.
Approach: They propose to learn natural language actions that represent utterances as a span of words.
Outcome: The proposed approach outperforms latent action baselines on a multi-domain dataset.
Mnemis: Dual-Route Retrieval on Hierarchical Graphs for Long-Term LLM Memory (2026.acl-long)

Copied to clipboard

Challenge: Existing methods for retrieving historical messages are based on similarity-based mechanisms.
Approach: They propose a system that integrates System-1 similarity search with a complementary System-2 mechanism, termed Global Selection.
Outcome: The proposed framework achieves state-of-the-art on long-term memory benchmarks and 93.9 on LoCoMo and 91.6 on LongMemEval-S.
QuoteR: A Benchmark of Quote Recommendation for Writing (2022.acl-long)

Copied to clipboard

Challenge: Existing methods to recommend quotes are evaluated on unpublished datasets .
Approach: They propose to build a dataset that is open and contains three parts including English, standard Chinese and classical Chinese.
Outcome: The proposed model outperforms existing methods on all three parts of QuoteR.
Sememe Prediction for BabelNet Synsets using Multilingual and Multimodal Information (2022.findings-acl)

Copied to clipboard

Challenge: Existing sememe KBs only cover a few languages, which hinders the wide utilization of sememes.
Approach: They propose to build a multilingual sememe KB based on a dictionary called BabelNet . they use multilingual synonyms, multilingual glosses and images to encode sememes .
Outcome: The proposed model outperforms previous methods in terms of MAP and F1 scores.
TSGP: Two-Stage Generative Prompting for Unsupervised Commonsense Question Answering (2022.findings-emnlp)

Copied to clipboard

Challenge: Existing studies focus on acquiring relevant knowledge by retrieving external knowledge bases and fine-tuning pre-trained models.
Approach: They propose a two-stage prompt-based unsupervised commonsense question answering framework that leverages implicit knowledge stored in PrLMs to generate knowledge for questions with unlimited types and possible candidate answers independent of specified choices.
Outcome: The proposed framework significantly improves the reasoning ability of language models in unsupervised settings.
OlympiadBench: A Challenging Benchmark for Promoting AGI with Olympiad-Level Bilingual Multimodal Scientific Problems (2024.acl-long)

Copied to clipboard

Challenge: Large Language Models (LLMs) and Large Multimodal Models have exceeded general human capabilities in various tasks.
Approach: They present an Olympiad-level bilingual multimodal scientific benchmark featuring 8,476 problems from Olympiad level mathematics and physics competitions.
Outcome: The best performing model, GPT-4V, attains an average score of 17.97% on OlympiadBench, with a mere 10.74% in physics, highlighting the benchmark rigor and the intricacy of physical reasoning.
Too Consistent to Detect: A Study of Self-Consistent Errors in LLMs (2025.emnlp-main)

Copied to clipboard

Challenge: Existing detection methods fail to account for **self-consistent error** . study identifies self-consistency errors and evaluates them .
Approach: They propose a method that fuses hidden state evidence from an external verifier LLM to detect self-consistent errors.
Outcome: The proposed method significantly enhances performance on self-consistent errors across three LLM families.
Specificity-Driven Cascading Approach for Unsupervised Sentiment Modification (D19-1)

Copied to clipboard

Challenge: Existing methods for unsupervised sentiment modification lack specific information in text generated without parallel data . specificity-driven cascading approach can improve specificity of generated text and content preservation .
Approach: They propose a specificity-driven cascading approach for unsupervised sentiment modification . the method performs target sentiment addition and content reconstruction independently .
Outcome: The proposed method outperforms competitive systems by a large margin on Yelp and Amazon datasets.
Blinded by Generated Contexts: How Language Models Merge Generated and Retrieved Contexts When Knowledge Conflicts? (2024.acl-long)

Copied to clipboard

Challenge: Recent advances in augmenting Large Language Models (LLMs) with auxiliary information have significantly revolutionized their efficacy in knowledge-intensive tasks.
Approach: They propose a systematic framework to identify whether LLMs’ responses are attributed to either generated or retrieved contexts.
Outcome: The proposed framework identifies whether LLMs’ responses are attributed to either generated or retrieved contexts.
GA-SAM: Gradient-Strength based Adaptive Sharpness-Aware Minimization for Improved Generalization (2022.emnlp-main)

Copied to clipboard

Challenge: Recent studies show flat minima tend to imply better generalization abilities . however, it has some difficulty implying SAM to some natural language tasks .
Approach: They propose a flatness-aware minimization algorithm that can be applied to natural language tasks . they propose to use parameter corruptions to explain why flat minima generalize better .
Outcome: The proposed algorithm can generalize better for flat minima that are robust against corruptions or perturbations.
LexicalAT: Lexical-Based Adversarial Reinforcement Training for Robust Sentiment Classification (D19-1)

Copied to clipboard

Challenge: Existing text classification models are fragile and sensitive to simple perturbations.
Approach: They propose a generator-classifier adversarial training approach to improve classification models . they use a large-scale lexical knowledge base to generate attacking examples .
Outcome: The proposed approach outperforms strong baselines and reduces test errors on neural networks.
Unified Dual-view Cognitive Model for Interpretable Claim Verification (2021.acl-long)

Copied to clipboard

Challenge: Existing studies constructing direct interactions between the claim and each single user response to capture evidence have shown remarkable success in interpretable claim verification.
Approach: They propose a Dual-view model based on the views of Collective and Individual Cognition (CICD) that captures word-level semantics based . on individual cognition, they adjust the proportion between them to generate global evidence.
Outcome: The proposed model is based on the views of collective and individual cognition and achieves state-of-the-art performance on three benchmark datasets.
Hidden Killer: Invisible Textual Backdoor Attacks with Syntactic Trigger (2021.acl-long)

Copied to clipboard

Challenge: Existing methods for textual backdoor attacks insert additional contents into normal samples as triggers, causing detection and blocking of backdoors.
Approach: They propose to use syntactic structure as trigger in textual backdoor attacks . they propose to achieve similar attack performance but have higher invisibility .
Outcome: The proposed method achieves almost 100% success rate but has higher invisibility and stronger resistance to defenses than the insertion-based methods.
Mind the Style of Text! Adversarial and Backdoor Attacks Based on Text Style Transfer (2021.emnlp-main)

Copied to clipboard

Challenge: Experimental results show that popular NLP models are vulnerable to both adversarial and backdoor attacks based on text style transfer.
Approach: They propose to conduct adversarial and backdoor attacks based on text style transfer . the authors propose to use text style to alter the style of a sentence .
Outcome: The proposed methods show that popular models are vulnerable to both attacks based on text style transfer . the results show that the proposed methods perform better than baselines in many aspects .
The Threat of PROMPTS in Large Language Models: A System and User Prompt Perspective (2025.findings-acl)

Copied to clipboard

Challenge: Prompts are essential for guiding model output and influencing content generation.
Approach: They propose to attack models with prompt leakage and prompt jailbreak attacks . they summarize the experimental setups of these methods and explore the relationship between prompt threats and prompt injection attacks.
Outcome: The proposed methods summarize the experimental setups and examine the relationship between prompt threats and prompt injection attacks.
TASO: Task-Aligned Sparse Optimization for Parameter-Efficient Model Adaptation (2025.emnlp-main)

Copied to clipboard

Challenge: Existing studies have shown that LoRA introduces substantial parameter redundancy, which not only increases the number of trainable parameters but also hinders the effectiveness of fine-tuning.
Approach: They propose a method that leverages importance information from the pretrained model’s weights to mitigate LoRA redundancy.
Outcome: The proposed method significantly reduces the number of trainable parameters required for task adaptation while providing a task-aligned perspective for LoRA redundancy reduction.
Generalizing Trust: Weak-to-Strong Trustworthiness in Language Models (2026.acl-long)

Copied to clipboard

Challenge: Recent studies have highlighted weak-to-strong generalization, where a strong model trained only on a weak model’s labels surpasses the weak model in task performance.
Approach: They propose two fundamental fine-tuning strategies that leverage trustworthiness regularization during the fine-uning of the weak model and the weak-to-strong transfer to improve trustworthy.
Outcome: The proposed models show that they can generalize robustness, fairness, and privacy better when trained on weak models than models trained on strong models.
Pretrain-KGE: Learning Knowledge Representation from Pretrained Language Models (2020.findings-emnlp)

Copied to clipboard

Challenge: Existing knowledge graph embedding models suffer from limited knowledge representation due to sparse and noisy dataset annotations.
Approach: They propose to use pretrained language models to enhance knowledge representation by leveraging world knowledge from pretrained models.
Outcome: Extensive experiments show that the proposed framework can improve results over existing models.
Neural Network Surgery: Injecting Data Patterns into Pre-trained Models with Minimal Instance-wise Side Effects (2021.naacl-main)

Copied to clipboard

Challenge: Existing neural network tuning methods cause instance-wise side effects . et al., 2018: a new approach to perform neural network surgery .
Approach: They propose to perform neural network surgery by only changing 10-5 parameters . they propose to use a dynamic selecting method to achieve the best overall performance .
Outcome: The proposed method achieves the best overall performance and induces fewer instance-wise side effects by changing only 10-5 of the parameters.
Distantly Supervised Contrastive Learning for Low-Resource Scripting Language Summarization (2024.lrec-main)

Copied to clipboard

Challenge: Existing methods for code summarization are limited in resources and require atomic commands and category constraints to enhance code representations.
Approach: They propose a framework that leverages limited atomic commands and category constraints to enhance code representations.
Outcome: The proposed framework outperforms baseline methods in a number of domains and demonstrates superiority over competing frameworks.
WebCPM: Interactive Web Search for Chinese Long-form Question Answering (2023.acl-long)

Copied to clipboard

Challenge: Long-form question answering requires two procedures: information retrieval and information synthesis.
Approach: They propose a Chinese long-form question answering dataset called WebCPM . the dataset is based on a web search interface that engages with a search engine in real time .
Outcome: The proposed dataset generates answers that are no worse than human-written ones . the dataset is the first Chinese LFQA dataset .
Aligning Large Language Models to Follow Instructions and Hallucinate Less via Effective Data Filtering (2025.acl-long)

Copied to clipboard

Challenge: Existing studies show that training LLMs on data containing unfamiliar knowledge during instruction tuning can encourage hallucinations.
Approach: They propose a framework that measures how familiar the LLM is with instruction data and introduce an expert-aligned reward model to ensure the quality of selected samples.
Outcome: The proposed framework reduces hallucinations while maintaining a competitive ability to follow instructions.
ResLoRA: Identity Residual Mapping in Low-Rank Adaption (2024.findings-acl)

Copied to clipboard

Challenge: Low-rank adaptation (LoRA) is one of the most popular parameter-efficient fine-tuning methods.
Approach: They propose a low-rank adaptation method that adds residual paths during training and merges them together during inference to achieve better results.
Outcome: The proposed method achieves 2.5x faster convergence speed and improves performance by 14.3% on NLG, NLU, and text-to-image tasks.
Semantic-Unit-Based Dilated Convolution for Multi-Label Text Classification (D18-1)

Copied to clipboard

Challenge: a novel model for multi-label text classification is proposed for the task of assigning multiple labels for a given text.
Approach: They propose a novel model for multi-label text classification based on sequence-to-sequence learning and a hybrid attention mechanism that extracts both the word-level and the semantic unit.
Outcome: The proposed model is competitive to the baseline models and more robust to classifying low-frequency labels.
GraphQ IR: Unifying the Semantic Parsing of Graph Query Languages with One Intermediate Representation (2022.emnlp-main)

Copied to clipboard

Challenge: Existing approaches to neural semantic parsing are limited by the semantic gap between natural and formal languages.
Approach: They propose a unified intermediate representation for graph query languages, named GraphQ IR, which has a natural-language-like expression that bridges the semantic gap and formally defined syntax that maintains the graph structure.
Outcome: The proposed representation can convert user queries into graphQ IR, which can later be losslessly compiled into various downstream graph query languages.
OS-Sentinel: Towards Safety-Enhanced Mobile GUI Agents via Hybrid Validation in Realistic Workflows (2026.acl-long)

Copied to clipboard

Challenge: Existing methods for detecting unsafe mobile GUI agents are underexplored.
Approach: They propose a mobile agent safety detection framework that integrates a formal verifier and a VLM-based contextual judge to detect system-level violations.
Outcome: The proposed framework achieves 10%–30% improvements over existing approaches across multiple metrics.
Low-Entropy Watermark Detection via Bayes’ Rule Derived Detector (2025.findings-acl)

Copied to clipboard

Challenge: Existing methods for text watermarking ignore strong evidences embedded in low-entropy tokens, causing statistical measures to falsely indicate the absence of a watermark.
Approach: They propose a Bayes' Rule derived watermark Detector which exploits watermark information from every token by leveraging the posterior probability of watermark’s presence.
Outcome: The proposed method achieves 50% and 70% relative improvements over baselines in code generation and math problem-solving tasks.
MM-MATH: Advancing Multimodal Math Evaluation with Process Evaluation and Fine-grained Classification (2024.findings-emnlp)

Copied to clipboard

Challenge: Existing benchmarks for multimodal reasoning in large multimodal models are underperforming on multimodal tasks.
Approach: They propose a benchmark for multimodal reasoning in large multimodal models, MM-MATH . MM's process evaluation employs LMM-as-a-judge to automatically analyze solution steps . diagram misinterpretation is the most common error, they find .
Outcome: The proposed model achieves only 31% accuracy, compared to 82% for humans.
Grammar-Based Code Representation: Is It a Worthy Pursuit for LLMs? (2025.findings-acl)

Copied to clipboard

Challenge: Existing research demonstrates the effectiveness of grammar-based code representations in small-scale models, showing their ability to reduce syntax errors and enhance performance.
Approach: They develop a series of billion-scale grammar-based code representations that incorporate grammar rules into the code generation process.
Outcome: Experiments on HumanEval and MBPP show that grammar-based representations reduce syntax errors and improve performance even in billion-scale models.
Parrot: A Training Pipeline Enhances Both Program CoT and Natural Language CoT for Reasoning (2025.emnlp-main)

Copied to clipboard

Challenge: Existing work focuses on enabling models to generate natural language chain-of-thought rationales or leverage executable and verifiable code, such as Python.
Approach: They propose a novel training pipeline that integrates sequential P-CoT and N-Co T generation and a subtask hybrid training strategy to facilitate natural language transferability.
Outcome: The proposed training pipeline improves both N-CoT and P-Co T performance over the RL baseline.
Actively Supervised Clustering for Open Relation Extraction (2023.acl-long)

Copied to clipboard

Challenge: Existing methods for Open Relation Extraction (OpenRE) use a two-stage pipeline, which learns relation representations and assignments in the first stage, then manually labels relation for each cluster.
Approach: They propose a method that performs relation learning and relation labeling simultaneously without a significant increase in human effort.
Outcome: The proposed method improves existing SOTA methods by 13.8% and 10.6% on two datasets.
From Grounding to Manipulation: Case Studies of Foundation Model Integration in Embodied Robotic Systems (2025.findings-emnlp)

Copied to clipboard

Challenge: a new study examines the operational characteristics of different integration strategies for robotics . end-to-end vision-language-action models implicitly unify perception and planning .
Approach: They propose end-to-end vision-language-action models that implicitly unify perception and planning . they also propose modular pipelines using either vision-linguistic models or MLLMs .
Outcome: The proposed frameworks implicitly unify perception and planning, and modular pipelines using either vision-language models or multimodal large language models.
Adversarial and Domain-Aware BERT for Cross-Domain Sentiment Analysis (2020.acl-main)

Copied to clipboard

Challenge: Cross-domain sentiment classification requires large amounts of labeled data.
Approach: They propose to apply a pre-training language model BERT on unsupervised domain adaptation . they propose to distill domain-specific features in a self-supervised way .
Outcome: The proposed model outperforms state-of-the-art methods on Amazon dataset . it can be applied to the unsupervised domain adaptation task without domain awareness .
MEFT: Memory-Efficient Fine-Tuning through Sparse Adapter (2024.acl-long)

Copied to clipboard

Challenge: Parameter-Efficient Fine-tuning (PEFT) methods are limited on knowledge-intensive tasks due to the limited number of trainable parameters.
Approach: They propose a mechanism that fine-tunes Large Language Models with larger adapters . they store and update the parameters of larger adapter adapters on the CPU .
Outcome: The proposed method achieves comparable results to those obtained with larger memory capacities over the limited bandwidth of PCI Express (PCIe).
WantWords: An Open-source Online Reverse Dictionary System (2020.emnlp-demos)

Copied to clipboard

Challenge: Existing reverse dictionary systems only support English reverse dictionary queries . a reverse dictionary can help people who can't remember a word from memory .
Approach: They propose an online reverse dictionary system that outperforms other reverse dictionary systems . it supports Chinese and English-Chinese as well as Chinese-English cross-lingual reverse dictionary queries .
Outcome: The proposed reverse dictionary outperforms other reverse dictionary systems on performance . it supports Chinese and English-Chinese as well as Chinese-English queries .
AutoVecCoder: Teaching LLMs to Generate Explicitly Vectorized Code (2026.findings-acl)

Copied to clipboard

Challenge: Current development practices face a dichotomy between automation and performance.
Approach: They propose a framework to empower LLMs with the capability of automated explicit vectorization.
Outcome: The proposed framework achieves state-of-the-art performance on the SSE and AVX subsets of SimdBench.
Advancing Sequential Numerical Prediction in Autoregressive Models (2025.acl-short)

Copied to clipboard

Challenge: Autoregressive models are the de facto choice for sequence generation tasks, but standard approaches treat digits as independent tokens and apply cross-entropy loss, overlooking the coherent structure of numerical sequences.
Approach: They propose a novel approach to entropy loss by extending the Earth Mover’s Distance to preserve ordinal relationships between numerical values and sequence-level to penalize the overall discrepancy between predicted and actual sequences.
Outcome: Extensive experiments show that NTIL improves numerical prediction and integrates effectively with LLMs/MLLMs.
Unpaired Sentiment-to-Sentiment Translation: A Cycled Reinforcement Learning Approach (P18-1)

Copied to clipboard

Challenge: Existing studies for sentiment-to-sentiment "translation" only change the underlying sentiment and fail to keep the semantic content.
Approach: They propose a cycled reinforcement learning method that combines neutralization module and emotionalization module.
Outcome: The proposed method outperforms state-of-the-art systems on Yelp and Amazon review datasets.
Try to Substitute: An Unsupervised Chinese Word Sense Disambiguation Method Based on HowNet (2020.coling-main)

Copied to clipboard

Challenge: Existing unsupervised methods for word sense disambiguation cannot work for HowNet-based WSD because of its uniqueness.
Approach: They propose a method which exploits the masked language model task of pre-trained language models to conduct word sense disambiguation using a lexical knowledge base as the sense inventory.
Outcome: The proposed method achieves significantly better performance than baseline methods.
from Benign import Toxic: Jailbreaking the Language Model via Adversarial Metaphors (2025.acl-long)

Copied to clipboard

Challenge: Recent studies have exposed the risk of Large Language Models (LLMs) generating harmful content by jailbreak attacks.
Approach: They propose a framework that exploits AdVersArial meTAphoR to induce LLMs to calibrate harmful metaphors for jailbreaking.
Outcome: The proposed framework can successfully jailbreak Large Language Models (LLMs) by leveraging the AdVersArial meTAphoR (AVATAR) framework achieves state-of-the-art attack success rate across multiple advanced LLMs.
Tokenization Consistency Matters for Generative Models on Extractive NLP Tasks (2023.findings-emnlp)

Copied to clipboard

Challenge: Pretrained sequence-to-sequence (seq2sequ) models have been widely used to solve extractive tasks, where parts of the input are extracted to form the desired output.
Approach: They propose a simple fix to tokenization inconsistency that damages extractive nature of generative models by causing performance drop and hallucination.
Outcome: The proposed model performs better in both in-domain and out-of-domain datasets with a notable average of +1.7 F1 gain when a BART model is trained on SQuAD and evaluated on 8 QA datasets.
Calibrating LLM-Based Evaluator (2024.lrec-main)

Copied to clipboard

Challenge: Existing models for large language models lack the ability to calibrate their outputs towards human preference.
Approach: They propose a multi-stage, gradient-free approach to calibrate an LLM-based evaluator toward human preference.
Outcome: The proposed approach improves correlation with expert evaluation on multiple text quality evaluation datasets.
UPRISE: Universal Prompt Retrieval for Improving Zero-Shot Evaluation (2023.emnlp-main)

Copied to clipboard

Challenge: Large Language Models (LLMs) have impressive capabilities but need for task-specific prompt engineering can hinder their generalization.
Approach: They propose a lightweight and versatile retriever that automatically retrieves prompts for a given zero-shot task input.
Outcome: The proposed model is universally applicable across tasks and models . it mitigates hallucination problem in chatGPT, and it improves even the strongest LLMs.
Hallucination Detection in Long-Form Text Generated by LLMs: A Benchmark and a Hyper-Relational Knowledge Graph Approach (2026.findings-acl)

Copied to clipboard

Challenge: Existing methods for hallucination detection are coarse-grained and lack long-range consistency checks.
Approach: They propose a benchmark for long-form hallucination detection that incorporates diverse entity types and intricate factual dependencies spanning extended contexts.
Outcome: The proposed framework outperforms baselines and robustly integrates fact-centric hyper-relational knowledge graphs.
GATEAU: Selecting Influential Samples for Long Context Alignment (2025.emnlp-main)

Copied to clipboard

Challenge: Existing studies have attempted to scale up the available data volume by synthesizing long instruction-following samples, but a lack of a well-defined strategy for ensuring data quality may introduce low-quality samples and restrict the model’s performance.
Approach: They propose a framework to identify influential samples enriched with long-range dependency relations that can be used to align large language models to handle instructions with extremely long contexts.
Outcome: The proposed framework identifies samples with long-range dependency relations and shows that the model trained on these samples exhibits better instruction-following and long-context understanding capabilities.
Alleviating Performance Degradation Caused by Out-of-Distribution Issues in Embedding-Based Retrieval (2025.findings-emnlp)

Copied to clipboard

Challenge: Recent studies reveal query out-of-distribution issues degrading ANN performance . a distribution regularizer is introduced into the encoder training objective to encourage alignment between query and base embeddings.
Approach: They introduce a distribution regularizer into the encoder training objective to encourage alignment between query and base embeddings.
Outcome: The proposed method consistently improves retrieval performance across multiple datasets.
Masked Conditional Random Fields for Sequence Labeling (2021.naacl-main)

Copied to clipboard

Challenge: Conditional Random Fields (CRF) based neural models are among the most performant for sequence labeling problems, but they can sometimes generate illegal sequences of tags.
Approach: They propose a conditional random field-based model that imposes restrictions on candidate paths during both training and decoding phases.
Outcome: The proposed method improves on existing CRF models with near zero additional cost.
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.
From Scores to Preferences: Redefining Evaluation Paradigm for Speech Quality Reward Modeling (2026.findings-acl)

Copied to clipboard

Challenge: Experimental results show that the MOS-aware GRM significantly improves fine-grained speech quality discrimination.
Approach: They propose a MOS-aware reward model that incorporates MOS gap into reward function during reinforcement learning.
Outcome: The proposed model significantly improves fine-grained speech quality discrimination.
Mitigating Object Hallucinations in MLLMs via Multi-Frequency Perturbations (2025.findings-emnlp)

Copied to clipboard

Challenge: Multimodal large language models have demonstrated remarkable performance in visual-language tasks, but their authenticity is often compromised by object hallucinations.
Approach: They propose a multi-frequency perturbation method that leverages both low-frequency and high-frequency features of images to perturb visual feature representations and explicitly suppress redundant frequency-domain features during inference.
Outcome: The proposed method significantly mitigates object hallucinations across various model architectures.
Better Robustness by More Coverage: Adversarial and Mixup Data Augmentation for Robust Finetuning (2021.findings-acl)

Copied to clipboard

Challenge: Pretrained language models perform poorly under adversarial attacks due to the large search space.
Approach: They propose a method to cover a much larger proportion of the attack search space by adding textual adversarial examples during training.
Outcome: The proposed method covers a much larger proportion of the attack search space.
LLM×MapReduce: Simplified Long-Sequence Processing using Large Language Models (2025.acl-long)

Copied to clipboard

Challenge: Existing studies have focused on extending the context length of large language models (LLMs) due to their quadratic computational complexity and a lack of high-quality long training examples, most LLMs are trained with a limited window size.
Approach: They propose a training-free framework that enables large language models to effectively process long texts using a divide-and-conquer strategy for comprehensive document understanding.
Outcome: The proposed framework outperforms open-source and commercial long-context LLMs and is compatible with several models.
Evaluating and Mitigating Object Hallucination in Large Vision-Language Models: Can They Still See Removed Objects? (2025.naacl-long)

Copied to clipboard

Challenge: LVLMs often mistakenly determine objects as present in images where they do not exist . authors propose a new benchmark to evaluate object hallucinations by removing objects from images and asking the model whether it can still see the removed objects.
Approach: They propose a benchmark to evaluate object hallucinations by removing objects from images . they propose oDPO, a direct preference optimization objective based on visual objects .
Outcome: The proposed benchmark reduces the likelihood of object hallucinations by removing objects from images and asking the model whether it can still see the removed objects.
Can Language Models Understand Physical Concepts? (2023.emnlp-main)

Copied to clipboard

Challenge: Existing language models do not understand basic physical concepts in the human world.
Approach: They propose a method to transfer embodied knowledge from visual models to LMs . they use visual concepts and embodies concepts learned from interaction with the world .
Outcome: The proposed method achieves comparable performance with scaling up parameters of LMs 134.
Learning When to Concentrate or Divert Attention: Self-Adaptive Attention Temperature for Neural Machine Translation (D18-1)

Copied to clipboard

Challenge: Neural Machine Translation models treat decoding at each time step equally with the same matrix . conventional methods treat decoder outputs at all time steps with the identical weight matrix causing inaccuracy .
Approach: They propose a model with a mechanism to control the softness of attention by means of an attention temperature.
Outcome: The proposed model outperforms baseline models on Chinese-English and English-Vietnamese translations.
Modeling Semantic Compositionality with Sememe Knowledge (P19-1)

Copied to clipboard

Challenge: Semantic compositionality (SC) is defined as the phenomenon that the meaning of a complex linguistic unit can be composed of the meanings of its constituents.
Approach: They propose to incorporate sememes into SC models and employ them in learning multiword expressions.
Outcome: The proposed models achieve significant performance boost compared to baseline methods without sememe knowledge.
Beyond Scaling: Measuring and Predicting the Upper Bound of Knowledge Retention in Language Model Pre-Training (2026.acl-long)

Copied to clipboard

Challenge: Existing methods to predict performance of large language models are lacking . authors propose a size-dependent mutual information predictor for closed-book question answering accuracy .
Approach: They propose a size-dependent mutual information predictor that integrates knowledge frequency, knowledge specificity, and model size to forecast closed-book question answering accuracy.
Outcome: The proposed method outperforms baseline models and achieves R2 > 0.7 in predicting QA accuracy without additional training.
Example Quality Matters: Multi-Aspects Example Augmentation for Private Library Programming (2026.acl-long)

Copied to clipboard

Challenge: Existing approaches to code generation fail to consider the quality of retrieved examples.
Approach: They propose a retrieval-augmented generation method that combines existing API examples to improve complexity and readability.
Outcome: The proposed method achieves up to 22% accuracy improvement over baseline methods.
Capsule Network with Interactive Attention for Aspect-Level Sentiment Classification (D19-1)

Copied to clipboard

Challenge: Existing methods for aspect-level sentiment classification are limited for dealing with overlapped features.
Approach: They propose to use capsule network to construct vector-based feature representation and cluster features by an EM routing algorithm to model semantic relationship between aspect terms and context.
Outcome: The proposed model achieves state-of-the-art on three datasets.
Few-shot Joint Multimodal Aspect-Sentiment Analysis Based on Generative Multimodal Prompt (2023.findings-acl)

Copied to clipboard

Challenge: Existing studies require massive labeled data to train models for multimodal data analysis.
Approach: They propose a novel multimodal prompt model that captures specific aspect terms in a few-shot scenario.
Outcome: The proposed model outperforms baselines on two MABSA-related tasks on a few-shot dataset.
ModularMoE: Fast LLM Customization with Parameter-Sharing Mixture-of-Experts for Low-Resource Settings (2026.findings-acl)

Copied to clipboard

Challenge: Large Language Models impose significant computational and storage burdens on personal devices . existing customization approaches incur excessive computational costs or lead to suboptimal performance .
Approach: They propose a training framework that converts pre-trained LLMs into parameter-sharing MoE models for lightweight deployment.
Outcome: The proposed training framework outperforms state-of-the-art training frameworks at the same sparsity level while delivering up to 2.71 inference speedup.

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