Papers by Ming Tang

49 papers
DiffuSpec: Unlocking Diffusion Language Models for Speculative Decoding (2026.findings-acl)

Copied to clipboard

Challenge: Autoregressive (AR) decoding in large language models is latency-bounded by strictly sequential token generation.
Approach: They propose a diffusion-based drafter that proposes multi-token candidates and then verifies them in parallel by the target model.
Outcome: The proposed drafter generates multi-token proposals in a single forward pass while remaining compatible with standard AR verifiers.
WhiteningBERT: An Easy Unsupervised Sentence Embedding Approach (2021.findings-emnlp)

Copied to clipboard

Challenge: Pre-trained language models perform well on learning sentence semantics when fine-tuned with supervised data.
Approach: They conduct a thorough examination of pretrained model based unsupervised sentence embeddings.
Outcome: The proposed approach improves on whitening-based vector normalization with less than 10 lines of code.
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.
LCR-RAG: Enhancing Logical Consistency in Retrieval-Augmented Generation via Neuro-symbolic Reinforcement Learning (2026.acl-long)

Copied to clipboard

Challenge: Retrieval-Augmented Generation (RAG) is widely used to ground large language models in external knowledge and improve factual accuracy.
Approach: They propose a framework that integrates neuro-symbolic verification with reinforcement learning to optimize logical consistency.
Outcome: The proposed framework outperforms strong RAG baselines on hotpotQA, ASQA, and TriviaQA.
AnRe: Analogical Replay for Temporal Knowledge Graph Forecasting (2025.acl-long)

Copied to clipboard

Challenge: Temporal Knowledge Graphs (TKGs) are vital for event prediction, yet current methods face limitations.
Approach: They propose a training-free Analogical Replay reasoning framework that uses LLMs to extract historical contexts and generate analogical reasoning examples as contextual inputs.
Outcome: The proposed model outperforms existing training-free methods on four benchmarks.
Multi-hop Reading Comprehension across Multiple Documents by Reasoning over Heterogeneous Graphs (P19-1)

Copied to clipboard

Challenge: Existing models to tackle multi-hop reading comprehension (RC) are focusing on a single document or paragraph, but they lack the ability to do reasoning across multiple documents.
Approach: They propose a heterogeneous document-entity graph with different types of nodes and edges to solve multi-hop RC problem.
Outcome: The proposed model can do reasoning over the proposed graph with nodes representation initialized with co-attention and self-attention based context encoders.
Evidence-Aware Inferential Text Generation with Vector Quantised Variational AutoEncoder (2020.acl-main)

Copied to clipboard

Challenge: Existing approaches for inferential text generation ignore context that is not explicitly provided . Existing models ignore background knowledge that provides crucial evidence to generate inferences .
Approach: They propose an approach that automatically finds evidence for an event from a large text corpus and leverages it to guide the generation of inferential texts.
Outcome: The proposed model generates inferential texts from a large text corpus and uses evidence to guide it.
Experience-driven Multi-turn Reinforcement Learning for GUI Agents (2026.acl-long)

Copied to clipboard

Challenge: GUI agents have demonstrated remarkable progress in automating complex user interface interactions . training such agents for long-horizon tasks remains challenging due to limited rewards and prohibitive costs.
Approach: They propose a method that leverages expert trajectories as environment experiences for on-policy multi-turn training.
Outcome: The proposed method achieves significant gains over the base model with 1K public trajectories as RL experiences . it achieves competitive performance against strong baselines such as UI-TARS-7B and GPT-4o .
HSUGA: LLM-Enhanced Recommendation with Hierarchical Semantic Understanding and Group-Aware Alignment (2026.findings-acl)

Copied to clipboard

Challenge: Existing methods for enhancing sequential recommendation use long interaction sequences, but they lack the ability to extract user preferences from long sequences.
Approach: They propose a plugin that integrates LLMs to infer user preferences from interaction sequences.
Outcome: The proposed algorithms improve user semantic embedding extraction and utilization on three benchmark datasets.
CoSQA: 20,000+ Web Queries for Code Search and Question Answering (2021.acl-long)

Copied to clipboard

