Papers by Jian Wang

215 papers
Disentangling Reasoning Capabilities from Language Models with Compositional Reasoning Transformers (2023.findings-acl)

Copied to clipboard

Challenge: ReasonFormer is a unified reasoning framework for complex decision-making . it is based on the dual-process theory of cognitive science, where two cognitive systems interact to form a whole reasoning process.
Approach: They propose a unified reasoning framework that mirrors the modular reasoning process of humans . they decouple the representation module and the reasoning modules to capture different levels of cognition .
Outcome: The proposed framework shows that humans can perform better in complex decision-making tasks.
UserAdapter: Few-Shot User Learning in Sentiment Analysis (2021.findings-acl)

Copied to clipboard

Challenge: Adapting a model to a handful of personalized data is challenging, authors say . standard fine-tuning requires hundreds of millions of parameters for each user .
Approach: They propose a lightweight method that clamps millions of parameters of a Transformer model and optimizes a tiny user-specific vector.
Outcome: The proposed method improves accuracy on Yelp and IMDB datasets and reduces the number of parameters added for each user.
Think Visually: Question Answering through Virtual Imagery (P18-1)

Copied to clipboard

Challenge: Existing models of geometric reasoning are based on visual representations of objects and objects, but they are not based in symbols or words.
Approach: They propose a new deep network architecture that specializes in answering questions that admit latent visual representations and learns to generate and reason over such representations.
Outcome: The proposed model can generate and reason over latent visual representations and is validated by two synthetic benchmarks.
Reinforcement Learning for Diffusion LLMs via Energy-Based Gibbs Alignment (2026.acl-long)

Copied to clipboard

Challenge: Diffusion Large Language Models (dLLMs) offer parallel decoding and bidirectional context modeling . aligning dLLms with reinforcement learning (RL) remains a challenge .
Approach: They propose a variational framework that reformulates RL for dLLMs as a distribution matching problem.
Outcome: The proposed framework reformulates RL for dLLMs as a distribution matching problem.
Mixture of Diverse Size Experts (2024.emnlp-industry)

Copied to clipboard

Challenge: Recent large language models (LLMs) have shown superior performance in a variety of tasks due to the sub-linearly increasing computational costs.
Approach: They propose a new MoE architecture with designed layers where experts have different sizes to mitigate this defect.
Outcome: The proposed architecture surpasses existing MoEs by adaptively assigning the parameter budget to experts while maintaining the same total parameter size and number of experts.
NBDESCRIB: A Dataset for Text Description Generation from Tables and Code in Jupyter Notebooks with Guidelines (2025.findings-acl)

Copied to clipboard

Challenge: Existing methods for Jupyter Notebooks focus on generating cell-level descriptions from code snippets or table outputs independently.
Approach: They propose a task to generate personalized cell-level descriptions using code, tables, and user-written guidelines in Jupyter Notebooks.
Outcome: The proposed task combines code, tables, and user-written guidelines with personalized descriptions to evaluate the performance of existing models.
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.
EAC-MoE: Expert-Selection Aware Compressor for Mixture-of-Experts Large Language Models (2025.acl-long)

Copied to clipboard

Challenge: Mixture-of-Experts (MoE) has demonstrated promising potential in scaling LLMs . however, it is hindered by two critical challenges: substantial GPU memory consumption and low activated parameters.
Approach: They propose an Expert-Selection Aware Compressor for Mixture-of-Experts (MoE) that aligns with the characteristics of MoE from the perspectives of quantization and pruning.
Outcome: The proposed approach significantly reduces memory usage and improves inference speed with minimal performance degradation.
Stylized Knowledge-Grounded Dialogue Generation via Disentangled Template Rewriting (2022.naacl-main)

Copied to clipboard

Challenge: Existing knowledge-grounded dialogue generation models only produce pedantic responses, which lacks emotion and attraction compared with the responses with polite style, positive and negative sentiments.
Approach: They propose a method which generates responses via combing disentangled style templates and content templates.
Outcome: The proposed method improves on evaluation metrics compared with state-of-the-art methods.
Generating Commonsense Reasoning Questions with Controllable Complexity through Multi-step Structural Composition (2025.coling-main)

Copied to clipboard

Challenge: Existing work mainly learns to map text into questions, lacking a mechanism to control results with desired complexity.
Approach: They propose a novel controllable framework to generate QGs with desired complexity using contextual and commonsense clues from text.
Outcome: The proposed framework can generate complex questions with desired complexity levels.
FlexQuant: A Flexible and Efficient Dynamic Precision Switching Framework for LLM Quantization (2025.findings-emnlp)

Copied to clipboard

Challenge: Existing methods for quantization of large language models struggle to adapt to dynamic workloads.
Approach: a new framework optimizes the trade-off between inference speed and accuracy . FlexQuant enables fine-grained, layer-wise mixed-precision quantization .
Outcome: a new framework optimizes the trade-off between inference speed and accuracy . it achieves a 1.3 speedup across diverse language tasks with negligible accuracy loss .
UniEDU: Toward Unified and Efficient Large Multimodal Models for Educational Tasks (2025.emnlp-industry)

Copied to clipboard

Challenge: Existing research has focused on plain text, while real-world K-12 scenarios often involve multimodal data.
Approach: They propose a unified language and vision assistant called UniEDU for educational applications . it excels across multiple educational tasks while maintaining strong generalization capabilities . authors propose to use UniEDu for industry-scale deployment .
Outcome: The proposed model excels across multiple educational tasks while maintaining strong generalization capabilities.
MS2SL: Multimodal Spoken Data-Driven Continuous Sign Language Production (2024.findings-acl)

Copied to clipboard

Challenge: Existing solutions for sign language production are limited due to phonological differences and data scarcity.
Approach: They propose a unified framework for continuous sign language production that generates sign predictions step by step from text or speech embeddings.
Outcome: The proposed model achieves competitive performance on how2sign and PHOENIX14T datasets.
Reasoning as Gradient: Scaling MLE Agents Beyond Tree Search (2026.findings-acl)

Copied to clipboard

Challenge: LLM-based agents for machine learning engineering rely on tree search to rank candidates.
Approach: They propose an LLM-based agent that operationalizes gradient-based optimization.
Outcome: The proposed agent achieves a state-of-the-art 35.1% any-medal rate on MLE-Bench with a limited budget on a single GPU.
UnCo: Uncertainty-Driven Collaborative Framework of Large and Small Models for Grounded Multimodal NER (2025.emnlp-main)

Copied to clipboard

Challenge: Existing methods to identify unseen multimodal entities struggle with limited knowledge and generalization.
Approach: They propose a framework that leverages the strengths of small fine-tuned models and MLLMs to generate unambiguous predictions.
Outcome: Extensive experiments show that the proposed framework retains the in-domain knowledge of small models while utilizing the capabilities of MLLMs to handle unseen entities.
Towards Understanding and Improving Knowledge Distillation for Neural Machine Translation (2023.acl-long)

Copied to clipboard

Challenge: Existing knowledge distillation techniques for neural machine translation lack special treatment on the top-1 information, which is limiting the potential of KD.
Approach: They propose a method to distill knowledge from top-1 predictions of teachers and a technique to infuse more additional knowledge by distilling on the data without ground-truth targets.
Outcome: The proposed method outperforms the vanilla word-level KD and outperfies the existing methods on three different students with different capacity gaps.
FOREVER: Forgetting Curve-Inspired Memory Replay for Language Model Continual Learning (2026.acl-long)

Copied to clipboard

Challenge: Continual learning (CL) for large language models (LLMs) aims to enable sequential knowledge acquisition without catastrophic forgetting.
Approach: They propose a framework that aligns replay schedules with a model-centric notion of time.
Outcome: Experiments on three benchmarks show that FOREVER consistently mitigates catastrophic forgetting.
MAKAR: a Multi-Agent framework based Knowledge-Augmented Reasoning for Grounded Multimodal Named Entity Recognition (2025.emnlp-main)

Copied to clipboard

Challenge: Existing methods for GMNER fail to address semantic ambiguity caused by polysemy and long-tail distribution of datasets.
Approach: They propose a framework for Grounded Multimodal Named Entity Recognition that leverages a Multimodal Large Language Model to address semantic ambiguity.
Outcome: Extensive experiments show that the proposed framework outperforms existing methods on two benchmark datasets.
WebClipper: Efficient Evolution of Web Agents with Graph-based Trajectory Pruning (2026.acl-long)

Copied to clipboard

Challenge: Open-source web agents rely on long tool-call trajectories with cyclic reasoning loops and exploration of unproductive branches.
Approach: They propose a framework that compresses web agent trajectories via graph-based pruning.
Outcome: The proposed framework reduces tool-call rounds by 20% while improving accuracy and efficiency while maintaining the same level of performance as existing models.
LoopCoder: Scaling Code Intelligence via Looped Language Models (2026.findings-acl)

Copied to clipboard

Challenge: Large language models have mastered syntax-level code generation, but complex algorithmic reasoning remains a challenge.
Approach: They propose a recurrent inductive bias that aligns with the recursive nature of programming logic.
Outcome: The proposed model achieves comparable performance to standard dense models with more parameters.
Turning the Tide: Repository-based Code Reflection (2025.findings-emnlp)

Copied to clipboard

Challenge: Code large language models (LLMs) enhance programming by understanding and generating code across languages.
Approach: a new benchmark evaluates code understanding and generation in repositories using code large language models.
Outcome: The proposed model improves code understanding and generation in repositories by evaluating 1,888 test cases across 6 programming languages.
A Slot Is Not Built in One Utterance: Spoken Language Dialogs with Sub-Slots (2022.findings-acl)

Copied to clipboard

Challenge: Sub-Slot based task-oriented dialogs provide slot values segment by segment over multiple turns.
Approach: They define a task called Sub-Slot based Task-Oriented Dialog (SSTOD) they build a Chinese dialog dataset SSD for boosting research on SSTOD.
Outcome: The proposed task is called Sub-Slot based Task-Oriented Dialog (SSTOD) it includes 40K dialogs and 500K utterances from Chinese names, phone numbers, ID numbers and license plate numbers . the dataset is well annotated with sub-slot values, slot values, dialog states and actions .
Don’t Say No: Jailbreaking LLM by Suppressing Refusal (2025.findings-acl)

Copied to clipboard

Challenge: Large Language Models (LLMs) are vulnerable to "jailbreaking" attacks where crafted prompts manipulate them into producing toxic content.
Approach: They propose to improve the target loss objective by combining a cosine decay schedule method with refusal suppression to achieve higher success rates.
Outcome: The proposed approach outperforms baseline attacks and achieves state-of-the-art attack success rates.
ProQA: Structural Prompt-based Pre-training for Unified Question Answering (2022.naacl-main)

Copied to clipboard

Challenge: Existing QA research on question answering is focused on specific question types, knowledge domains, or reasoning skills.
Approach: They propose a unified QA paradigm that solves various tasks through a single model.
Outcome: The proposed model improves QA-centric ability on 11 QA benchmarks.
ReCreate: Reasoning and Creating Domain Agents Driven by Experience (2026.acl-long)

Copied to clipboard

Challenge: Large Language Model (LLM) agents are reshaping the industrial landscape, but tasks differ widely, making them labor-intensive to build.
Approach: They propose an experience-driven framework for the automatic creation of domain agents . they leverage agent interaction histories to provide rich concrete signals on success or failure .
Outcome: The proposed framework outperforms human-designed agents and existing methods in experiments across diverse domains.
Generative Table Pre-training Empowers Models for Tabular Prediction (2023.emnlp-main)

Copied to clipboard

Challenge: Existing methods to use table pre-training to boost tabular prediction performance remain open . a bachelor's degree earns less than 50K, and a generative LM can be used to unify tasks via one LM.
Approach: They propose a method that leverages table pre-training to empower tabular prediction models.
Outcome: The proposed method outperforms baseline models on 12 datasets and can be easily combined with various backbone models.
Perplexity-Aware Data Scaling Law: Perplexity Landscapes Predict Performance for Continual Pre-training (2026.acl-long)

Copied to clipboard

Challenge: Large language models (LLMs) have impressive capabilities across a wide range of domains, but their generalpurpose pre-training objectives often leave them illsuited for specialized applications such as healthcare.
Approach: They propose a perplexity-aware data scaling law that establishes a predictive relationship between the perplexities of domain-specific data and the test loss.
Outcome: Experiments on medical and general-domain benchmarks show that the proposed scaling law consistently identifies near-optimal training subsets with significantly reduced data consumption.
Tailoring Diagnostic Modeling to Individual Learners: Personalized Distractor Generation via MCTS-Guided Reasoning Reconstruction (2026.acl-long)

Copied to clipboard

Challenge: Current distractor generation methods produce shared distractors for all students, ignoring individual variations in reasoning, which limits their diagnostic effectiveness.
Approach: They propose a method which tailors distractors to each student’s specific cognitive flaws, inferred from their past question-answering (QA) history.
Outcome: The proposed framework outperforms existing methods in generating plausible distractors and adapts to group-level settings.
Towards Reliable Large Audio Language Model (2025.findings-acl)

