Tingxu Han
2026
Debiasing LLMs by Masking Unfairness-Driving Attention Heads
Tingxu Han | Wei Song | Ziqi Ding | Ziming Li | Chunrong Fang | Yuekang Li | Dongfang Liu | Zhenyu Chen | Zhenting Wang
Findings of the Association for Computational Linguistics: ACL 2026
Tingxu Han | Wei Song | Ziqi Ding | Ziming Li | Chunrong Fang | Yuekang Li | Dongfang Liu | Zhenyu Chen | Zhenting Wang
Findings of the Association for Computational Linguistics: ACL 2026
Large language models (LLMs) increasingly mediate decisions in domains where unfair treatment of demographic groups is unacceptable. Existing work probes when biased outputs appear, but gives little insight into the mechanisms that generate them, leaving existing mitigations largely fragile. In this paper, we conduct a systematic investigation of LLM unfairness and propose DiffHeads—a lightweight debiasing framework for LLMs. We first compare Direct-Answer (DA) prompting to Chain-of-Thought (CoT) prompting across eight representative open- and closed-source LLMs. DA will trigger the nature-bias component of the LLM and reduce measured unfairness by 391.9%- 534.5% in both one- and two-turn dialogues. Next, we define a token-to-head contribution score that traces each token’s influence back to individual attention heads. This reveals a small cluster of bias heads that activate under DA but stay largely dormant with CoT, providing the first causal link between prompting strategy and bias emergence. Finally, building on this insight, we propose DiffHeads, which identify bias heads through differential activation analysis between DA and CoT and selectively mask only those heads. DiffHeads reduces unfairness by 49.4%, and 40.3% under DA and CoT, respectively, without harming model utility.
2025
Token-Budget-Aware LLM Reasoning
Tingxu Han | Zhenting Wang | Chunrong Fang | Shiyu Zhao | Shiqing Ma | Zhenyu Chen
Findings of the Association for Computational Linguistics: ACL 2025
Tingxu Han | Zhenting Wang | Chunrong Fang | Shiyu Zhao | Shiqing Ma | Zhenyu Chen
Findings of the Association for Computational Linguistics: ACL 2025
Reasoning is critical for large language models (LLMs) to excel in a wide range of tasks. While methods like Chain-of-Thought (CoT) reasoning and enhance LLM performance by decomposing problems into intermediate steps, they also incur significant overhead in token usage, leading to increased costs. We find that the reasoning process of current LLMs is unnecessarily lengthy and it can be compressed by including a reasonable token budget in the prompt, but the choice of token budget plays a crucial role in the actual compression effectiveness. We then propose a token-budget-aware LLM reasoning framework that dynamically adjusts the number of reasoning tokens based on the reasoning complexity of each problem. Experiments show that our method effectively reduces token costs in CoT reasoning with only a slight performance reduction, offering a practical solution to balance efficiency and accuracy in LLM reasoning. Code: https://github.com/GeniusHTX/TALE.