Challenge: Using deep neural networks to find codes is difficult . we present a dataset that includes 20,604 labels for natural language queries and codes .
Approach: They introduce a contrastive learning method to enhance text-code matching . they find that CoSQA improves the accuracy of code question answering by 5.1% .
Outcome: The proposed method improves the accuracy of code question answering by 5.1% and improves by 10.5% on a CodeBERT model.
One-for-All Pruning: A Universal Model for Customized Compression of Large Language Models (2025.findings-acl)

Copied to clipboard

Challenge: Existing pruning methods for large language models (LLMs) focus on achieving high compression rates while maintaining model performance.
Approach: They propose a Univeral Model for Customized Compression (UniCuCo) which introduces a StratNet that learns to map arbitrary requests to their optimal pruning strategy.
Outcome: The proposed model is 28 times faster than baselines in processing 64 requests, while maintaining comparable accuracy to baselines.
Question Generation from SQL Queries Improves Neural Semantic Parsing (D18-1)

Copied to clipboard

Challenge: Using question generation, we learn a semantic parser with 30% of the supervised training data.
Approach: They propose to use question generation to learn a semantic parser with less supervised training data.
Outcome: The proposed method improves the state-of-the-art model with less training data.
LEMMA: Learning from Errors for MatheMatical Advancement in LLMs (2025.findings-acl)

Copied to clipboard

Challenge: Existing approaches focus on improving the quality of correct training data, neglecting the value contained in error data, thereby hindering the model’s reflective ability.
Approach: They propose to improve LLM's reasoning ability by learning from error data and a grounded mistake augmentation method to collect representative errors.
Outcome: The proposed model achieves significant performance improvements over other strong models with less than 90k data.
Parameter-Efficient Tuning Makes a Good Classification Head (2022.emnlp-main)

Copied to clipboard

Challenge: In recent years, pretrained models revolutionized the paradigm of natural language understanding . but the final-layer output of the backbone, i.e. the input of the classification head, will change greatly during finetuning .
Approach: They propose to append a randomly initialized classification head after the pretrained backbone and finetune the whole model.
Outcome: The proposed classification head can be replaced with the randomly initialized heads for a stable performance gain.
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.
MMRC: A Large-Scale Benchmark for Understanding Multimodal Large Language Model in Real-World Conversation (2025.acl-long)

Copied to clipboard

Challenge: Existing multimodal large language models lack the ability to memorize, recall, and reason in sustained interactions.
Approach: They propose a multimodal real-world conversation benchmark for evaluating open-ended abilities of multimodal large language models.
Outcome: The proposed benchmarks show that the models perform better in open-ended conversations.
Asking Clarification Questions in Knowledge-Based Question Answering (D19-1)

Copied to clipboard

Challenge: Existing clarification datasets with limited annotated examples do not address ambiguous phenomena.
Approach: They propose a dataset that allows users to ask clarification questions using open-domain examples.
Outcome: The proposed model achieves better performance than strong baselines and provides new challenges.
Logic-Driven Context Extension and Data Augmentation for Logical Reasoning of Text (2022.findings-acl)

Copied to clipboard

Challenge: Existing methods for logical reasoning of text focus on contextual semantics while struggling to explicitly model the logical inference process.
Approach: They propose a logic-driven context extension framework and a data-driven augmentation algorithm that uses contrastive learning to better capture logical information.
Outcome: The proposed framework outperforms existing methods on two benchmark datasets, ReClor and LogiQA.
From Implicit Graph Encoding to Explicit Evidence: A Training-Free LLM Framework for Temporal Knowledge Graph Reasoning (2026.findings-acl)

Copied to clipboard

Challenge: Existing Large Language Models (LLMs) struggle with implicit modality alignment and suboptimal graph linearization.
Approach: They propose a training-free, test-time adaptive framework that reframes TKG prediction as explicit evidence-driven reasoning.
Outcome: ExE-LLM outperforms fully trained graph neural networks on four benchmarks . it achieves SOTA performance in inductive settings, significantly outperforming fully trained neural networks .
SEEKR: Selective Attention-Guided Knowledge Retention for Continual Learning of Large Language Models (2024.emnlp-main)

Copied to clipboard