Copied to clipboard

Challenge: Recent advances in large audio language models (LALMs) have demonstrated impressive results and promising prospects in universal understanding and reasoning across speech, music, and general sound.
Approach: They propose to use training-free and training-based methods to enhance LALM reliability to different extents.
Outcome: The proposed methods improve the reliability of large audio language models to different extents.
TransS-Driven Joint Learning Architecture for Implicit Discourse Relation Recognition (2020.acl-main)

Copied to clipboard

Challenge: Existing approaches to implicit discourse relation recognition lack connectives as strong linguistic clues.
Approach: They propose a transS-driven joint learning architecture to translate discourse relations in low-dimensional embedding space and exploit the semantic features of arguments to assist discourse understanding.
Outcome: The proposed model outperforms existing systems on the Penn Discourse TreeBank.
Eliciting Implicit Acoustic Styles from Open-domain Instructions to Facilitate Fine-grained Controllable Generation of Speech (2025.emnlp-main)

Copied to clipboard

Challenge: Current work relies on pre-defined rules or templates to control the style of speech.
Approach: They propose to use open-domain instructions to generate speech with the acoustic style that meets users’ needs based on their instructions.
Outcome: The proposed model can be used to generate speech with the acoustic style that meets users’ needs based on open-domain instructions.
Public Sentiment Drift Analysis Based on Hierarchical Variational Auto-encoder (2020.emnlp-main)

Copied to clipboard

Challenge: Existing methods for detecting public sentiment drift are not designed for sentiment drift detection.
Approach: They propose a Hierarchical Variational Auto-Encoder model to learn better distribution representation and a new drift measure to directly evaluate distribution changes between historical and new data.
Outcome: The proposed model performs better than three existing state-of-the-art methods.
KEPLER: A Unified Model for Knowledge Embedding and Pre-trained Language Representation (2021.tacl-1)

Copied to clipboard

Challenge: Existing language representation models (PLMs) cannot capture factual knowledge from text.
Approach: They propose a unified model for Knowledge Embedding and Pre-trained LanguagERepresentation which integrates factual knowledge into PLMs and produces effective text-enhanced KE with the strong PLM.
Outcome: The proposed model improves on existing pre-trained language representation models and improves their performance on various NLP tasks.
Instruct Once, Chat Consistently in Multiple Rounds: An Efficient Tuning Framework for Dialogue (2024.acl-long)

Copied to clipboard

Challenge: Tuning language models for dialogue generation has been a prevalent paradigm for building capable dialogue agents.
Approach: They propose a multi-round interactive dialogue tuning framework that models the speaker roles of agent and user separately.
Outcome: The proposed framework performs superior to fine-tuning and improves dialogue consistency.
Adversary-Aware DPO: Enhancing Safety Alignment in Vision Language Models via Adversarial Training (2025.findings-emnlp)

Copied to clipboard

Challenge: Adversary-aware DPO (ADPO) is a training framework that explicitly considers adversary.
Approach: a new framework integrates adversarial training into a pre-trained large language model to enhance safety alignment . adversary-aware DPO provides a framework that explicitly considers adversary .
Outcome: a new training framework outperforms baselines in safety alignment and general utility of large language models.
AGSC: Adaptive Granularity and Semantic Clustering for Uncertainty Quantification in Long-text Generation (2026.acl-long)

Copied to clipboard

Challenge: Existing methods for aggregating large-form outputs overlook the nuance of neutral information and suffer from the high computational cost of fine-grained decomposition.
Approach: They propose a UQ framework that uses NLI neutral probabilities as triggers to distinguish irrelevance from uncertainty, reducing computation costs.
Outcome: Experiments on BIO and LongFact show that the proposed framework reduces inference time by 60% compared to full atomic decomposition.
Low-Resource Generation of Multi-hop Reasoning Questions (2020.acl-main)

Copied to clipboard

Challenge: Existing methods to generate valid and fluent questions from text are limited and insufficient for training.
Approach: They propose to generate multi-hop reasoning questions from the raw text in a low resource circumstance by deducing over multiple relations on several sentences in the text.
Outcome: The proposed model can be applied to the task of machine reading comprehension and achieve significant performance improvements.
Pruning Large Language Models to Intra-module Low-rank Architecture with Transitional Activations (2024.findings-acl)

Copied to clipboard

Challenge: Structured pruning is a feasible solution for end-side LLM deployment . however, achieving a high compression ratio for scaled-up LLMs remains a challenge .
Approach: They propose a task-agnostic structured pruning approach coupled with a compact Transformer architecture to prune LLMs into an intra-module low-rank architecture.
Outcome: The proposed approach reduces transitional activations inside multi-head attention (MHA) and multi-layer perceptron (MLP) modules while preserving inter-module activations sensitive to perturbations.
Retrieval Augmented Instruction Tuning for Open NER with Large Language Models (2025.coling-main)

Copied to clipboard

Challenge: Existing studies have focused on integrating large language models (LLMs) with information extraction (IE) however, the best approach to incorporate information with LLMs for IE remains an open question.
Approach: They propose to use a Chinese IT dataset to perform RA-IT for IE . they use semantically similar examples from the training dataset as the context .
Outcome: The proposed approach is evaluated in English and Chinese scenarios.
HeteroCache: A Dynamic Retrieval Approach to Heterogeneous KV Cache Compression for Long-Context LLM Inference (2026.acl-long)

Copied to clipboard

Challenge: Existing static compression methods suffer from coarse-grained caching and high I/O overhead.
Approach: They propose a training-free dynamic compression framework that uses a sparse attention mechanism to categorize attention heads based on stability and similarity.
Outcome: The proposed framework achieves state-of-the-art performance on long-context benchmarks and accelerates decoding by up to 3 compared to the original model with a 224K context.
LLM-Driven Completeness and Consistency Evaluation for Cultural Heritage Data Augmentation in Cross-Modal Retrieval (2025.emnlp-main)

Copied to clipboard

Challenge: Cross-modal retrieval is essential for interpreting cultural heritage data, but its effectiveness is limited by incomplete or inconsistent textual descriptions.
Approach: They propose a data augmentation framework that enhances cross-modal retrieval performance by improving the completeness and consistency of LLM-generated descriptions.
Outcome: The proposed framework improves cross-modal retrieval performance by improving completeness and consistency of LLM-generated descriptions.
AdaMARP: An Adaptive Multi-Agent Interaction Framework for General Immersive Role-Playing (2026.findings-acl)

Copied to clipboard

Challenge: Existing LLMs lack immersion and adaptability, resulting in limited character orchestration and on-the-fly character introduction.
Approach: They propose an LLM-based framework that allows actors to interact with users in an ongoing narrative.
Outcome: The proposed framework outperforms commercial LLMs in character consistency, environment grounding, and narrative coherence.
Reframe Your Life Story: Interactive Narrative Therapist and Innovative Moment Assessment with Large Language Models (2025.emnlp-main)

Copied to clipboard

Challenge: Existing approaches to mental health support lack realism and capture therapeutic progression over time.
Approach: They propose a framework that simulates expert narrative therapists by planning therapeutic stages, guiding reflection levels, and generating contextually appropriate responses through retrieval-augmentation.
Outcome: The proposed framework outperforms standard methods in quality and depth on 260 simulated clients and 230 human participants.
HIRAG: Hierarchical-Thought Instruction-Tuning Retrieval-Augmented Generation (2025.findings-emnlp)

Copied to clipboard

Challenge: In-depth research on the specific capabilities needed by the RAG generation model is lacking, leading to inconsistent document quality and retrieval system imperfections.
Approach: They propose that RAG models should possess three progressively hierarchical abilities: (1) Filtering: the ability to select relevant information; (2) Combination: the capability to combine semantic information across paragraphs; (3) RAG-specific reasoning: the capacity to further process external knowledge using internal knowledge.
Outcome: Experiments show that the proposed method significantly improves the model’s open-book examination capability on datasets such as RGB, PopQA, MuSiQue, HotpotQA, and PubmedQA.
Hierarchical Enhancement Framework for Aspect-based Argument Mining (2023.findings-emnlp)

Copied to clipboard

Challenge: Existing methods have primarily treated ABAM as a nested named entity recognition problem, overlooking the need for tailored strategies to effectively address the specific challenges of ABA M tasks.
Approach: They propose a layer-based Hierarchical Enhancement Framework (HEF) for Aspect-Based Argument Mining and introduce three new components to improve the performance and accuracy.
Outcome: Experiments on multiple datasets and tasks verify the effectiveness of the proposed framework and components.
Training Turn-by-Turn Verifiers for Dialogue Tutoring Agents: The Curious Case of LLMs as Your Coding Tutors (2025.findings-acl)

Copied to clipboard

Challenge: Existing studies have focused on coding tutoring, but their capabilities in guiding users to solve complex tasks remain underexplored.
Approach: They propose a novel agent workflow, Trace-and-Verify, which combines knowledge tracing to estimate a student’s knowledge state and turn-by-turn verification to ensure effective guidance toward task completion.
Outcome: The proposed agent workflow achieves significantly higher success rates than existing tutoring agents.
Rectified Sparse Attention for Efficient Long-Sequence Generation (2026.findings-acl)

Copied to clipboard

Challenge: Recent sparse decoding methods improve efficiency but suffer from KV cache misalignment, resulting in performance degradation.
Approach: They propose a method that combines block-sparse attention with periodic dense rectification to bound error accumulation and preserve alignment with the pretraining distribution.
Outcome: Experiments on math reasoning, language modeling, and retrieval tasks show that ReSA achieves near-lossless generation quality with significantly improved efficiency.
Medical Dialogue Generation via Dual Flow Modeling (2023.findings-acl)

Copied to clipboard

Challenge: Medical dialogue systems (MDS) aim to provide patients with medical services, such as diagnosis and prescription.
Approach: They propose a Dual Flow enhanced Medical (DFMed) dialogue generation framework that extracts the medical entities and doctor's dialogue acts used in the dialogue history and models their transitions with an entity-centric graph flow and a sequential act flow.
Outcome: The proposed framework exceeds baselines in both automatic and manual evaluations on two datasets.
A Comprehensive Evaluation of Quantization Strategies for Large Language Models (2024.findings-acl)

Copied to clipboard

Challenge: Quantization studies have focused on instruction-tuned LLMs, leaving their performance on other benchmarks unclear.
Approach: They propose a framework to evaluate quantized large language models using four dimensions . they propose to reduce the bits needed for model weights or activations with minimal performance loss .
Outcome: The proposed framework can retain comparable performance to non-quantized LLMs on most benchmarks.
Label-Aware Double Transfer Learning for Cross-Specialty Medical Named Entity Recognition (N18-1)

Copied to clipboard

Challenge: NER is a fundamental problem for medical text mining because of the difference of specialties and cost of human annotation.
Approach: They propose a label-aware double transfer learning framework for medical NER from electronic medical records.
Outcome: The proposed framework improves accuracy over strong baselines on 12 cross-specialty NER tasks.
RPC-Bench: A Fine-grained Benchmark for Research Paper Comprehension (2026.acl-long)

Copied to clipboard

Challenge: Existing benchmarks for understanding research papers offer limited fine-grained evaluation at scale.
Approach: They propose a large-scale question-answering benchmark built from review–rebuttal exchanges of high-quality computer science papers.
Outcome: The proposed model is based on human-verified QA pairs and contains 15K questions.
Mobile-Bench: An Evaluation Benchmark for LLM-based Mobile Agents (2024.acl-long)

Copied to clipboard

Challenge: Existing benchmarks for LLM-based mobile agents are insufficient to evaluate their capabilities.
Approach: They propose a benchmark to evaluate LLM-based mobile agents' planning capabilities . they expand UI operations by incorporating 103 APIs to accelerate task completion .
Outcome: The proposed benchmarks are based on 103 collected APIs and real user queries . the data is categorized into three distinct groups: SAST, SAMT, and MAMT .
FactVerse: A Benchmark for Factual Consistency in Interleaved Image–Text Generation (2026.acl-long)

Copied to clipboard

Challenge: Existing benchmarks lack effective mechanisms to evaluate factual consistency in interleaved image-text generation.
Approach: They propose a benchmark dedicated to evaluating factual consistency in interleaved image-text generation.
Outcome: The proposed framework outperforms existing evaluation methods in evaluating factual consistency in interleaved image-text generation.
Certified Robustness to Word Substitution Attack with Differential Privacy (2021.naacl-main)

Copied to clipboard

Challenge: Recent studies have shown that adversarial examples can be easily fooled by DNNs, making the robustness and security of NLP models significantly important.
Approach: They propose a differential privacy-based algorithm to achieve certified robustness against word substitution at- tacks in text classification via differential privacy.
Outcome: The proposed model achieves higher accuracy and more than 30X efficiency improvement over existing defense algorithms.
C-ICL: Contrastive In-context Learning for Information Extraction (2024.findings-emnlp)

