Papers by Wei Zhu

167 papers
RETAIL: Towards Real-world Travel Planning for Large Language Models (2025.emnlp-main)

Copied to clipboard

Challenge: Existing travel planning systems assume users provide explicit queries, limiting their practical utility.
Approach: They propose a dataset RETAIL which supports decision-making for implicit queries while covering explicit queries.
Outcome: The proposed model achieves a 1.0% pass rate, suggesting real-world travel planning remains challenging.
Chinese SafetyQA: A Safety Short-form Factuality Benchmark for Large Language Models (2025.acl-long)

Copied to clipboard

Challenge: Large language models have created significant safety concerns . factuality ability is crucial in determining whether they can be deployed and applied safely and compliantly within specific regions.
Approach: They propose a benchmark to evaluate the factuality of large language models in China . they evaluate the models' ability to provide accurate and reliable information .
Outcome: The proposed benchmark evaluates the factuality abilities of existing LLMs and compares them to LLM abilities.
Discovering Better Model Architectures for Medical Query Understanding (2021.naacl-industry)

Copied to clipboard

Challenge: Neural architecture search (NAS) has attracted intense attention in computer vision and NLP.
Approach: They propose to use neural architecture search to optimize model architectures for medical questions . they propose to modify the ENAS method to accelerate and stabilize the search results .
Outcome: The proposed approach outperforms baseline models on two medical questions . it is compared with other NAS methods and shows that it provides the best results .
Attention as Selector: Unlocking VLM Attention for Long Document Page Retrieval (2026.acl-long)

Copied to clipboard

Challenge: Existing page-level retrieval methods lack query–page interaction before similarity scoring . Existing methods require large-scale datasets to align visual and textual embeddings .
Approach: They propose a retrieval framework that utilizes attention mechanisms inside VLMs for page selection.
Outcome: The proposed retrieval framework outperforms embedding-based retrieval methods on four long-document benchmarks.
Complex Evolutional Pattern Learning for Temporal Knowledge Graph Reasoning (2022.acl-short)

Copied to clipboard

Challenge: Existing models for TKG reasoning focus on modeling fact sequences of a fixed length, which cannot discover complex evolutional patterns that vary in length.
Approach: They propose to use a length-aware Convolutional Neural Network to handle evolutional patterns of different lengths via an easy-to-difficult curriculum learning strategy.
Outcome: The proposed model improves performance under both offline and online learning strategies.
LECO: Improving Early Exiting via Learned Exits and Comparison-based Exiting Mechanism (2023.acl-srw)

Copied to clipboard

Challenge: Recent work on dynamic early exiting has neglected the intermediate exits’ architectural designs.
Approach: They propose a framework for learning exits and COmparison-based early exiting to improve PTMs’ early exit performance.
Outcome: The proposed framework achieves the SOTA performance on multi-exit BERT training and dynamic early exiting on pre-trained models.
HiCoLoRA: Addressing Context-Prompt Misalignment via Hierarchical Collaborative LoRA for Zero-Shot DST (2026.findings-acl)

Copied to clipboard

Challenge: Existing approaches to zero-shot Dialog State Tracking (zs-DST) are inadequate to generalize to new domains without extensive training.
Approach: They propose a framework that enhances zero-shot slot inference through robust prompt alignment.
Outcome: Experiments on multi-domain datasets show that HiCoLoRA outperforms baselines, achieving SOTA in zs-DST.
VIGNETTE: Socially Grounded Bias Evaluation for Vision-Language Models (2026.acl-long)

Copied to clipboard

Challenge: Existing studies on VLM bias focus on portrait-style images and gender-occupation associations . existing studies ignore broader and more complex social stereotypes and their implied harm .
Approach: They propose a large-scale VQA benchmark for evaluating bias in vision-language models . they use a question-answering framework that spans factuality, perception, stereotyping, and decision making .
Outcome: The proposed framework examines bias in vision-language models using 30M+ images . findings reveal subtle, multifaceted, and surprising stereotypical patterns .
PricingLogic: Evaluating LLMs Reasoning on Complex Tourism Pricing Tasks (2025.emnlp-main)

Copied to clipboard

Challenge: Recent advances in Large Language Models (LLMs) have demonstrated remarkable capabilities across diverse domains, such as code generation, mathematical problem-solving, and general-purpose human instruction following.
Approach: They propose to use large language models to process questions expressed in natural language to automate tourism-booking prices when multiple, overlapping farerules apply.
Outcome: The proposed model can automate tourism-booking prices when multiple, overlapping farerules apply.
USB: A COMPREHENSIVE AND UNIFIED SAFETY EVALUATION BENCHMARK FOR MULTIMODAL LARGE LANGUAGE MODELS (2026.acl-long)

Copied to clipboard

Challenge: Existing safety benchmarks fail to provide reliable assessments due to limited risk coverage, insufficient scale and the oversight of complex modality combinations.
Approach: They propose a framework that covers 61 risk categories across four modality interactions to address this gap.
Outcome: The proposed framework covers 61 risk categories across four distinct modality interactions.
Mirroring Users: Towards Building Preference-aligned User Simulator with User Feedback in Recommendation (2026.acl-long)

Copied to clipboard

Challenge: Large Language Models lack specific task alignment and large-scale simulations are challenging due to their ambiguity, noise and massive volume.
Approach: They propose a framework that leverages user feedback in RSs with advanced LLM capabilities to generate high-quality simulation data.
Outcome: The proposed framework boosts the alignment with human preferences and in-domain reasoning capabilities of the fine-tuned LLMs.
FanLoRA: Fantastic LoRAs and Where to Find Them in Large Language Model Fine-tuning (2024.emnlp-industry)

Copied to clipboard

Challenge: Lowrank adaptation and its variants introduce significant latency in multi-tenant settings, hindering their applications in the industry.
Approach: They propose a framework to fine-tune LoRA modules on a large-scale instruction tuning dataset.
Outcome: The proposed framework outperforms existing PEFT methods and significantly reduces inference latency.
CoCA: Fusing Position Embedding with Collinear Constrained Attention in Transformers for Long Context Window Extending (2024.acl-long)

Copied to clipboard

Challenge: Existing models that use self-attention and position embedding have anomalous behavior that hinder long context window extrapolation.
Approach: They propose a collinear constraint between Q and K to integrate RoPE and self-attention.
Outcome: The proposed model integrates self-attention and position embedding into LLMs without fine-tuning.
What Makes AI Research Replicable? Executable Knowledge Graphs as Scientific Knowledge Representations (2026.acl-short)

Copied to clipboard

Challenge: Existing approaches to replicate AI research are limited by insufficient background knowledge and the limitations of retrieval-augmented generation methods.
Approach: They propose a pluggable, paper-centric knowledge base that integrates code snippets and technical insights extracted from scientific literature into a verifiable, executable representation.
Outcome: The proposed knowledge base shows significant performance gains on paperBench when integrated into three agent frameworks with two different LLMs.
Aligning Large Language Models via Fully Self-Synthetic Data (2026.acl-long)

Copied to clipboard

Challenge: Existing approaches to reinforcement learning from human feedback (RLHF) require expensive human-annotated datasets and proprietary models like GPT-4 to annotate preference pairs.
Approach: They propose a self-synthetic framework for LLM alignment where all training data, including prompts (i.e., user queries), responses, and preferences, are generated by the model itself.
Outcome: The proposed framework enhances the model’s chat capabilities on standard benchmarks like AlpacaEval 2.0 while maintaining strong performance on downstream objective tasks.
v-HUB: A Benchmark for Video Humor Understanding from Vision and Sound (2026.acl-long)

Copied to clipboard

Challenge: Humor enriches our daily lives and appears in many forms, from jokes and cartoons to comedies and viral videos.
Approach: They introduce a video humor understanding benchmark to test their ability to understand humor from visual cues.
Outcome: The proposed video humor understanding benchmark is based on a collection of short videos . it features rich annotations and a study of environmental sound that can enhance humor .
MVP-BERT: Multi-Vocab Pre-training for Chinese BERT (2021.acl-srw)

Copied to clipboard

Challenge: Pre-trained language models (PLMs) improve performance of Chinese NLP tasks, but the vocabulary (vocab) for these Chinese PLMs remains to be the one provided by Google Chinese BERT (CITATION), which is based on Chinese characters (chars).
Approach: They propose two versions of multi-vocab pre-training (MVP) to improve Chinese PLMs' expressiveness.
Outcome: The proposed model outperforms the recent AMBERT (CITATION) model on span-level tasks and is more robust against adversarial attacks.
Layer-wise Importance Matters: Less Memory for Better Performance in Parameter-efficient Fine-tuning of Large Language Models (2024.findings-emnlp)

Copied to clipboard

Challenge: Parameter-Efficient Fine-Tuning (PEFT) methods have gained popularity for adapting pre-trained Large Language Models (LLMs) to downstream tasks.
Approach: They propose a method to optimize the importance of full layers with layer-wise importance scoring by leveraging the estimated importance scores.
Outcome: The proposed method is compatible with PEFT methods that operate on a per-layer basis and achieves better performance.
Distilled Dual-Encoder Model for Vision-Language Understanding (2022.emnlp-main)

Copied to clipboard

Challenge: Experimental results show that the proposed cross-modal attention distillation is crucial to the success of our framework.
Approach: They propose a framework that distills knowledge of fusion-encoder teacher into dual-encoding student model.
Outcome: The proposed model is competitive with the fusion-encoder teacher model in performance, but suffers from a lack of deep cross-modal interactions.
IFlyEA: A Chinese Essay Assessment System with Automated Rating, Review Generation, and Recommendation (2021.acl-demo)

Copied to clipboard

Challenge: Automated Essay Assessment (AEA) aims to judge students’ writing proficiency in an automatic way.
Approach: They propose to use Chinese AEA system IFlyEssayAssess to evaluate essays written by native Chinese students from primary and junior schools.
Outcome: The proposed system provides application services for essay scoring, review generation, recommendation, and explainable analytical visualization.
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.
MentalSeek-Dx: Towards Progressive Hypothetico-Deductive Reasoning for Real-world Psychiatric Diagnosis (2026.acl-long)

Copied to clipboard

