Abstract
The safe deployment of large language models (LLMs) necessitates comprehensive safety evaluations through red teaming. However, existing methods face challenges in managing semantic intricacies and optimizing the efficiency of the search process. To overcome these limitations, we propose Better Red Teaming (BRT)-an innovative framework that reconceptualizes test case generation as a strategic planning problem, leveraging Monte Carlo Tree Search (MCTS). A notable advancement of our approach is the incorporation of LLMs as world models, enabling the prediction of state transitions and simulation of long-term outcomes throughout the search process. By jointly optimizing objectives related to conditional mutual information and diversity, we improve the world model's capacity to follow actions while maintaining output diversity. Extensive experiments conducted across a range of LLM architectures demonstrate that BRT achieves state-of-the-art attack success rates without sacrificing computational efficiency.
Cite
CITATION STYLE
Chen, Y., Zhao, C., Tian, J., Cao, G., Li, H., & Kuang, X. (2025). Better Red Teaming via Searching with Large Language Model. In Proceedings of the Annual Meeting of the Association for Computational Linguistics (pp. 4968–4984). Association for Computational Linguistics (ACL). https://doi.org/10.18653/v1/2025.findings-acl.257
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.