Papers by Huazheng Wang

12 papers
Erasing Without Remembering: Implicit Knowledge Forgetting in Large Language Models (2026.acl-long)

Copied to clipboard

Challenge: a new method for unlearning large language models is proposed to improve the performance of large language model models.
Approach: They propose a probability perturbation-based unlearning paradigm that allows models to forget implicit knowledge in large language models with a focus on generalisation.
Outcome: The proposed model improves unlearning vanilla target data while forgetting implicit knowledge.
TreeBoN: Enhancing Inference-Time Alignment with Speculative Tree-Search and Best-of-N Sampling (2025.findings-emnlp)

Copied to clipboard

Challenge: Best-of-N (BoN) sampling generates multiple responses and selects the best one, achieving improved performance but with a high computational cost.
Approach: They propose a framework that integrates a speculative tree-search strategy into Best-of-N (BoN) Sampling.
Outcome: The proposed framework outperforms Best-of-N (BoN) sampling but has high computational cost . tree-search strategy reduces computational overhead while maintaining high output quality .
Adversarial Domain Adaptation for Machine Reading Comprehension (D19-1)

Copied to clipboard

Challenge: Existing models for machine reading comprehension rely on large amounts of human-annotated in-domain data.
Approach: They propose an unsupervised domain adaptation framework for Machine Reading Comprehension where the source domain has a large amount of labeled data, while only unlabeled passages are available in the target domain.
Outcome: The proposed framework can be generalizable to different MRC models and datasets and can be extended to semi-supervised learning.
MDR: Model-Specific Demonstration Retrieval at Inference Time for In-Context Learning (2024.naacl-long)

Copied to clipboard

Challenge: Existing methods for retrieval-based in-context learning ignore model biases and fail to retrieve the most appropriate demonstrations for different LLMs.
Approach: They propose a model-specific demonstration retrieval method that considers the biases of different LLMs at inference time.
Outcome: The proposed method improves performance on seen and unseen tasks with multi-scale inference LLMs by up to 41.2%.
Unveiling Internal Reasoning Modes in LLMs: A Deep Dive into Latent Reasoning vs. Factual Shortcuts with Attribute Rate Ratio (2025.emnlp-main)

Copied to clipboard

Challenge: Existing research in multi-hop questions has identified two reasoning modes, but has not investigated how these modes differ during inference.
Approach: They propose a classification metric that compares latent reasoning and factual shortcuts in multi-hop questions.
Outcome: The proposed metric achieves 90% accuracy on the proposed datasets and demonstrates effectiveness in RAG conflict scenarios.
SSS: Editing Factual Knowledge in Language Models towards Semantic Sparse Space (2024.findings-acl)

Copied to clipboard

Challenge: Existing methods to modify LMs suffer from sub-optimal locality, where irrelevant neighborhood examples can be adversely influenced.
Approach: They propose to use a model editing method to modify specific examples in LMs to improve locality and reasoning capability by directing the hidden state of edit example towards spaces where semantics are sparse.
Outcome: The proposed method improves locality and reasoning capability on two datasets.
The Threat of PROMPTS in Large Language Models: A System and User Prompt Perspective (2025.findings-acl)

Copied to clipboard

Challenge: Prompts are essential for guiding model output and influencing content generation.
Approach: They propose to attack models with prompt leakage and prompt jailbreak attacks . they summarize the experimental setups of these methods and explore the relationship between prompt threats and prompt injection attacks.
Outcome: The proposed methods summarize the experimental setups and examine the relationship between prompt threats and prompt injection attacks.
The Ranking Blind Spot: Decision Hijacking in LLM-based Text Ranking (2025.emnlp-main)

Copied to clipboard

Challenge: Large Language Models (LLMs) have demonstrated strong performance in information retrieval tasks like passage ranking.
Approach: They propose two attacks that aim to force the LLM ranker to prefer a specific passage and rank it at the top.
Outcome: The proposed attacks aim to force the LLM ranker to prefer a specific passage and rank it at the top.
Divide, Optimize, Merge: Scalable Fine-Grained Generative Optimization for LLM Agents (2025.findings-emnlp)

Copied to clipboard

Challenge: LLM-based generative optimization has shown remarkable potential in improving agentic systems, but the current approach of prompting with the trajectories on the whole training dataset becomes untenable as datasets grow.
Approach: They propose a scalable framework that divides large optimization tasks into manageable subsets and performs targeted optimizations.
Outcome: The proposed framework outperforms conventional approach by 1.6-8.6% while reducing average prompt token consumption by 56.3%.
Evaluating and Mitigating Object Hallucination in Large Vision-Language Models: Can They Still See Removed Objects? (2025.naacl-long)

Copied to clipboard

Challenge: LVLMs often mistakenly determine objects as present in images where they do not exist . authors propose a new benchmark to evaluate object hallucinations by removing objects from images and asking the model whether it can still see the removed objects.
Approach: They propose a benchmark to evaluate object hallucinations by removing objects from images . they propose oDPO, a direct preference optimization objective based on visual objects .
Outcome: The proposed benchmark reduces the likelihood of object hallucinations by removing objects from images and asking the model whether it can still see the removed objects.
Example Quality Matters: Multi-Aspects Example Augmentation for Private Library Programming (2026.acl-long)

Copied to clipboard

Challenge: Existing approaches to code generation fail to consider the quality of retrieved examples.
Approach: They propose a retrieval-augmented generation method that combines existing API examples to improve complexity and readability.
Outcome: The proposed method achieves up to 22% accuracy improvement over baseline methods.
SimpleDoc: Multi‐Modal Document Understanding with Dual‐Cue Page Retrieval and Iterative Refinement (2025.emnlp-main)

Copied to clipboard

Challenge: Document Visual Question Answering (DocVQA) is a task to answer questions based on documents containing text, tables, and images.
Approach: They propose a lightweight retrieval framework that uses visual language models to embed and retrieve relevant pages as images and generate answers with VLMs that can accept an image as input.
Outcome: The proposed framework outperforms baselines by 3.2% on average on 4 DocVQA datasets with much fewer pages retrieved.

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