Challenge: Mental health disorders represent a burgeoning global public health challenge . lack of ecological validity and fine-grained diagnostic supervision limits their utility .
Approach: They propose a medical-specialized LLM trained to internalize clinical reasoning process through supervised trajectory construction and curriculum-based reinforcement learning.
Outcome: The proposed model achieves state-of-the-art with only 14B parameters, establishing a clinically grounded framework for reliable psychiatric diagnosis.
GAML-BERT: Improving BERT Early Exiting by Gradient Aligned Mutual Learning (2021.emnlp-main)

Copied to clipboard

Challenge: Existing approaches to improve the early exiting of natural language processing (NLP) are notoriously gigantic and slow in both training and inference.
Approach: They propose a framework for improving the early exiting of BERT by asking each exit to distill knowledge from each other.
Outcome: The proposed framework outperforms the state-of-the-art (SOTA) BERT early exiting methods on the GLUE benchmark.
Don’t Reinvent the Wheel: Efficient Instruction-Following Text Embedding based on Guided Space Transformation (2025.acl-long)

Copied to clipboard

Challenge: Existing methods for text embedding require re-encoding the entire corpus for each instruction.
Approach: They propose a framework that generates dynamic text embeddings that adapt to user instructions, highlighting specific attributes of text.
Outcome: The proposed framework improves instruction-following text embedding quality over state-of-the-art methods while speeding up processing on large datasets.
Expectation Confirmation Preference Optimization for Multi-Turn Conversational Recommendation Agent (2025.findings-acl)

Copied to clipboard

Challenge: Recent advances in Large Language Models (LLMs) have propelled the development of Conversational Recommendation Agents (CRAs).
Approach: They propose a multi-turn preference optimization paradigm that leverages Expectation Confirmation Theory to explicitly model the evolution of user satisfaction throughout multi-turned dialogues.
Outcome: The proposed paradigm eliminates the significant sampling overhead of existing MTPO methods while ensuring the optimization process drives meaningful improvements.
FT-MDT: Extracting Decision Trees from Medical Texts via a Novel Low-rank Adaptation Method (2025.emnlp-industry)

Copied to clipboard

Challenge: Existing methods for extracting medical decision trees rely on manual annotation . PI-LoRA is a low-rank adaptation method for extract medical decision tree from clinical guidelines and textbooks .
Approach: They propose a low-rank adaptation method for automatically extracting medical decision trees from clinical guidelines and textbooks.
Outcome: The proposed method outperforms existing methods for the Text2MDT task while maintaining a lightweight architecture.
The LLM Already Knows: Estimating LLM-Perceived Question Difficulty via Hidden Representations (2025.emnlp-main)

Copied to clipboard

Challenge: Existing methods for difficulty estimation rely on repeated response sampling, auxiliary models, or fine-tuning the target model itself.
Approach: They propose a method that leverages only the hidden representations produced by large language models.
Outcome: The proposed method outperforms baselines in difficulty estimation on textual and multimodal tasks and improves adaptive reasoning strategies with fewer generated tokens.
ZipVoice-Dialog: Non-Autoregressive Spoken Dialogue Generation with Flow Matching (2026.findings-acl)

Copied to clipboard

Challenge: Existing autoregressive models for dialogue generation suffer from high latency and stability issues.
Approach: They propose a non-autoregressive (NAR) zero-shot spoken dialogue generation model based on flow-matching.
Outcome: The proposed model outperforms existing models in speech generation due to poor speech intelligibility and turn-taking precision.
AgentBank: Towards Generalized LLM Agents via Fine-Tuning on 50000+ Interaction Trajectories (2024.findings-emnlp)

Copied to clipboard

Challenge: Existing studies focus on specialized agents designed for particular tasks.
Approach: They propose to scale annotated interaction trajectories and fine-tune LLMs on AgentBank to get a series of agent models, Samoyed.
Outcome: The proposed model can scale to get generalized agent capabilities.
Re-ViLM: Retrieval-Augmented Visual Language Model for Zero and Few-Shot Image Captioning (2023.findings-emnlp)

Copied to clipboard

Challenge: Existing methods for image-to-text generation store all knowledge within parameters, thus requiring computational-expensive fine-tuning.
Approach: They propose a Retrieval-augmented Visual Language Model that stores all the knowledge within parameters and can be used to retrieve it from the external database.
Outcome: The proposed model significantly boosts performance for image-to-text generation tasks with 4x less parameters compared with baseline methods.
Continually Detection, Rapidly React: Unseen Rumors Detection Based on Continual Prompt-Tuning (2022.coling-1)

Copied to clipboard

Challenge: Existing rumor detection models assume the same training and testing distributions and can not cope with the continuously changing social network environment.
Approach: They propose a Continual Prompt-Tuning RD framework which avoids catastrophic forgetting of upstream tasks during sequential task learning and enables bidirectional knowledge transfer between domain tasks.
Outcome: The proposed framework avoids catastrophic forgetting (CF) of upstream tasks during sequential task learning and enables bidirectional knowledge transfer between domain tasks.
Task-Aware Self-Supervised Framework for Dialogue Discourse Parsing (2023.findings-emnlp)

Copied to clipboard

Challenge: Existing discourse parsing approaches are constrained by predefined relation types, which can impede the adaptability of the parser for downstream tasks.
Approach: They propose to introduce a task-aware paradigm to improve the versatility of the parser.
Outcome: Empirical studies on dialogue discourse parsing datasets and a downstream task demonstrate the proposed framework.
Unified Demonstration Retriever for In-Context Learning (2023.acl-long)

Copied to clipboard

Challenge: In-context learning is a new learning paradigm where a language model conditions on a few input-output pairs (demonstrations) and a test input, and directly outputs the prediction.
Approach: They propose a single model to retrieve demonstrations for a wide range of tasks by combining training signals from various tasks into a unified list-wise ranking formulation by language model’s feedback.
Outcome: The proposed model outperforms baselines on 30+ tasks across 13 task families and multiple data domains.
Unsupervised Morphological Tree Tokenizer (2025.findings-acl)

Copied to clipboard

Challenge: Conventional statistical tokenizers often disrupt constituent boundaries within words, thereby corrupting semantic information.
Approach: They propose a method that uses morphological structure guidance to induce character-level structures of words by training a deep model.
Outcome: Empirical results show that the proposed method retains complete morphemes and outperforms existing methods on morphological segmentation and language modeling tasks.
Make Some Noise: Unlocking Language Model Parallel Inference Capability through Noisy Training (2024.emnlp-main)

Copied to clipboard

Challenge: Existing speculative decoding methods require additional model structure and training processes to assist the model for draft token generation.
Approach: They propose a make some noise training framework that introduces some noise at the input for the model to learn the denoising task.
Outcome: The proposed model improves inference speed by 2.3-2.7x times without compromising model performance.
Adaptive and Representative Multi-Interest Modeling for Recommendation with Large Language Model (2026.findings-acl)

Copied to clipboard

Challenge: Existing methods for multi-interest analysis of users rely on heuristic assumptions . however, the granularity of raw generation of LLMs is agnostic, leading to overly fine or coarse interest grouping.
Approach: They propose an LLM-driven adaptive and representative multi-interest modeling framework that exploits the agnostic granularity of LLMs for multi-interest analysis.
Outcome: The proposed model outperforms baselines on real-world datasets.
When Inverse Data Outperforms: Exploring the Pitfalls of Mixed Data in Multi-Stage Fine-Tuning (2025.findings-emnlp)

Copied to clipboard

Challenge: Existing methods for o1-level performance focus on unidirectional supervised fine-tuning (SFT), overlooking the intricate interplay between diverse reasoning patterns.
Approach: They construct a reverse reasoning dataset and examine how it is supervised . they find that naively mixing forward and reverse data during SFT weakens the directional distinction .
Outcome: The proposed model improves accuracy by 1.6%–6.8% over a standard model.
Knowledge Graph-Guided Retrieval Augmented Generation (2025.naacl-long)

Copied to clipboard

Challenge: Existing studies on RAG focus on semantic retrieval of isolated relevant chunks, which ignore their intrinsic relationships.
Approach: They propose a framework that utilizes knowledge graphs to provide fact-level relationships between chunks, improving the diversity and coherence of the retrieved results.
Outcome: Extensive experiments on the HotpotQA dataset and its variants demonstrate the advantages of KG2RAG compared to existing RAG-based approaches in terms of response quality and retrieval quality.
InquireMobile: Teaching VLM-based Mobile Agent to Request Human Assistance via Reinforcement Fine-Tuning (2026.acl-long)

Copied to clipboard

Challenge: Recent advances in Vision-Language Models (VLMs) have enabled mobile agents to perceive and interact with real-world mobile environments based on human instructions.
Approach: They propose a vision-language model that actively seeks human confirmation at critical decision points and a model inspired by reinforcement learning.
Outcome: The proposed model achieves an improvement of 46.8% in inquiry success rate and the best overall success rate among existing baselines on InquireBench.
Counterfactual Adversarial Learning with Representation Interpolation (2021.findings-emnlp)

Copied to clipboard

Challenge: Existing models with statistical bias are prone to memorized correlations . large pre-trained models such as BERT have revolutionized the model development paradigm in natural language processing .
Approach: They propose a framework to tackle the problem from a causal perspective using a latent space interpolation approach.
Outcome: Extensive experiments show that CAT achieves substantial performance improvement over SOTA across different downstream tasks, including sentence classification, natural language inference and question answering.
Multimodal Dual-Path Decoding for Medical Report Generation (2026.findings-acl)

Copied to clipboard

Challenge: Current methods for radiology report generation rely on encoder-decoder based frameworks that fail to integrate multimodal clinical evidence with domain-specific knowledge.
Approach: They propose a multimodal dual-path framework that synergistically integrates large vision-language models and large language models for radiology report generation.
Outcome: The proposed framework improves on the public MIMIC-CXR benchmark and shows that it is superior to state-of-the-art models.
MiLoRA: Efficient Mixture of Low-Rank Adaptation for Large Language Models Fine-tuning (2024.findings-emnlp)

Copied to clipboard

