Haolun Wu
2026
Context-Fidelity Boosting: Enhancing Faithful Generation through Watermark-Inspired Decoding
Weixu Zhang | Fanghua Ye | Qiang Gao | Jian Li | Haolun Wu | Yuxing Tian | Sijing Duan | Nan Du | Xiaolong Li
Findings of the Association for Computational Linguistics: ACL 2026
Weixu Zhang | Fanghua Ye | Qiang Gao | Jian Li | Haolun Wu | Yuxing Tian | Sijing Duan | Nan Du | Xiaolong Li
Findings of the Association for Computational Linguistics: ACL 2026
Large language models (LLMs) often produce content that contradicts or overlooks information provided in the input context, a phenomenon known as faithfulness hallucination. In this paper, we propose Context-Fidelity Boosting (CFB), a lightweight and general decoding-time framework that effectively reduces such hallucinations by boosting the generation probability of context-relevant tokens. Motivated by logit-shaping principles in watermarking techniques, CFB leverages token-level logit adjustments based on their presence or salience in the input context. Specifically, we develop three boosting strategies, static, context-aware, and token-aware that progressively incorporate distributional divergence, attention scores, and semantic similarity. Notably, CFB requires no retraining or architectural changes, making it compatible with a wide range of LLMs. Experiments on summarization and question answering tasks across multiple open-source LLMs show that CFB consistently improves faithfulness metrics, with minimal generation overhead. Our implementation is fully open-sourced.
LLM Safety From Within: Detecting Harmful Content with Internal Representations
Difan Jiao | Yilun Liu | Ye Yuan | Zhenwei Tang | Linfeng Du | Haolun Wu | Ashton Anderson
Proceedings of the 64th Annual Meeting of the Association for Computational Linguistics (Volume 1: Long Papers)
Difan Jiao | Yilun Liu | Ye Yuan | Zhenwei Tang | Linfeng Du | Haolun Wu | Ashton Anderson
Proceedings of the 64th Annual Meeting of the Association for Computational Linguistics (Volume 1: Long Papers)
Guard models are widely used to detect harmful content in user prompts and LLM responses. However, state-of-the-art guard models rely solely on terminal-layer representations and overlook the rich safety-relevant features distributed across internal layers. We present SIREN, a lightweight guard model that harnesses these internal features. By identifying safety neurons via linear probing and combining them through an adaptive layer-weighted strategy, SIREN builds a harmfulness detector from LLM internals without modifying the underlying model. Our comprehensive evaluation shows that SIREN substantially outperforms state-of-the-art open-source guard models across multiple benchmarks while using 250× fewer trainable parameters. Moreover, SIREN exhibits superior generalization to unseen benchmarks, naturally enables real-time streaming detection, and significantly improves inference efficiency compared to generative guard models. Overall, our results highlight LLM internal states as a promising foundation for practical, high-performance harmfulness detection.
Optimizing User Profiles via Contextual Bandits for Retrieval-Augmented LLM Personalization
Linfeng Du | Ye Yuan | Zichen Zhao | Fuyuan Lyu | Emiliano Penaloza | Xiuying Chen | Zipeng Sun | Jikun Kang | Laurent Charlin | Xue Liu | Haolun Wu
Proceedings of the 64th Annual Meeting of the Association for Computational Linguistics (Volume 1: Long Papers)
Linfeng Du | Ye Yuan | Zichen Zhao | Fuyuan Lyu | Emiliano Penaloza | Xiuying Chen | Zipeng Sun | Jikun Kang | Laurent Charlin | Xue Liu | Haolun Wu
Proceedings of the 64th Annual Meeting of the Association for Computational Linguistics (Volume 1: Long Papers)
Large language models (LLMs) excel at general-purpose tasks, yet adapting their responses to individual users remains challenging. Retrieval augmentation provides a lightweight alternative to fine-tuning by conditioning LLMs on user history records, and existing approaches typically select these records based on semantic relevance. We argue that relevance serves as an unreliable proxy for utility: a record may be semantically similar to a query yet fail to improve generation quality or even degrade it due to redundancy or conflicting information. To bridge this gap, we propose PURPLE, a contextual bandit framework that oPtimizes UseR Profiles for LLM pErsonalization. In contrast to a greedy selection of the most relevant records, PURPLE treats profile construction as an order-sensitive generation process and utilizes a Plackett-Luce ranking model to capture complex inter-record dependencies. By training with semantically rich feedback provided by the likelihood of the reference response, our method aligns retrieval directly with generation quality. Extensive experiments on nine personalization tasks demonstrate that PURPLE consistently outperforms strong heuristic and retrieval-augmented baselines in both effectiveness and efficiency, establishing a principled and scalable solution for optimizing user profiles.
Preference Heads in Large Language Models: A Mechanistic Framework for Interpretable Personalization
Weixu Zhang | Ye Yuan | Changjiang Han | Yuxing Tian | Zipeng Sun | Linfeng Du | Jikun Kang | Hong Kang | Xue Liu | Haolun Wu
Proceedings of the 64th Annual Meeting of the Association for Computational Linguistics (Volume 1: Long Papers)
Weixu Zhang | Ye Yuan | Changjiang Han | Yuxing Tian | Zipeng Sun | Linfeng Du | Jikun Kang | Hong Kang | Xue Liu | Haolun Wu
Proceedings of the 64th Annual Meeting of the Association for Computational Linguistics (Volume 1: Long Papers)
Large Language Models (LLMs) exhibit strong implicit personalization ability, yet most existing approaches treat this behavior as a black box, relying on prompt engineering or fine tuning on user data. In this work, we adopt a mechanistic interpretability perspective and hypothesize the existence of a sparse set of Preference Heads, attention heads that encode user specific stylistic and topical preferences and exert a causal influence on generation. We introduce Differential Preference Steering (DPS), a training free framework that (1) identifies Preference Heads through causal masking analysis and (2) leverages them for controllable and interpretable personalization at inference time. DPS computes a Preference Contribution Score (PCS) for each attention head, directly measuring its causal impact on user aligned outputs. During decoding, we contrast model predictions with and without Preference Heads, amplifying the difference between personalized and generic logits to selectively strengthen preference aligned continuations. Experiments on widely used personalization benchmarks across multiple LLMs demonstrate consistent gains in personalization fidelity while preserving content coherence and low computational overhead. Beyond empirical improvements, DPS provides a mechanistic explanation of where and how personalization emerges within transformer architectures.
GlossaGen: Making Academic Translation Smarter with Glossing
Zixiao Wang | Duzhen Zhang | Juntian Zhang | Yuhan Liu | Guoming Li | Haolun Wu | Le Song | Xiuying Chen
Findings of the Association for Computational Linguistics: ACL 2026
Zixiao Wang | Duzhen Zhang | Juntian Zhang | Yuhan Liu | Guoming Li | Haolun Wu | Le Song | Xiuying Chen
Findings of the Association for Computational Linguistics: ACL 2026
When reading foreign-language literature, non-native users often face significant challenges. Existing traditional machine translation systems tend to obscure or mistranslate key terminology, while paraphrasing aimed at lay readers often oversimplifies it, thereby hindering their ability to master domain-specific technical vocabulary. To bridge this gap, we first define a novel task, Glossing-Oriented Academic Translation (GOAT), which aims to produce translations dynamically adapted to a reader’s academic proficiency, or level. We then propose GlossaGen, a comprehensive framework to address this task. GlossaGen features two key innovations: a multi-agent data synthesis pipeline that leverages academic personas to automatically generate a large-scale, structured dataset with level-specific explanations; and a novel training strategy based on dynamic adapter merging, which balances task generalization with user-level specialization by combining a ”generalist” adapter with a fine-grained ”expert” one. We evaluate GlossaGen on our synthesized benchmark, where results from automatic metrics, large language model (LLM)-based assessments, and human evaluations consistently demonstrate that our approach achieves higher scores than strong baselines across most metrics. Our framework provides a scalable pathway to enhance the comprehensibility of scientific literature for non-native readers, delivering more accurate translations accompanied by pedagogically sound, level-specific term explanations, and we release our code and data to facilitate further research.
2024
Learning to Extract Structured Entities Using Language Models
Haolun Wu | Ye Yuan | Liana Mikaelyan | Alexander Meulemans | Xue Liu | James Hensman | Bhaskar Mitra
Proceedings of the 2024 Conference on Empirical Methods in Natural Language Processing
Haolun Wu | Ye Yuan | Liana Mikaelyan | Alexander Meulemans | Xue Liu | James Hensman | Bhaskar Mitra
Proceedings of the 2024 Conference on Empirical Methods in Natural Language Processing
Recent advances in machine learning have significantly impacted the field of information extraction, with Language Models (LMs) playing a pivotal role in extracting structured information from unstructured text. Prior works typically represent information extraction as triplet-centric and use classical metrics such as precision and recall for evaluation. We reformulate the task to be entity-centric, enabling the use of diverse metrics that can provide more insights from various perspectives. We contribute to the field by introducing Structured Entity Extraction and proposing the Approximate Entity Set OverlaP (AESOP) metric, designed to appropriately assess model performance. Later, we introduce a new Multistage Structured Entity Extraction (MuSEE) model that harnesses the power of LMs for enhanced effectiveness and efficiency by decomposing the extraction task into multiple stages. Quantitative and human side-by-side evaluations confirm that our model outperforms baselines, offering promising directions for future advancements in structured entity extraction. Our source code is available at https://github.com/microsoft/Structured-Entity-Extraction.
Search
Fix author
Co-authors
- Ye Yuan 4
- Linfeng Du 3
- Xue Liu 3
- Xiuying Chen 2
- Jikun Kang 2
- Zipeng Sun 2
- Yuxing Tian 2
- Weixu Zhang 2
- Ashton Anderson 1
- Laurent Charlin 1
- Nan Du 1
- Sijing Duan 1
- Qiang Gao 1
- Changjiang Han 1
- James Hensman 1
- Difan Jiao 1
- Hong Kang 1
- Jian Li 1
- Xiaolong Li 1
- Guoming Li 1
- Yilun Liu 1
- Yuhan Liu 1
- Fuyuan Lyu 1
- Alexander Meulemans 1
- Liana Mikaelyan 1
- Bhaskar Mitra 1
- Emiliano Penaloza 1
- Le Song 1
- Zhenwei Tang 1
- Zixiao Wang 1
- Fanghua Ye 1
- Duzhen Zhang 1
- Juntian Zhang 1
- Zichen Zhao 1