Copied to clipboard

Challenge: Existing methods for in-context learning with large language models focus on using correct or negative examples, ignoring the potential value of incorrect or negative samples.
Approach: They propose a few-shot technique that leverages both correct and incorrect sample constructions to create in-context learning demonstrations.
Outcome: The proposed technique outperforms previous few-shot in-context learning methods on a broad spectrum of related tasks.
Global Eye: Breaking the “Fixed Thinking Pattern” during the Instruction Expansion Process (2025.acl-long)

Copied to clipboard

Challenge: Existing methods focus on constructing multi-perspective prompts to expand instructions, overlooking the “Fixed Thinking Pattern” issue of Large Language Models.
Approach: They propose a method that analyzes the statistical characteristics of newly generated instructions and updates the prompts after a fixed number of instruction expansions.
Outcome: The proposed method surpasses open-source LLMs and GPT3.5 in several metrics.
Multilingual Machine Translation with Open Large Language Models at Practical Scale: An Empirical Study (2025.naacl-long)

Copied to clipboard

Challenge: Large language models (LLMs) have shown continuously improving multilingual capabilities.
Approach: They evaluate the ability of open LLMs to handle multilingual machine translation tasks using a parallel-first monolingual-second data mixing strategy.
Outcome: The proposed model outperforms state-of-the-art models and achieves competitive performance with Google Translate and GPT-4-turbo.
LLM Agents for Education: Advances and Applications (2025.findings-emnlp)

Copied to clipboard

Challenge: Large Language Model (LLM) agents are transforming education by automating complex tasks and enhancing both teaching and learning processes.
Approach: This survey analyzes recent advances in applying Large Language Model agents to educational settings . it highlights ethical issues, hallucination and overreliance, and integration with existing ecosystems .
Outcome: The authors analyze the technologies enabling LLM agents and highlight key challenges in deploying them in educational settings.
DREAM: Improving Video-Text Retrieval Through Relevance-Based Augmentation Using Large Foundation Models (2025.naacl-long)

Copied to clipboard

Challenge: Recent advances in video-text retrieval models have limited training data annotations.
Approach: They propose a Video-Text Retrieval Paradigm with Relevance-based Augmentation which enhances video and text data using large foundation models to learn more generalized features.
Outcome: The proposed method improves video-text retrieval performance over existing methods.
Finding RELIEF: Shaping Reasoning Behavior without Reasoning Supervision via Belief Engineering (2026.findings-acl)

Copied to clipboard

Challenge: Existing methods for shaping large reasoning models rely on reinforcement learning or fine-tuning with gold-standard reasoning traces. Existing techniques for behavior shaping rely only on additional reward modeling.
Approach: They propose a framework that aligns a model's self-concept with a target belief blueprint and internalizes desired traits by fine-tuning on synthesized, self-reflective QA pairs that affirm the target belief.
Outcome: The proposed framework outperforms behavior-supervised and preference-based models while requiring significantly lower training costs.
DIGAT: Modeling News Recommendation with Dual-Graph Interaction (2022.findings-emnlp)

Copied to clipboard

Challenge: Existing news recommendation methods lack effective news-user feature interaction.
Approach: They propose to use news-graph and user-graph channels to enhance news encodings . they also propose to perform effective feature interaction between news and user graphs based on semantic-augmented graphs.
Outcome: The proposed graph attention networks outperform existing NR methods on the benchmark dataset MIND.
GAPO: Robust Advantage Estimation for Real-World Code LLMs (2026.findings-acl)

Copied to clipboard

Challenge: Reinforcement learning (RL) is widely used for post-training large language models (LLMs) in code editing, but in real-world code editing scenarios, reward distributions are often skewed with unpredictable noise, leading to distorted advantage computation and increased rollout outliers.
Approach: They propose a group-relative method that finds an interval with the highest SNR and uses the median of that interval as an adaptive Q to replace the group mean in advantage calculation.
Outcome: The proposed method improves on nine instruction-tuned LLMs while remaining plug-and-play and efficient.
RealMedDial: A Real Telemedical Dialogue Dataset Collected from Online Chinese Short-Video Clips (2022.coling-1)

Copied to clipboard

Challenge: Existing medical dialogue systems are limited by the lack of corpora and data from real scenarios.
Approach: They construct a Chinese medical dialogue dataset based on real medical consultations.
Outcome: The proposed dataset is applicable to a wide range of NLP tasks with respect to medical dialogue.
Inducing Argument Facets for Faithful Opinion Summarization (2025.findings-emnlp)

Copied to clipboard

Challenge: Faithful opinion summarization task involves generating a summary that covers the majority and minority opinions in documents.
Approach: They propose a facets-guided opinion summarization method that induces facets and partitions documents into multiple facet-specific sets.
Outcome: The proposed method outperforms state-of-the-art methods and multiple LLMs on two representative datasets and shows it can be used in specialty domains.
CVRH: Cross-modal Variational Role Hypergraph Network via Semantic Enhancement for Multi-modal Event Argument Extraction (2026.findings-acl)

Copied to clipboard

Challenge: Existing methods focus on weakly aligning uni-modal representations and generatively data augmentation techniques, but they ignore the potential impact of event role information on MEAE.
Approach: They propose a cross-modal variational role hypergraph network via semantic enhancement to model high-order role correlations among cross-mod arguments in multi-modal documents.
Outcome: The proposed method achieves a 6.9% improvement in F1-score on the M2E2 benchmark compared to current state-of-the-art methods.
TailorKV: A Hybrid Framework for Long-Context Inference via Tailored KV Cache Optimization (2025.findings-acl)

Copied to clipboard

Challenge: Existing work mitigates memory overhead by offloading or compressing the Key-Value cache.
Approach: They propose a method that integrates quantization and offloading into a generative large language model by using a hybrid compression method.
Outcome: The proposed method outperforms the state-of-the-art in long-context evaluations.
From Misleading Queries to Accurate Answers: A Three-Stage Fine-Tuning Method for LLMs (2025.findings-acl)

Copied to clipboard

Challenge: Existing methods focus on correcting the output but overlook the ability of LLMs to detect and correct misleading content in the input itself.
Approach: They propose a three-stage fine-tuning method that improves LLMs' ability to detect and correct misleading information in input queries.
Outcome: The proposed method improves accuracy and factuality of LLM responses while also reducing hallucinations.
Prototype Tuning: A Meta-Learning Approach for Few-Shot Document-Level Relation Extraction with Large Language Models (2025.findings-naacl)

Copied to clipboard

Challenge: Few-Shot Document-Level Relation Extraction (FSDLRE) aims to develop models capable of generalizing to new categories with minimal support examples.
Approach: They propose a meta-training approach to train Large Language Models to improve their ICL capabilities . they construct simulated episodes using relation types that do not overlap with test corpus .
Outcome: Experimental results show that the proposed approach outperforms baseline models on few-shot tasks.
Verify Before You Commit: Towards Faithful Reasoning in LLM Agents via Self-Auditing (2026.acl-long)

Copied to clipboard

Challenge: Existing approaches to reasoning faithfulness violate constraints, authors say . a science fantasy series and companion books are among the books .
Approach: They propose a framework that enforces verification over internal belief states within the agent before action commitment, achieving faithful reasoning.
Outcome: The proposed framework improves reasoning faithfulness while preserving competitive end-task performance.
DTCRS: Dynamic Tree Construction for Recursive Summarization (2025.acl-long)

Copied to clipboard

Challenge: Recursive summarization (RAG) is an important method for mitigating large model hallucinations and enhancing answer interpretability.
Approach: They propose a method that dynamically generates summary trees based on document structure and query semantics.
Outcome: The proposed method significantly reduces summary tree construction time and achieves substantial improvements across three QA tasks.
M2C: Towards Automatic Multimodal Manga Complement (2023.findings-emnlp)

Copied to clipboard

Challenge: Multimodal manga analysis focuses on enhancing manga understanding with visual and textual features.
Approach: They propose a task to enhance manga understanding with visual and textual features by providing a shared semantic space for vision and language understanding.
Outcome: The proposed task provides a shared semantic space for vision and language understanding.
Mask Attention Networks: Rethinking and Strengthen Transformer (2021.naacl-main)

Copied to clipboard

Challenge: Existing research explores to enhance the two sublayers separately to improve the capability of Transformer for text representation.
Approach: They propose to combine SAN and Feed-Forward Networks to create a dynamic mask attention network with a learnable mask matrix which can model localness adaptively.
Outcome: The proposed model outperforms the original Transformer on translation and text summarization tasks.
Developing multilingual speech synthesis system for Ojibwe, Mi’kmaq, and Maliseet (2025.naacl-short)

Copied to clipboard

Challenge: In general, speech synthesis for Indigenous languages is underdeveloped compared to the majority of languages.
Approach: They propose to train a multilingual model on three typologically similar languages to improve performance over monolingual models.
Outcome: The proposed model can train on three similar languages with high performance and is highly competitive with self-attention architectures with higher memory efficiency.
ClinAlign: Scaling Healthcare Alignment from Clinician Preference (2026.findings-acl)

Copied to clipboard

Challenge: Existing methods for aligning open-ended outputs with fine-grained clinician preferences are weakly grounded in professional guidelines.
Approach: They propose a framework to align large language models' outputs with fine-grained clinician preferences . they propose 119 broadly reusable, clinically grounded principles organized by clinical dimensions .
Outcome: The proposed framework outperforms existing models on HealthBench-Hard and Deepseek-R1 and o3.
Document-Level Event Extraction via Information Interaction Based on Event Relation and Argument Correlation (2024.lrec-main)

Copied to clipboard

Challenge: Document-level Event Extraction (DEE) is a vital task in NLP . current approaches overlook intricate relationships among events and subtle correlations among arguments within a document .
Approach: They propose a document-level event extraction tool that integrates event relationships and argument correlation graphs to model the relationship among events.
Outcome: The proposed network outperforms existing models and large language models in terms of F1-score across two benchmark datasets.
UniXcoder: Unified Cross-Modal Pre-training for Code Representation (2022.acl-long)

Copied to clipboard

Challenge: Pre-trained models for programming languages have demonstrated great success on code intelligence . however, such pre-tried models are sub-optimal for auto-regressive tasks .
Approach: They propose a unified cross-modal pre-trained model for programming language that leverages cross-module contents like AST and code comment to enhance code representation.
Outcome: The proposed model achieves state-of-the-art on most code-related tasks and compares with existing models on zero-shot code-to-code search.
What If Consensus Lies? Selective-Complementary Reinforcement Learning at Test Time (2026.acl-long)

Copied to clipboard

Challenge: Existing TTRL methods rely on positive pseudo-labeling strategies to enhance reasoning capabilities.
Approach: They propose a test-time reinforcement learning framework that mitigates label noise amplification by deriving pseudo-rewards from majority voting consensus.
Outcome: The proposed framework mitigates label noise amplification by implementing selective positive pseudo-labeling and entropy-gated negative p-labeled pruning.
Reasoning Over Semantic-Level Graph for Fact Checking (2020.acl-main)

Copied to clipboard

Challenge: Existing methods for fact checking use string concatenation or fusing features of isolated evidence sentences.
Approach: They propose a method suitable for reasoning about the semantic-level structure of evidence . they use graph convolutional network and graph attention network to exploit the structure .
Outcome: The proposed method improves claim verification accuracy and FEVER score on a benchmark dataset.
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.
InfiMM: Advancing Multimodal Understanding with an Open-Sourced Visual Language Model (2024.findings-acl)

Copied to clipboard

Challenge: InfiMM is a multimodal large language model that adapts to complex vision-language tasks.
Approach: They present a Multimodal Large Language Model that adapts to intricate vision-language tasks using large-scale training data and comprehensive training strategies.
Outcome: Empirical evaluations across a variety of benchmarks underscore InfiMM’s remarkable capability in multimodal understanding.
Foresight Optimization for Strategic Reasoning in Large Language Models (2026.acl-long)

Copied to clipboard

Challenge: Existing reasoning enhancement methods do not capture foresight in LLMs.
Approach: They propose to integrate opponent modeling principles into policy optimization to enhance strategic reasoning in LLMs by integrating opponent modeling into policy.
Outcome: The proposed method outperforms existing reasoning-based LLMs in out-of-domain scenarios and shows that it significantly enhances strategic reasoning across LLM of varying sizes and origins.
Composition-based Heterogeneous Graph Multi-channel Attention Network for Multi-aspect Multi-sentiment Classification (2022.coling-1)

Copied to clipboard

Challenge: Existing methods for Aspect-based sentiment analysis (ABSA) focus on aspect terms with the same sentiment polarity . current methods focus on sentences with only one aspect term or multiple aspect terms .
Approach: They propose a novel method to model inter-aspect relationships and aspect-context relationships simultaneously using a heterogeneous graph.
Outcome: The proposed method can predict sentiments towards the given aspect term in a sentence . it can provide more detailed predictions compared with sentence-level sentiment analysis.
DetermLR: Augmenting LLM-based Logical Reasoning from Indeterminacy to Determinacy (2024.acl-long)