Challenge: Low-rank adaptation and its mixture-of-experts (MOE) methods are highly effective but introduce significant latency in multi-tenant settings due to the LoRA modules and MOE routers added to multiple linear modules.
Approach: They propose a low-rank adaptation variant that considers each LoRA module as an expert and employs a prompt-aware routing mechanism.
Outcome: Extensive analysis on commonsense reasoning tasks and math reasoning tasks show that MiLoRA outperforms strong PEFT baselines with comparable tunable parameter budgets.
BPP-Search: Enhancing Tree of Thought Reasoning for Mathematical Modeling Problem Solving (2025.acl-long)

Copied to clipboard

Challenge: Existing datasets in operations research domain lack detailed annotations of the modeling process, focusing only on objective values.
Approach: They propose an annotation-based tree-of-thought tree-based reasoning algorithm that integrates reinforcement learning into a tree- of-though.
Outcome: The proposed algorithm outperforms state-of-the-art methods on StructuredOR, NL4OPT, and MAMO-ComplexLP datasets.
AgentV-RL: Scaling Reward Modeling with Agentic Verifier (2026.findings-acl)

Copied to clipboard

Challenge: Existing approaches to improve LLM reasoning are limited in complex domains and lack external grounding makes verifiers unreliable on computation-intensive tasks.
Approach: They propose a framework that transforms reward modeling into a multi-turn, tool-augmented deliberative process.
Outcome: The proposed framework surpasses state-of-the-art ORMs by 25.2% under parallel and sequential TTS.
Self-Distillation Bridges Distribution Gap in Language Model Fine-Tuning (2024.acl-long)

Copied to clipboard

Challenge: Experimental results show that fine-tuning of large language models for specific tasks can be challenging . distribution shift during fine-timing can lead to performance degradation in general task capabilities .
Approach: They propose a new approach that bridges the distribution gap between task datasets and LLMs by guiding fine-tuning with a distilled dataset generated by the model itself.
Outcome: The proposed approach achieves comparable or superior performance on downstream tasks compared to the vanilla approach.
Masks Can be Learned as an Alternative to Experts (2025.acl-long)

Copied to clipboard

Challenge: a recent study shows that sparse activation techniques can reduce inference performance without sacrificing performance.
Approach: They propose to sparsify a pre-trained dense large language model into a mixture-of-experts architecture for faster inference.
Outcome: The proposed approach is more efficient than one-shot sparsification techniques . it achieves 97% performance retention on downstream tasks with only 50% of parameters activated .
Multi-hop Selector Network for Multi-turn Response Selection in Retrieval-based Chatbots (D19-1)

Copied to clipboard

Challenge: Existing studies focus on matching candidate responses with every context utterance, but it also brings noise signals and unnecessary information.
Approach: They propose a multi-hop selector network to match context with candidate responses . they propose to use a selector to filter the relevant utterances as context .
Outcome: The proposed model outperforms state-of-the-art methods on three public multi-turn dialogue datasets.
On Sample Based Explanation Methods for NLP: Faithfulness, Efficiency and Semantic Evaluation (2021.acl-long)

Copied to clipboard

Challenge: Existing methods for explaining "black-box" models such as Influence Functions are becoming more popular.
Approach: They propose a semantic-based evaluation metric that can better align with humans’ judgment of explanations than the widely adopted diagnostic or re-training measures.
Outcome: The proposed method can better align with humans’ judgment of explanations than diagnostic or re-training measures.
Learning to Ask Unanswerable Questions for Machine Reading Comprehension (P19-1)

Copied to clipboard

Challenge: Existing models for extractive reading comprehension are not good at deciding whether no answer is presented in the context.
Approach: They propose a data augmentation technique by automatically generating relevant unanswerable questions according to an answerable question paired with its corresponding paragraph that contains the answer.
Outcome: The proposed model performs better on the SQuAD 2.0 dataset than the baseline model and the BERT-large model.
Improving Relation Extraction with Relational Paraphrase Sentences (2020.coling-main)

Copied to clipboard

Challenge: Existing annotated data is expensive and non-scalable, limiting performance of relation extraction models.
Approach: They propose to enrich relation expressions by relational paraphrase sentences by annotating human-annotated data.
Outcome: The proposed model improves performance even on a strong baseline.
Robust Learning for Multi-party Addressee Recognition with Discrete Addressee Codebook (2023.acl-short)

Copied to clipboard

Challenge: Existing addressee recognition models suffer from the issue of robustness when applied in real-world scenes.
Approach: They propose a method which discretes addressees into a character codebook and makes it robust in a noisy environment.
Outcome: The proposed method represents open set addressees and is robust even in noisy environments.
Multi-Aspect Controllable Text Generation with Disentangled Counterfactual Augmentation (2024.acl-long)

Copied to clipboard

Challenge: Existing studies neglect attribute correlations formed by the intertwining of different attributes.
Approach: They propose a multi-aspect controllable text generation method with disentangled counterfactual augmentation that alleviates imbalanced attribute correlations during training by disentanglement.
Outcome: The proposed method outperforms state-of-the-art methods in imbalanced and balanced attribute correlation scenarios.
PCEE-BERT: Accelerating BERT Inference via Patient and Confident Early Exiting (2022.findings-naacl)

Copied to clipboard

Challenge: Pre-trained language models (PLMs) are the state-of-the-art (SOTA) models for natural language processing (NLP).
Approach: They propose a patient and confident early exiting BERT (PCEE-BERT) that can work with different PLMs and popular model compression methods.
Outcome: The proposed method outperforms existing models on the GLUE benchmarks and achieves different speed-up ratios.
EARL: Informative Knowledge-Grounded Conversation Generation with Entity-Agnostic Representation Learning (2021.emnlp-main)

Copied to clipboard

Challenge: Existing knowledge-grounded conversation models lack knowledge that occurs in training data, resulting in incomplete knowledge generation.
Approach: They propose an Entity-Agnostic Representation Learning method to introduce knowledge graphs to informative conversation generation using context of conversations and relational structure of knowledge graph.
Outcome: The proposed model generates more informative, coherent, and natural responses than baseline models.
BioT5: Enriching Cross-modal Integration in Biology with Chemical Knowledge and Natural Language Associations (2023.emnlp-main)

Copied to clipboard

Challenge: et al., 2022) argue that the current models for drug discovery lack the ability to integrate molecules, proteins, and natural language.
Approach: They propose a framework that integrates biological knowledge with chemical knowledge and natural language associations.
Outcome: The proposed framework shows superior performance across a wide range of tasks.
CLEAN–EVAL: Clean Evaluation on Contaminated Large Language Models (2024.findings-naacl)

Copied to clipboard

Challenge: Existing methods to evaluate large language models are prone to data contamination.
Approach: They propose a method which parses contaminated data and back-translates it into a candidate set.
Outcome: The proposed method reduces data contamination and evaluates the LLMs more cleanly.
ProtoLens: Advancing Prototype Learning for Fine-Grained Interpretability in Text Classification (2025.acl-long)

Copied to clipboard

Challenge: ProtoLens provides fine-grained, sub-sentence level interpretability for text classification.
Approach: They propose a prototype-based model that provides fine-grained, sub-sentence level interpretability for text classification.
Outcome: Extensive experiments show that ProtoLens outperforms both prototype-based and non-interpretable baselines on multiple text classification benchmarks.
AC-EVAL: Evaluating Ancient Chinese Language Understanding in Large Language Models (2024.findings-emnlp)

Copied to clipboard

Challenge: AC-EVAL is a benchmark designed to assess the advanced knowledge and reasoning capabilities of LLMs within the context of ancient Chinese.
Approach: They propose a benchmark to assess the advanced knowledge and reasoning capabilities of LLMs in ancient Chinese.
Outcome: AC-EVAL aims to assess the comprehension of ancient Chinese texts . the benchmark covers 13 tasks covering historical facts, geography, social customs, art, philosophy, classical poetry and prose.
Pingan Smart Health and SJTU at COIN - Shared Task: utilizing Pre-trained Language Models and Common-sense Knowledge in Machine Reading Tasks (D19-60)

Copied to clipboard

Challenge: Existing approaches to represent knowledge in the low-dimensional space are to leverage large-scale unsupervised text corpus to train fixed or contextual representations.
Approach: They propose to leverage large-scale unsupervised text corpus to train fixed or contextual language representations and to express knowledge into a knowledge graph (KG) they incorporate distributional representations of a KG onto the representations from pre-trained language models, via simply concatenation or multi-head attention.
Outcome: The proposed models outperform the other models on the COIN: COmmonsense INference in Natural Language Processing (COIN) Workshop datasets.
NAG-NER: a Unified Non-Autoregressive Generation Framework for Various NER Tasks (2023.acl-industry)

Copied to clipboard

Challenge: Existing models for general NER tasks require entities to be generated in a predefined order, causing error propagation and inefficient decoding.
Approach: They propose a non-autoregressive generation framework for general NER tasks that generates entities as a set instead of a sequence, avoiding error propagation and inefficient decoding.
Outcome: The proposed model outperforms state-of-the-art models on three benchmark NER datasets and two of our proprietary NER tasks.
Detoxification for LLM: From Dataset Itself (2026.acl-long)

Copied to clipboard

Challenge: Existing methods for large language models focus on post-training stage or inference time, while few tackle the source of toxicity, namely, the dataset itself.
Approach: They propose to localize and rewrite toxic spans in raw corpora with SoCD, which guides an LLM to localized and preserving semantics while preserving toxicity.
Outcome: The proposed method reduces TP from 0.42 to 0.18 and Expected Maximum Toxicity (EMT) from 0.43 to 0.20 on three LLMs.
DRUM: Learning Demonstration Retriever for Large MUlti-modal Models (2025.acl-srw)

Copied to clipboard

Challenge: Recent studies have shown that large language models (LLMs) have impressive capabilities in dealing with new tasks with the help of in-context learning (ICL).
Approach: They propose to concate the image and text embeddings to enhance the retrieval performance of a visual-language task and to calculate a list-wise ranking loss for training the embeddable model.
Outcome: The proposed framework fine-tunes the CLIP embedding model to better meet the needs of the large vision-language models.
SARA: Salience-Aware Reinforced Adaptive Decoding for Large Language Models in Abstractive Summarization (2025.acl-long)

Copied to clipboard

