Papers by Qiang Wu

40 papers
Attention-guided Self-reflection for Zero-shot Hallucination Detection in Large Language Models (2025.emnlp-main)

Copied to clipboard

Challenge: Hallucination is a significant barrier to the effective application of Large Language Models (LLMs).
Approach: They propose an Attention-Guided SElf-Reflection approach for hallucination detection in Large Language Models.
Outcome: The proposed method significantly outperforms existing methods in zero-shot hallucination detection on four widely-used LLMs across three different halluciation benchmarks.
OmniCharacter: Towards Immersive Role-Playing Agents with Seamless Speech-Language Personality Interaction (2025.acl-long)

Copied to clipboard

Challenge: Existing methods focus on replicating dialogues in textual form, neglecting the role’s voice traits as a crucial effect in interaction, which tends to be more immersive experiences in realistic scenarios.
Approach: They propose a first seamless speech-language personality interaction model to achieve immersive RPAs with low latency.
Outcome: The proposed model exhibits role-specific personality traits and vocal traits throughout the interaction, enabling a mixture of speech and language responses.
Logical Closed Loop: Uncovering Object Hallucinations in Large Vision-Language Models (2024.findings-acl)

Copied to clipboard

Challenge: Object hallucination has been an Achilles’ heel which hinders the broader applications of large vision-language models (LVLMs).
Approach: They propose a logical closed loop-based framework for Object Hallucination Detection and Mitigation that uses logical consistency probing to raise questions with logical correlations to determine hallucinations.
Outcome: The proposed method can be applied to all existing LVLMs and is effective and general.
RealChart2Code: Bridging the Gap in Real-World Chart-to-Code Generation via Multi-Task Evaluation (2026.acl-long)

Copied to clipboard

Challenge: Vision-Language Models (VLMs) have demonstrated impressive capabilities in code generation across various domains, but their ability to replicate complex, multi-panel visualizations remains largely unassessed.
Approach: They propose a large-scale benchmark to evaluate chart generation from large- scale raw data and assess iterative code refinement in a multi-turn conversational setting.
Outcome: The new benchmark evaluates 14 leading VLMs on real-world data and shows they struggle with complex plot structures and authentic data.
SINCon: Mitigate LLM-Generated Malicious Message Injection Attack for Rumor Detection (2025.acl-long)

Copied to clipboard

Challenge: Existing methods define important nodes as important and target them for attacks if the model treats nodes’ predictive influence more uniformly . Existing approaches target high predictive influence nodes but are vulnerable to malicious message injection attacks.
Approach: They propose a defense mechanism that encourages the model to learn graph representations where nodes with varying importance have a more uniform influence on predictions.
Outcome: Extensive experiments on the Twitter and Weibo datasets show that similarizing the predictive Influence of nodes with Contrastive Learning significantly enhances resistance against LLM-driven message injection attacks.
Personalized Text Generation with Contrastive Activation Steering (2025.acl-long)

Copied to clipboard

Challenge: Existing approaches to personalized text generation rely on retrieval-augmented generation and parameter-efficient fine-tuning.
Approach: They propose a training-free framework that disentangles and represents personalized writing style as a vector in LLM’s activation-space.
Outcome: The proposed framework achieves 8% relative improvement in personalized generation while reducing storage requirements by 1700 over PEFT method.
Mixture of Decoding: An Attention-Inspired Adaptive Decoding Strategy to Mitigate Hallucinations in Large Vision-Language Models (2025.findings-acl)

Copied to clipboard

Challenge: Large Vision-Language Models (LVLMs) have impressive capabilities across visual tasks, yet they remain hindered by the persistent challenge of hallucinations.
Approach: They propose a novel approach that dynamically adapts decoding strategies by evaluating the correctness of the model’s attention on image tokens to distinguish the correct attention.
Outcome: Extensive experiments show that the proposed approach outperforms existing decoding methods across multiple mainstream benchmarks, effectively mitigating hallucinations in LVLMs.
PersonaX: A Recommendation Agent-Oriented User Modeling Framework for Long Behavior Sequence (2025.findings-acl)

Copied to clipboard