Challenge: Existing methods fail to fully exploit the knowledge embedded in models from previous tasks . Existing techniques fail to exploit the information embedded in previous tasks, resulting in a large number of replay samples to achieve good results.
Approach: They propose a method that uses attention weights to extract knowledge from previous tasks . they use a data replay strategy to extract the knowledge from the previous tasks.
Outcome: The proposed method achieves comparable or even better performance with only 1/10 of replayed data used by other methods.
Visual Attention Reasoning via Hierarchical Search and Self-Verification (2026.acl-long)

Copied to clipboard

Challenge: Multimodal Large Language Models (MLLMs) often hallucinate due to fragile, linear reasoning and weak visual grounding.
Approach: They propose a framework that reformulates reasoning as a hierarchical search with self-verification and replaces linear Chain-of-Thought with a tree-search policy capable of backtracking to correct logical errors.
Outcome: The proposed framework outperforms state-of-the-art methods on hallucination and safety benchmarks.
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.
Efficient Transformer Parameter Reuse via Zero-Token Mechanism (2026.findings-acl)

Copied to clipboard

Challenge: Existing approaches to scaling up parameter counts are impractical for users with limited computational resources.
Approach: They propose a decoupled parameter cycling strategy that employs a head-tail decoupling strategy to decouple the first (head) and last (tail) layers from the parameter cycling process.
Outcome: The proposed approach achieves superior performance under strict parameter constraints and significantly reduces computational overhead via early exits.
DoCIA: An Online Document-Level Context Incorporation Agent for Speech Translation (2025.findings-acl)

Copied to clipboard

Challenge: Document-level context is crucial for speech translation due to noise from ASR . incorporating document-level contextual information into ST remains a challenge .
Approach: They develop an online framework that integrates document-level context into machine translation . they use document-based modules to integrate document- level context into ST .
Outcome: The proposed framework outperforms baselines in sentence and discourse metrics . it can correct ASR transcription errors and improve translation performance .
Towards Benchmarking Situational Awareness of Large Language Models:Comprehensive Benchmark, Evaluation and Analysis (2024.findings-emnlp)

Copied to clipboard

Challenge: Situational awareness is crucial for decision-making, anticipating potential issues, and adapting to dynamic circumstances.
Approach: They propose a benchmark that covers three tiers of situational awareness capabilities . they conduct extensive experiments on advanced LLMs including GPT-4, LLaMA3, Qwen1.5 .
Outcome: The proposed benchmark covers environment perception, situation comprehension and future projection.
FewNLU: Benchmarking State-of-the-Art Methods for Few-Shot Natural Language Understanding (2022.acl-long)

Copied to clipboard

Challenge: Existing evaluation protocols for few-shot natural language understanding (NLU) tasks are inconsistent and hinder fair comparison and measuring progress.
Approach: They propose an evaluation framework that improves previous evaluation procedures in three key aspects, i.e., test performance, dev-test correlation, and stability.
Outcome: The proposed framework improves evaluation procedures in three key aspects, i.e., performance, dev-test correlation, and stability.
K-Adapter: Infusing Knowledge into Pre-Trained Models with Adapters (2021.findings-acl)

Copied to clipboard

Challenge: Existing methods for injecting knowledge into pre-trained models are inconsistent and can flush out knowledge when multiple kinds of knowledge are injected.
Approach: They propose a framework that retains the original parameters of pre-trained models fixed and supports the development of versatile knowledge-infused models.
Outcome: The proposed framework retains the original parameters of the pre-trained model fixed and supports the development of versatile knowledge-infused models.
Grammar-Based Patches Generation for Automated Program Repair (2021.findings-acl)

Copied to clipboard

Challenge: Automated program repair (APR) aims to find an automatic solution to program language bugs without human intervention.
Approach: They propose a grammar-based rule-rule model which regards the repair process as the transformation of grammar rules and employs a tree-based self-attention approach to guarantee grammar correctness.
Outcome: The proposed model outperforms the state-of-the-art models on a Java dataset in terms of generated code accuracy.
Cognitive Graph for Multi-Hop Reading Comprehension at Scale (P19-1)

Copied to clipboard