Challenge: Existing decoding strategies neglect the explicit use of salient contextual information and rely on static hyperparameters to fix the balance between contextual and prior knowledge.
Approach: They propose a salience-aware reinforced adaptive decoding (SARA) which incorporates salient contextual information and allows the model to determine reliance on source document's context, salient context, and model's prior knowledge based on pointwise mutual information.
Outcome: The proposed model improves the quality and faithfulness of summaries across LLMs without modifying their weights.
CARL: Constraint-Aware Reinforcement Learning for Planning with LLMs (2026.findings-acl)

Copied to clipboard

Challenge: Existing approaches to constraint-aware planning fail to enhance the model’s intrinsic focus on constraints.
Approach: They propose a constraint-aware reinforcement learning framework that encourages constraint focus and penalizes neglect of LLMs.
Outcome: The proposed framework outperforms existing frameworks and state-of-the-art reasoning models in a number of real-world applications.
HierPrompt: Zero-Shot Hierarchical Text Classification with LLM-Enhanced Prototypes (2025.findings-emnlp)

Copied to clipboard

Challenge: Existing methods for Hierarchical Text Classification are based on prototypes, but do not perform well due to ambiguity and impreciseness of category names.
Approach: They propose a method that leverages hierarchy-aware prompts to instruct LLM to produce more representative and informative prototypes.
Outcome: The proposed method outperforms existing methods on three benchmark datasets.
DGPO: Beyond Pairwise Preferences with Directional Consistent Groupwise Optimization (2026.findings-acl)

Copied to clipboard

Challenge: Existing methods for directional consistency alignment of large language models are limited . a recent study suggests reverse supervision as a complement to forward reasoning .
Approach: They propose a framework that aggregates supervision signals at the group level and explicitly models direction-aware alignment through multi-candidate comparisons.
Outcome: The proposed framework achieves 3.2% accuracy improvement across five benchmarks and multiple datasets.
MAPO: Advancing Multilingual Reasoning through Multilingual-Alignment-as-Preference Optimization (2024.acl-long)

Copied to clipboard

Challenge: Existing models exhibit inconsistent reasoning abilities across different languages . existing models lack consistency across languages due to imbalance of training data .
Approach: They propose a multilingual alignment-as-preference optimization framework to align reasoning processes in other languages with the dominant language.
Outcome: The proposed framework improves multilingual reasoning across languages on three benchmarks.
See the World, Discover Knowledge: A Chinese Factuality Evaluation for Large Vision Language Models (2025.findings-acl)

Copied to clipboard

Challenge: Existing models for large vision language models do not fully reflect their knowledge capacity and reliability, resulting in erroneous outputs that do not align with the image content or provide answers lacking knowledge evidence.
Approach: They propose a Chinese-based benchmark for visual factuality across 8 major topics and 56 subtopics and a multi-hop question construction.
Outcome: The proposed model decouples visual factuality into two parts: seeing the world and discovering knowledge.
Entailment Tree Explanations via Iterative Retrieval-Generation Reasoner (2022.findings-naacl)

Copied to clipboard

Challenge: Large language models have achieved high performance on various natural language benchmarks, but the explainability of their output remains elusive.
Approach: They propose an architecture called iterative retrieval-generation reasoner that generates an entailment tree that explains a given hypothesis by using premises from C.
Outcome: The proposed model outperforms existing benchmarks on premise retrieval and entailment tree generation with around 300% gain in overall correctness.
GradOT: Training-free Gradient-preserving Offsite-tuning for Large Language Models (2025.acl-long)

Copied to clipboard

Challenge: Existing methods for offsite-tuning of large language models require high computational costs and lack theoretical analysis.
Approach: They propose an offsite-tuning approach that selectively applies compression techniques such as rank compression and channel pruning to preserve the gradients of fine-tuned adapters while ensuring privacy.
Outcome: The proposed method surpasses existing OT methods in privacy protection and model performance.
Dialectical Structured Reasoning for Explainable Multimodal Fake News Detection (2026.findings-acl)

Copied to clipboard

Challenge: Existing fake news detection models are opaque and lack deductive transparency . a framework for dialectical structured reasoning is proposed to address this limitation .
Approach: They propose a framework that model fake news detection as an explicit dialectical process over multimodal social context.
Outcome: The proposed framework achieves state-of-the-art while producing transparent explanations that mirror human reasoning process.
Mem-Gallery: Benchmarking Multimodal Long-Term Conversational Memory for MLLM Agents (2026.acl-long)

Copied to clipboard

Challenge: Existing benchmarks evaluate multi-session memory in text-only conversations or assess multimodal understanding within localized contexts.
Approach: They propose a benchmark for evaluating multimodal long-term conversational memory in MLLM agents.
Outcome: The proposed framework assesses key memory capabilities along three functional dimensions: memory extraction and test-time adaptation, memory reasoning, and memory knowledge management.
LeeBERT: Learned Early Exit for BERT with cross-level optimization (2021.acl-long)

Copied to clipboard

Challenge: Pre-trained language models are resource exhaustive and computationally expensive for industrial scenarios.
Approach: They propose a learning scheme to learn from each other to speed up inference . they ask each exit to learn the weights of different loss terms, instead of learning only from the last layer .
Outcome: The proposed scheme improves state-of-the-art (SOTA) early exit methods for pre-trained models on the GLUE benchmark.
DISCO Balances the Scales: Adaptive Domain- and Difficulty-Aware Reinforcement Learning on Imbalanced Data (2025.findings-emnlp)

Copied to clipboard

Challenge: Large Language Models (LLMs) are increasingly aligned with human preferences through Reinforcement Learning from Human Feedback (RLHF).
Approach: a new study proposes a domain-informed self-consistency policy optimization extension to GRPO that addresses inter-group imbalance.
Outcome: a new extension of GRPO addresses inter-group imbalance with two key innovations . the proposed method outperforms existing GR PO variants by 5% on Qwen3 models .
Dissecting Failure Dynamics in Large Language Model Reasoning (2026.acl-long)

Copied to clipboard

Challenge: Large Language Models achieve strong performance through extended inference-time deliberation, yet how their reasoning failures arise remains poorly understood.
Approach: They propose a framework that probes and redirects critical transitions using uncertainty signals.
Outcome: Empirical evaluations show that GUARD improves reasoning performance . GUard probes critical transitions and redirects them using uncertainty signals .
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.
Visual Attention Reasoning via Hierarchical Search and Self-Verification (2026.acl-long)

Copied to clipboard

Challenge: Multimodal Large Language Models (MLLMs) often hallucinate due to fragile, linear reasoning and weak visual grounding.
Approach: They propose a framework that reformulates reasoning as a hierarchical search with self-verification and replaces linear Chain-of-Thought with a tree-search policy capable of backtracking to correct logical errors.
Outcome: The proposed framework outperforms state-of-the-art methods on hallucination and safety benchmarks.
BADGE: Speeding Up BERT Inference after Deployment via Block-wise Bypasses and Divergence-based Early Exiting (2023.acl-industry)

Copied to clipboard

Challenge: Recent years have witnessed the rise of many pre-trained language models (PLMs) such as GPT (Radford et al., 2019) and XLNet (Yang e.t al, 2019).
Approach: They propose a framework which consists of two off-the-shelf methods for improving PLMs’ early exiting.
Outcome: The proposed method can reduce the average latency of pre-trained language models and work with other inference speed-up methods like model pruning.
FGraDA: A Dataset and Benchmark for Fine-Grained Domain Adaptation in Machine Translation (2022.lrec-1)

Copied to clipboard

Challenge: Recent research on domain adaptation neglects diversity in translation within a domain . current research on NMT models considers very broad target domains .
Approach: They propose a fine-grained domain adaptation task for autonomous vehicles, AI education, real-time networks, and smart phone.
Outcome: The proposed task is compared with a dataset of Chinese-English translation tasks for four sub-domains of information technology: autonomous vehicles, AI education, real-time networks, and smart phone.
Retrieval-Enhanced Adversarial Training for Neural Response Generation (P19-1)

Copied to clipboard

Challenge: Existing approaches to dialogue systems are labor-intensive and difficult to scale up.
Approach: They propose a Retrieval-Enhanced Adversarial Training method for neural response generation that leverages an adversarial training paradigm while taking advantage of N-best response candidates from a retrieval-based system to construct the discriminator.
Outcome: The proposed method outperforms the vanilla Seq2Seq model and conventional adversarial training approach on a large scale dataset.
Boosting Policy and Process Reward Models with Monte Carlo Tree Search in Open-Domain QA (2025.findings-acl)

Copied to clipboard

Challenge: Experimental results show that our approach can effectively improve the performance of both the policy model and the reward model.
Approach: They propose to use Monte Carlo Tree Search for both policy model improvement and reward model improvement to bridge it to more subtle open-domain question answering.
Outcome: The proposed approach surpasses existing methods for annotation and training data with fewer data points and achieves better performance in test-time scaling strategies.
MdEval: Massively Multilingual Code Debugging (2026.findings-acl)

Copied to clipboard

Challenge: Existing benchmarks primarily focus on Python and are limited in terms of language diversity.
Approach: They propose a multilingual debugging benchmark that includes 3.9K test samples of 20 programming languages and introduces the debug instruction corpora MdEval-Instruct by injecting bugs into the correct multilingual queries and solutions.
Outcome: The proposed benchmark includes 3.9K test samples of 20 programming languages and covers the automated program repair task, bug localization task, and bug identification task.
DGLF: A Dual Graph-based Learning Framework for Multi-modal Sarcasm Detection (2024.emnlp-main)

Copied to clipboard

Challenge: Existing methods for multimodal sarcasm detection neglect high-order relationships and underestimate high-frequency messages.
Approach: They propose a Dual Graph-based Learning Framework to capture inter-modal inconsistencies . they propose combining a hypergraph and a vanilla graph to achieve enhanced propagation .
Outcome: The proposed model outperforms existing state-of-the-art methods on two benchmark datasets.
PLAY2PROMPT: Zero-shot Tool Instruction Optimization for LLM Agents via Tool Play (2025.findings-acl)

Copied to clipboard