Challenge: Existing methods for user profile modeling extract only partial segments from full historical behavior sequence, resulting in incomplete modeling and suboptimal profiling.
Approach: They propose an agent-agnostic LLM-UM framework to augment downstream recommendation agents . it segments complete historical behaviors into clustered groups and performs offline multi-persona profiling .
Outcome: The proposed framework improves agent performance and inference efficiency by 31% and 10% using 30–50% of behavioral data.
KELE: Residual Knowledge Erasure for Enhanced Multi-hop Reasoning in Knowledge Editing (2025.findings-emnlp)

Copied to clipboard

Challenge: Existing knowledge editing techniques show limitations when applied to multi-hop reasoning . residual single-hop knowledge causes edited models to revert to original answers .
Approach: They propose a knowledge editing method that incorporates a Knowledge Erasure mechanism for Large language model Editing (KELE) they propose an erasure function for residual knowledge and an injection function for new knowledge .
Outcome: The proposed method significantly improves multi-hop reasoning capability of edited models.
EX-FEVER: A Dataset for Multi-hop Explainable Fact Verification (2024.findings-acl)

Copied to clipboard

Challenge: Existing studies on fact verification lack a high-quality dataset for explainability . existing systems lack evidence retrieval and veracity prediction, limiting the ability to verify a claim .
Approach: They propose a dataset for multi-hop explainable fact verification that summarises and modifies Wikipedia documents.
Outcome: The proposed dataset aims to improve the accuracy of multi-hop explainable fact verification systems.
Generate First, Then Sample: Enhancing Fake News Detection with LLM-Augmented Reinforced Sampling (2025.acl-long)

Copied to clipboard

Challenge: Existing models have a performance gap of 20% between classifying fake news and real news, making them less suitable for practical deployment.
Approach: They propose to adopt an LLM to generate fake news in three different styles, which are later incorporated into the training set to augment the representation of fake news.
Outcome: The proposed model achieves state-of-the-art performance on two benchmark datasets and improves detection accuracy by 24.02% and 11.06% respectively.
Improving Temporal Relation Extraction with a Globally Acquired Statistical Resource (N18-1)

Copied to clipboard

Challenge: Existing temporal extraction systems that extract temporal relations can be improved by using a resource that provides prior knowledge of the temporal order that events usually follow.
Approach: They propose to use a probabilistic knowledge base acquired in the news domain to extract temporal relations between events from the New York Times articles over a 20-year span.
Outcome: The proposed system and resource are both publicly available.
Context-Fidelity Boosting: Enhancing Faithful Generation through Watermark-Inspired Decoding (2026.findings-acl)

Copied to clipboard

Challenge: Large language models produce content that contradicts or overlooks information provided in the input context, a phenomenon known as faithfulness hallucination.
Approach: They propose a lightweight framework that boosts the generation probability of context-relevant tokens by boosting the generation of tokens.
Outcome: The proposed framework improves faithfulness metrics with minimal generation overhead.
Chain-of-History Reasoning for Temporal Knowledge Graph Forecasting (2024.findings-acl)

Copied to clipboard

Challenge: Existing graph-based models excel at capturing structural information within TKGs but lack semantic comprehension abilities.
Approach: They propose a plug-and-play module to enhance the performance of graph-based TKG models by exploring high-order histories step-by-step.
Outcome: Experiments on three datasets and backbones show that CoH is effective in capturing high-order historical information for LLMs.
Easy, Reproducible and Quality-Controlled Data Collection with CROWDAQ (2020.emnlp-demos)

Copied to clipboard

Challenge: Efficient data collection is important for advancing research and building time-sensitive applications.
Approach: They propose an open-source platform that standardizes the data collection pipeline . it includes customizable user interface components, automated annotator qualification, and saved pipelines .
Outcome: The proposed platform simplifies data annotation significantly on diverse datasets . it can be used by researchers and engineers to improve reproducibility and minimize overhead .
MorphoBench: A Benchmark with Difficulty Adaptive to Model Reasoning (2026.findings-acl)

Copied to clipboard