Copied to clipboard

Challenge: Recent advances in large language models (LLMs) have revolutionized the landscape of reasoning tasks.
Approach: They propose a new approach that rethinks the reasoning process as an evolution from indeterminacy to determinacy.
Outcome: The proposed model surpasses all baselines on various logical reasoning benchmarks.
Sentient Agent as a Judge: Evaluating Higher-Order Social Cognition in Large Language Models (2026.findings-acl)

Copied to clipboard

Challenge: Large language models (LLMs) have evolved from statistical sequence predictors to sophisticated autonomous agents capable of reasoning, planning, and sustaining multi-turn conversa-tions.
Approach: They propose a system that instantiates a "Sentient Agent" that simulates human-like emotional changes and inner thoughts to provide a more realistic evaluation of the model in multi-turn conversations.
Outcome: The proposed framework measures the agent's higher-order social cognition in multi-turn conversations.
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.
CMMaTH: A Chinese Multi-modal Math Skill Evaluation Benchmark for Foundation Models (2025.coling-main)

Copied to clipboard

Challenge: Large language models excel in various language tasks, while large multimodal models effectively handle visual-language problems.
Approach: They propose to use a multimodal multimodal model evaluation benchmark to evaluate model performance in Chinese K12 classrooms.
Outcome: The proposed model evaluation tool is integrated with the CMMaTH dataset.
HSGraphAgent: Knowledge-Graph-Guided Large Language Models for Harmonized System Code Classification (2026.acl-long)

Copied to clipboard

Challenge: Harmonized System (HS) code classification is a hierarchically structured and regulation-constrained task, often complicated by short and noisy product descriptions.
Approach: They propose a knowledge-graph-guided LLM framework that formulates HS classification as a stepwise, regulation-aware reasoning process over an explicit HS knowledge graph.
Outcome: The proposed framework constrains inference to legally valid paths while producing explicit and traceable reasoning trajectories.
PMSS: Pretrained Matrices Skeleton Selection for LLM Fine-tuning (2025.coling-main)

Copied to clipboard

Challenge: Low-rank adaptation and its variants have been popular due to their ability to avoid excessive inference costs.
Approach: They propose a low-rank adaptation method that enables high-rank updates with low costs while leveraging semantic and linguistic information inherent in pre-trained weight.
Outcome: The proposed method outperforms LoRA and other fine-tuning methods across tasks with less trainable parameters.
AGCL: Aspect Graph Construction and Learning for Aspect-level Sentiment Classification (2025.coling-main)

Copied to clipboard

Challenge: Aspect-level Sentiment Classification (ALSC) is a fine-grained sentiment analysis task that aims to identify the sentiment polarity of a review text toward each corresponding aspect.
Approach: They propose a novel Aspect Graph Construction and Learning method that harnesses aspect connections to construct a domain aspect graph and iteratively updates it to enhance its domain expertise.
Outcome: The proposed method can bridge unseen aspects with seen aspects, enhancing the model's generalization capability.
GCoT-Decoding: Unlocking Deep Reasoning Paths for Universal Question Answering (2026.findings-acl)

Copied to clipboard

Challenge: Recent work on Chain-of-Thought reasoning requires manual prompts to guide the model.
Approach: They propose a general decoding strategy that generates CoT-style reasoning paths without prompts.
Outcome: The proposed method maintains strong performance on fixed and free QA tasks and achieves significant improvements on free qa.
Generating Deep Questions with Commonsense Reasoning Ability from the Text by Disentangled Adversarial Inference (2023.findings-acl)

Copied to clipboard

Challenge: Existing methods for commonsense question generation produce shallow questions that can be answered by simple word matching.
Approach: They propose a task of commonsense question generation that aims to yield deep-level questions from the text.
Outcome: The proposed model can yield deep-level and to-the-point questions from the text.
ELIOT: Zero-Shot Video-Text Retrieval through Relevance-Boosted Captioning and Structural Information Extraction (2025.naacl-srw)

Copied to clipboard

Challenge: Recent advances in video-text retrieval (VTR) have relied on supervised learning and fine-tuning.
Approach: They propose a zero-shot video-text retrieval framework that leverages off-the-shelf captioners, large language models, and text retrieval methods without additional training or annotated data.
Outcome: The proposed framework outperforms existing methods on video-text retrieval benchmarks without data.
ReachAgent: Enhancing Mobile Agent via Page Reaching and Operation (2025.naacl-long)

Copied to clipboard

Challenge: Existing mobile AI agents focus on most task-relevant elements at each step, leading to local optimal solutions and ignoring the overall GUI flow.
Approach: They propose a mobile AI agent that breaks tasks into page reaching and operation subtasks and a framework that focuses on improving its task-completion abilities.
Outcome: The proposed framework improves IoU accuracy and text accuracy by 7.12% and 7.69% on step-level and 4.72% and 4.63% on task-level compared to the SOTA agent.
Improving Semantic Matching through Dependency-Enhanced Pre-trained Model with Adaptive Fusion (2022.findings-emnlp)

Copied to clipboard

Challenge: Existing work on dependency prior structure integration into pre-trained models is still unclear.
Approach: They propose a dependency-based fusion attention paradigm which explicitly introduces dependency prior structure into pre-trained models and adaptively fuses it with semantic information.
Outcome: The proposed model achieves state-of-the-art or competitive performance on 10 public datasets, demonstrating the benefits of adaptively fusing dependency structure in semantic matching task.
Empirical Study of Zero-Shot NER with ChatGPT (2023.emnlp-main)

Copied to clipboard

Challenge: Large language models (LLMs) have been a key component of natural language processing (NLP) .
Approach: They propose to decompose the NER task into simpler subproblems by labels and propose a syntactic augmentation strategy to stimulate model's intermediate thinking.
Outcome: The proposed methods achieve remarkable improvements for zero-shot NER across seven benchmarks, including Chinese and English datasets.
Constructing Your Model’s Value Distinction: Towards LLM Alignment with Anchor Words Tuning (2025.findings-emnlp)

Copied to clipboard

Challenge: a study of large language models (LLMs) shows that they can generate outputs that are honest, positive, harmless, etc.
Approach: They propose a method that amplifies logits difference between positive and negative tokens . they propose to use the logits gap to generate positive and positive tokens after alignment .
Outcome: The proposed method achieves effective alignment, but requires fewer computational resources compared to training-time alignment methods.
Information Aggregation for Multi-Head Attention with Routing-by-Agreement (N19-1)

Copied to clipboard

Challenge: Existing studies focus on extracting informative or distinct partial-representations from different subspaces, while few studies have paid attention to the aggregation of the extracted partial-Representations.
Approach: They propose to use a routing-by-agreement algorithm to improve multi-head attention by iteratively updating the proportion of how much a part should be assigned to a whole based on agreement between parts and wholes.
Outcome: The proposed algorithm improves the information aggregation for multi-head attention over the standard linear transformation on linguistic probing and machine translation tasks.
RQT: Hierarchical Residual Quantization for Multi-Model Compression (2025.findings-acl)

Copied to clipboard

Challenge: Existing methods for decomposing fine-tuned LLMs are sensitive to the magnitude of delta values.
Approach: They propose a hierarchical quantization framework that shares low-bit integer weights across similar models.
Outcome: The proposed framework achieves an average accuracy degradation of approximately 3% on fine-tuned models across mathematics, coding, chatbot, and Chinese LLMs.
MobileVLM: A Vision-Language Model for Better Intra- and Inter-UI Understanding (2024.findings-emnlp)

Copied to clipboard

Challenge: Recent mobile AI agents based on VLMs lack basic mobile capabilities due to their pre-trained nature.
Approach: They propose a mobile AI agent based on VLMs that includes additional pre-training stages to enhance both intra- and inter-UI understanding.
Outcome: The proposed model outperforms existing VLMs on the Chinese mobile dataset Mobile3M .
pFedGPT: Hierarchically Optimizing LoRA Aggregation Weights for Personalized Federated GPT Models (2025.emnlp-main)

Copied to clipboard

Challenge: Existing methods for fine-tuning Large Language Models (LLMs) struggle with data heterogeneity and adapt shared global knowledge to individual client needs.
Approach: They propose a framework that leverages Hierarchical Bayesian Optimization (HBO) for fine-grained, personalized LoRA aggregation.
Outcome: The proposed framework achieves state-of-the-art (SOTA) performance on personalized FL benchmarks while introducing only minimal (approx. 4%) additional optimization overhead.
Prompt-based Logical Semantics Enhancement for Implicit Discourse Relation Recognition (2023.emnlp-main)

Copied to clipboard

Challenge: Existing methods for identifying discourse relations without explicit connectives are limited by the availability of annotated data.
Approach: They propose a method that injects knowledge relevant to discourse relation into pre-trained language models through prompt-based connective prediction.
Outcome: The proposed method achieves outstanding performance against the current state-of-the-art models.
ReCaLL: Membership Inference via Relative Conditional Log-Likelihoods (2024.emnlp-main)

Copied to clipboard

Challenge: ReCaLL (Relative Conditional Log-Likelihood) is a membership inference attack that can detect LLMs’ pretraining data by leveraging their conditional language modeling capabilities.
Approach: They propose a membership inference attack to detect LLMs’ pretraining data by leveraging their conditional language modeling capabilities.
Outcome: The proposed model achieves state-of-the-art performance on the WikiMIA dataset, even with random and synthetic prefixes, and can be further improved using an ensemble approach.
Generating Informative Conversational Response using Recurrent Knowledge-Interaction and Knowledge-Copy (2020.acl-main)

Copied to clipboard

Challenge: Knowledge-driven conversation approaches have attracted considerable research attention in recent years.
Approach: They propose a method that integrates recurrent knowledge interaction among response decoding steps to incorporate appropriate knowledge.
Outcome: The proposed method improves on two datasets Wizard-of-Wikipedia and DuConv with different knowledge formats and different languages.
DialogueCSE: Dialogue-based Contrastive Learning of Sentence Embeddings (2021.emnlp-main)

Copied to clipboard

Challenge: Conventional approaches to learning sentence embeddings from dialogues employ the siamese-network for this task, but such architecture yields a large gap between training and evaluating.
Approach: They propose a dialogue-based contrastive learning approach to learn sentence embeddings from dialogues using a siamese-network.
Outcome: The proposed model outperforms baseline methods on three multi-turn dialogue datasets in terms of MAP and Spearman’s correlation measures.
LoRE: Enhancing Search Relevance with Progressive Chain-of-Thought and Preference Alignment (2026.findings-acl)

Copied to clipboard

Challenge: E-commerce search relevance is a critical component of retrieval systems.
Approach: They propose a large-generative model for search relevance that trains reasoning knowledge, multi-modal understanding and rule awareness into three core competencies.
Outcome: The proposed model outperforms GPT-5 in Macro-F1 and achieves 27% online gain.
PromptBERT: Improving BERT Sentence Embeddings with Prompts (2022.emnlp-main)

Copied to clipboard

Challenge: Existing research shows that BERT and RoBERTa are poor in sentence embeddings due to static token embeddable bias and ineffective BERT layers.
Approach: They propose a novel contrastive learning method for better sentence embeddings by using a template denoising technique.
Outcome: The proposed method achieves 2.29 and 2.58 points of improvement compared to SimCSE and RoBERTa in the unsupervised setting.
DT-Solver: Automated Theorem Proving with Dynamic-Tree Sampling Guided by Proof-level Value Function (2023.acl-long)

Copied to clipboard

Challenge: Recent advances in neural theorem-proving resort to large language models and tree searches.
Approach: They propose a Dynamic-Tree Driven Theorem Solver to accommodate general theoremes by guiding the search procedure with state confidence and proof-level values.
Outcome: The proposed method outperforms state-of-the-art methods on two popular theorem-proving datasets with a 6.65% improvement on average in terms of success rate.
Dual Dynamic Memory Network for End-to-End Multi-turn Task-oriented Dialog Systems (2020.coling-main)

Copied to clipboard

Challenge: Existing task-oriented dialog systems struggle to dynamically model long dialog context for interactions and effectively incorporate knowledge base (KB) information into dialog generation.
Approach: They propose a dual dynamic memory network for multi-turn dialog generation . the model dynamically expands the dialog memory turn by turn and keeps track of dialog history .
Outcome: The proposed model outperforms baseline models on three benchmark datasets on human evaluation and automatic evaluation.
Exploring All-In-One Knowledge Distillation Framework for Neural Machine Translation (2023.emnlp-main)

Copied to clipboard