Challenge: Existing solutions for large language models rely on manual rewriting or labeled data for validation . Existing approaches rely only on comprehensive tool documentation and in-context demonstrations .
Approach: They propose a framework that "plays" with each tool to explore its input-output behaviors.
Outcome: Experiments show that PLAY2PROMPT improves zero-shot tool performance across open and closed models.
AutoRC: Improving BERT Based Relation Classification Models via Architecture Search (2021.acl-srw)

Copied to clipboard

Challenge: Existing literature on relation classification models shows no consensus on optimal architecture .
Approach: They propose a search space for BERT based relation classification models and employ an ENAS method to find better architectures.
Outcome: The proposed method can find better architectures than baseline models on eight benchmark RC tasks.
DoCIA: An Online Document-Level Context Incorporation Agent for Speech Translation (2025.findings-acl)

Copied to clipboard

Challenge: Document-level context is crucial for speech translation due to noise from ASR . incorporating document-level contextual information into ST remains a challenge .
Approach: They develop an online framework that integrates document-level context into machine translation . they use document-based modules to integrate document- level context into ST .
Outcome: The proposed framework outperforms baselines in sentence and discourse metrics . it can correct ASR transcription errors and improve translation performance .
CNNSum: Exploring Long-Context Summarization with Large Language Models in Chinese Novels (2025.findings-acl)

Copied to clipboard

Challenge: Currently, long-context summarization mainly relies on memory ability.
Approach: They propose a multi-scale long-context summarization benchmark based on Chinese novels . they use human-driven annotations to analyze long-constituency models .
Outcome: The proposed benchmark features human-driven annotations across four subsets with lengths ranging from 16k to 128k.
A Simple Hash-Based Early Exiting Approach For Language Understanding and Generation (2022.findings-acl)

Copied to clipboard

Challenge: Existing methods to measure instance difficulty use generalization and threshold-tuning . a new approach to learn to exit is based on hash functions to assign tokens to a fixed exiting layer.
Approach: They propose a Hash-based Early Exiting approach that replaces learn-to-exit modules with hash functions to assign each token to a fixed exiting layer.
Outcome: The proposed approach improves on learning to exit and predicting instance difficulty.
Confidence-Calibrated Small-Large Language Model Collaboration for Cost-Efficient Reasoning (2026.eacl-long)

Copied to clipboard

Challenge: Large language models (LLMs) have superior reasoning capabilities compared to small language models, but incur substantially higher inference costs.
Approach: They propose a system that cascades an LLM with an SLM to achieve a balance between accuracy and cost in complex reasoning tasks.
Outcome: The proposed system improves the SLM’s reasoning ability and confidence calibration across diverse datasets and model backbones.
Text2Sql: Pure Fine-Tuning and Pure Knowledge Distillation (2025.naacl-industry)

Copied to clipboard

Challenge: Text2Sql is a task that translates natural language questions and database schemas into SQL queries.
Approach: They employ pure fine-tuning strategy to reduce redundancy by using only 53% of the baseline prompt length to fine- tune the model.
Outcome: The model outperforms the baseline model by 8.2% and 8.6% in Test-suite accuracy (TS) and exact-set-match accuracy (EM) under the most refined Spider dev set of prompts, the model achieves 73.5% and 75.4%, respectively, approaching state-of-the-art (SOTA) levels.
Inject to Heal: Alleviating hallucination in LVLMs via Context Embedding Injection (2026.findings-acl)

Copied to clipboard

Challenge: a large vision-language model can generate hallucinations inconsistent with visual input . a lightweight method that embeds the last input token as a grounding signal reduces the likelihood of hallucinosity.
Approach: They propose a training-free mitigation strategy that harnesses the hidden state of the last input token as a grounding signal to maintain visual fidelity throughout decoding and curb hallucinations.
Outcome: The proposed method outperforms state-of-the-art methods on CHAIR, AMBER, and MMHal benchmarks.
QueryLink: Leveraging Query-Memory Alignment for Long-Term Reasoning in LLM Agents (2026.findings-acl)

Copied to clipboard

Challenge: Existing approaches to integrating external memory prioritize memory organization while overlooking a critical semantic gap between implicit, intent-driven queries and explicit, narrative-based memories.
Approach: They propose a framework that leverages Query-Memory Alignment to project both queries and memories into a shared semantic space.
Outcome: The proposed framework significantly outperforms SOTA methods on the LoCoMo and LongMemEval benchmarks and can be integrated as a plug-and-play component to boost existing vector-based systems like A-MEM.
Global Attention Decoder for Chinese Spelling Error Correction (2021.findings-acl)

Copied to clipboard

Challenge: Existing methods for Chinese spelling error correction focus on local contextual information, thus misleading the user and reducing performance.
Approach: They propose a global attention decoder that learns the global relationship of correct input characters and candidates of potential error characters.
Outcome: The proposed method outperforms all competitor models by a large margin of up to 6.2% on three human-annotated datasets.
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.
Label-Free Distant Supervision for Relation Extraction via Knowledge Graph Embedding (D18-1)

Copied to clipboard

Challenge: Existing methods to generate large scale labeled data for relation extraction produce noisy relation labels when there are multiple relationships between entities.
Approach: They propose a method which assumes that a pair of entities appears in a Knowledge Graph and trains a relation classifier.
Outcome: The proposed method performs well in the current distant supervision dataset.
MPPO: Multi Pair-wise Preference Optimization for LLMs with Arbitrary Negative Samples (2025.coling-main)

Copied to clipboard

Challenge: Existing preference optimization methods such as DPO and KTO are inherently derived from PPO, requiring a reference model that adds GPU memory resources and relies heavily on abundant preference data.
Approach: They propose an algorithm that leverages the average likelihood of model responses to fit the reward function and maximizes the utilization of preference data.
Outcome: The proposed algorithm outperforms DPO, ORPO, and SimPO on MT-Bench and Arena-Hard.
Benchmarking Fine-Grained Error Detection in Multimodal Reasoning (2026.acl-long)

Copied to clipboard

Challenge: Multimodal Process Reward Models (MPRMs) have emerged as a pivotal framework for enhancing the reasoning capabilities of Multimodal Large Language Models.
Approach: They propose a benchmark specifically designed to evaluate MPRMs’ proficiency in detecting erroneous reasoning steps across diverse error categories.
Outcome: The proposed model achieves up to 4.8% performance improvement through test-time scaling.
Adversarial Preference Learning for Robust LLM Alignment (2025.findings-acl)

Copied to clipboard

Challenge: Modern language models rely on Reinforcement Learning from Human Feedback (RLHF) to encourage safe behaviors, but they remain vulnerable to adversarial attacks due to three key limitations: (1) the inefficiency and high cost of human annotation; (2) the vast diversity of potential adversarials; and (3) the risk of feedback bias and reward hacking.
Approach: They propose an iterative adversarial training method that incorporates three key innovations to address these challenges.
Outcome: Experiments on Mistral-7B-Instruct-v0.3 show that the proposed method significantly enhances robustness and reduces harmful outputs from 5.88% to 0.43%.
Learning from LLM Agents: In-Context Generative Models for Text Casing in E-Commerce Ads (2025.emnlp-industry)

Copied to clipboard

Challenge: Existing NER-based transformer models are expensive and lack contextual dependencies, making them less reliable when handling unseen or ad-specific terms, e.g., brand names.
Approach: They propose a two-stage approach to casing correction in e-commerce ad content that leverages Chain-of-Actions to enforce content policies while accurately handling ads-specific terms.
Outcome: The proposed model outperforms existing NER-based models and achieves near-LLM performance at a fraction of the cost.
Mem2Evolve: Towards Self-Evolving Agents via Co-Evolutionary Capability Expansion and Experience Distillation (2026.acl-long)

Copied to clipboard

Challenge: Existing frameworks that focus on static tools and static assets are ineffective for self-evolving agents.
Approach: They propose a paradigm of co-evolutionary Capability Expansion and Experience Distillation that leverages accumulated experience to guide dynamic creation of assets.
Outcome: The proposed framework improves performance in single-task and cross-task settings by 18.53% over standard LLMs, 11.80% over agents evolving solely through experience, and 6.46% over those evolving solelly through asset creation.
Towards Effective and Efficient Continual Pre-training of Large Language Models (2025.acl-long)

Copied to clipboard

Challenge: Continual pre-training (CPT) has been an important approach for adapting language models to specific domains or tasks.
Approach: They propose a Continual pre-training method that can greatly improve Chinese language ability and scientific reasoning ability of LLMs.
Outcome: The proposed method can greatly improve Chinese language ability and scientific reasoning ability of LLMs.
SynGraph: A Dynamic Graph-LLM Synthesis Framework for Sparse Streaming User Sentiment Modeling (2025.findings-acl)

Copied to clipboard

Challenge: Traditional sentiment analysis methods focus on static reviews, failing to capture temporal relationship between user sentiment rating and textual content.
Approach: They propose a dynamic graph-based framework that addresses data sparsity in streaming reviews.
Outcome: The proposed framework reduces data sparsity by categorizing users into mid-tail, long-tail and extreme scenarios and incorporating LLM enhancements within a dynamic graph-based structure.
ChatKBQA: A Generate-then-Retrieve Framework for Knowledge Base Question Answering with Fine-tuned Large Language Models (2024.findings-acl)

Copied to clipboard

Challenge: Existing KBQA methods address inefficient knowledge retrieval and semantic parsing errors.
Approach: They propose a generatethen-retrieve KBQA framework that generates logical form and replaces entities and relations with an unsupervised retrieval method to improve both generation and retrieval more directly.
Outcome: Experimental results show that ChatKBQA achieves new state-of-the-art performance on standard KBQA datasets, WebQSP, and CWQ.
DiagnosisArena: Benchmarking Diagnostic Reasoning for Large Language Models (2026.findings-acl)

Copied to clipboard

Challenge: Existing medical benchmarks for diagnostic reasoning are limited in their ability to perform complex tasks.
Approach: They propose to benchmark diagnostic capabilities of large language models to assess their accuracy and generalization bottlenecks.
Outcome: The proposed model achieves 45.82%, 31.09%, and 17.79% accuracy, compared to current models, o3-mini, e1 and DeepSeek-R1 .
DyBBT: Dynamic Balance via Bandit-inspired Targeting for Dialog Policy with Cognitive Dual Systems (2026.acl-long)