Challenge: Existing benchmarks designed to evaluate the reasoning capabilities of large models are limited in scope and lack flexibility to adapt difficulty according to evolving reasoning capacities of models.
Approach: They propose a benchmark that incorporates multidisciplinary questions to evaluate the reasoning capabilities of large models and can adjust and update question difficulty based on the reasoning abilities of advanced models.
Outcome: The proposed benchmark incorporates multidisciplinary questions to evaluate the reasoning capabilities of large models and can adjust and update question difficulty based on the reasoning abilities of advanced models.
Advancing Event Causality Identification via Heuristic Semantic Dependency Inquiry Network (2024.emnlp-main)

Copied to clipboard

Challenge: Existing methods for ECI rely on causal features and external knowledge, but these methods fail in two dimensions: causal features between events in texts often lack explicit clues and external information may introduce bias.
Approach: They propose a simple and effective Semantic Dependency Inquiry Network for ECI that captures semantic dependencies within the context using a unified encoder and generates a fill-in token based on comprehensive context understanding.
Outcome: Extensive experiments show that SemDI surpasses state-of-the-art methods on three widely used benchmarks.
The Staircase of Ethics: Probing LLM Value Priorities through Multi-Step Induction to Complex Moral Dilemmas (2025.emnlp-main)

Copied to clipboard

Challenge: Existing evaluations of LLMs' moral reasoning capabilities rely on single-step evaluations, ignoring how models adapt to evolving ethical challenges.
Approach: They propose a framework to evaluate evolving moral judgments of large language models (LLMs) using multi-step moral dilemma questionnaires.
Outcome: The proposed framework enables a fine-grained analysis of how LLMs adjust their moral reasoning across escalating dilemmas.
Chinese Idiom Paraphrasing (2023.tacl-1)

Copied to clipboard

Challenge: Chinese idioms are hard to understand by children and non-native speakers due to their non-compositionality and metaphorical meaning.
Approach: They propose a task to rephrase idiom-containing sentences to non-idiomatic ones under the premise of preserving the original sentence’s meaning.
Outcome: The proposed method has better performance than baselines based on the established dataset.
A2ATS: Retrieval-Based KV Cache Reduction via Windowed Rotary Position Embedding and Query-Aware Vector Quantization (2025.findings-acl)

Copied to clipboard

Challenge: Long context large language models (LLMs) pose significant challenges for efficient serving due to the large memory footprint and high access overhead of KV cache.
Approach: They propose a retrieval-based method to reduce the memory footprint of LLMs . they propose Windowed Rotary Position Embedding and query-aware vector quantization .
Outcome: The proposed method can achieve lower performance degradation with lower overhead compared to existing methods . it can reduce the memory footprint and access overhead of long context large language models .
Knowledge Graph Enhanced Large Language Model Editing (2024.emnlp-main)

Copied to clipboard

Challenge: Existing methods for editing large language models struggle to track and incorporate changes in knowledge associated with edits, which limits the generalization ability of post-edit LLMs in processing edited knowledge.
Approach: They propose a model editing method that leverages knowledge graphs to enhance LLM editing by capturing changes in associated knowledge by constructing an external graph.
Outcome: The proposed method improves the generalization ability of LLMs in processing edited knowledge.
Mathematical Word Problem Generation from Commonsense Knowledge Graph and Equations (2021.emnlp-main)

Copied to clipboard

Challenge: Existing models for generating mathematical word problems are lacking in educational assessment.
Approach: They propose an end-to-end neural model to generate diverse mathematical word problems from commonsense knowledge graph and equations.
Outcome: The proposed model outperforms the SOTA models in terms of evaluation metrics and topic relevance.
Counterfactual Debiasing for Fact Verification (2023.acl-long)

Copied to clipboard

Challenge: Existing methods for debiasing factchecking models learn such biases instead of understanding the semantic relationship between the claim and evidence.
Approach: They propose a counterfactual framework CLEVER which is augmentation-free and mitigates biases on the inference stage.
Outcome: The proposed method is augmentation-free and mitigates biases on the inference stage.
Learning Latent Relations for Temporal Knowledge Graph Reasoning (2023.acl-long)

Copied to clipboard