Challenge: Existing knowledge distillation methods only obtain one lightweight student each time . this could be resource-intensive and resulting in multiple students not being optimally utilized .
Approach: They propose a knowledge distillation framework which generates multiple satisfactory students at once.
Outcome: The proposed framework generates multiple satisfactory students at once.
Disco-RAG: Discourse-Aware Retrieval-Augmented Generation (2026.acl-long)

Copied to clipboard

Challenge: Existing RAG strategies treat retrieved passages in a flat and unstructured way, which prevents the model from capturing structural cues and constrains its ability to synthesize knowledge from dispersed evidence across documents.
Approach: They propose a framework that explicitly injects discourse signals into the generation process.
Outcome: Experiments on question answering and long-document summarization benchmarks show the efficacy of the proposed framework.
Nash-Pruned CredMAS: Dynamic Panel Pruning for VLM-MAS using Nash-based Selection and Doubly-Robust Credits (2026.findings-acl)

Copied to clipboard

Challenge: Multi-Agent Systems (MAS) are expensive due to static panel designs, where all N agents communicate at every T round.
Approach: They propose an economic framework that transforms agent selection into a dynamic resource allocation game.
Outcome: The proposed system reduces token consumption by over 25% on challenging benchmarks while reducing token consumption.
GLGE: A New General Language Generation Evaluation Benchmark (2021.findings-acl)

Copied to clipboard

Challenge: Multi-task benchmarks focus on a range of Natural Language Understanding (NLU) tasks without considering the Natural Language Generation (NLG) models.
Approach: They propose a multi-task benchmark for evaluating the generalization capabilities of NLG models across eight language generation tasks.
Outcome: The proposed benchmarks are based on GLUE and Su-perGLUE for English and several other languages.
Alpha-GPT: Human-AI Interactive Alpha Mining for Quantitative Investment (2025.emnlp-demos)

Copied to clipboard

Challenge: Traditional methods of alpha mining have inherent limitations, especially in implementing the ideas of quant researchers.
Approach: They propose a new alpha mining paradigm by introducing human-AI interaction and a prompt engineering algorithmic framework to implement this paradigm by using large language models.
Outcome: The proposed framework is based on human-AI interaction and large language models and is comparable to human participants in the WorldQuant International Quant Championship.
STeCa: Step-level Trajectory Calibration for LLM Agent Learning (2025.findings-acl)

Copied to clipboard

Challenge: Existing work focuses on behavior cloning from expert demonstrations or preference learning through exploratory trajectory sampling, but these methods often struggle to address long-horizon tasks where suboptimal actions accumulate step by step, causing agents to deviate from correct task trajectories.
Approach: They propose a framework for LLM-based agent learning that identifies suboptimal actions through a step-level reward comparison during exploration and constructs calibrated trajectories using LLM reflection.
Outcome: The proposed framework outperforms existing methods in long-horizon tasks where suboptimal actions accumulate step by step, causing agents to deviate from correct task trajectories.
Act as you think: Reinforcing Consistent Reasoning in Medical Visual Question Answering (2026.acl-long)

Copied to clipboard

Challenge: Recent advances have improved the accuracy of medical visual question answering (Med-VQA) however, the high stakes nature of the medical domain has precipitated a shift towards interpretability and transparency of reasoning processes.
Approach: They propose a reinforcement learning from verifiable rewards framework that rewards internal consistency and logical coherence.
Outcome: The proposed framework rewards internal consistency and logical coherence, and is highly versatile, the authors show.
SAME: Safety-Aware Model Editing Guided by Safety Transformation (2026.acl-long)

Copied to clipboard

Challenge: Existing models that update or insert new knowledge require sequential parameter updates while maintaining model capability.
Approach: They propose a model editing approach that estimates safety transforms and identifies corresponding safety direction in the neural activation space and aligns neural activations and network parameter updates under the safety constraints.
Outcome: The proposed approach reduces unsafe responses to malicious queries while preserving the effectiveness of model editing.
Q-Mamba: Towards more efficient Mamba models via post-training quantization (2025.findings-acl)

Copied to clipboard

Challenge: Existing studies show that Mamba architectures have room for further optimization in linear projections and state caches.
Approach: They propose a decoupled scale quantization scheme to mitigate outliers in states and channels by applying separate quantization scales.
Outcome: The proposed method reduces memory consumption by 50% across various quantization settings, model sizes, and generation and zero-shot tasks.
World Models with Hints of Large Language Models for Goal Achieving (2025.naacl-long)

Copied to clipboard

Challenge: Existing methods address this by adding intrinsic rewards, but they fail to provide meaningful guidance in long-horizon decision-making tasks with large state and action spaces lacking purposeful exploration.
Approach: They propose a multi-modal model-based RL approach that integrates the proposed hinting subgoals into the model rollouts to encourage goal discovery and reaching in challenging tasks.
Outcome: The proposed model outperforms existing methods in challenging, sparse-reward environments such as HomeGrid, Crafter, and Minecraft by 41.8%, 21.1%, and 9.9%.
Emotion Inference in Multi-Turn Conversations with Addressee-Aware Module and Ensemble Strategy (2021.emnlp-main)

Copied to clipboard

Challenge: Empirical studies on three different benchmark conversation datasets demonstrate the effectiveness of the proposed model over several strong baselines.
Approach: They propose an addressee-aware module to automatically learn whether the participant keeps the historical emotional state or is affected by others in the next upcoming turn.
Outcome: The proposed model can predict the participant's emotion in the next upcoming turn without knowing the participant’s response yet.
Towards Generalized Open Information Extraction (2022.findings-emnlp)

Copied to clipboard

Challenge: Open Information Extraction (OpenIE) models are evaluated on in-domain test sets aside from the training corpus, which violates the initial task principle of domain-independence.
Approach: They propose to generalize OpenIE over unseen target domains with different data distributions from source training domains.
Outcome: The proposed method beats the previous methods in both in- and out-of-domain settings by 6.0% in F1 score absolutely.
GRACE: Gradient-guided Controllable Retrieval for Augmenting Attribute-based Text Generation (2023.findings-acl)

Copied to clipboard

Challenge: Existing methods for controlling the generation of pre-trained language models infuse domain bias into the generation process, making it difficult to generate out-of-domain texts.
Approach: They propose a retrieval-augmented generation framework that uses retrieval to generate fluent sentences with high attribute relevance.
Outcome: The proposed method can generate fluent sentences with high attribute relevance while keeping domain bias out of the model.
FrontCoder: Scaling Visual Fidelity in Front-End Code Generation (2026.findings-acl)

Copied to clipboard

Challenge: Existing work on front-end code generation fails to provide visual fidelity and rendering quality for front- end developers.
Approach: They propose a three-stage pipeline to enhance front-end code generation capabilities in LLMs . they use synthetic data, quality-controlled supervised fine-tuning, and reinforcement learning .
Outcome: The proposed model achieves competitive performance with frontier models while maintaining generation efficiency.
InfiMM-WebMath-40B: Advancing Multimodal Pre-Training for Enhanced Mathematical Reasoning (2025.findings-emnlp)

Copied to clipboard

Challenge: InfiMM-WebMath-40B is a dataset of interleaved image-text documents . it consists of 24 million web pages, 85 million image URLs, and 40 billion text tokens .
Approach: InfiMM-WebMath-40B is a high-quality dataset of interleaved image-text documents . it contains 24 million web pages, 85 million image URLs, and 40 billion text tokens .
Outcome: InfiMM-WebMath-40B is a high-quality dataset of interleaved image-text documents . it consists of 24 million web pages, 85 million image URLs, and 40 billion text tokens .
Unlocking the Power of Large Language Models for Entity Alignment (2024.acl-long)

Copied to clipboard

Challenge: Entity Alignment (EA) is a crucial step in unifying data from heterogeneous sources and plays a critical role in data-driven AI applications.
Approach: They propose a framework that incorporates large language models to improve EA.
Outcome: The proposed framework incorporates large language models (LLMs) to improve EA accuracy while preserving efficiency.
Beyond Modality Collapse: Taming Guided Modality Entropy for Omni-modal Emotion Reasoning (2026.findings-acl)

Copied to clipboard

Challenge: EmoOmni is a data paradigm for omni-modal large language models that can be used for emotion reasoning.
Approach: They propose a data paradigm that interleaves guided tokens into reasoning traces to enforce structured evidence extraction.
Outcome: The proposed paradigm over-relys on a dominant modality while neglecting complementary cues.
Two Languages Are Better than One: Bilingual Enhancement for Chinese Named Entity Recognition (2022.coling-1)

Copied to clipboard

Challenge: Existing studies focus on internal features of Chinese named entity recognition, but neglect other lingual modalities.
Approach: They propose a bilingual enhancement module for Chinese Named Entity Recognition . they integrate rich English information into Chinese representation and use it to learn the interaction between bilinguals and dependent information within Chinese.
Outcome: The proposed model can learn the interaction of bilinguals and dependent information within Chinese.
Where CoT Reasoning Commits: Entropy Traces Identify Interpretable Attention Heads (2026.findings-acl)

Copied to clipboard

Challenge: a growing body of work suggests a disconnect between the generated rationale and the model's actual choice.
Approach: They propose a mechanism-aware framework that interprets the evolving "choice state" of attention heads during CoT generation . they identify a set of intervention targets and perform Selective Head Fine-Tuning .
Outcome: The proposed framework interprets the "choice state" of attention heads during CoT generation . it detects two functional behaviors: Steadfast Heads and Wavering Heads .
Joint Pre-Encoding Representation and Structure Embedding for Efficient and Low-Resource Knowledge Graph Completion (2024.emnlp-main)

Copied to clipboard

Challenge: Existing knowledge graph completion models require longer training and inference times as well as increased memory usage.
Approach: They propose to encode textual descriptions into semantic representations before training and integrate structural embedding with pre-encoded semantic description to improve model's prediction performance on 1-N relations.
Outcome: The proposed model increases inference speed by 30x and reduces training memory by approximately 60% on the WN18RR and UMLS datasets.
Self-Detoxifying Language Models via Toxification Reversal (2023.emnlp-main)

Copied to clipboard

Challenge: Existing methods to generate toxic content in pretrained language models are resource-intensive and require additional components.
Approach: They propose a method that enables the PLM itself to achieve "self-detoxification" they identify the toxification direction from the normal generation process to the one prompted with the negative prefix and then steer the generation to the reverse direction by manipulating the information movement within the attention layers.
Outcome: The proposed method can achieve comparable performance with state-of-the-art methods without any fine-tuning or extra components.
LoRaDA: Low-Rank Direct Attention Adaptation for Efficient LLM Fine-tuning (2025.findings-emnlp)

Copied to clipboard

Challenge: Recent advances in parameter-efficient fine-tuning techniques allow for adjustments to only a minor fraction of the parameters of language models.
Approach: They propose a low-rank direct attention adapted method for efficient LLM fine-tuning . they propose LMAM, which can bring negative attention to self-attention modules .
Outcome: The proposed method outperforms the full fine-tuning method by 2.1% on GLUE benchmark.
ESC-Eval: Evaluating Emotion Support Conversations in Large Language Models (2024.emnlp-main)

Copied to clipboard

Challenge: Emotion Support Conversation (ESC) is a crucial application for reducing stress and providing emotional guidance.
Approach: They re-organize 2,801 role-playing cards to define roles of role-players . they train a specific role- playing model called ESC-Role which behaves more like a confused person than GPT-4 .
Outcome: The proposed model behaves more like a confused person than GPT-4, and the model performs better than GPLs.
SPO: Self Preference Optimization with Self Regularization (2025.findings-emnlp)

Copied to clipboard

Challenge: Existing reference-free preference optimization methods exhibit higher training efficiency but are prone to overoptimization, leading to performance degradation.
Approach: They propose a reference-free preference optimization method that replaces the logsigmoid loss function with a SiLU function to improve the model's performance.
Outcome: The proposed method achieves 7% improvement over SimPO on AlpacaEval 2 and MT-Bench.
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.
GroupRank: A Groupwise Paradigm for Effective and Efficient Passage Reranking with LLMs (2026.findings-acl)

Copied to clipboard

Challenge: Existing rankers excel in lexical-matching scenarios, while they struggle with complex queries requiring deep reasoning.
Approach: They propose a new paradigm that balances flexibility and context awareness to unlock the full potential of groupwise reranking.
Outcome: The proposed approach achieves a state-of-the-art 65.2 NDCG@10 on BRIGHT and surpasses baselines by 2.1 points on R2MED while delivering a 6.4 inference speedup.
m3P: Towards Multimodal Multilingual Translation with Multimodal Prompt (2024.lrec-main)

Copied to clipboard

Challenge: Existing multimodal neural machine translation models focus on bilingual translation, but experimental results show that they outperform the text-only baselines and multilingual multimodal methods by a large margin.
Approach: They propose a framework to leverage the multimodal prompt to guide the Multimodal Multilingual Neural Machine Translation (m3P) this framework aligns the representations of different languages with the same meaning and generates the conditional vision-language memory for translation.
Outcome: The proposed framework outperforms previous text-only baselines and multilingual multimodal methods by a large margin.
Understanding In-Context Learning Beyond Transformers: An Investigation of State Space and Hybrid Architectures (2026.findings-acl)