Challenge: a new framework for multi-hop reading comprehension question answering is needed to cross the chasm of reading comprehension between machine and human.
Approach: They propose a CogQA framework for multi-hop reading comprehension question answering in web-scale documents that builds a cognitive graph in an iterative process by coordinating an implicit extraction module and an explicit reasoning module.
Outcome: The proposed framework outperforms the best competitor in the hotpotQA dataset in F1 . it provides explainable reasoning paths and accurate answers, while giving accurate answers .
Large Language Models Are Poor Clinical Decision-Makers: A Comprehensive Benchmark (2024.emnlp-main)

Copied to clipboard

Challenge: Existing studies focus on evaluating large language models in close-ended QA tasks, but many clinical decisions involve answering open-ended questions without pre-set options.
Approach: They construct a benchmark to better understand large language models in the clinic . they use existing datasets to evaluate LLMs in clinical situations .
Outcome: The proposed model outperforms human experts in multiple medical tasks.
CodeBERT: A Pre-Trained Model for Programming and Natural Languages (2020.findings-emnlp)

Copied to clipboard

Challenge: Large pre-trained models have improved performance on a variety of natural language processing tasks.
Approach: They develop a bimodal pre-trained model for programming language (PL) and natural language (NL) it incorporates a hybrid objective function that detects replaced tokens from generators.
Outcome: The proposed model performs better on two NL-PL applications by fine-tuning model parameters.
Semantic Parsing with Syntax- and Table-Aware SQL Generation (P18-1)

Copied to clipboard

Challenge: Existing approaches generate a SQL query word-by-word but results are incorrect or not executable due to mismatch between question words and table contents.
Approach: They propose a generative model to map natural language questions into SQL queries.
Outcome: The proposed model significantly improves state-of-the-art execution accuracy from 69.0% to 74.4% on a large question- SQL dataset.
Syntax-Enhanced Pre-trained Model (2021.acl-long)

Copied to clipboard

Challenge: Existing methods that use syntax of text in pre-training and fine-tuning suffer from discrepancy between the two stages.
Approach: They propose a model that utilizes the syntactic structure of text in pre-training and fine-tuning stages.
Outcome: The proposed model achieves state-of-the-art on six public benchmark datasets.
EmoCaps: Emotion Capsule based Model for Conversational Emotion Recognition (2022.findings-acl)

Copied to clipboard

Challenge: Existing studies on ERC focus on context modeling but ignore representation of contextual emotional tendency.
Approach: They propose to use Emoformer to extract multi-modal emotion vectors from different modalities and fuse them with sentence vector to be an emotion capsule.
Outcome: The proposed model outperforms the state-of-the-art models on two benchmark datasets.
Self-Critique Guided Iterative Reasoning for Multi-hop Question Answering (2025.findings-acl)

Copied to clipboard

Challenge: Large language models (LLMs) have demonstrated remarkable reasoning capabilities, but they still face challenges in knowledge-intensive multi-hop reasoning.
Approach: They propose a method that uses self-critique feedback to guide iterative reasoning by enabling iteration and self-evaluation of its intermediate reasoning steps.
Outcome: The proposed method surpasses the previous SOTA by 8.6% on three multi-hop reasoning datasets.
Coupling Retrieval and Meta-Learning for Context-Dependent Semantic Parsing (P19-1)

Copied to clipboard

Challenge: a context-aware retrieval model and a meta-learning paradigm are used for context-dependent semantic parsing .
Approach: They propose a retrieval model and a meta-learner to incorporate retrieved datapoints as context-dependent semantic parsing evidence.
Outcome: The proposed approach performs better than retrieve-and-edit baselines on CONCODE and CSQA datasets.
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.
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 .
SPEAK: Spiking Neurons as an Entropy-Aware Tokenizer for Large Language Models (2026.acl-long)

Copied to clipboard

Challenge: Existing tokenizers fail to explicitly leverage historical tokenization results . large language models (LLMs) have demonstrated remarkable effectiveness across NLP tasks .
Approach: They propose a tokenizer that integrates spiking neurons to explicitly leverage historical tokenization results.
Outcome: The proposed tokenizer leverages historical tokenization results, but does not selectively leverage history based on contextual relevance.
TAGS: A Test-Time Generalist–Specialist Framework with Retrieval-Augmented Reasoning and Verification (2026.findings-acl)