Copied to clipboard

Challenge: Task oriented dialog systems often rely on static exploration strategies that do not adapt to dynamic dialog contexts.
Approach: They propose a dialog policy learning framework that formalizes the exploration challenge through a structured cognitive state space C.
Outcome: The proposed framework achieves SOTA performance in success rate, efficiency, and generalization.
Aspect and Sentiment Aware Abstractive Review Summarization (C18-1)

Copied to clipboard

Challenge: Abstractive summarization is a task that generates short and concise summaries of user generated reviews.
Approach: They propose an interactive attention mechanism to learn the representations of context and aspect words within reviews, acted as an encoder.
Outcome: The proposed model achieves impressive results compared to other strong competitors on a real-life dataset.
Training Verifier to Assessing Complex Real-World Tool-Use Trajectories (2026.findings-acl)

Copied to clipboard

Challenge: Existing methods for training effective AI agents often resort to synthetic data generation.
Approach: They propose a plug-and-play framework for data quality control in tool-use scenarios . they construct a tool-verify dataset and release a benchmark to assess its performance .
Outcome: The proposed framework surpasses Qwen2.5-72B-Instruct on Tool-V-Bench and the previous APIGen-MT dataset.
Language Generation with Multi-Hop Reasoning on Commonsense Knowledge Graph (2020.emnlp-main)

Copied to clipboard

Challenge: Existing approaches that integrate commonsense knowledge into pre-trained language models simply transfer relational knowledge while ignoring rich connections within the knowledge graph.
Approach: They propose a method that leverages structural and semantic information of the knowledge graph to generate commonsense-aware text.
Outcome: The proposed method outperforms baseline models on three text generation tasks that require reasoning over commonsense knowledge.
Enabling Agents to Communicate Entirely in Latent Space (2026.acl-long)

Copied to clipboard

Challenge: Natural language is the de facto communication medium for LLM-based agents, but it presents a fundamental constraint . natural language downsampling limits the depth and nuance of information that can be transmitted . et al.: inter-agent latent space communication is a promising paradigm for solving complex tasks .
Approach: They propose a paradigm that leverages the last hidden states of an LLM as a representation of its thought for direct communication.
Outcome: The proposed paradigm outperforms fine-tuned chain-of-thought prompting and single-agent baselines even across heterogeneous models.
M3TQA: Massively Multilingual Multitask Table Question Answering (2026.findings-acl)

Copied to clipboard

Challenge: Existing multilingual table benchmarks suffer from geolinguistic imbalance - overrepresenting certain languages and lacking sufficient scale for rigorous cross-lingual analysis.
Approach: They propose a framework for massively multilingual table question answering that includes tables expanded to 97 languages from Chinese and English sources.
Outcome: Experiments on state-of-the-art LLMs show that synthetically generated training data significantly boosts performance, especially for low-resource languages.
Learned Adapters Are Better Than Manually Designed Adapters (2023.findings-acl)

Copied to clipboard

Challenge: Existing approaches to improve adapter-based tuning are sub-optimal . a learning framework is proposed to learn the optimal adapter architectures .
Approach: They propose a framework to automatically learn optimal adapter architectures for better task adaptation of pre-trained models.
Outcome: The proposed framework outperforms the previous parameter-efficient tuning baselines while tuning comparable or fewer parameters.
Mitigating Lost-in-Retrieval Problems in Retrieval Augmented Multi-Hop Question Answering (2025.acl-long)

Copied to clipboard

Challenge: Empirical results show that ChainRAG consistently outperforms baselines in both effectiveness and efficiency.
Approach: They propose a method which sequentially handles each sub-question by completing missing key entities and retrieving relevant sentences from a sentence graph for answer generation.
Outcome: The proposed method outperforms baselines on three multi-hop QA datasets.
To Code or not to Code? Adaptive Tool Integration for Math Language Models via Expectation-Maximization (2025.findings-acl)

Copied to clipboard

Challenge: Existing tools that integrate chain-of-thought reasoning and code execution lack metacognitive awareness to integrate tools.
Approach: They propose a framework that synergizes structured exploration with off-policy RL optimization to create a cycle between metacognitive tool-use decisions and evolving capabilities.
Outcome: The proposed framework improves over 11% on MATH500 and 9.4% on AIME without o1-like CoT.
SPT: Learning to Selectively Insert Prompts for Better Prompt Tuning (2023.emnlp-main)

Copied to clipboard

Challenge: Prompt tuning is a method of pre-trained models that optimizes the prompt to adapt to downstream tasks.
Approach: They propose a framework that learns to select the proper prompt layers by inserting a probabilistic gate at each intermediate layer.
Outcome: The proposed framework can perform better than the state-of-the-art prompt tuning frameworks on ten benchmark datasets.
Supporting Clustering with Contrastive Learning (2021.naacl-main)

Copied to clipboard

Challenge: Unsupervised clustering aims at discovering the semantic categories of data according to some distance measured in the representation space, but different categories overlap with each other at the beginning of the learning process.
Approach: They propose a framework to leverage contrastive learning to promote better separation between different categories by optimizing a clustering objective defined in the representation space.
Outcome: The proposed framework improves state-of-the-art accuracy and normalized mutual information on short text clustering and combines top-down and bottom-up instance discrimination to achieve better distances.
MMNMT: Modularizing Multilingual Neural Machine Translation with Flexibly Assembled MoE and Dense Blocks (2023.emnlp-main)

Copied to clipboard

Challenge: Mixture-of-Experts (MoE) based sparse architectures are prone to overfitting on low-resource language translation.
Approach: They propose a modularized MNMT framework that flexibly assembles dense and MoE-based sparse modules to achieve the best of both worlds.
Outcome: The proposed framework outperforms existing models on low-resource language translation and zero-shot translation on benchmark datasets.
Little Giants: Synthesizing High-Quality Embedding Data at Scale (2025.naacl-long)

Copied to clipboard

Challenge: Synthetic data generation is an increasingly popular way of training models without the need for large, manually labeled datasets.
Approach: They propose a framework that aligns open-source small models to efficiently generate large-scale embedding data.
Outcome: The proposed framework outperforms state-of-the-art embedding models by using only 1/10 of the GPT API calls.
LLaSE-G1: Incentivizing Generalization Capability for LLaMA-based Speech Enhancement (2025.acl-long)

Copied to clipboard

Challenge: Recent advances in language models have demonstrated strong capabilities in semantic understanding and contextual modeling.
Approach: They propose a LLaMA-based language model that incentivizes generalization capabilities for speech enhancement.
Outcome: The proposed language model outperforms prior task-specific discriminative and generative models in acoustic enhancement tasks.
SaCa: A Highly Compatible Reinforcing Framework for Knowledge Graph Embedding via Structural Pattern Contrast (2025.findings-emnlp)

Copied to clipboard

Challenge: Existing knowledge Graph Embedding approaches lack structural semantics of knowledge graphs . structure-aware calibration (SaCa) is a framework designed to calibrate KGEs based on global structural patterns.
Approach: a new framework is designed to calibrate knowledge graphs using global structural patterns.
Outcome: a new framework can calibrate KGE models using global structural patterns . the framework consistently boosts performance across ten models on link prediction and entity classification tasks .
MemTR: Enhancing Tool-Calling Reliability via Uncertainty-Triggered FFN-Space Retracing (2026.findings-acl)

Copied to clipboard

Challenge: Existing tool-calling methods rely on costly tool-use training data or only constrain syntax, leaving tool selection and argument value errors largely unsolved.
Approach: They propose a method that decodes tool evidence from the tool library and mixes it into the output at the uncertain layer.
Outcome: The proposed method reduces tool calling failures by 2%–9% with only 1%–2% runtime overhead.
StyleFlow: Disentangle Latent Representations via Normalizing Flow for Unsupervised Text Style Transfer (2024.lrec-main)

Copied to clipboard

Challenge: Existing methods to separate content from style but some words contain both content and style information.
Approach: They propose a method which uses a reversible encoder to improve content disentanglement.
Outcome: The proposed method outperforms baselines on sentiment transfer and formality transfer tasks.
THCM-CAL: Temporal-Hierarchical Causal Modelling with Conformal Calibration for Clinical Risk Prediction (2025.findings-emnlp)

Copied to clipboard

Challenge: Existing approaches to risk prediction from EHRs handle structured diagnostic codes and unstructured narrative notes separately.
Approach: They propose a Temporal-Hierarchical Causal Model with Conformal Calibration . they construct a multimodal causal graph where nodes represent clinical entities from two modalities .
Outcome: The proposed model infers three clinically grounded interactions from textual propositions and ICD codes mapped to textual descriptions.
Question Answering with Long Multiple-Span Answers (2020.findings-emnlp)

Copied to clipboard

Challenge: Existing QA systems for question answering are limited by the availability of annotated datasets.
Approach: They propose a dataset for question-answering that extracts information from multiple parts of text . they propose QA-based multi-span neural architecture that captures relevance among multiple answer spans .
Outcome: The proposed model outperforms state-of-the-art QA models in this multi-span QA setting.
PARA: Parameter-Efficient Fine-tuning with Prompt-Aware Representation Adjustment (2024.emnlp-industry)

Copied to clipboard

Challenge: Existing methods for parameter-efficient fine-tuning excel in the context of single-backbone multi-tenant applications.
Approach: They propose to integrate a lightweight vector generator within each Transformer layer to improve prompt-aware representation adjustment.
Outcome: The proposed method surpasses current benchmarks in terms of performance despite having a similar number of adjustable parameters.
RLAE: Reinforcement Learning-Assisted Ensemble for LLMs (2025.emnlp-main)

Copied to clipboard

Challenge: Existing ensemble methods for ensembling large language models rely on fixed weighting strategies that fail to adapt to dynamic, context-dependent characteristics of LLMs.
Approach: They propose a framework that reformulates LLM ensemble through a Markov Decision Process.
Outcome: The proposed framework outperforms existing methods by 3.3% on a diverse set of tasks while achieving lower time latency.
From Past To Path: Masked History Learning for Next-Item Prediction in Generative Recommendation (2026.acl-long)

Copied to clipboard