Copied to clipboard

Challenge: In-context learning is an emergent ability from pretrained Large Language Models (LLMs).
Approach: They perform in-depth evaluations of in-context learning on transformers and hybrid large language models using behavioral probing and intervention-based methods.
Outcome: The proposed model performs well on state-of-the-art transformer, state-space, and hybrid large language models.
Enhancing Multilingual Reasoning via Steerable Model Merging (2026.findings-acl)

Copied to clipboard

Challenge: Model merging is an effective technique for composing the capabilities of a multilingual model and a reasoning model.
Approach: They propose a model merging framework that modulates the contribution of each source model.
Outcome: Experiments show that the proposed model merging framework outperforms strong baselines on multilingual reasoning benchmarks across 21 different languages.
COIG-P: A High-Quality and Large-Scale Chinese Preference Dataset for Alignment with Human Values (2026.findings-eacl)

Copied to clipboard

Challenge: Existing Chinese preference datasets suffer from limited scale, restricted domain coverage, and insufficiently rigorous data validation.
Approach: They propose an LLM-based data annotation pipeline with no human intervention to annotate Chinese preference datasets.
Outcome: The proposed pipeline outperforms existing Chinese preference datasets on AlignBench and Chinese Reward Benchmark.
UniCoder: Scaling Code Large Language Model via Universal Code (2024.acl-long)

Copied to clipboard

Challenge: Experimental results show that UniCoder with the universal code significantly outperforms the previous prompting methods by a large margin.
Approach: They introduce the universal code (UniCode) as the intermediate representation of algorithm steps using conventions of programming languages.
Outcome: The proposed model outperforms previous prompting methods by a large margin . the proposed model is based on a dataset of natural-language questions and code solutions .
An Enhanced Knowledge Injection Model for Commonsense Generation (2020.coling-main)

Copied to clipboard

Challenge: a recent study shows that digging the relationship of concepts from scratch is non-trivial for commonsense generation tasks.
Approach: They use a retrieve-and-edit framework to retrieve a prototype with these concepts . they use qt and qq to generate commonsense questions at scale .
Outcome: The proposed method significantly improves the performance on commonsense generation tasks.
Plug-and-Play Data Module for Code RL: Adaptive Ambiguity Replay (2026.findings-acl)

Copied to clipboard

Challenge: Existing approaches to reinforcement learning (RL) rely on static, in-epoch metrics that overlook training dynamics, often introducing low-utility or outdated data.
Approach: They propose a plug-and-play module that prioritizes cross-epoch ambiguous samples to neutralize the noise from stale experiences.
Outcome: Extensive experiments on nine LLMs show that Adaptive Ambiguity Replay outperforms state-of-the-art baselines on real-world code editing tasks.
Modeling LLM Unlearning as an Asymmetric Two-Task Learning Problem (2026.acl-long)

Copied to clipboard

Challenge: Large language models (LLMs) are inherently dual-use and can be leveraged for both beneficial and harmful purposes.
Approach: They propose a retention-prioritized gradient synthesis framework that decouples task-specific gradient extraction from conflict-aware combination.
Outcome: The proposed method achieves tighter alignment on WMDP Bio and RWKU benchmarks.
Rethinking Entropy Interventions in RLVR: An Entropy Change Perspective (2026.acl-long)

Copied to clipboard

Challenge: Large Language Models (LLMs) have remarkable reasoning capabilities in complex tasks such as mathematics and coding.
Approach: They propose an entropy-modulation method that adaptively reweighs tokens based on theoretically-estimated entropic variations.
Outcome: The proposed method outperforms state-of-the-art methods in six mathematical reasoning and three coding benchmarks.
FARSS: Fisher-Optimized Adaptive Low-Rank and Singular-Vector Selection for Knowledge-Preserving Fine-Tuning (2026.findings-acl)

Copied to clipboard

Challenge: Low-rank adaptation methods for large language models have limitations in preserving world knowledge and limiting updates to preserve world knowledge.
Approach: They propose a Fisher-optimized adaptive low Rank and Singular-VectorSelection framework for knowledge-preserving fine-tuning that allows efficient and task-sensitive updates.
Outcome: The proposed framework outperforms existing methods for knowledge-preserving fine-tuning.
Beyond Static Rules: Automated Discovery of Latent Vulnerabilities in Text-to-SQL (2026.findings-acl)

Copied to clipboard

Challenge: Large Language Models (LLMs) have been successful in Text-to-SQL tasks, but their deployment in real-world environments is hindered by latent reliability issues.
Approach: They propose a framework to autonomously uncover latent failure patterns in LLM-based Text-to-SQL generation.
Outcome: The proposed framework uncovers a substantial number of failure cases on state-of-the-art open-source LLMs.
DAST: Difficulty-Adaptive Slow-Thinking for Large Reasoning Models (2025.emnlp-industry)

Copied to clipboard

Challenge: Recent advances in slow-thinking reasoning models have shown exceptional performance in complex reasoning tasks.
Approach: They propose a framework that enables models to automatically adjust Chain-of-Thought (CoT) length based on problem difficulty.
Outcome: The proposed framework penalizes inefficiency on simple problems while incentivizing deep reasoning for complex ones.
ToolPlanner: A Tool Augmented LLM for Multi Granularity Instructions with Path Planning and Feedback (2024.emnlp-main)

Copied to clipboard

Challenge: Recent studies have shown that tool-augmented large language models can interact with external tools in multiple rounds and provide a final answer.
Approach: They propose a tool-augmented large language model that can interact with external tools in multiple rounds and provide a final answer to an instruction.
Outcome: The proposed framework significantly improves Match Rate, Pass Rate and Win Rate by 26.8%, 20.2%, and 5.6% compared to the SOTA model.
Where and What: Reasoning Dynamic and Implicit Preferences in Situated Conversational Recommendation (2026.acl-long)

Copied to clipboard

Challenge: Situated conversational recommendation (SCR) uses visual scenes grounded in specific environments and natural language dialogue to deliver contextually appropriate recommendations.
Approach: They propose a framework that integrates scene transition estimation and Bayesian inverse inference to provide contextually appropriate recommendations.
Outcome: The proposed framework achieves superiority over baselines on two representative benchmarks on dynamic scene transitions and implicit user intents.
Analytical Reasoning of Text (2022.findings-naacl)

Copied to clipboard

Challenge: Existing models with implicit reasoning ability struggle to solve analytical reasoning of text.
Approach: They propose an approach to analyze text and use it to perform reasoning over it.
Outcome: The proposed approach outperforms pre-trained models on an analysis of the Law School Admission Test dataset.
Neural Deepfake Detection with Factual Structure of Text (2020.emnlp-main)

Copied to clipboard

Challenge: Existing approaches to deepfake detection typically represent documents with coarse-grained representations, but they struggle to capture factual structures of documents.
Approach: They propose a graph-based model that captures factual structures of documents for deepfake detection.
Outcome: The proposed model improves strong base models built with RoBERTa on two public deepfake datasets.
Debate-of-Thoughts: Resolving Knowledge Conflicts in LLMs Through Internal Deliberation (2026.acl-long)

Copied to clipboard

Challenge: Existing methods for retrieval augmented generation are based on a simplistic binary choice of relying on external contexts or memory.
Approach: They propose a framework that transforms conflict resolution into an active deliberation process by incorporating contradictions as opportunities for deeper reasoning.
Outcome: Experiments show that DoT outperforms state-of-the-art methods while generating transparent debate transcripts that explain its decisions.
Explicit and Implicit Data Augmentation for Social Event Detection (2025.acl-long)

Copied to clipboard

Challenge: Social event detection relies on labeled data, but annotation is costly and labor-intensive.
Approach: They propose a plug-and-play dual augmentation framework that combines explicit text-based and implicit feature-space augmentation to enhance data diversity and model robustness.
Outcome: The proposed framework outperforms the best baseline model by 17.67% on the Twitter2012 dataset and 15.57% on the twitter2018 dataset in terms of the average F1 score.
HoPE: A Novel Positional Encoding Without Long-Term Decay for Enhanced Context Awareness and Extrapolation (2025.acl-long)

Copied to clipboard

Challenge: Existing positional encodings exhibit long-term decay, based on an entrenched and long-standing opinion that tokens farther away from the current position carry less relevant information.
Approach: They propose a high-frequency rotary position encoding (HoPE) that replaces specific components in RoPE with position-independent ones, retaining only high- frequency signals.
Outcome: The proposed method exhibits greater robustness to the out-of-distribution behavior in attention patterns during extrapolation.
RoleLLM: Benchmarking, Eliciting, and Enhancing Role-Playing Abilities of Large Language Models (2024.findings-acl)

Copied to clipboard

Challenge: Large Language Models (LLMs) have paved the way for complex tasks such as role-playing.
Approach: They propose a framework to benchmark, elicit, and enhance role-playing abilities in Large Language Models.
Outcome: The proposed framework improves role-playing abilities with 168,093 samples.
LogicalFactChecker: Leveraging Logical Operations for Fact Checking with Graph Module Network (2020.acl-main)

Copied to clipboard

Challenge: Existing methods for fact checking textual statements are not yet available.
Approach: They propose a neural network approach capable of leveraging logical operations for fact checking . they use a textual statement and semi-structured tables to generate a program from it .
Outcome: The proposed approach achieves state-of-the-art performance on TABFACT dataset . it derives a program (a.k.a. logical form) of the statement in semantic parsing manner .
Dunhuang-Bench: How Well Do MLLMs Understand Cultural Heritage? (2026.findings-acl)

Copied to clipboard

Challenge: Recent advances in Multimodal Large Language Models (MLLMs) have led to extensive evaluations on Chinese cultural benchmarks.
Approach: They construct a large-scale benchmark comprising 486 images and 22,970 QA pairs to evaluate MLLMs' cultural understanding.
Outcome: The proposed benchmark incorporates three task formats to evaluate MLLMs’ cultural understanding: Question Answering with Text Description, Multi-turn Dialogue, and Question Answers with Choices.
Benchmarking for Domain-Specific LLMs: A Case Study on Academia and Beyond (2025.findings-emnlp)

Copied to clipboard

Challenge: Comp-Comp is an iterative benchmarking framework grounded in the principles of comprehensiveness and compactness.
Approach: They propose a benchmark framework that incorporates the principle of comprehensiveness and compactness.
Outcome: The proposed framework is domain-agnostic and adaptable to a wide range of specialized fields.
Exploring Better Text Image Translation with Multimodal Codebook (2023.acl-long)

Copied to clipboard

Challenge: Current studies on text image translation face bottlenecks due to lack of a publicly available dataset and poor optical character recognition.
Approach: They propose a text image translation model with a multimodal codebook and an OCR dataset for Chinese-English translation.
Outcome: The proposed model can associate the image with relevant texts, providing useful supplementary information for translation.
Doc-V*: Coarse-to-Fine Interactive Visual Reasoning for Multi-Page Document VQA (2026.acl-long)

Copied to clipboard

Challenge: Existing OCR-free approaches to document visual question answering are brittle and passive.
Approach: They propose an OCR-free agentic framework that casts multi-page DocVQA as sequential evidence aggregation.
Outcome: The proposed framework outperforms open-source and proprietary models in five benchmarks and improves out-of-domain performance by 47.9% over baseline.
MR-ALIGN: Meta-Reasoning Informed Factuality Alignment for Large Reasoning Models (2026.findings-acl)

Copied to clipboard

Challenge: Large reasoning models (LRMs) show strong capabilities in complex reasoning, yet their marginal gains on evidence-dependent factual questions are limited.
Approach: They propose a Meta-Reasoning informed alignment framework that quantifies state-transition probabilities along the model’s thinking process and constructs a transition-aware implicit reward that reinforces beneficial reasoning patterns while suppressing defective ones at the atomic thinking segments.
Outcome: Empirical evaluations of four factual QA datasets and one long-form factuality benchmark show that MR-ALIGN consistently improves accuracy and truthfulness while reducing misleading reasoning.
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.
Seeing Isn’t Believing: Mitigating Belief Inertia via Active Intervention in Embodied Agents (2026.findings-acl)

Copied to clipboard

Challenge: Existing large language models (LLMs) have enabled agents to tackle complex embodied tasks through environmental interaction, but they still make suboptimal decisions and perform ineffective actions.
Approach: They propose an active belief intervention mechanism that generates explicit belief states . they characterize belief inertia as a key failure mode of LLM-based agents .
Outcome: The proposed method achieves significant gains in task success rates across embodied benchmarks.
Why Safeguarded Ships Run Aground? Aligned Large Language Models’ Safety Mechanisms Tend to Be Anchored in The Template Region (2025.acl-long)

Copied to clipboard