Challenge: Existing methods for Temporal Knowledge Graph reasoning capture intra- and inter-time latent relations between entities that appear at different times.
Approach: They propose a Latent relations Learning method for TKG reasoning that captures latent relations between entities at different times.
Outcome: The proposed method exploits the intra- and inter-time latent relations of entities at different times.
MetaTKG: Learning Evolutionary Meta-Knowledge for Temporal Knowledge Graph Reasoning (2022.emnlp-main)

Copied to clipboard

Challenge: Existing models rely on historical information to learn embeddings for entities, but ignore the evolution of facts.
Approach: They propose a Temporal Meta-learning framework to learn evolutionary meta-knowledge from TKGs.
Outcome: The proposed method improves on four widely-used datasets and three backbones on a wide range of scenarios on tKGs.
ALYMPICS: LLM Agents Meet Game Theory (2025.coling-main)

Copied to clipboard

Challenge: Alympics provides a framework for simulating human-like strategic interactions with Large Language Model (LLM) agents.
Approach: They propose a framework utilizing Large Language Models (LLM) agents for empirical game theory research.
Outcome: The proposed framework can be used to study human-like strategic interactions with large language model (LLM) agents in a game on the multi-round auction of scarce survival resources.
SHARP: Steering Hallucination in LVLMs via Representation Engineering (2025.emnlp-main)

Copied to clipboard

Challenge: Large Vision-Language Models (LVLMs) generate responses that are plausible but incorrect or unsupported—commonly referred to as hallucinations.
Approach: They propose a representation-level intervention framework that modulates hallucination-related features during inference by probing their encoded features.
Outcome: The proposed framework reduces hallucinations while maintaining the performance and generalization capabilities of Large Vision-Language Models (LVLMs).
TORQUE: A Reading Comprehension Dataset of Temporal Ordering Questions (2020.emnlp-main)

Copied to clipboard

Challenge: Current machine reading comprehension benchmarks have no questions that test temporal phenomena . a new study studies reading comprehension for temporal relations .
Approach: They propose a reading comprehension benchmark built on news snippets and 21k human-generated questions querying temporal relationships.
Outcome: The new reading comprehension benchmark TORQUE achieves an exact-match score of 51% on the test set . the benchmark is built on 3.2k news snippets with 21k human-generated questions .
A Meta-framework for Spatiotemporal Quantity Extraction from Text (2022.acl-long)

Copied to clipboard

Challenge: a meta-framework for news events that extracts quantities from text is proposed . a previous work on news events focused on extracting event mentions, attributes, and relationships .
Approach: They propose a meta-framework for solving the NLP problem of spatiotemporal quantity extraction . they demonstrate the framework is general and extensible, and shareable crowdsourcing pipeline and baseline models are used .
Outcome: The proposed framework is general and extensible, the authors say . it can extract quantity from news streams, quickly respond to emergencies, investigate incidents .
Boosting LLM’s Molecular Structure Elucidation with Knowledge Enhanced Tree Search Reasoning (2025.acl-long)

Copied to clipboard

Challenge: Molecular structure elucidation involves deducing a molecule’s structure from various types of spectral data, which is crucial in chemical experimental analysis.
Approach: They propose a Knowledge-enhanced reasoning framework for Molecular Structure Elucidation that leverages Monte Carlo Tree Search for test-time scaling as a plugin to extend the LLMs’ coverage of the chemical structure space.
Outcome: The proposed framework significantly improves on both GPT-4o-mini and GPT4o, and a specialized molecule-spectrum scorer improves performance.
A Multi-Axis Annotation Scheme for Event Temporal Relations (P18-1)

Copied to clipboard

Challenge: Existing temporal relation (TempRel) annotation schemes have low inter-annotator agreements even between experts, suggesting that the current annotation task needs a better definition.
Approach: They propose to annotate temporal relation (TempRel) annotation schemes based on event start-points instead of a conventional 60’s-80’s model.
Outcome: The proposed model improves IAA from the conventional 60’s to 80’s and can be used by crowdsourcing to alleviate labor intensity.
Evaluating the Expressive Appropriateness of Speech in Rich Contexts (2026.acl-long)

Copied to clipboard

