Wei Zhang
Author directoryOther people with similar names: Wei Zhang, Wei Zhang, Wei Zhang, Wei Zhang, Wei Zhang, Wei Zhang, Wei Zhang, Wei Zhang, Wei Zhang, Wei Zhang, Wei Zhang
Unverified author pages with similar names: Wei Zhang
2026
Why Are LLM Backdoor Defenses Fragmented? A Feature-Level Explanation with Sparse Autoencoders
Yizhe Zeng | Chenxu Niu | Wei Zhang | Hao Huang | Yunpeng Li | Handongxu | Dan Du | Cheng Hong | Hequn Xian | Yuling Liu
Findings of the Association for Computational Linguistics: EMNLP 2026
Yizhe Zeng | Chenxu Niu | Wei Zhang | Hao Huang | Yunpeng Li | Handongxu | Dan Du | Cheng Hong | Hequn Xian | Yuling Liu
Findings of the Association for Computational Linguistics: EMNLP 2026
Backdoor attacks pose a serious threat to large language models (LLMs), but existing defenses remain fragmented, failing to provide unified defense against both dirty-label and clean-label attacks. To investigate why such fragmentation arises, we present the first systematic feature-level mechanistic analysis of LLM backdoors using sparse autoencoders (SAEs). Starting from a 2×2 comparison of clean and poisoned models on clean and triggered inputs, we trace backdoor-induced logit shifts to high-contributing SAE features and categorize them into four roles: interaction, suppressed, mixed, and weight-modified features. This taxonomy reveals systematic encoding differences: dirty-label backdoors are dominated by isolated interaction features, whereas clean-label backdoors rely more on heterogeneous mixtures of mixed and weight-modified features. These differences explain why existing defenses remain fragmented across attack paradigms. We validate this hypothesis through inference-time feature clamping, which reduces ASR to at most **10.8%** in most dirty-label settings and at most **15.4%** in the majority of clean-label settings, while preserving benign-task performance. These results show that SAE-based analysis can explain defense fragmentation and guide interpretable backdoor mitigation.
SAGE: An Extensible Benchmark for Service Agent Graph-guided Evaluation
Ling Shi | Yuqin Dai | Ziyin Wang | Wei Zhang | Ning Gao | Chaozheng Wang | Xinwei Wu | Yujie Wang | Wei He | Jinpeng Wang | Linlong Xu | Deyi Xiong
Findings of the Association for Computational Linguistics: EMNLP 2026
Ling Shi | Yuqin Dai | Ziyin Wang | Wei Zhang | Ning Gao | Chaozheng Wang | Xinwei Wu | Yujie Wang | Wei He | Jinpeng Wang | Linlong Xu | Deyi Xiong
Findings of the Association for Computational Linguistics: EMNLP 2026
LLMs are transforming customer service, yet evaluating service agents across diverse business scenarios remains costly and fragmented, as each new domain requires building a dedicated benchmark from scratch. Existing benchmarks rely on static, scenario-specific scripts with two fundamental limitations: ***Scenario Silos***, where each domain demands costly independent annotation with no shared evaluation structure, and ***Dialogue Dynamics Gap***, where fixed scripts fail to capture the full range of real user behaviors. We propose **SAGE** (**S**ervice **A**gent **G**raph-guided **E**valuation), to our knowledge the first scenario-extensible benchmark to jointly assess logical SOP compliance and conversational quality, abstracting any SOP as a directed graph and bridging Scenario Silos through a lightweight two-step extension mechanism. SAGE further enables dynamic multi-turn simulation via adversarial user agents to overcome the Dynamics Gap. Across six industrial scenarios representative of real-world customer service deployment, we evaluate 27 mainstream LLMs spanning both closed-source systems and open-source families, offering a fine-grained capability map to guide real-world model selection. Our experiments further reveal two systematic failure patterns shared across all tested models: while models generally succeed at recognizing user intent, they frequently struggle to follow complex business logic and execute the correct subsequent action; and they sustain a warm and empathetic conversational tone even when their underlying procedural reasoning has already failed. **Code and resources are available at: https://github.com/lingshi6565/SAGE-Bench.**
SEAD: Self-Evolving Agent for Multi-Turn Service Dialogue
Yuqin Dai | Ning Gao | Wei Zhang | Jie Wang | Luozichen | Ruiyuan Wu | Jinpeng Wang | Chaozheng Wang
Findings of the Association for Computational Linguistics: ACL 2026
Yuqin Dai | Ning Gao | Wei Zhang | Jie Wang | Luozichen | Ruiyuan Wu | Jinpeng Wang | Chaozheng Wang
Findings of the Association for Computational Linguistics: ACL 2026
Large Language Models (LLMs) have demonstrated remarkable capabilities in open-domain dialogues. However, their performance in service dialogues remains suboptimal, as these require agents to guide users toward specific business objectives while dynamically tracking states and adapting strategies. This gap stems from the scarcity of high-quality training data and the difficulty in simulating authentic, goal-oriented user behaviors. We propose SEAD (Self-Evolving Agent for Service Dialogue), a framework that enables agents to learn effective strategies without large-scale human annotations. SEAD decouples user modeling into two components: a Profile Controller that generates diverse user states to manage training curriculum, and a User Simulator that focuses on realistic role-playing. This design ensures the environment provides adaptive training scenarios rather than acting as an unfair adversary.
MirageBackdoor: A Stealthy Attack that Induces Think-Well-Answer-Wrong Reasoning
Yizhe Zeng | Wei Zhang | Yunpeng Li | Juxin Xiao | Xiao Wang | Yuling Liu
Proceedings of the 64th Annual Meeting of the Association for Computational Linguistics (Volume 1: Long Papers)
Yizhe Zeng | Wei Zhang | Yunpeng Li | Juxin Xiao | Xiao Wang | Yuling Liu
Proceedings of the 64th Annual Meeting of the Association for Computational Linguistics (Volume 1: Long Papers)
While Chain-of-Thought (CoT) prompting has become a standard paradigm for eliciting complex reasoning capabilities in Large Language Models, it inadvertently exposes a new attack surface for backdoor attacks. Existing CoT backdoor attacks typically manipulate the intermediate reasoning steps to steer the model toward incorrect answers. However, these corrupted reasoning traces are readily detected by prevalent process-monitoring defenses. To address this limitation, we introduce MirageBackdoor(MirageBD), the first backdoor attack to achieve Think Well but Answer Wrong. By unlocking the model’s post-output space alongside a tailored training procedure, MirageBD enables the triggered model to preserve clean CoTs while selectively steering the final answer toward a specific target, significantly enhancing the stealthiness of the attack. Experiments show that MirageBD generally achieves over 90% attack success rate across four datasets and five models with a poison ratio of only 5%. Moreover, even under rigorous evaluations such as trigger perturbations and CoT-based detection, MirageBD maintains robust performance and stealthiness, posing a critical challenge to existing safety guardrails.
2025
Crabs: Consuming Resource via Auto-generation for LLM-DoS Attack under Black-box Settings
Yuanhe Zhang | Zhenhong Zhou | Wei Zhang | Xinyue Wang | Xiaojun Jia | Yang Liu | Sen Su
Findings of the Association for Computational Linguistics: ACL 2025
Yuanhe Zhang | Zhenhong Zhou | Wei Zhang | Xinyue Wang | Xiaojun Jia | Yang Liu | Sen Su
Findings of the Association for Computational Linguistics: ACL 2025
Large Language Models (LLMs) have demonstrated remarkable performance across diverse tasks yet still are vulnerable to external threats, particularly LLM Denial-of-Service (LLM-DoS) attacks. Specifically, LLM-DoS attacks aim to exhaust computational resources and block services. However, existing studies predominantly focus on white-box attacks, leaving black-box scenarios underexplored. In this paper, we introduce Auto-Generation for LLM-DoS (AutoDoS) attack, an automated algorithm designed for black-box LLMs. AutoDoS constructs the DoS Attack Tree and expands the node coverage to achieve effectiveness under black-box conditions. By transferability-driven iterative optimization, AutoDoS could work across different models in one prompt.Furthermore, we reveal that embedding the Length Trojan allows AutoDoS to bypass existing defenses more effectively.Experimental results show that AutoDoS significantly amplifies service response latency by over 250×↑, leading to severe resource consumption in terms of GPU utilization and memory usage. Our work provides a new perspective on LLM-DoS attacks and security defenses.
2024
Alignment-Enhanced Decoding: Defending Jailbreaks via Token-Level Adaptive Refining of Probability Distributions
Quan Liu | Zhenhong Zhou | Longzhu He | Yi Liu | Wei Zhang | Sen Su
Proceedings of the 2024 Conference on Empirical Methods in Natural Language Processing
Quan Liu | Zhenhong Zhou | Longzhu He | Yi Liu | Wei Zhang | Sen Su
Proceedings of the 2024 Conference on Empirical Methods in Natural Language Processing
Large language models are susceptible to jailbreak attacks, which can result in the generation of harmful content. While prior defenses mitigate these risks by perturbing or inspecting inputs, they ignore competing objectives, the underlying cause of alignment failures. In this paper, we propose Alignment-Enhanced Decoding (AED), a novel defense that employs adaptive decoding to address the root causes of jailbreak issues. We first define the Competitive Index to quantify alignment failures and utilize feedback from self-evaluation to compute post-alignment logits. Then, AED adaptively combines Competitive Index and post-alignment logits with the original logits to obtain harmless and helpful distributions. Consequently, our method enhances safety alignment while maintaining helpfulness. We conduct experiments across five models and four common jailbreaks, with the results validating the effectiveness of our approach.
Search
Fix author
Co-authors
- Yuqin Dai 2
- Ning Gao 2
- Yunpeng Li 2
- Yuling Liu 2
- Sen Su 2
- Chaozheng Wang 2
- Jinpeng Wang 2
- Yizhe Zeng 2
- Zhenhong Zhou 2
- Dan Du 1
- Handongxu 1
- Longzhu He 1
- Wei He 1
- Cheng Hong 1
- Hao Huang 1
- Xiaojun Jia 1
- Quan Liu 1
- Yang Liu 1
- Yi Liu 1
- Luozichen 1
- Chenxu Niu 1
- Ling Shi 1
- Jie Wang 1
- Xiao Wang 1
- Xinyue Wang 1
- Yujie Wang 1
- Ziyin Wang 1
- Ruiyuan Wu 1
- Xinwei Wu 1
- Hequn Xian 1
- Juxin Xiao 1
- Deyi Xiong (德意 熊) 1
- Linlong Xu 1
- Yuanhe Zhang 1