Copied to clipboard

Challenge: Existing efforts to improve medical question answering performance follow two directions.
Approach: They propose a framework that combines a generalist with a domain-specific specialist without any model fine-tuning or parameter updates.
Outcome: The proposed framework boosts GPT-4o accuracy by 13.8%, deepseek-R1 by 16.8%, and improves a vanilla 7B model from 14.1% to 23.9%.
Towards Knowledge-Based Recommender Dialog System (D19-1)

Copied to clipboard

Challenge: Existing frameworks that only provide information about user preferences can be inaccurate in e-commerce recommender systems.
Approach: They propose a framework which integrates the recommender system and dialog generation system by introducing information about users’ preferences.
Outcome: The proposed framework can achieve better performance in both dialog generation and recommendation compared with baselines.
Cracking the Code of Hallucination in LVLMs with Vision-aware Head Divergence (2025.acl-long)

Copied to clipboard

Challenge: Existing methods focus on alignment training or decoding refinements but address symptoms at the generation stage without probing the underlying causes.
Approach: They propose a training-free approach to mitigate hallucination by enhancing the role of vision-aware attention heads.
Outcome: The proposed method achieves superior performance compared to state-of-the-art approaches in mitigating hallucinations while maintaining high efficiency with negligible additional time overhead.
Towards Faithful Multi-step Reasoning through Fine-Grained Causal-aware Attribution Reasoning Distillation (2025.coling-main)

Copied to clipboard

Challenge: Recent advances have witnessed large language models (LLMs) achieving significant milestones across various domains of natural language processing.
Approach: They introduce fine-grained attribution reasoning distillation (FARD) which incorporates grounded citations to consolidate the relationships between reasoning steps.
Outcome: The proposed method outperforms CoT distillation methods on mathematical and general reasoning benchmarks.
Compare to The Knowledge: Graph Neural Fake News Detection with External Knowledge (2021.acl-long)

Copied to clipboard

Challenge: Existing methods for fake news detection rely on linguistic and semantic features from news content and do not exploit external knowledge.
Approach: They propose a graph neural model which compares news to knowledge base through entities for fake news detection.
Outcome: The proposed model significantly outperforms state-of-the-art methods on two benchmark datasets.
Learning to Collaborate for Question Answering and Asking (N18-1)

Copied to clipboard

Challenge: Question answering (QA) and question generation (QG) are closely related tasks.
Approach: They propose a training algorithm that generalizes both Generative Adversarial Network and Generating Domain-Adaptive Nets under the question answering scenario.
Outcome: The proposed training algorithm generalizes both Generative Adversarial Network (GAN) and Generating Domain-Adaptive Nets (GDAN) under the question answering scenario.
Leveraging Declarative Knowledge in Text and First-Order Logic for Fine-Grained Propaganda Detection (2020.emnlp-main)

Copied to clipboard

Challenge: Existing methods for fine-grained propaganda detection are not based on input-output data, but instead use declarative knowledge to detect propagandistic text fragments.
Approach: They propose a method to inject declarative knowledge of fine-grained propaganda techniques into training data to get better representations of propagandistic texts.
Outcome: The proposed method achieves superior performance on a large dataset for propaganda detection.
Measuring Social Norms of Large Language Models (2024.findings-naacl)

Copied to clipboard

Challenge: Existing datasets that evaluate a general understanding of social science are inadequate to understand social norms.
Approach: They propose a multi-agent framework to improve large language models’ ability to understand social norms by comparing them to elementary students.
Outcome: The proposed framework improves large language models to be on par with humans.
Machine Reasoning: Technology, Dilemma and Future (2020.emnlp-tutorials)

Copied to clipboard

Challenge: Machine reasoning is a field of research that aims to build interpretable AI systems . Symbolic reasoning methods represent knowledge using symbolic logic, perform inference . probabilistic reasoning methods combine probability and symbolic logic into a unified model .
Approach: This tutorial introduces machine reasoning frameworks and aims to define them . it will show how they can be used to build interpretable AI systems .
Outcome: This tutorial aims to show how machine reasoning frameworks perform in real-world scenarios.

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