Challenge: Generative recommendation models inherently bias towards local contexts, failing to capture deeper historical dependencies necessary for understanding complex user intents.
Approach: They propose a training framework that shifts the objective from simple next-step prediction to deep comprehension of history by entropy-guided masking policy and a curriculum learning scheduler to enhance the framework.
Outcome: The proposed framework outperforms state-of-the-art generative models on three public datasets and shows that it is more accurate than current models.
OFFSIDE: Benchmarking Unlearning Misinformation in Multimodal Large Language Models (2026.findings-acl)

Copied to clipboard

Challenge: Existing benchmarks for MU are limited by a lack of image diversity and coarse-grained unlearning targets.
Approach: They propose a benchmark to evaluate misinformation unlearning in MLLMs . OFFSIDE supports advanced unlearning targets such as fine-grained unlearning and visual rumor removal.
Outcome: OFFSIDE supports advanced unlearning targets, such as fine-grained unlearning and visual rumor removal.
IAPT: Instance-Aware Prompt Tuning for Large Language Models (2024.acl-long)

Copied to clipboard

Challenge: Existing methods for prompt tuning require many soft tokens to guarantee performance . large language models still require a large amount of GPU memory and computations to fine-tune .
Approach: They propose to use a parameter-efficient soft prompt generator to generate idiosyncratic soft prompts for each input instruction.
Outcome: The proposed method outperforms the baselines with comparable tunable parameters and is more efficient than LoRA under the single-backbone multi-tenant setting.
SCA: Selective Compression Attention for Efficiently Extending the Context Window of Large Language Models (2024.findings-emnlp)

Copied to clipboard

Challenge: Existing methods to compress the KV cache of large language models are expensive and limited in their context window and cost.
Approach: They propose a method to expand the context window and reduce memory footprint by compressing the KV cache of large language models.
Outcome: The proposed method can reduce memory footprint and expand context window of large language models without training.
ChartMind: A Comprehensive Benchmark for Complex Real-world Multimodal Chart Question Answering (2025.emnlp-main)

Copied to clipboard

Challenge: Chart question answering (CQA) is a multimodal task for evaluating the reasoning capabilities of vision-language models.
Approach: They propose a chart question answering benchmark that incorporates multilingual contexts and supports open-domain textual outputs.
Outcome: The proposed framework outperforms the previous three common CQA paradigms: instruction-following, OCR-enhanced, and chain-of-thought.
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.
A Batch Normalized Inference Network Keeps the KL Vanishing Away (2020.acl-main)

Copied to clipboard

Challenge: Variational Autoencoder (VAE) is widely used to approximate a model’s posterior on latent variables.
Approach: They propose to let the Kullback–Leibler divergence individual follow a distribution across the whole dataset and analyze that it is sufficient to prevent posterior collapse by keeping the expectation of the KL’s distribution positive.
Outcome: The proposed approach can avoid posterior collapse effectively and efficiently without introducing any new model component or modifying the objective.
The Accuracy Paradox in RLHF: When Better Reward Models Don’t Yield Better Language Models (2024.emnlp-main)

Copied to clipboard

Challenge: Reinforcement Learning from Human Feedback (RLHF) significantly enhances Natural Language Processing by aligning language models with human expectations.
Approach: They propose to integrate feedback from humans into RLHF to improve language models by capturing human-like preferences.
Outcome: The proposed model outperforms models trained with moderately accurate reward models on relevance, factuality, and completeness tasks.
Neural Natural Language Inference Models Enhanced with External Knowledge (P18-1)

Copied to clipboard

Challenge: Existing datasets that allow for complex models to be trained are limited . if data is not available, can machines learn all knowledge needed to perform natural language inference?
Approach: They propose to enrich neural natural language inference models with external knowledge . they propose to use this knowledge to build NLI models to leverage it .
Outcome: The proposed models improve on the SNLI and MultiNLI datasets.
PAED: Zero-Shot Persona Attribute Extraction in Dialogues (2023.acl-long)

Copied to clipboard

Challenge: Existing methods for persona attribute extraction from conversations are inconsistent and unreliable.
Approach: They propose a model with a hard negative sampling strategy for generalized zero-shot persona attribute extraction.
Outcome: The proposed model outperforms existing models in persona attribute extraction tasks.
An Effective and Efficient Entity Alignment Decoding Algorithm via Third-Order Tensor Isomorphism (2022.acl-long)

Copied to clipboard

Challenge: Existing methods focus on graph representation learning, but decoding is a key part of the process.
Approach: They propose an EA Decoding Algorithm via Third-order Tensor Isomorphism (DATTI) they combine two sets of isomorphic equations to enhance the decoding process .
Outcome: The proposed algorithm can deliver significant performance improvements even on the most advanced methods while the extra required time is less than 3 seconds.
ComRAG: Retrieval-Augmented Generation with Dynamic Vector Stores for Real-time Community Question Answering in Industry (2025.acl-industry)

Copied to clipboard

Challenge: Existing methods for Community Question Answering (CQA) focus on static knowledge, limiting their applicability to real-world scenarios.
Approach: They propose a retrieval-augmented generation framework for real-time industrial CQA that integrates static knowledge with dynamic historical QA pairs via a centroid-based memory mechanism.
Outcome: The proposed framework outperforms baselines on three industrial CQA datasets and achieves 25.9% improvement in vector similarity, reducing latency by 8.7%–23.3%, and lowering chunk growth from 20.23% to 2.06% over iterations.
Lifelong Pretraining: Continually Adapting Language Models to Emerging Corpora (2022.naacl-main)

Copied to clipboard

Challenge: Pretrained language models are typically learned over a large, static corpus and fine-tuned for various downstream tasks.
Approach: They propose to continuously update a pretrained language model to adapt to emerging data and to keep track of the model's performance.
Outcome: The proposed model can adapt to new corpora while retaining knowledge in earlier domains.
AMAS: Adaptively Determining Communication Topology for LLM-based Multi-agent System (2025.emnlp-industry)

Copied to clipboard

Challenge: Large language models (LLMs) have revolutionized natural language processing, but their practical implementation as autonomous multi-agent systems remains fraught with unresolved challenges.
Approach: They propose a dynamic graph selector that redefines LLM-based MAS by exploiting the intrinsic properties of individual inputs to intelligently direct query trajectories.
Outcome: The proposed framework exceeds state-of-the-art approaches in question answering, mathematical deduction, and code generation benchmarks.
Candidate Soups: Fusing Candidate Results Improves Translation Quality for Non-Autoregressive Translation (2022.emnlp-main)

Copied to clipboard

Challenge: Existing methods to improve NAT model's performance but do not fully utilize it.
Approach: They propose a non-autoregressive translation method which can obtain high-quality translations while maintaining the inference speed of NAT models.
Outcome: The proposed method outperforms the autoregressive translation model on three translation tasks with 7.6 speedup.
LLMs + Persona-Plug = Personalized LLMs (2025.acl-long)

Copied to clipboard

Challenge: Large language models (LLMs) have demonstrated extraordinary capabilities in natural language understanding, generation, and reasoning.
Approach: They propose a plug-and-play LLM model that embeds a user-specific embedding for each individual by modeling her historical contexts through a lightweight plug-in user embedder module.
Outcome: Experiments on various tasks in the language model personalization (LaMP) benchmark show that the proposed model significantly outperforms existing personalized LLM approaches.
mmE5: Improving Multimodal Multilingual Embeddings via High-quality Synthetic Data (2025.findings-acl)

Copied to clipboard

Challenge: Multimodal embedding models encode multimedia inputs into latent vector representations.
Approach: They propose to synthesize multimodal multilingual data using a multimodal large language model . they identify three criteria for high-quality synthetic multimodal data .
Outcome: The proposed model outperforms existing models on the MMEB Benchmark and the XTD benchmark.
Point, Disambiguate and Copy: Incorporating Bilingual Dictionaries for Neural Machine Translation (2021.acl-long)

Copied to clipboard

Challenge: Existing approaches to incorporate bilingual dictionaries into Neural Machine Translation (NMT) models have been criticized for lack of integration of bilingual lexical information into the neural architecture.
Approach: They propose a neural architecture to incorporate bilingual dictionaries into Neural Machine Translation models by introducing three new components: Pointer, Disambiguator, and Copier.
Outcome: The proposed method achieves the following merits inherently compared with previous efforts: (1) Pointer leverages the semantic information from bilingual dictionaries, for the first time, to better locate source words whose translation in dictionary can potentially be used; (2) Disambiguator synthesizes contextual information from source view and target view, both of which contribute to distinguishing translation of a specific source word from multiple candidates in dicaries; (3) Copier systematically connects Pointer and Disambiguators based on a hierarchical
ALoRA: Allocating Low-Rank Adaptation for Fine-tuning Large Language Models (2024.naacl-long)

Copied to clipboard

Challenge: Low-rank adaptation (LoRA) has demonstrated commendable performance as a popular method . however, it is implemented with a fixed intrinsic rank that might not be ideal for downstream tasks.
Approach: They propose a method that estimates the importance score of each LoRA rank and prunes abundant LoRA ranks to improve performance.
Outcome: The proposed method outperforms baselines on a variety of tasks with comparable parameters.
Time-LlaMA: Adapting Large Language Models for Time Series Modeling via Dynamic Low-rank Adaptation (2025.acl-srw)

Copied to clipboard

Challenge: Recent studies have demonstrated that large language models possess robust pattern recognition and semantic understanding capabilities over time series data.
Approach: They propose a time series model that converts time series input into token embeddings and aligns time sequence embeddables with text prompts.
Outcome: The proposed framework achieves the state-of-the-art (SOTA) performance and has potentials for wide industrial usages.
UrbanGeoEval: A City-Scale Benchmark for Evaluating Large Language Models in Geospatial Reasoning (2026.acl-long)

Copied to clipboard

Challenge: Extensive experiments on 18 widely used LLMs uncover critical insights: (1) models exhibit severe geographic biases and resolution gaps; (2) failures in complex multi-hop tasks stem from brittle foundational spatial skills rather than high-level logic deficits.
Approach: They propose a dual-module framework that disentangles factual recall and spatial logic from the model's real capabilities in urban environments.
Outcome: Extensive tests on 18 widely used LLMs reveal that models exhibit severe geographic biases and resolution gaps, and failures in complex multi-hop tasks often stem from brittle foundational spatial skills rather than high-level logic deficits.
Pairwise Supervised Contrastive Learning of Sentence Representations (2021.emnlp-main)