Challenge: Infilling a fixed template between the input instruction and initial model output is a common practice for existing LLMs, but it is vulnerable to inference-time jailbreak attacks.
Approach: They propose to fill a fixed template between the input instruction and initial model output and to detach safety mechanisms from the template region to mitigate the risk of inference-time jailbreak attacks.
Outcome: The proposed method is widespread across aligned LLMs and shows that it mitigates inference-time jailbreak vulnerabilities.
Enhancing Event Causality Identification with Event Causal Label and Event Pair Interaction Graph (2023.findings-acl)

Copied to clipboard

Challenge: Existing methods for event causality identification (ECI) do not consider event causal label information and interaction information between event pairs.
Approach: They propose a framework to enrich the representation of event pairs by introducing the event causal label information and the interaction information between event pairs.
Outcome: The proposed framework outperforms state-of-the-art methods on two benchmark datasets.
S2SQL: Injecting Syntax to Question-Schema Interaction Graph Encoder for Text-to-SQL Parsers (2022.findings-acl)

Copied to clipboard

Challenge: Existing graph-based encoders for text-to-SQL do not model the syntax of natural language questions.
Approach: They propose to inject Syntax to question-Schema graph encoder for text-to-SQL parsers and employ the decoupling constraint to induce diverse relational edge embedding.
Outcome: The proposed approach outperforms all existing methods when pre-training models are used, resulting in a performance ranks first on the Spider leaderboard.
DABERT: Dual Attention Enhanced BERT for Semantic Matching (2022.coling-1)

Copied to clipboard

Challenge: Existing models for semantic sentence matching lack the ability to capture subtle differences.
Approach: They propose to use a Transformer-based pre-trained language model to capture fine-grained differences in sentence pairs by introducing a dual attention module and a fusion module to learn the aggregation of difference and affinity features.
Outcome: The proposed method is able to capture fine-grained differences in sentence pairs.
LongDocURL: a Comprehensive Multimodal Long Document Benchmark Integrating Understanding, Reasoning, and Locating (2025.acl-long)

Copied to clipboard

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

Copied to clipboard

Challenge: Large Foundation Models (LFMs) have transformed the landscape of AI research and day-to-day life.
Approach: They propose a framework that delineates GUI agents' perception, reasoning, planning, and acting capabilities.
Outcome: The proposed framework delineates their perception, reasoning, planning, and acting capabilities.
UCS-SQL: Uniting Content and Structure for Enhanced Semantic Bridging In Text-to-SQL (2025.findings-acl)

Copied to clipboard

Challenge: Existing methods overlook the challenge of effectively transforming structure information from NL to SQL.
Approach: They propose a text-to-SQL framework that unites content and structure pipes to bridge the gap between NL and SQL.
Outcome: The proposed framework bridges the gap between natural language questions and SQL by combining content and structure pipes.
Understanding and Mitigating Spurious Signal Amplification in Test-Time Reinforcement Learning for Math Reasoning (2026.findings-acl)

Copied to clipboard

Challenge: a framework to mitigate spurious optimization signals is proposed for test-time reinforcement learning (TTRL) Reinforcement learning with verifiable rewards (RLVR) is an effective paradigm for improving large language models on structured challenging reasoning tasks.
Approach: They propose a framework to mitigate spurious optimization signals from label noise . they propose to use a frequency-based sampling strategy to exclude ambiguous samples .
Outcome: The proposed framework outperforms existing TTRL baselines on three large language models across multiple mathematical reasoning benchmarks.
Failing Forward: Improving Generative Error Correction for ASR with Synthetic Data and Retrieval Augmentation (2025.findings-acl)

Copied to clipboard

Challenge: Generative Error Correction (GEC) is a powerful post-processing method to boost the performance of Automatic Speech Recognition systems.
Approach: They propose a method to augment GEC models with retrieved entities to improve accuracy in out-of-domain and out-od scenarios.
Outcome: The proposed method outperforms baseline models on multiple datasets and settings.
MCP-Flow: Facilitating LLM Agents to Master Real-World, Diverse and Scaling MCP Tools (2026.acl-long)

Copied to clipboard

Challenge: Existing research on Large Language Models (LLMs) relies on few servers and lacks training support.
Approach: They propose a web-agent-driven pipeline for large-scale server discovery, data synthesis, and model training that collects and filters data from 1166 servers and 11536 tools.
Outcome: Empirical evidence shows that MCP-Flow generates higher quality instruction-function call pairs and higher agentic task performance than previous work.
Target-oriented Proactive Dialogue Systems with Personalization: Problem Formulation and Dataset Curation (2023.emnlp-main)

Copied to clipboard

Challenge: a recent study defines a conversation target from the system side to proactively steer conversations toward predefined targets or accomplish specific system-side goals.
Approach: They propose a dataset curation framework that automatically curations a large-scale personalized dialogue dataset using a role-playing approach.
Outcome: The proposed dataset is of high quality and could contribute to exploring personalized target-oriented dialogue.
VecInfer: Efficient LLM Inference with Low-Bit KV Cache via Outlier-Suppressed Vector Quantization (2026.acl-long)

Copied to clipboard

Challenge: Existing quantization methods for large language models suffer performance degradation at ultra-low bit-widths due to key cache outliers.
Approach: They propose a vector quantization method that suppresses outliers in the key cache and reduces memory access overhead.
Outcome: The proposed method outperforms baseline quantization methods across long-context understanding and mathematical reasoning tasks while minimizing memory access overhead.
Stand on The Shoulders of Giants: Building JailExpert from Previous Attack Experience (2025.emnlp-main)

Copied to clipboard

Challenge: Existing methods to generate human-aligned content with a “jailbreak prompt” are inefficient and repetitive, causing inefficiency and a lack of experience.
Approach: They propose a framework that integrates past attack experiences to aid current jailbreak attempts.
Outcome: The proposed framework improves both attack effectiveness and efficiency compared to the current black-box jailbreak method.
JudgeAgent: Beyond Static Benchmarks for Knowledge-Driven and Dynamic LLM Evaluation (2026.findings-acl)

Copied to clipboard

Challenge: Current evaluation methods for large language models rely on static benchmarks . limited knowledge coverage and fixed difficulties hinder the targeted optimizations resulting in superficial evaluations of LLMs - a problem that has been addressed by JudgeAgent .
Approach: They propose a knowledge-driven and dynamic evaluation framework for large language models . judgeAgent leverages LLM agents equipped with context graphs to traverse knowledge structures .
Outcome: The proposed framework can achieve comprehensive evaluations and facilitate effective model iterations.
OAgents: An Empirical Study of Building Effective Agents (2025.findings-emnlp)

Copied to clipboard

Challenge: a recent study shows that agent research practices are far from standard, rigorous . lack of a standard evaluation protocol makes previous works not reproducible, authors say .
Approach: They conduct an empirical study on the GAIA benchmark to investigate agent design choices . they find that lack of a standard evaluation protocol makes previous works not reproducible .
Outcome: The proposed framework achieves state-of-the-art performance among open-source projects.
ToolRerank: Adaptive and Hierarchy-Aware Reranking for Tool Retrieval (2024.lrec-main)

Copied to clipboard

Challenge: Recent studies have proposed tool learning, which augments LLMs with external tools.
Approach: They propose an adaptive and hierarchy-aware reranking method to refine retrieval results by truncating the retrieval result related to seen and unseen tools at different positions.
Outcome: The proposed method improves retrieval results, leading to better execution results generated by the LLM.
Dialogue Planning via Brownian Bridge Stochastic Process for Goal-directed Proactive Dialogue (2023.findings-acl)

Copied to clipboard

Challenge: Goal-directed dialogue systems aim to proactively reach a pre-determined target through multi-turn conversations.
Approach: They propose a coherent dialogue planning approach that uses a stochastic process to model the temporal dynamics of dialogue paths.
Outcome: The proposed approach generates more coherent utterances and achieves the goal with a higher success rate.
TokenShapley: Token Level Context Attribution with Shapley Value (2025.findings-acl)

Copied to clipboard

Challenge: Large language models (LLMs) have strong capabilities in in-context learning, but verifying the correctness of their generated responses remains a challenge.
Approach: They propose a token-level attribution method that combines Shapley value-based data attribution with KNN-based retrieval techniques to improve attribution accuracy.
Outcome: TokenShapley outperforms state-of-the-art methods on four benchmarks . it achieves an 11–23% improvement in accuracy on the benchmarks.
MAXS: Meta-Adaptive Exploration with LLM Agents (2026.findings-acl)

Copied to clipboard

Challenge: Existing methods for inference are often myopic and have divergent reasoning paths . a meta-adaptive reasoning framework is proposed to improve the efficiency of LLM agents .
Approach: They propose a meta-adaptive reasoning framework that integrates tool execution and reasoning planning.
Outcome: The proposed framework outperforms existing methods in performance and inference efficiency.
Self-supervised Preference Optimization: Enhance Your Language Model with Preference Degree Awareness (2024.findings-emnlp)

Copied to clipboard

Challenge: Recent studies have focused on replacing the reward model in Reinforcement Learning with Human Feedback (RLHF) methods for Large Language Models (LLMs).
Approach: They propose a self-supervised preference optimization framework that replaces the reward model with a preference loss and alignment loss to improve LLMs' ability to understand human preferences.
Outcome: The proposed framework can be integrated with existing preference optimization methods and significantly boost their performance.
Training LLMs for Optimization Modeling via Iterative Data Synthesis and Structured Validation (2025.findings-emnlp)

Copied to clipboard

Challenge: Large Language Models (LLMs) are a promising tool for OR, but they face challenges when dealing with complex problems.
Approach: They propose a framework that augments existing datasets and generates high-quality fine-tuning data tailored to OR.
Outcome: The proposed framework augments existing datasets and generates high-quality fine-tuning data . it prevents error propagation and ensures the quality of the generated dataset .
EmoTrans: Emotional Transition-based Model for Emotion Recognition in Conversation (2024.lrec-main)

Copied to clipboard

Challenge: Emotions are causally transmitted among communication participants, facilitating comprehension of intricate changes in emotional states during the conversation.
Approach: They propose an Emotional Transition-based Emotion Recognizer that captures ET features in an emotional conversation by concatenating the most recent utterances with their corresponding speakers.
Outcome: The proposed model is sensitive to emotions and captures ET features in the sample.
Dual Activation-Weight Sparsity: A Training-Free Framework for Efficient Large Language Model Compression (2026.acl-long)

Copied to clipboard

Challenge: Large language models (LLMs) excel at natural language tasks but face deployment bottlenecks due to computational demands.
Approach: They propose a training-free framework that exploits activation and weight sparsity . they use a three-tier routing strategy that uses magnitude-based pruning .
Outcome: Experiments on Llama and Mistral models show that DAWS outperforms activation-weight sparsity pruning methods.
Detecting Customer Complaint Escalation with Recurrent Neural Networks and Manually-Engineered Features (N19-2)

Copied to clipboard

Challenge: e-commerce companies often have the option of escalating complaints by filing grievances with a government authority . this is detrimental to an ecommerce company, but this problem is challenging to solve by integrating recurrent neural networks with manually-engineered features.
Approach: They propose a model that integrates recurrent neural networks with manually-engineered features to identify cases where the customer expresses such an intent.
Outcome: The proposed model outperforms baseline models and provides better recall and triage for specialized agents.
Memory or Reasoning? Explore How LLMs Compute Mixed Arithmetic Expressions (2025.findings-acl)

Copied to clipboard

Challenge: Large language models (LLMs) can solve complex multi-step math reasoning problems, but their internal implementation is limited.
Approach: They propose to use a "C**ausal **E**ffect **D**riven **F**ine-tuning method" to improve LLMs' reasoning ability.
Outcome: The proposed method improves the model's reasoning ability by enhancing key components that are used to execute mixed arithmetic calculations.
M2RC-EVAL: Massively Multilingual Repository-level Code Completion Evaluation (2025.acl-long)

Copied to clipboard

Challenge: Existing repository-level code completion benchmarks focus on a limited number of languages . existing benchmarks report overall average scores of different languages ignoring fine-grained abilities .
Approach: They propose to use repository-level code completion benchmarks to evaluate general code intelligence abilities across languages for existing code Large Language Models.
Outcome: The proposed benchmarks improve the code completion abilities of existing LLMs by using two types of annotations on the parsed syntax tree.
AI for Science in the Era of Large Language Models (2024.emnlp-tutorials)

Copied to clipboard

Challenge: Recent advances in large language models (LLMs) have demonstrated significant prowess in tasks involving natural language, such as translating languages, constructing chatbots, and answering questions.
Approach: This tutorial explores the application of large language models to three crucial categories of scientific data: 1) textual data, 2) biomedical sequences, and 3) brain signals.
Outcome: This tutorial will explore the application of large language models to three crucial categories of scientific data.
DrDiff: Dynamic Routing Diffusion with Hierarchical Attention for Breaking the Efficiency-Quality Trade-off (2025.emnlp-main)

Copied to clipboard