Challenge: Existing methods for evaluating expressive speech focus on word accuracy, naturalness, signal quality, or emotional intensity at the utterance level.
Approach: They propose a framework for Evaluating Expressive Appropriateness in speech that assesses whether a speech sample aligns with the underlying communicative intent implied by its discourse-level narrative context.
Outcome: The proposed framework outperforms existing speech evaluation and analysis systems on a human-annotated test set.
Stealthy Attack on Large Language Model based Recommendation (2024.acl-long)

Copied to clipboard

Challenge: Recent advances in recommender systems have been overlooked due to their emphasis on textual content.
Approach: They propose to introduce large language models into recommendation models to exploit the semantic understanding and strong transferability of LLMs.
Outcome: The proposed approach significantly boosts an item’s exposure by altering its textual content during the testing phase, without requiring direct interference with the model’s training process.
REACT: Representation Extraction And Controllable Tuning to Overcome Overfitting in LLM Knowledge Editing (2025.emnlp-main)

Copied to clipboard

Challenge: Large language model editing methods suffer from overfitting, where factual updates can propagate beyond their intended scope, overemphasizing the edited target even when it’s contextually inappropriate.
Approach: They propose a framework for precise and controllable knowledge editing that utilizes two-phase representations and a linear transformation to compute a directional "belief shift" vector.
Outcome: The proposed framework significantly reduces overfitting across nearly all evaluation metrics and on COUNTERFACT and MQuAKE.
Model-based Large Language Model Customization as Service (2025.emnlp-main)

Copied to clipboard

Challenge: Existing large language model services require users to upload data for fine-tuning . current methods for customization are noisy and require sensitive domain data .
Approach: *Llamdex is a framework that facilitates LLM customization as a service . client uploads pre-trained domain-specific *models* rather than data .
Outcome: *Llamdex* framework improves domain-specific accuracy by up to 26% over state-of-the-art private data synthesis methods .
CPRM: A LLM-based Continual Pre-training Framework for Relevance Modeling in Commercial Search (2025.naacl-industry)

Copied to clipboard

Challenge: Relevance modeling between queries and items is a key component of commercial search engines.
Approach: They propose a framework for continual pre-training of LLMs to enhance domain knowledge . they employ queries and multi-field item to jointly pre-train for enhancing domain knowledge.
Outcome: The proposed model achieves convincing performance compared to strong baselines.
Divide-Then-Align: Honest Alignment based on the Knowledge Boundary of RAG (2025.acl-long)

Copied to clipboard

Challenge: Large language models (LLMs) augmented with retrieval systems have significantly advanced natural language processing tasks by integrating external knowledge sources.
Approach: They propose a method that conditions large language models to generate answers even in the absence of reliable knowledge.
Outcome: The proposed approach balances accuracy with appropriate abstention, enhancing the reliability and trustworthiness of retrieval-augmented systems.
Joint Reasoning for Temporal and Causal Relations (P18-1)

Copied to clipboard

Challenge: a cause must occur earlier than its effect, temporal and causal relations are closely related . a joint inference framework is developed for studying temporal, causal relations .
Approach: They propose a joint inference framework for temporal and causal relations . they use constraints inherent in time and causality to enforce constraints .
Outcome: The proposed framework improves extraction of temporal and causal relations from text.
Noise-Robust Semi-Supervised Learning for Distantly Supervised Relation Extraction (2023.findings-emnlp)

Copied to clipboard

Challenge: Distantly supervised relation extraction (DSRE) methods are not capable of extracting relation labels for individual sentences.
Approach: They propose a semi-supervised learning relation extraction framework for sentence-level DSRE . they discard only the labels of the noisy samples and utilize them as unlabeled samples .
Outcome: The proposed framework achieves significant performance enhancements on two real-world datasets.
RLShield: Dynamic Jailbreak Detection for LLMs via Reinforced Adaptive Learning (2026.findings-acl)

Copied to clipboard

Challenge: Existing approaches to detect jailbreak prompts rely on static model components or fixed decision thresholds.
Approach: They propose a dynamic jailbreak detection framework that employs reinforcement learning for adaptive threshold selection.
Outcome: Experimental results show that the framework outperforms baselines in detection performance while maintaining high computational efficiency.

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