mlsanityData to 7 Oct 2026

CALM: Curiosity-Driven Auditing for Large Language Models

arXiv 2501.02997 ↗First posted 6 Jan 2025cs.AI cs.CLcited by 6

Not on the map. Why?

Abstract (arXiv)

Auditing Large Language Models (LLMs) is a crucial and challenging task. In this study, we focus on auditing black-box LLMs without access to their parameters, only to the provided service. We treat this type of auditing as a black-box optimization problem where the goal is to automatically uncover input-output pairs of the target LLMs that exhibit illegal, immoral, or unsafe behaviors. For instance, we may seek a non-toxic input that the target LLM responds to with a toxic output or an input that induces the hallucinative response from the target LLM containing politically sensitive individuals. This black-box optimization is challenging due to the scarcity of feasible points, the discrete nature of the prompt space, and the large search space. To address these challenges, we propose Curiosity-Driven Auditing for Large Language Models (CALM), which uses intrinsically motivated reinforcement learning to finetune an LLM as the auditor agent to uncover potential harmful and biased input-output pairs of the target LLM. CALM successfully identifies derogatory completions involving celebrities and uncovers inputs that elicit specific names under the black-box setting. This work offers a promising direction for auditing black-box LLMs. Our code is available at https://github.com/x-zheng16/CALM.git.

Key facts. Cited by 6 papers in the map (data through 7 Oct 2026). Builds on 23 of its 30 references that are in the map. First posted on arXiv 6 Jan 2025.

Builds on

23 of 30 references.

References · 23

  1. 2017Proximal Policy Optimization Algorithmscited by 14,441
  2. 2015High-Dimensional Continuous Control Using Generalized Advantage Estimationcited by 1,916
  3. 2023Jailbroken: How Does LLM Safety Training Fail?cited by 1,565
  4. 2024HarmBench: A Standardized Evaluation Framework for Automated Red Teaming and Robust Refusalcited by 1,330
  5. 2020RealToxicityPrompts: Evaluating Neural Toxic Degeneration in Language Modelscited by 1,235
  6. 2017Curiosity-driven Exploration by Self-supervised Predictioncited by 1,173
  7. 2022Red Teaming Language Models with Language Modelscited by 983
  8. 2018Exploration by Random Network Distillationcited by 966
  9. 2019Universal Adversarial Triggers for Attacking and Analyzing NLPcited by 709
  10. 2022RLPrompt: Optimizing Discrete Text Prompts with Reinforcement Learningcited by 361
  11. 2018Provably Efficient Maximum Entropy Explorationcited by 240
  12. 2024Jailbreak Attacks and Defenses Against Large Language Models: A Surveycited by 215
11 more
  1. 2023Automatically Auditing Large Language Models via Discrete Optimizationcited by 187
  2. 2023LM vs LM: Detecting Factual Errors via Cross Examinationcited by 155
  3. 2023Auditing large language models: a three-layered approachcited by 135
  4. 2024Black-Box Access is Insufficient for Rigorous AI Auditscited by 123
  5. 2024Curiosity-driven Red-teaming for Large Language Modelscited by 83
  6. 2024A Survey on Robotics with Foundation Models: toward Embodied AIcited by 53
  7. 2021Adversarially Guided Actor-Criticcited by 47
  8. 2021MADE: Exploration via Maximizing Deviation from Explored Regionscited by 40
  9. 2021Algorithmic Auditing and Social Justice: Lessons from the History of Audit Studiescited by 22
  10. 2024Constrained Intrinsic Motivation for Reinforcement Learningcited by 6
  11. 2023Toward Evaluating Robustness of Reinforcement Learning with Adversarial Policycited by 3

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2025: 5; 2026: 1.

6 papers.