Challenge: et al., 2019; Brown e.t al, 2023; Touvron e t al; 2024; OpenAI, 2024) Large Language Models (LLMs) have demonstrated remarkable capabilities in knowledge encoding and contextual understanding during their pretraining phase.
Approach: They propose a dynamic expert scheduling mechanism that allocates computational resources based on text complexity and a hierarchical sparse attention mechanism that adjusts attention patterns according to a variety of input lengths.
Outcome: The proposed framework overpowers existing methods on long-text generation benchmarks.
My Words Imply Your Opinion: Reader Agent-Based Propagation Enhancement for Personalized Implicit Emotion Analysis (2025.acl-long)

Copied to clipboard

Challenge: Current studies personalize emotion analysis by focusing on the author but neglect the impact of the intended reader on implicit emotional feedback.
Approach: They propose a model which incorporates reader feedback into implicit emotion analysis (IEA) they use large language models to create reader agents to simulate reader feedback .
Outcome: The proposed model outperforms state-of-the-art models in a text-centric environment.
AIMMerging: Adaptive Iterative Model Merging Using Training Trajectories for Language Model Continual Learning (2025.emnlp-main)

Copied to clipboard

Challenge: Recent model merging-based methods struggle to effectively manage the trade-off between learning new knowledge and preventing catastrophic forgetting.
Approach: They propose a model merging framework that utilizes learning and forgetting signals from the training trajectory to dynamically monitor the model’s training status.
Outcome: The proposed framework achieves significant performance improvements over existing state-of-the-art methods on three CL benchmarks with various model sizes (from 770M to 13B).
MM-ChatAlign: A Novel Multimodal Reasoning Framework based on Large Language Models for Entity Alignment (2024.findings-emnlp)

Copied to clipboard

Challenge: Existing MMEA methods rely on knowledge representation learning (KRL) to measure the similarity of entity embeddings.
Approach: They propose a framework that utilizes the visual reasoning abilities of MLLMs for multimodal entity alignment.
Outcome: The proposed framework integrates the visual reasoning abilities of MLLMs for multimodal entity alignment.
Golden Touchstone: A Comprehensive Bilingual Benchmark for Evaluating Financial Large Language Models (2025.findings-emnlp)

Copied to clipboard

Challenge: Existing financial benchmarks suffer from limited language and task coverage, low-quality datasets, and inadequate adaptability for LLM evaluation.
Approach: They propose a bilingual benchmark for financial LLMs that assesses models’ language understanding and generation capabilities.
Outcome: The proposed bilingual benchmark assesses models’ language understanding and generation capabilities.
Pi-SQL: Enhancing Text-to-SQL with Fine-Grained Guidance from Pivot Programming Languages (2025.findings-emnlp)

Copied to clipboard

Challenge: Existing prompt-based methods craft meticulous text guidelines and examples to facilitate SQL generation, but their accuracy is hindered by the large semantic gap between the texts and the low-resource SQL programs.
Approach: They propose to use Python as a pivot to bridge between natural language query and SQL program.
Outcome: The proposed method improves the execution accuracy of the best-performing baseline by up to 3.20.
Knowledge Association with Hyperbolic Knowledge Graph Embeddings (2020.emnlp-main)

Copied to clipboard

Challenge: Existing methods for knowledge graphs (KGs) depend on high embedding dimensions and hierarchical structures to achieve expressiveness.
Approach: They propose a hyperbolic relational graph neural network for KG embedding and capture knowledge associations with a high-dimensional transformation.
Outcome: Experiments on entity alignment and type inference show the proposed method is effective and efficient.
SampleMix: A Sample-wise Pre-training Data Mixing Strategy by Coordinating Data Quality and Diversity (2025.findings-emnlp)

Copied to clipboard

Challenge: Existing methods for pretraining data mixing for large language models neglect significant inter-domain overlaps and commonalities, failing to control the global diversity of the constructed training dataset.
Approach: They propose a sample-wise data mixture approach that performs global cross-domain sampling by systematically evaluating the quality and diversity of each sample.
Outcome: The proposed method exceeds existing domain-based methods in multiple downstream tasks and perplexity assessments.
Balance Act: Mitigating Hubness in Cross-Modal Retrieval with Query and Gallery Banks (2023.emnlp-main)

Copied to clipboard

Challenge: a small number of gallery data points are frequently retrieved, resulting in a decline in retrieval performance.
Approach: They propose a framework that leverages both gallery and query data to address hubness . they propose dual inverted softmax and dual dynamic inverted hardmax methods to normalize similarity .
Outcome: The proposed framework reduces the occurrence of hubs during inference while improving similarity between non-hubs and queries.
Harmonizing Dense and Sparse Signals in Multi-turn RL: Dual-Horizon Credit Assignment for Industrial Sales Agents (2026.acl-industry)

Copied to clipboard

Challenge: Large language models for industrial sales require balancing long-term commercial objectives with immediate linguistic constraints such as fluency and compliance.
Approach: They propose a framework that disentangles optimization across time scales by normalizing advantages from turn-level and session-level rewards before fusion.
Outcome: The proposed framework outperforms the state-of-the-art GRPO model in conversion rate and identity detection rate.
JPU: Bridging Jailbreak Defense and Unlearning via On-Policy Path Rectification (2026.acl-long)

Copied to clipboard

Challenge: Large Language Models (LLMs) are vulnerable to diverse jailbreak attacks despite extensive safety alignment .
Approach: They propose a method to rectify dynamic jailbreak paths towards safety anchors by dynamically mining on-policy adversarial samples to expose vulnerabilities and identify jailbreak path.
Outcome: The proposed model significantly improves jailbreak resistance against dynamic attacks while maintaining its utility.
Chain-of-Note: Enhancing Robustness in Retrieval-Augmented Language Models (2024.emnlp-main)

Copied to clipboard

Challenge: Standard RALMs often neglect their intrinsic knowledge due to the interference from retrieved information.
Approach: They propose a new approach to improve robustness of RALMs by generating sequential reading notes for each retrieved document.
Outcome: The proposed approach outperforms standard RALMs on four open-domain QA benchmarks.
E2CL: Exploration-based Error Correction Learning for Embodied Agents (2024.findings-emnlp)

Copied to clipboard

Challenge: Language models are exhibiting increasing capability in knowledge utilization and reasoning, but they often suffer from misalignment between their intrinsic knowledge and environmental knowledge, leading to infeasible actions.
Approach: They propose a framework that leverages exploration-induced errors and environmental feedback to enhance environment alignment for embodied agents.
Outcome: The proposed framework outperforms baseline methods and exhibits superior self-correction capabilities.
DataArc-SynData-Toolkit: A Unified Closed-Loop Framework for Multi-Path, Multimodal, and Multilingual Data Synthesis (2026.acl-demo)

Copied to clipboard

Challenge: Existing synthetic data tools are limited by convoluted workflows, fragmented data standards, and limited scalability across modalities.
Approach: They develop an open-source framework that aims to reduce the technical barrier to synthetic data generation and subsequent model training.
Outcome: The proposed framework achieves an optimal balance between generation efficiency and data quality.
Improving Speech Translation by Fusing Speech and Text (2023.findings-emnlp)

Copied to clipboard

Challenge: In speech translation, multimodal data to address limitations of individual modalities has shown significant effectiveness.
Approach: They propose a cross-modal model which supports three input modalities for speech, text and fused speech-text.
Outcome: The proposed model achieves an average of 34.0 BLEU on MuST-C, GigaST and newstest benchmark.
OpenRLHF: A Ray-based Easy-to-use, Scalable and High-performance RLHF Framework (2025.emnlp-demos)

Copied to clipboard

Challenge: Existing RLHF frameworks face inference bottlenecks and complexity barriers restricting their accessibility for newcomers.
Approach: They propose an open-source RLHF framework that can be used to train large language models.
Outcome: The proposed framework achieves superior training efficiency with speedups ranging from 1.22 to 1.68 across different model sizes compared to state-of-the-art frameworks, while requiring significantly fewer lines of code for implementation.
Can LLMs See Without Pixels? Benchmarking Spatial Intelligence from Textual Descriptions (2026.findings-acl)

Copied to clipboard

Challenge: Existing advances in Spatial Intelligence rely on vision-Language Models . however, a critical question remains: does spatial understanding originate from visual encoders?
Approach: They propose to evaluate the SI performance of Large Language Models without pixel-level input.
Outcome: The proposed benchmark challenges large language models to perform symbolic reasoning rather than visual pattern matching.
HumanLLM: Benchmarking and Improving LLM Anthropomorphism via Human Cognitive Patterns (2026.acl-long)

Copied to clipboard

Challenge: Large Language Models (LLMs) have demonstrated remarkable capabilities in reasoning and generation, serving as the foundation for advanced persona simulation and Role-Playing Language Agents (RPLAs).
Approach: They propose a framework that treats psychological patterns as interacting causal forces and synthesizes 113 scenarios where 2-5 patterns reinforce, conflict, or modulate each other.
Outcome: The proposed framework outperforms Qwen3-32B on multi-pattern dynamics despite 4 fewer parameters.
MAC-SQL: A Multi-Agent Collaborative Framework for Text-to-SQL (2025.coling-main)

Copied to clipboard

Challenge: Recent LLM-based Text-to-SQL methods suffer from performance degradation on “huge” databases and complex user questions that require multi-step reasoning.
Approach: They propose a framework that integrates a decomposer agent and auxiliary agents to generate SQL queries from natural language text.
Outcome: The proposed framework achieves comparable execution accuracy on SQL-Llama tasks compared to the baseline model.
Self-Reflective Generation at Test Time (2026.acl-long)

Copied to clipboard

Challenge: Existing self-reflection mechanisms are reactive and inefficient for large language models . a fundamental tension persists between the ability to execute complex multi-step reasoning and the ability of the model to generate coherent traces.
Approach: They propose a test-time framework that reflects before generating at uncertain points . SRGen utilizes dynamic entropy thresholding to identify high-uncertainty tokens .
Outcome: The proposed framework can significantly strengthen large language models' reasoning process.
Efficient Universal Goal Hijacking with Semantics-guided Prompt Organization (2025.acl-long)

Copied to clipboard

Challenge: Existing methods for prompt injection have focused on optimizing the suffix, overlooking the role of the prompt.
Approach: They propose a method that incorporates an efficient optimization algorithm and two semantics-guided prompt organization strategies to optimize the suffix sequence for universal goal hijacking.
Outcome: The proposed method can generate a fixed suffix that can concatenate to arbitrary user prompts for universal goal hijacking.
M-MAD: Multidimensional Multi-Agent Debate for Advanced Machine Translation Evaluation (2025.acl-long)

Copied to clipboard

Challenge: Recent advances in large language models (LLMs) have shown their potential to deliver human-like judgments.
Approach: They propose a systematic LLM-based multi-agent framework for advanced LLM as-a-judge MT evaluation that integrates dimension-specific results into a final evaluation judgment.
Outcome: The proposed framework outperforms existing LLM-as-a-judge methods and competes with state-of-the-art automatic metrics even when powered by a suboptimal model like GPT-4o mini.
LANG: Reinforcement Learning for Multilingual Reasoning with Language-Adaptive Hint Guidance (2026.acl-long)

Copied to clipboard

Challenge: Existing methods for enhancing multi-step reasoning have not fully translated to multilingual contexts.
Approach: They propose a framework that leverages language-conditioned hints to guide exploration in non-English reasoning tasks.
Outcome: Empirical results show that the proposed framework improves reasoning performance without compromising language consistency.
InvGC: Robust Cross-Modal Retrieval by Inverse Graph Convolution (2023.findings-emnlp)

Copied to clipboard

Challenge: a recent study shows that multi-modal data representations tend to cluster within a limited convex cone, hindering retrieval performance.
Approach: They propose a method that uses graph convolution and average pooling to separate representations by increasing distances between data points.
Outcome: The proposed method reduces representation degeneration problem by increasing distances between data points.
WECA: A WordNet-Encoded Collocation-Attention Network for Homographic Pun Recognition (D18-1)

Copied to clipboard

Challenge: Homographic puns have a long history in human writing, widely used in written and spoken literature, which intended as jokes.
Approach: They propose a WordNet-encoded model to settle polysemy of homographic puns and a word weighted model for recognizing them.
Outcome: The proposed model can distinguish between homographic pun and non-homographic pun texts.
Look Again, Think Slowly: Enhancing Visual Reflection in Vision-Language Models (2025.emnlp-main)

Copied to clipboard

Challenge: Recent advances in text-only "slow thinking" reasoning have prompted efforts to transfer this capability to vision-language models (VLMs).
Approach: They propose a VRM Reflection-V which enhances visual reflection based on reasoning data for cold-start and reward design for reinforcement learning.
Outcome: The proposed model improves visual reflection for cold-start and reward design for reinforcement learning (RL) it maintains a stronger and more consistent reliance on visual information during visual reasoning, indicating effective enhancement in visual reflection capabilities.

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