Papers by Xiao Ding
Learning Event Graph Knowledge for Abductive Reasoning (2021.acl-long)
Copied to clipboard
| Challenge: | Existing models for abductive reasoning based on formal logic lack commonsense knowledge and effective reasoning mechanism. |
| Approach: | They propose a narrative text-based abductive reasoning task NLI with a latent variable to capture commonsense knowledge from event graph for guiding the abductive reasoning task. |
| Outcome: | The proposed model outperforms baseline methods on the abductive reasoning task. |
CogBERT: Cognition-Guided Pre-trained Language Models (2022.coling-1)
Copied to clipboard
| Challenge: | Existing methods fine-tune pre-trained models on cognitive data, ignoring the semantic gap between texts and cognitive signals. |
| Approach: | They propose a framework that can induce fine-grained cognitive features from cognitive data and incorporate them into pre-trained language models by adaptively adjusting the weight of cognitive features for different NLP tasks. |
| Outcome: | The proposed framework can induce fine-grained cognitive features from cognitive data and incorporate them into BERT by adaptively adjusting weight of cognitive features for different NLP tasks. |
Event Representation Learning Enhanced with External Commonsense Knowledge (D19-1)
Copied to clipboard
| Challenge: | Existing methods to learn event representations from text lack commonsense knowledge about the intents and emotions of event participants. |
| Approach: | They propose to leverage external commonsense knowledge about the intent and sentiment of the event to learn distributed representations for structured events from text. |
| Outcome: | The proposed model improves on hard similarity tasks and yields more precise inferences on subsequent events under given contexts. |
ReCo: Reliable Causal Chain Reasoning via Structural Causal Recurrent Neural Networks (2022.emnlp-main)
Copied to clipboard
| Challenge: | Causal chain reasoning models suffer from two main transitive problems: threshold effect and scene drift. |
| Approach: | They propose a framework that uses exogenous variables to represent causal pairs and estimates the threshold and scene contradictions using structural causal recurrent neural networks. |
| Outcome: | The proposed framework outperforms baselines on Chinese and English CCR datasets. |
Learning Geometry-Aware Representations for New Intent Discovery (2024.acl-long)
Copied to clipboard
| Challenge: | Existing methods for intent classification fail to distinguish new intents due to intertwined centers . a novel framework that learns geometry-aware representations to maximally separate all intents is proposed . |
| Approach: | They propose a new intent discovery framework that learns geometry-aware representations to maximally separate all intents. |
| Outcome: | The proposed framework achieves a new state-of-the-art performance on three benchmarking datasets. |
ExpeTrans: LLMs Are Experiential Transfer Learners (2025.acl-long)
Copied to clipboard
| Challenge: | Recent studies provide large language models with textual task-solving experiences via prompts to improve their performance. |
| Approach: | They propose to use prompts to provide LLMs with textual task-solving experiences during their inference stage. |
| Outcome: | The proposed framework improves the performance of large language models on 13 datasets. |
Towards Generalizable and Faithful Logic Reasoning over Natural Language via Resolution Refutation (2024.lrec-main)
Copied to clipboard
| Challenge: | Large language models (LLMs) have achieved significant performance in various natural language reasoning tasks, but struggle with performing first-order logic reasoning over formal logical theories expressed in natural language. |
| Approach: | They propose a framework which introduces the paradigm of resolution refutation to solve first-order logic reasoning problems by extending reasoning rules and employing the principle of proof by contradiction. |
| Outcome: | The proposed framework outperforms existing models while maintaining performance in simple scenarios. |
Incentivizing Strong Reasoning from Weak Supervision (2026.eacl-long)
Copied to clipboard
| Challenge: | Large language models (LLMs) have demonstrated impressive performance on reasoning-intensive tasks, but enhancing their reasoning abilities typically relies on expensive high-quality demonstrations and reinforcement learning. |
| Approach: | They propose to incentivize reasoning abilities of large language models without expensive demonstrations and reinforcement learning. |
| Outcome: | The proposed model can recover 94% of the gains of expensive RL at a fraction of the cost. |
GLM: General Language Model Pretraining with Autoregressive Blank Infilling (2022.acl-long)
Copied to clipboard
| Challenge: | Existing pretraining frameworks do not perform well for all tasks of three main categories, such as natural language understanding (NLU), unconditional generation, and conditional generation. |
| Approach: | They propose a general language model based on autoregressive blank infilling to address this challenge. |
| Outcome: | The proposed model outperforms BERT, T5, and GPT on a wide range of tasks across NLU, conditional and unconditional generation tasks. |
Is EEG-to-Text Feasible in Real-World Scenarios? An In-Depth Analysis Using a Neuropsychology-Inspired Benchmark (2026.acl-long)
Copied to clipboard
| Challenge: | Existing benchmarks for EEG2Text have neglected EEG instability, a problem that has confounded inference and sparked debate. |
| Approach: | They propose to use a 128-channel high-density EEG cap to evaluate EEG2Text models . they find existing benchmarks have neglected EEG instability, a flaw that has confounded inferences and sparked debate . |
| Outcome: | The proposed benchmarks provide key evidence for teacher-forcing-free decoding of EEG2Text models. |
Consolidation or Adaptation? PRISM: Disentangling SFT and RL Data via Gradient Concentration (2026.acl-long)
Copied to clipboard
Yang Zhao, Yangou Ouyang, Xiao Ding, Hepeng Wang, Bibo Cai, Kai Xiong, Jinglong Gao, Zhouhao Sun, Li Du, Bing Qin, Ting Liu
| Challenge: | Existing data arbitration strategies for large language model training rely on surface-level heuristics that fail to diagnose intrinsic learning needs. |
| Approach: | They propose a framework that arbitrates data based on its degree of cognitive conflict with the model's existing knowledge. |
| Outcome: | Extensive experiments on WebShop and ALFWorld show that PRISM outperforms state-of-the-art hybrid methods while reducing computational costs by up to 3.22 . |
Beyond Similarity: A Gradient-based Graph Method for Instruction Tuning Data Selection (2025.acl-long)
Copied to clipboard
Yang Zhao, Li Du, Xiao Ding, Yangou Ouyang, Hepeng Wang, Kai Xiong, Jinglong Gao, Zhouhao Sun, Dongliang Xu, Qing Yang, Dongchen Li, Bing Qin, Ting Liu
| Challenge: | Existing methods for selecting training data from general datasets fail to account for the joint distribution of instructions, resulting in inefficient learning and suboptimal knowledge transfer. |
| Approach: | They propose a method that constructs a mixed gradient-based instruction graph to capture the joint distribution and interdependencies among instructions. |
| Outcome: | The proposed method outperforms existing methods on domain adaptation tasks and in complex, data-scarce scenarios. |
Examining Inter-Consistency of Large Language Models Collaboration: An In-depth Analysis via Debate (2023.findings-emnlp)
Copied to clipboard
| Challenge: | Existing studies focus on inconsistency issues within a single LLM, while we explore the inter-consistencies among multiple LLMs for collaboration. |
| Approach: | They propose a formal debate framework to examine whether LLMs can collaborate effectively to achieve a consensus for a shared goal. |
| Outcome: | The proposed framework enables LLMs to achieve consensus in three real-world debate scenarios with real-time scenarios aligned to the LLM's goals. |
OctoBench: Benchmarking Scaffold-Aware Instruction Following in Repository-Grounded Agentic Coding (2026.acl-long)
Copied to clipboard
Deming Ding, Shichun Liu, Enhui Yang, Jiahang Lin, Ziying Chen, Shihan Dou, Honglin Guo, Weiyu Cheng, Pengyu Zhao, Chengjun Xiao, Qunhong Zeng, Qi Zhang, Xuanjing Huang, Qidi Xu, Tao Gui
| Challenge: | coding scaffolds that follow heterogeneous instructions remain under-examined in software engineering . coding models are capable software agents, but their ability to follow constraints remains under-explored . |
| Approach: | They introduce OctoBench, which benchmarks scaffold-aware instruction following in agentic coding. |
| Outcome: | The proposed benchmark aims to accelerate the development of more scaffold-aware agents. |
Tool Zero: Training Tool-Augmented LLMs via Pure RL from Scratch (2025.findings-emnlp)
Copied to clipboard
Yirong Zeng, Xiao Ding, Yutai Hou, Yuxian Wang, Li Du, Juyi Dai, Qiuyang Ding, Duyu Tang, Dandan Tu, Weiwen Liu, Bing Qin, Ting Liu
| Challenge: | Experimental results demonstrate that our models achieve over 7% performance improvement compared to both SFT and RL-with-SFT models under the same experimental settings. |
| Approach: | They propose a dynamic generalization-guided reward design for rule-based RL that shifts rewards from exploratory to exploitative tool-use patterns. |
| Outcome: | The proposed model achieves over 7% performance improvement compared to SFT and RL-with-SFT models under the same experimental settings. |
Learning Sentence Representations over Tree Structures for Target-Dependent Classification (N18-1)
Copied to clipboard
| Challenge: | Existing work on tree structures uses syntactic parsers or Treebank annotations to perform target-dependent classifications. |
| Approach: | They propose a reinforcement learning based approach which automatically induces target-specific sentence representations over tree structures. |
| Outcome: | The proposed model gives superior performance on two benchmark tasks compared to previous work on parsed trees . |
On LLMs-Driven Synthetic Data Generation, Curation, and Evaluation: A Survey (2024.findings-acl)
Copied to clipboard
| Challenge: | Large Language Models (LLMs) provide a data-centric solution to alleviate limitations of real-world data with synthetic data generation. |
| Approach: | They propose a generic workflow for LLM-driven synthetic data generation. |
| Outcome: | The proposed workflows highlight gaps in existing research and outline avenues for future studies. |
Topic-Oriented Open Relation Extraction with A Priori Seed Generation (2024.emnlp-main)
Copied to clipboard
| Challenge: | Existing methods for open relation extraction give sub-optimal results on specific topics. |
| Approach: | They propose a method that leverages the built-in knowledge of large language models to maintain a dynamic seed relation dictionary for the topic. |
| Outcome: | The proposed approach empowers better topic-oriented control over the generated relations and improves ORE performance along the five dimensions, especially on specialized and narrow topics. |
MAESTRO: Meta-learning Adaptive Estimation of Scalarization Trade-offs for Reward Optimization (2026.acl-long)
Copied to clipboard
Yang Zhao, Hepeng Wang, Xiao Ding, Yangou Ouyang, Bibo Cai, Kai Xiong, Jinglong Gao, Zhouhao Sun, Li Du, Bing Qin, Ting Liu
| Challenge: | Group-Relative Policy Optimization (GRPO) has emerged as an efficient paradigm for aligning Large Language Models (LLMs), but its efficacy is confined to domains with verifiable ground truths. |
| Approach: | They propose a meta-cognitive orchestration layer that treats reward scalarization as a dynamic latent policy, leveraging the model’s terminal hidden states as 'a semantic bottleneck' . Across seven benchmarks, MAESTRO consistently outperforms single-reward and static multi-objective baselines while preserving the efficiency advantages of GRPO. |
| Outcome: | The proposed model outperforms single-reward and static multi-objective baselines while preserving efficiency advantages. |
Towards Transferable Personality Representation Learning based on Triplet Comparisons and Its Applications (2025.emnlp-main)
Copied to clipboard
Kai Tang, Rui Wang, Renyu Zhu, Minmin Lin, Xiao Ding, Tangjie Lv, Changjie Fan, Runze Wu, Haobo Wang
| Challenge: | Existing methods for personality analysis treat corpus as a single unit for classification, but this approach presents several challenges. |
| Approach: | They propose a task paradigm for text-based personality representation learning that uses a triplet personality trend comparison dataset to learn single-sentence personality embeddings with desirable metric properties. |
| Outcome: | The proposed model significantly boosts performance across various applications, including personality detection, personality retrieval, and emotion translation prediction. |
e-CARE: a New Dataset for Exploring Explainable Causal Reasoning (2022.acl-long)
Copied to clipboard
| Challenge: | Existing causal reasoning models only learn to induce empirical causal patterns that are predictive to the label, while human beings seek for deep and conceptual understanding of the causality to explain the observed causal facts. |
| Approach: | They present a human-annotated CAusal REasoning dataset with conceptual explanations of the causality. |
| Outcome: | The presented dataset shows that human-annotated explanations can be useful for promoting the accuracy and stability of causal reasoning models. |
AD-LLM: Benchmarking Large Language Models for Anomaly Detection (2025.findings-acl)
Copied to clipboard
Tiankai Yang, Yi Nian, Li Li, Ruiyao Xu, Yuangang Li, Jiaqi Li, Zhuo Xiao, Xiyang Hu, Ryan A. Rossi, Kaize Ding, Xia Hu, Yue Zhao
| Challenge: | Anomaly detection (AD) is an important machine learning task with many real-world uses, including fraud detection, medical diagnosis, and industrial monitoring. |
| Approach: | They propose a benchmark that evaluates how large language models (LLMs) can help with NLP anomaly detection. |
| Outcome: | The proposed model can perform zero-shot detection without tasks-specific training, data augmentation and model selection, and it can suggest unsupervised AD models. |
Improving Recall of Large Language Models: A Model Collaboration Approach for Relational Triple Extraction (2024.lrec-main)
Copied to clipboard
| Challenge: | Existing large language models can extract triples from simple sentences with few-shot learning or fine-tuning, but they often miss out when extracting from complex sentences. |
| Approach: | They propose an evaluation-filtering framework that integrates large language models with small models for relational triple extraction tasks. |
| Outcome: | The proposed framework integrates large language models with small models for relational triple extraction tasks. |
AttentionRank: Unsupervised Keyphrase Extraction using Self and Cross Attentions (2021.emnlp-main)
Copied to clipboard
| Challenge: | Keyword or keyphrase extraction is to identify words or phrases presenting the main topics of a document. |
| Approach: | They propose a hybrid attention model to identify keyphrases from a document in an unsupervised manner. |
| Outcome: | The proposed model is effective and robust on long and short documents. |
RU22Fact: Optimizing Evidence for Multilingual Explainable Fact-Checking on Russia-Ukraine Conflict (2024.lrec-main)
Copied to clipboard
| Challenge: | Existing methods to verify factuality of claims do not provide sufficient evidence for explainable fact-checking systems. |
| Approach: | They propose a method to automatically retrieve and summarize evidence from the Web and a novel multilingual explainable fact-checking dataset on the Russia-Ukraine conflict in 2022. |
| Outcome: | The proposed method can retrieve and summarize evidence from the Web and generate explanations in 16 languages. |
DrKGC: Dynamic Subgraph Retrieval-Augmented LLMs for Knowledge Graph Completion across General and Biomedical Domains (2025.findings-emnlp)
Copied to clipboard
| Challenge: | Knowledge graph completion (KGC) aims to predict missing triples in knowledge graphs . current approaches encode graph context in textual form, which fails to exploit its potential . |
| Approach: | a new method is proposed to predict missing triples in knowledge graphs by leveraging existing triples and textual information. |
| Outcome: | The proposed model learns structural embeddings and logical rules within the KG and extracts a subgraph for each query guided by the learned rules. |
AGRank: Augmented Graph-based Unsupervised Keyphrase Extraction (2022.aacl-main)
Copied to clipboard
| Challenge: | Unsupervised keyphrase extraction (UKE) is highly anticipated because no labeled data is needed to train a model. |
| Approach: | They propose an augmented graph-based unsupervised model to identify keyphrases from a document by integrating graph and deep learning methods. |
| Outcome: | The proposed model is effective and robust for long and short documents. |
REVEALER: Reinforcement-Guided Visual Reasoning for Element-Level Text-Image Alignment Evaluation (2026.acl-long)
Copied to clipboard
| Challenge: | Existing methods for text-to-image alignment evaluation rely on coarse-grained metrics or static Question Answering pipelines that lack fine-grounded interpretability and struggle to reflect human preferences. |
| Approach: | They propose a reinforcement-guided visual reasoning framework for element-level text-to-image alignment evaluation. |
| Outcome: | The proposed framework achieves state-of-the-art results on four benchmarks and surpasses the strong proprietary Gemini 3 Pro and Training-based baselines. |
A Unified Knowledge Graph Augmentation Service for Boosting Domain-specific NLP Tasks (2023.findings-acl)
Copied to clipboard
| Challenge: | Existing domain-specific pre-trained language models lack domain knowledge in domain-focused training. |
| Approach: | They propose a unified domain language model development service to inject domain knowledge into the PLM fine-tuning stage. |
| Outcome: | Experiments on domain-specific text classification and QA tasks verify the effectiveness and generalizability of KnowledgeDA. |
BFS-Prover: Scalable Best-First Tree Search for LLM-based Automatic Theorem Proving (2025.acl-long)
Copied to clipboard
| Challenge: | Existing approaches to theorem proving in large language models rely on value functions and/or Monte Carlo Tree Search (MCTS), but the potential of simpler methods like Best-First Tree Search remains underexplored. |
| Approach: | They propose a scalable expert iteration framework that implements strategic data filtering at each expert iteration round, excluding problems solvable via beam search node expansion to focus on harder cases. |
| Outcome: | The proposed framework achieves a state-of-the-art score of 72.95 on the MiniF2F test set and challenges the perceived necessity of complex tree search methods. |
Natural Logic at the Core: Dynamic Rewards for Entailment Tree Generation (2025.findings-acl)
Copied to clipboard
| Challenge: | Existing approaches to generating entailment trees lack logical consistency . static reward structures or intricate dependencies within multi-step reasoning are often ignored . |
| Approach: | They propose a method that integrates natural logic principles into reinforcement learning to guide entailment tree generation. |
| Outcome: | Experiments on EntailmentBank show that the proposed method improves interpretability and generalization. |
MDC-Bench: A Multidisciplinary Causal Benchmark Based on Causal Structures for Evaluating Large Language Models (2026.findings-acl)
Copied to clipboard
Peng Wang, Yuxiong Yan, Xiao Ding, Kai Xiong, Bibo Cai, Chao Peng, Yutai Hou, Dandan Tu, Bing Qin, Ting Liu
| Challenge: | Existing causal datasets focus on the commonsense domain, but LLMs perform poorly when answering complex questions. |
| Approach: | They propose a multidisciplinary causal evaluation benchmark to assess LLMs' knowledge and skills. |
| Outcome: | The proposed model improves in domain specialization, structural diversity, and task complexity. |
Exploring Large Language Models for Effective Rumor Detection on Social Media (2025.naacl-long)
Copied to clipboard
| Challenge: | Large-scale contexts hinder LLMs’ reasoning abilities while moderate contexts perform better for LLM. |
| Approach: | They propose a semantic-propagation collaboration-base framework that integrates small language models with LLMs for effective rumor detection. |
| Outcome: | The proposed framework bridges the gap between LLMs and LLM in facing long, structured data and offers a novel solution for rumor detection on social media. |
Self-Evolving GPT: A Lifelong Autonomous Experiential Learner (2024.acl-long)
Copied to clipboard
| Challenge: | Existing approaches to provide LLMs with textual task-solving experience rely on manual efforts to acquire and apply such experience for each task. |
| Approach: | They propose a lifelong autonomous experiential learning framework based on LLMs that learns and accumulates experience through experience transfer and induction. |
| Outcome: | The proposed framework performs reliably in each intermediate step and improves GPT-3.5 and GPT-4 on widely used NLP datasets. |
HER: Human-like Reasoning and Reinforcement Learning for LLM Role-playing (2026.findings-acl)
Copied to clipboard
Chengyu Du, Xintao Wang, Aili Chen, Weiyuan Li, Rui Xu, Junteng Liu, Zishan Huang, Rong Tian, Zijun Sun, Yuhao Li, Liheng Feng, Deming Ding, Pengyu Zhao, Yanghua Xiao
| Challenge: | Existing models for LLM role-playing lack high-quality datasets with explicit reasoning traces and reliable reward signals aligned with human preferences. |
| Approach: | They propose a unified framework for cognitive-level persona simulation that strictly distinguishes characters’ first-person thinking processes from LLMs’ third-person reasoning. |
| Outcome: | The proposed framework outperforms the Qwen3-32B baseline model and achieves a 30.26% and 14.97% performance on the minimax benchmarks. |
Neural Natural Logic Inference for Interpretable Question Answering (2021.emnlp-main)
Copied to clipboard
| Challenge: | Existing question answering models are based on textual entailment tasks . prior work has focused on QA on premise-based questions . |
| Approach: | They propose a neural-symbolic QA approach that integrates natural logic reasoning within deep learning architectures towards developing effective question answering models. |
| Outcome: | The proposed model outperforms previous work on multiple-choice science questions . it integrates natural logic reasoning within deep learning architectures to build proof paths . |
SoftDedup: an Efficient Data Reweighting Method for Speeding Up Language Model Pre-training (2024.acl-long)
Copied to clipboard
| Challenge: | Current methods focus on detecting and removing duplicates, which risks the loss of valuable information and neglects the varying degrees of duplication. |
| Approach: | They propose a method that maintains dataset integrity while selectively reducing the sampling weight of data with high commonness. |
| Outcome: | The proposed method significantly improves training efficiency on deduplicated datasets and improves downstream accuracy by 1.77%. |
Learning Target-Specific Representations of Financial News Documents For Cumulative Abnormal Return Prediction (C18-1)
Copied to clipboard
| Challenge: | Recent work considers learning dense representations for news titles and abstracts . text representations can address the sparsity of discrete indicators in statistical models . |
| Approach: | They propose to use news abstracts to combine the most informative sentences in news content to learn dense representations for text elements. |
| Outcome: | The proposed model can be used to estimate abnormal returns of companies when compared to titles and abstracts. |
Deciphering the Impact of Pretraining Data on Large Language Models through Machine Unlearning (2024.findings-acl)
Copied to clipboard
| Challenge: | Existing studies have suggested that the composition of the pretraining corpus exerts a significant impact upon the performance of LLMs. |
| Approach: | They analyze the impact of 48 datasets from 5 major categories of pretraining data of Large Language Models and measure their impacts on LLMs using benchmarks about nine major categories. |
| Outcome: | The proposed analysis provides insights into the organization of data to support more efficient pretraining of Large Language Models. |
Analyzing the Rapid Generalization of SFT via the Perspective of Attention Head Activation Patterns (2025.acl-long)
Copied to clipboard
| Challenge: | Currently, LLMs learn in a data-driven schema while the instructions about complex tasks are both scarce and hard to collect or construct. |
| Approach: | They employ a gradient-based method to dissect the process that the Supervised Fine-tuning Process (SFT) adapts LLMs to downstream tasks via the perspective of attention patterns. |
| Outcome: | The proposed method dissects the process that the SFT process adapts LLMs to downstream tasks via the perspective of attention patterns. |
Is ChatGPT a Good Causal Reasoner? A Comprehensive Evaluation (2023.findings-emnlp)
Copied to clipboard
| Challenge: | Existing methods to evaluate ChatGPT's causal reasoning abilities are based on pre-trained language models, but they rely on supervised training. |
| Approach: | They conduct the first comprehensive evaluation of ChatGPT’s causal reasoning capabilities using four state-of-the-art (STA) simulations. |
| Outcome: | The proposed model is not a good causal reasoner, but a great causal interpreter. |
Towards Stable Natural Language Understanding via Information Entropy Guided Debiasing (2023.acl-long)
Copied to clipboard
| Challenge: | Existing approaches to debiase Natural Language Understanding models use dataset biases instead of learning the intended task. |
| Approach: | They propose a debiasing framework that detects and purifies dataset biases using information entropy. |
| Outcome: | The proposed framework improves the stability of performance on out-of-distribution datasets for a set of widely adopted NLU models. |
ExCAR: Event Graph Knowledge Enhanced Explainable Causal Reasoning (2021.acl-long)
Copied to clipboard
| Challenge: | Existing work infers the causation between events based on knowledge from annotated causal event pairs, but additional evidence information is unexploited. |
| Approach: | They propose an Event graph knowledge enhanced explainable CAusal Reasoning framework that acquires additional evidence information from a large-scale causal event graph as logical rules for causal reasoning. |
| Outcome: | The proposed framework outperforms state-of-the-art methods in human evaluation and in animal models. |
Com2 : A Causal-Guided Benchmark for Exploring Complex Commonsense Reasoning in Large Language Models (2025.acl-long)
Copied to clipboard
Kai Xiong, Xiao Ding, Yixin Cao, Yuxiong Yan, Li Du, Yufei Zhang, Jinglong Gao, Jiaqian Liu, Bing Qin, Ting Liu
| Challenge: | Existing works focus on complex tasks like math and code, while complex commonsense reasoning remains underexplored due to its uncertainty and lack of structure. |
| Approach: | They propose to build a benchmark for large language models based on complex commonsense reasoning based upon causal event graphs and causal theory. |
| Outcome: | The proposed benchmark combines a complex commonsense reasoning benchmark with a detective story to achieve a more challenging subset. |
Automated Profile Inference with Language Model Agents (2026.findings-acl)
Copied to clipboard
| Challenge: | Existing privacy protections for large language models (LLMs) are limited due to the potential for malicious applications. |
| Approach: | They propose an automated profile inference framework that can extract personal information from public online activities by an adversary with the help of large language model (LLM) based agents. |
| Outcome: | The proposed framework is highly effective and efficient and the inferred attributes are both identifiable and sensitive, posing significant privacy risks. |
STGN: an Implicit Regularization Method for Learning with Noisy Labels in Natural Language Processing (2022.emnlp-main)
Copied to clipboard
| Challenge: | Existing work to mitigate the effect of noisy labels is limited to specific tasks or training procedures, making it hard to be widely used. |
| Approach: | They propose a stochastic tailor-made gradient noise to mitigate the effect of noisy labels by introducing benign noise into stochistic gradient descent. |
| Outcome: | The proposed method can be used to discriminate correct samples from incorrect ones and boost existing training methods. |
NoisywikiHow: A Benchmark for Learning with Real-world Noisy Labels in Natural Language Processing (2023.findings-acl)
Copied to clipboard
| Challenge: | Large-scale datasets in the real world often contain label noise, which can cause model overfitting and degrade generalization. |
| Approach: | They propose to use label noise to imitate human errors in annotations . they use a noisy label noise benchmark to evaluate their methods . |
| Outcome: | The proposed benchmarks are different from data with heterogeneous label noises in the real world. |
Modeling Event Background for If-Then Commonsense Reasoning Using Context-aware Variational Autoencoder (D19-1)
Copied to clipboard
| Challenge: | Understanding event and event-centered commonsense reasoning is crucial for natural language processing (NLP). |
| Approach: | They propose a If-Then commonsense reasoning dataset Atomic and an RNN-based Seq2Seq model to facilitate this. |
| Outcome: | The proposed model improves the accuracy and diversity of inferences compared with baseline methods. |
Large Language Models Are Still Misled by Simple Bias Ensembles (2026.findings-acl)
Copied to clipboard
| Challenge: | Existing benchmarks for large language models are constrained to datasets where each sample is manually injected with only one type of bias. |
| Approach: | They propose a multi-bias benchmark where each sample contains multiple types of biases. |
| Outcome: | The proposed benchmark shows that existing LLMs and debiasing methods perform poorly on this benchmark, highlighting the challenge of eliminating compounded biases. |
iTool: Reinforced Fine-Tuning with Dynamic Deficiency Calibration for Advanced Tool Use (2025.emnlp-main)
Copied to clipboard
Yirong Zeng, Xiao Ding, Yuxian Wang, Weiwen Liu, Yutai Hou, Wu Ning, Xu Huang, Duyu Tang, Dandan Tu, Bing Qin, Ting Liu
| Challenge: | Synthesizing tool-use data through real-world simulations is effective for enhancing large language models (LLMs) however, training gains decay as synthetic data increases, and the model struggles to benefit from more synthetic data. |
| Approach: | They propose an iterative reinforced fine-tuning strategy to improve LLMs with external tools to augment their capabilities. |
| Outcome: | The proposed method achieves 13.11% better performance than the same-size base model and outperforms larger open-source and closed-source models. |
Generating Reasonable and Diversified Story Ending Using Sequence to Sequence Model with Adversarial Training (C18-1)
Copied to clipboard
| Challenge: | Story generation is a challenging problem in artificial intelligence (AI) . previous work focused on learning statistical models of event sequences from large-scale text corpora . |
| Approach: | They propose to use adversarial training to generate reasonable story endings . their model includes a generator that defines the policy of generating a story ending . |
| Outcome: | The proposed model achieves better performance on the task of Story Cloze Test with an accuracy of 62.6% compared with state-of-the-art baseline methods. |
A Graph Enhanced BERT Model for Event Prediction (2022.findings-acl)
Copied to clipboard
| Challenge: | Existing methods to predict subsequent events use sparsity of event graph to improve performance. |
| Approach: | They propose to automatically build event graph using a BERT model by adding a structured variable to the model to learn to predict event connections. |
| Outcome: | The proposed model outperforms state-of-the-art models on two event prediction tasks. |
TinyJudge: Unverifiable Constraint Alignment via Lightweight Specialist Ensembles (2026.acl-long)
Copied to clipboard
Yirong Zeng, Yufei Liu, Xiao Ding, Yutai Hou, Yuxian Wang, Wu Ning, Haonan Song, Dandan Tu, Qixun Zhang, Yuxiang He, Bibo Cai, Ting Liu
| Challenge: | Instruction Following (IF) is a core capability of LLMs, requiring strict adherence to diverse constraints. |
| Approach: | They propose a framework that uses tiny language models to evaluate instruction following . they propose to use a set of specialized tiny language model to provide rewards for soft constraints. |
| Outcome: | The proposed framework outperforms baseline models by 12% and speeds up training time by 3. |
Explaining Length Bias in LLM-Based Preference Evaluations (2025.findings-emnlp)
Copied to clipboard
Zhengyu Hu, Linxin Song, Jieyu Zhang, Zheyuan Xiao, Tianfu Wang, Zhengyu Chen, Nicholas Jing Yuan, Jianxun Lian, Kaize Ding, Hui Xiong
| Challenge: | a preference evaluation metric is often biased towards longer responses, revealing a reliability problem . a decomposition of the preference evaluation into two components is needed to understand this bias. |
| Approach: | They propose to decompose the preference evaluation metric into two key components . the first component is length-dependent and related to trustworthiness . |
| Outcome: | The proposed evaluation metric is based on two components: desirability and information mass. |