Copied to clipboard

Challenge: Recent efforts to improve sentence representation learning have a common weakness . siamese or triplet loss only learns from individual sentence pairs or tripletes .
Approach: They propose a discrimination-based approach to bridge entailment and contradiction understanding with categorical concept encoding.
Outcome: The proposed method outperforms the state-of-the-art method on downstream tasks . it improves 10%–13% on clustering tasks and 5%–6% on STS tasks compared with the previous method .
Multi-Stage Balanced Distillation: Addressing Long-Tail Challenges in Sequence-Level Knowledge Distillation (2024.findings-emnlp)

Copied to clipboard

Challenge: Knowledge distillation (KD) is a promising solution for large language models, but their deployment remains computationally expensive.
Approach: They propose a framework which iteratively balances training data within a fixed computational budget and enables the transfer of knowledge from expensive teacher LLMs to smaller student models.
Outcome: The proposed framework achieves state-of-the-art performance across diverse long-tailed datasets, enhancing both the efficiency and efficacy of the distilled models.
GenProve: Learning to Generate Text with Fine-Grained Provenance (2026.acl-long)

Copied to clipboard

Challenge: Existing methods for large language models (LLMs) are coarse-grained and fail to distinguish between direct quotes and complex reasoning.
Approach: They propose a framework that combines supervised fine-tuning and group relative policy optimization to generate fluent answers while simultaneously producing sentence-level provenance triples.
Outcome: The proposed framework outperforms 14 strong large language models in joint evaluation.
LongEmbed: Extending Embedding Models for Long Context Retrieval (2024.emnlp-main)

Copied to clipboard

Challenge: Existing embedding models support only 512 input tokens, hindering their application in scenarios requiring long inputs.
Approach: They evaluate the performance of existing embedding models by using a new benchmark and a training-free context window extension strategy.
Outcome: The proposed model extends the input window of existing models by several folds.
LIFBench: Evaluating the Instruction Following Performance and Stability of Large Language Models in Long-Context Scenarios (2025.acl-long)

Copied to clipboard

Challenge: Existing benchmarks rarely focus on instruction-following in long-context scenarios or stability on different inputs.
Approach: They propose a scalable dataset to evaluate LLMs’ instruction-following capabilities and stability across long contexts.
Outcome: The proposed method evaluates LLMs’ instruction-following capabilities and stability across long contexts.
Generative Pretrained Structured Transformers: Unsupervised Syntactic Language Models at Scale (2024.acl-long)

Copied to clipboard

Challenge: Existing syntactic language models require a gold tree and sequential training to generate sentences.
Approach: They propose an unsupervised syntactic language model that incrementally generates a sentence with its syntaktic tree in a left-to-right manner.
Outcome: The proposed model outperforms existing models on grammar induction and comprehension tasks while holding a substantial acceleration on training.
Avoiding Knowledge Edit Skipping in Multi-hop Question Answering with Guided Decomposition (2025.findings-emnlp)

Copied to clipboard

Challenge: Existing methods for knowledge editing fail to work in multi-hop question answering due to 'edit skipping' edit skipping occurs due to the mismatch between the granularity of LLMs in problem-solving and the facts in the edited memory.
Approach: They propose a retrieval-augmented generation-based method that edits knowledge without modifying parameters without retraining LLMs.
Outcome: The proposed method outperforms state-of-the-art methods for KE in multi-hop question answering.
Neeko: Leveraging Dynamic LoRA for Efficient Multi-Character Role-Playing Agent (2024.emnlp-main)

Copied to clipboard

Challenge: Large Language Models (LLMs) have revolutionized open-domain dialogue agents but face challenges in multi-character role-playing (MCRP) scenarios.
Approach: They propose a framework for efficient multi-character role-playing that employs a dynamic low-rank adapter strategy and distinct LoRA blocks for each character.
Outcome: Neeko employs a dynamic low-rank adapter (LoRA) strategy, enabling it to adapt seamlessly to diverse characters.
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.
FinEval: A Chinese Financial Domain Knowledge Evaluation Benchmark for Large Language Models (2025.naacl-long)

Copied to clipboard

Challenge: Large language models have demonstrated outstanding performance in various natural language processing tasks, but their security capabilities in the financial domain have not been explored.
Approach: They propose to use a benchmark to evaluate large language models' financial domain knowledge and practical abilities.
Outcome: The proposed benchmark evaluates large language models' financial domain knowledge and practical abilities.
MeNTi: Bridging Medical Calculator and LLM Agent with Nested Tool Calling (2025.naacl-long)

Copied to clipboard

Challenge: Large Language Models (LLMs) have been widely used in medicine but are limited in their ability to fully address the complexities of the real world.
Approach: They propose a universal agent architecture for Large Language Models that integrates a specialized medical toolkit and employs meta-tool and nested calling mechanisms to enhance LLM tool utilization.
Outcome: The proposed framework improves the accuracy and performance of medical calculators in complex medical scenarios.
Beyond Surface Features: Advancing Medical Vision-Language Alignment via Dynamic Evidence-Guided Preference Optimization (2026.acl-long)

Copied to clipboard

Challenge: Existing preference-based methods for medical large vision-Language Models face limitations in medical settings . existing methods are limited by overfitting to superficial cues and pseudo convergence of the preference signal.
Approach: They propose a framework that enables evidence-aware and adaptive preference learning for Med-LVLMs.
Outcome: The proposed framework improves evidence-aware and adaptive preference learning for Med-LVLMs.
STAPO: Selective Trajectory-Aware Policy Optimization for LLM Agent Training (2026.acl-long)

Copied to clipboard

Challenge: Prior work has explored step-level supervision using Shannon-entropy-based uncertainty signals, which conflate inherent state complexity with agent confidence.
Approach: They propose a hierarchical group-based RL framework that leverages normalized entropy to locate outlier steps associated with trajectory neglect and optimizes them via a mechanism of trajectory-aware reward and trajectory-independent penalty.
Outcome: Experiments on ALFWorld, WebShop, and Search-Augmented QA show that STAPO achieves state-of-the-art performance while substantially alleviating trajectory neglect.
TextFlint: Unified Multilingual Robustness Evaluation Toolkit for Natural Language Processing (2021.acl-demo)

Copied to clipboard

Challenge: Existing approaches to textual robustness evaluation focus on slightly modifying the input data, which maintains the original meaning and results in a different prediction.
Approach: They propose a multilingual robustness evaluation toolkit for NLP that integrates universal text transformations, task-specific transformations and adversarial attack.
Outcome: The toolkit includes universal text transformation, task-specific transformation, adversarial attack, subpopulation, and their combinations to provide comprehensive robustness analyses.
Assessing “Implicit” Retrieval Robustness of Large Language Models (2024.emnlp-main)

Copied to clipboard

Challenge: Retrieval-augmented generation (RAG) is a framework to enhance large language models with external knowledge, but its effectiveness is constrained by the retrieval robustness of the model.
Approach: They propose to use gold and distracting context to fine-tune models to handle relevant or irrelevant retrieved context in an end-to-end manner.
Outcome: The proposed model performs better when gold and distracting context are used, while still extracting correct answers when retrieval is accurate.
Seeing No Evil: Blinding Large Vision-Language Models to Safety Instructions via Adversarial Attention Hijacking (2026.acl-long)

Copied to clipboard

Challenge: Existing attacks optimize image perturbations to maximize harmful output likelihood, but suffer from slow convergence due to gradient conflict between adversarial objectives and the model’s safety-retrieval mechanism.
Approach: They propose a push-pull approach which suppresses attention to system-prompt tokens and anchors generation on adversarial image features to avoid collisions.
Outcome: The proposed approach reduces gradient conflict by 45% and achieves 94.4% attack success rate on Qwen-VL (vs. 68.8% baseline) with 40% fewer iterations.
UniCreative: Unifying Long-form Logic and Short-form Sparkle via Reference-Free Reinforcement Learning (2026.findings-acl)

Copied to clipboard

Challenge: Existing alignment paradigms for creative writing use static reward signals and supervised data.
Approach: They propose a constraint-aware reward model that synthesizes query-specific criteria to provide fine-grained preference judgments.
Outcome: The proposed framework aligns models with human preferences across content quality and structural paradigms without supervised fine-tuning and ground-truth references.
Towards Accurate and Consistent Evaluation: A Dataset for Distantly-Supervised Relation Extraction (2020.coling-main)

Copied to clipboard

Challenge: Distant Supervision (DS) generates large-scale annotated data but has wrong labels that result in incorrect evaluation scores during testing.
Approach: They build a dataset using DS-generated data as training data and hire annotators to label test data.
Outcome: The proposed dataset NYTH has a much larger test set and performs more accurate and consistent evaluation.
Chain-of-Thought Matters: Improving Long-Context Language Models with Reasoning Path Supervision (2025.findings-emnlp)

Copied to clipboard

Challenge: Recent advances in Large Language Models (LLMs) have highlighted the challenge of handling long-context tasks.
Approach: They propose a chain-of-thought framework that teaches models to generate high-quality reasoning paths for enhanced long-context performance.
Outcome: The proposed framework generalizes across most long-context scenarios and amplifys with increasing context length.
Mobile-R1: Towards Interactive Capability for VLM-Based Mobile Agent via Systematic Training (2026.acl-long)

Copied to clipboard

Challenge: Existing approaches to training agents for visual-language models trap them in local optima, hindering exploration and error correction with the environment.
Approach: They propose a hierarchical training recipe that bridges atomic action execution and strategic task completion.
Outcome: The proposed training recipe bridges atomic action execution and strategic task completion.
Virtual Augmentation Supported Contrastive Learning of Sentence Representations (2022.findings-acl)

Copied to clipboard

Challenge: Despite profound successes, contrastive representation learning relies on carefully designed data augmentations using domain-specific knowledge.
Approach: They propose a virtual augmentation supported Contrastive Learning of sentence representations . they approximate the neighborhood of an instance via its K-nearest in-batch neighbors .
Outcome: The proposed model outperforms existing methods on a wide range of downstream tasks.

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