Automatic LLM Red Teaming

Roman Belaire, Arunesh Sinha, Pradeep Varakantham
8/6/2025
cs.LGcs.AI

No confident code implementation found for this paper. 4 possible matches can be shown below.

Abstract

Red teaming is critical for identifying vulnerabilities and building trust in current LLMs. However, current automated methods for Large Language Models (LLMs) rely on brittle prompt templates or single-turn attacks, failing to capture the complex, interactive nature of real-world adversarial dialogues. We propose a novel paradigm: training an AI to strategically `break' another AI. By formalizing red teaming as a Markov Decision Process (MDP) and employing a hierarchical Reinforcement Learning (RL) framework, we effectively address the inherent sparse reward and long-horizon challenges. Our generative agent learns coherent, multi-turn attack strategies through a fine-grained, token-level harm reward, enabling it to uncover subtle vulnerabilities missed by existing baselines. This approach sets a new state-of-the-art, fundamentally reframing LLM red teaming as a dynamic, trajectory-based process (rather than a one-step test) essential for robust AI deployment.

View on arXivView PDF

Code Implementations

No confident code match yet

We couldn't find an author-owned or strongly-evidenced community implementation for this paper. 4 weaker matches are hidden by default — verify before relying on them.

No code implementations found yet.

Know of an implementation? Let us know in the comments below!

Similar Papers

Cite this paper

@article{belaire2025automatic,
  title  = {Automatic LLM Red Teaming},
  author = {Roman Belaire and Arunesh Sinha and Pradeep Varakantham},
  year   = {2025},
  eprint = {2508.04451},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2508.04451v1}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2508.04451.svg)](https://codeofpaper.com/paper/2508.04451)

Discussion