Papers by Ting Li
SelF-Eval: Self-supervised Fine-grained Dialogue Evaluation (2022.coling-1)
Copied to clipboard
| Challenge: | Existing evaluation metrics are expensive and easy to conduct but ineffective to reflect dialogue quality. |
| Approach: | They propose a self-supervised fine-grained dialogue evaluation framework which can automatically assign fine-granular scores for arbitrarily dialogue data. |
| Outcome: | The proposed framework is highly consistent with human evaluations and better than the state-of-the-art models. |
R2A-TLS: Reflective Retrieval-Augmented Timeline Summarization with Causal-Semantic Integration (2025.findings-emnlp)
Copied to clipboard
| Challenge: | Existing methods struggle to capture coherent event narratives due to fragmented descriptions . Existing approaches accumulate noise through iterative retrieval strategies that lack relevance evaluation. |
| Approach: | They propose a reflective retrieval-augmented timeline summarization with Causal-Semantic Intergration approach for open-domain timeline summarizing . |
| Outcome: | The proposed approach outperforms the best prior published approaches. |
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. |
Multi-Document Scientific Summarization from a Knowledge Graph-Centric View (2022.coling-1)
Copied to clipboard
| Challenge: | Multi-Document Scientific Summarization (MDSS) aims to produce concise and concise summaries for clusters of topic-relevant scientific papers. |
| Approach: | They propose a model that incorporates knowledge graphs into paper encoding and decoding processes and propose 'decoder' for generating knowledge graph information of summary in the form of descriptive sentences. |
| Outcome: | The proposed architecture improves on baselines on the Multi-Xscience dataset. |
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. |
GCNet: Global-and-Context Collaborative Learning for Aspect-Based Sentiment Analysis (2024.lrec-main)
Copied to clipboard
| Challenge: | Existing methods for analyzing aspect terms are focused on extracting semantic information inherent within the sentence. |
| Approach: | They propose a GCNet that explicitly leverages global semantic information to guide context encoding. |
| Outcome: | The proposed model outperforms state-of-the-art methods on three public datasets. |
VPTQ: Extreme Low-bit Vector Post-Training Quantization for Large Language Models (2024.emnlp-main)
Copied to clipboard
| Challenge: | Recent research has focused on pushing weight-only quantization to extremely low-bit due to numerical representation limitations. |
| Approach: | They propose a vector-based quantization approach that pushes LLMs to extremely low-bit . they propose scalar-based weight quantization that reduces memory requirements and optimizes storage costs . |
| Outcome: | The proposed method reduces model quantization perplexity by 0.01-0.34 on LLaMA-2, 0.38-0.68 on mistral-7B, 4.41-7.34, on llaMA-3 on QA tasks on average. |
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. |
Lil: Less is Less When Applying Post-Training Sparse-Attention Algorithms in Long-Decode Stage (2026.findings-acl)
Copied to clipboard
Junhao Hu, Fangze Li, Mingtao Xu, Feifan Meng, Shiju Zhao, Tiancheng Hu, Ting Peng, Anmin Liu, Wenrui Huang, Chenxu Liu, Ziyue Hua, Tao Xie
| Challenge: | Prior work typically decomposes inference into prefill and decode stages, with the decode stage dominating total latency. |
| Approach: | They propose an algorithm that detects threshold where information loss exceeds information gain during sparse decoding to reduce token consumption by up to 90% and a marginal accuracy degradation of less than 2%. |
| Outcome: | The proposed algorithm reduces token consumption by 90% with a marginal accuracy degradation of less than 2% across reasoning-intensive benchmarks. |
Slot-consistent NLG for Task-oriented Dialogue Systems with Iterative Rectification Network (2020.acl-main)
Copied to clipboard
| Challenge: | Existing approaches to natural language generation are prone to errors, such as neglecting input slot values and generating redundant slot values. |
| Approach: | They propose an iterative rectification network to improve general NLG systems . they apply bootstrapping algorithms to sample training candidates and incorporate reward . |
| Outcome: | The proposed methods significantly reduce the slot error rate for strong baselines. |
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. |
Entity-Consistent End-to-end Task-Oriented Dialogue System with KB Retriever (D19-1)
Copied to clipboard
| Challenge: | Existing work on sequence-to-sequence dialogues treats the KB query as an attention over the entire KB without the guarantee that the generated entities are consistent with each other. |
| Approach: | They propose a framework which queries the knowledge base in two steps to improve consistency . they first return the most relevant KB row given a dialogue history . |
| Outcome: | The proposed framework outperforms baseline models and produces entity-consistent responses. |
Allocating Large Vocabulary Capacity for Cross-Lingual Language Model Pre-Training (2021.emnlp-main)
Copied to clipboard
| Challenge: | Existing models require a more expressive vocabulary to represent all languages . however, increasing the vocabulary size significantly slows down the pre-training speed . |
| Approach: | They propose an algorithm VoCap to determine the desired vocabulary capacity of each language. |
| Outcome: | The proposed algorithm improves cross-lingual model pre-training while reducing side effects of increasing vocabulary size. |
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 . |
LEAF: Towards Lightweight Explainable Hateful Video Detection via Self-Grounding CoT Guided Stage-Wise Distillation (2026.findings-acl)
Copied to clipboard
| Challenge: | Existing methods for detecting hateful videos rely on opaque models with no insight into their decisions. |
| Approach: | They propose a lightweight, explainable video detection framework that distills "explainability" from LMMs into efficient Smaller Multimodal Models (SMMs) they use a self-grounded chain-of-thought mechanism to generate unbiased supervision signals for videos . |
| Outcome: | The proposed framework outperforms existing methods in detection accuracy and explainability on three video benchmarks. |
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. |
A Stack-Propagation Framework with Token-Level Intent Detection for Spoken Language Understanding (D19-1)
Copied to clipboard
| Challenge: | Intent detection and slot filling are two main tasks for building a spoken language understanding system. |
| Approach: | They propose a framework to incorporate intent information into slot filling tasks . they use a joint model with Stack-Propagation to capture intent semantic knowledge . |
| Outcome: | The proposed model outperforms existing models on two publicly available datasets and outperformed existing models by a large margin. |
Learning to Ask Unanswerable Questions for Machine Reading Comprehension (P19-1)
Copied to clipboard
| Challenge: | Existing models for extractive reading comprehension are not good at deciding whether no answer is presented in the context. |
| Approach: | They propose a data augmentation technique by automatically generating relevant unanswerable questions according to an answerable question paired with its corresponding paragraph that contains the answer. |
| Outcome: | The proposed model performs better on the SQuAD 2.0 dataset than the baseline model and the BERT-large model. |
CLIP Models are Few-Shot Learners: Empirical Studies on VQA and Visual Entailment (2022.acl-long)
Copied to clipboard
| Challenge: | Previously, CLIP was only regarded as a powerful visual encoder. |
| Approach: | They propose a parameter-efficient fine-tuning strategy to boost CLIP's few-shot performance on a visual entailment task without introducing any additional pre-training procedure. |
| Outcome: | The proposed strategy achieves competitive zero/few-shot results on visual question answering and visual entailment tasks without introducing any additional pre-training procedure. |
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. |
DuReadervis: A Chinese Dataset for Open-domain Document Visual Question Answering (2022.findings-acl)
Copied to clipboard
| Challenge: | Open-domain question answering is a task that requires answering questions based on a collection of document images. |
| Approach: | They propose to use document images to answer questions using layouts and visual features instead of text. |
| Outcome: | The proposed approach reduces human cost and improves scalability of QA systems by incorporating layouts and visual features. |
HyperEdit: Unlocking Instruction-based Text Editing in LLMs via Hypernetworks (2026.findings-acl)
Copied to clipboard
Yiming Zeng, Jinghan Cao, Zexin Li, Wanhao Yu, Zhankai Ye, Dawei Xiang, Ting Hua, Xin Liu, Shangqian Gao, Tingting Yu
| Challenge: | Existing approaches treat instruction-based text editing as a generic text generation problem. Existing methods either over-edit or fail to apply modifications consistently. |
| Approach: | They propose a framework that processes each editing request to best align with it. |
| Outcome: | The proposed framework achieves 9% improvement over the state-of-the-art model. |
ORANGE: Text-video Retrieval via Watch-time-aware Heterogeneous Graph Contrastive Learning (2023.emnlp-industry)
Copied to clipboard
Yucheng Lin, Tim Chang, Yaning Chang, Jianqiang Ma, Donghui Li, Ting Peng, Zang Li, Zhiyi Zhou, Feng Wang
| Challenge: | Existing methods for text-video retrieval focus on informative representations and delicate matching mechanisms, but real-world scenarios often involve brief, ambiguous queries and low-quality videos. |
| Approach: | They propose a novel method to learn informative embeddings for queries and videos . they use a watch-time-aware contrastive learning paradigm to capture dependencies . |
| Outcome: | The proposed method is effective in a real-world video-search service. |
Aligning Translation-Specific Understanding to General Understanding in Large Language Models (2024.emnlp-main)
Copied to clipboard
| Challenge: | Large Language models (LLMs) have remarkable abilities in understanding complex texts . however, understanding misalignment leads to LLMs mistakenly translating complex concepts . |
| Approach: | They propose a translation process that aligns the translation-specific understanding with the general understanding to improve translation quality and reduce translation literalness. |
| Outcome: | The proposed translation process improves translation quality and reduces translation literalness by -25% -51%. |
A Multi-Modal Knowledge Graph for Classical Chinese Poetry (2022.findings-emnlp)
Copied to clipboard
| Challenge: | Existing studies in classical Chinese poetry area focus on generation and analysis of poetry. |
| Approach: | They propose to integrate the visual information of words in classical Chinese poetry into a multi-modal knowledge graph. |
| Outcome: | The proposed model bridges the semantic gap between two modalities and achieves state-of-the-art performance on the poetry-image retrieval task. |
SeCuRepair: Semantics-Aligned, Curriculum-Driven, and Reasoning-Enhanced Vulnerability Repair Framework (2026.acl-long)
Copied to clipboard
Chengran Yang, Ting Zhang, Jinfeng Jiang, Xin Zhou, Haoye Tian, Mingzhe Du, Jieke Shi, Junkai Chen, Yikun Li, Eng Lieh Ouh, Lwin Khin Shar, David Lo
| Challenge: | Existing methods for automating vulnerability repair suffer from syntactic overfitting . nvd published 49,230 Common Vulnerabilities and Exposures (CVE) records in 2025 alone . |
| Approach: | They propose a semantic-aware reward framework that optimizes for code semantic equivalence rather than lexical mimicry. |
| Outcome: | The proposed framework outperforms state-of-the-art frameworks on repository-level splits . it incorporates expert-aligned reasoning mechanism that grounds patch generation in structured diagnosis. |
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. |
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. |
Don’t Miss the Potential Customers! Retrieving Similar Ads to Improve User Targeting (2021.findings-emnlp)
Copied to clipboard
| Challenge: | a method for user targeting is developed to identify online users to whom an ad should be targeted. |
| Approach: | They propose a method for automatic augmentation of positive and negative clickthrough data for user targeting models. |
| Outcome: | The proposed method can increase positive and negative instances of positive training instances on two datasets. |
CrochetBench: Can Vision-Language Models Move from Describing to Doing in Crochet Domain? (2026.acl-long)
Copied to clipboard
| Challenge: | Existing multimodal large language models cannot generate executable procedures . authors propose a new benchmark to assess procedural competence in multimodal models . |
| Approach: | They propose a new benchmark to assess procedural competence in multimodal large language models . they use a CrochetPARADE DSL representation to enable structural validation and functional evaluation . |
| Outcome: | The proposed model enables structural validation and functional evaluation via execution. |
All Information is Valuable: Question Matching over Full Information Transmission Network (2022.findings-naacl)
Copied to clipboard
| Challenge: | Existing methods for question matching only transmit one kind of information while failing to utilize both kinds of information simultaneously. |
| Approach: | They propose a question matching network that can transmit both representation and interactive information together in a simultaneous fashion. |
| Outcome: | The proposed approach outperforms strong baseline models on two standard benchmarks. |
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. |
One for All: Update Parameterized Knowledge Across Multiple Models with Once Edit (2025.acl-long)
Copied to clipboard
Weitao Ma, Xiyuan Du, Xiaocheng Feng, Lei Huang, Yichong Huang, Huiyi Zhang, Xiaoliang Yang, Baohang Li, Xiachong Feng, Ting Liu, Bing Qin
| Challenge: | Existing methods for modifying large language models focus on individual models, resulting in errors and hallucinations. |
| Approach: | They propose an ensemble-based approach that employs a plug-in model as the editing module and a dynamic weight mechanism to enhance its effectiveness. |
| Outcome: | The proposed approach outperforms existing methods while achieving superior editing efficiency. |
A Span-Extraction Dataset for Chinese Machine Reading Comprehension (D19-1)
Copied to clipboard
| Challenge: | Existing reading comprehension datasets are mostly in English . MRC is a new field of research that aims to comprehend the context of articles and answer the questions based on them. |
| Approach: | They propose a Span-Extraction dataset for Chinese machine reading comprehension to add language diversities to existing reading comprehension datasets. |
| Outcome: | The proposed dataset is composed of 20,000 real questions annotated on Wikipedia paragraphs by human experts. |
TutorialBank: A Manually-Collected Corpus for Prerequisite Chains, Survey Extraction and Resource Recommendation (P18-1)
Copied to clipboard
Alexander Fabbri, Irene Li, Prawat Trairatvorakul, Yijiao He, Weitai Ting, Robert Tung, Caitlin Westerfield, Dragomir Radev
| Challenge: | TutorialBank is a publicly available dataset that aims to facilitate NLP education and research . a google search of "Natural Language Processing" returns over 100 million hits with papers, tutorials, 1 http://aan.how blog posts, codebases and other related online resources. |
| Approach: | They have manually collected and categorized over 5,600 resources on NLP . they have created a search engine and command-line tool to search the corpus . |
| Outcome: | The tutorial bank dataset is the largest manually-picked corpus of resources intended for NLP education . it includes lists of research topics, relevant resources for each topic, prerequisite relations among topics . |
Context-Sensitive Generation of Open-Domain Conversational Responses (C18-1)
Copied to clipboard
| Challenge: | Existing studies on single-turn conversation generation focus on coherence and context-sensitive generation of open-domain conversational responses. |
| Approach: | They propose static and dynamic attention based approaches for context-sensitive generation of open-domain conversational responses. |
| Outcome: | The proposed model outperforms all baselines on automatic and human evaluation on two public datasets. |
Knowledge-Augmented Question Error Correction for Chinese Question Answer System with QuestionRAG (2025.emnlp-industry)
Copied to clipboard
| Challenge: | Large language models struggle with input errors, often failing to interpret user intent or altering the original question’s structure (over-correction). |
| Approach: | They propose a framework that uses reinforcement learning to address misinterpretation and over-correction by integrating external knowledge with the input. |
| Outcome: | The proposed framework unlocks the full potential of LLMs for the question correction task. |
Molweni: A Challenge Multiparty Dialogues-based Machine Reading Comprehension Dataset with Discourse Structure (2020.coling-main)
Copied to clipboard
| Challenge: | Multiparty dialog applications such as discourse parsing and meeting summarization are now mainstream research. |
| Approach: | They propose to annotate a machine reading comprehension dataset with discourse structure built over multiparty dialog using a modified Segmented Discourse Representation Theory (SDRT) style. |
| Outcome: | The proposed dataset contributes large-scale discourse dependency annotations in a modified Segmented Discourse Representation Theory (SDRT) style for all of its multiparty dialogs, and achieves only 67.7% F1 on Molweni’s questions, a 20+% significant drop as compared against its SQuAD 2.0 performance. |
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 . |
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. |
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. |
Path Spuriousness-aware Reinforcement Learning for Multi-Hop Knowledge Graph Reasoning (2023.eacl-main)
Copied to clipboard
| Challenge: | Multi-hop reasoning is a common approach for query answering, but can be biased to spurious paths which coincidentally lead to the correct answer with poor explanation. |
| Approach: | They propose a method that quantitatively estimates to what extent a path is spurious by a metric called Path Spuriousness (PS) they propose KG reasoning, which infers new facts along existing paths in KGs. |
| Outcome: | The proposed model significantly improves the agent’s ability to prevent spurious paths while keeping comparable to state-of-the-art performance. |
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. |
AutoVecCoder: Teaching LLMs to Generate Explicitly Vectorized Code (2026.findings-acl)
Copied to clipboard
ShangZhan Li, Xinyu Yin, Xuanyu Jin, Ye He, Yuxin Zhou, Yuxuan Li, Xu Han, Wanxiang Che, Qi Shi, Ting Liu, Maosong Sun
| Challenge: | Current development practices face a dichotomy between automation and performance. |
| Approach: | They propose a framework to empower LLMs with the capability of automated explicit vectorization. |
| Outcome: | The proposed framework achieves state-of-the-art performance on the SSE and AVX subsets of SimdBench. |
Dynamic Low-rank Estimation for Transformer-based Language Models (2023.findings-emnlp)
Copied to clipboard
| Challenge: | RankDyna is a matrix decomposition method that can be used to compress Transformer-based language models. |
| Approach: | They propose a matrix decomposition method that enables dynamic rank resource allocation . they say it can outperform current SOTA methods under various parameter budget levels . |
| Outcome: | The proposed method outperforms current SOTA methods under various budget levels . the proposed method is more efficient with higher compression rates . |
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. |
Consistency Regularization for Cross-Lingual Fine-Tuning (2021.acl-long)
Copied to clipboard
Bo Zheng, Li Dong, Shaohan Huang, Wenhui Wang, Zewen Chi, Saksham Singhal, Wanxiang Che, Ting Liu, Xia Song, Furu Wei
| Challenge: | Experimental results show that consistency regularization improves cross-lingual fine-tuning . pre-trained cross-linguistic models can transfer task-specific supervision from one language to the other . |
| Approach: | They propose to improve cross-lingual fine-tuning with consistency regularization . they use example consistency regularized to penalize prediction sensitivity to four types of data augmentations . |
| Outcome: | The proposed method improves cross-lingual fine-tuning across tasks . it can be generalized to other target languages without additional training . |
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. |
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. |
Knowledge Transfer in Incremental Learning for Multilingual Neural Machine Translation (2023.acl-long)
Copied to clipboard
| Challenge: | Existing studies focus on overcoming catastrophic forgetting on original language pairs while lacking encouragement to learn new knowledge from incremental learning. |
| Approach: | They propose a knowledge transfer method that can adapt original MNMT models to diverse incremental language pairs by flexibly introducing knowledge from external models into original models, which encourages the models to learn new language pairs. |
| Outcome: | The proposed method outperforms baselines on multiple languages while maintaining performance on original language pairs. |
FroM: Frobenius Norm-Based Data-Free Adaptive Model Merging (2025.findings-emnlp)
Copied to clipboard
| Challenge: | a new adaptive merging method is proposed to improve fine-tuning performance . traditional methods often encounter task interference when merging full fine-uning models . |
| Approach: | They propose an adaptive merging method that directly measures model parameters using the Frobenius norm . |
| Outcome: | The proposed method outperforms baseline methods in various fine-tuning scenarios. |
SecureVibeBench: Benchmarking Secure Vibe Coding of AI Agents via Reconstructing Vulnerability-Introducing Scenarios (2026.acl-long)
Copied to clipboard
Junkai Chen, Huihui Huang, Yunbo Lyu, Junwen An, Jieke Shi, Chengran Yang, Ting Zhang, Haoye Tian, Yikun Li, Zhenhao Li, Xin Zhou, Xing Hu, David Lo
| Challenge: | Existing benchmarks fail to capture scenarios in which vulnerabilities are introduced by humans . we evaluate 5 popular code agents supported by 5 LLMs on SecureVibeBench . |
| Approach: | They propose a benchmarking tool that compares 105 C/C++ secure coding tasks . they use real-world open-source vulnerabilities and a comprehensive evaluation tool . |
| Outcome: | The proposed benchmarks show that code agents struggle to produce correct and secure code . the best performing agent produces merely 23.8% correct and secured solutions . |
DisCo: Distilled Student Models Co-training for Semi-supervised Text Mining (2023.emnlp-main)
Copied to clipboard
| Challenge: | Existing text mining models are fine-tuned by fine-timing a large pre-trained language model (PLM) in downstream tasks. |
| Approach: | They propose a semi-supervised learning framework for fine-tuning a cohort of small student models generated from a large pre-trained language model using knowledge distillation. |
| Outcome: | The proposed framework outperforms baseline models on semi-supervised text classification and extractive summarization tasks while maintaining comparable performance. |
Recommending Missed Citations Identified by Reviewers: A New Task, Dataset and Baselines (2024.lrec-main)
Copied to clipboard
| Challenge: | Existing citation recommendation systems aim to recommend a list of scientific papers for a given text context or a draft paper. |
| Approach: | They propose a task of Recommending Missed Citations Identified by Reviewers to help improve citations of full papers. |
| Outcome: | The proposed framework outperforms existing methods in all metrics and will motivate future research on this challenging task. |
Benchmarking Meaning Representations in Neural Semantic Parsing (2020.emnlp-main)
Copied to clipboard
| Challenge: | Existing work on meaning representations is not comprehensively evaluated due to the lack of readily-available execution engines. |
| Approach: | They propose a unified benchmark on meaning representations by integrating existing semantic parsing datasets, completing the missing logical forms, and implementing the missing execution engines. |
| Outcome: | The proposed benchmark combines existing parsing datasets, completes missing logical forms, and implements missing execution engines. |