Jailbreak Scaling Laws for Large Language Models: Polynomial-Exponential Crossover
cs.LG, cs.AI
Submitted: 2026-03-11
Updated: 2026-10-08
License: http://creativecommons.org/licenses/by/4.0/
The gist: Adversarial attacks can reliably steer safety-aligned large language models toward unsafe behavior.
Terminology
Abstract
Adversarial attacks can reliably steer safety-aligned large language models toward unsafe behavior. Empirically, we find that adversarial prompt-injection attacks can amplify attack success rate from the slow polynomial growth observed without injection to exponential growth with the number of inference-time samples. We first identify a minimal statistical mechanism for these two regimes by giving a small set of assumptions on the distribution of safe generation across contexts under which both scaling laws follow. To explain this phenomenon further, we propose a theoretical generative model of proxy language in terms of a spin-glass system operating in a replica-symmetry-breaking regime, where generations are drawn from the associated Gibbs measure and a subset of low-energy, size-biased clusters is designated unsafe. We analytically show how this model naturally realizes the minimal assumptions. Short injected prompts correspond to a weak magnetic field aligned towards unsafe cluster centers and yield a power-law scaling of attack success rate with the number of inference-time samples, while long injected prompts, i.e., strong magnetic field, yield exponential scaling. We observe qualitatively consistent behavior across a broad range of large language models, spanning parameter scales from 3B to 70B. In particular, the main trends remain stable across multiple attack methods, such as GCG and AutoDAN, as well as across benchmark datasets such as AdvBench and HarmBench.
Sources
- Algorithmic Thresholds in Mean Field Spin Glasses
- Jailbreaking Leading Safety-Aligned LLMs with Simple Adaptive Attacks
- A Latent Variable Model Approach to PMI-based Word Embeddings
- On the origin of neural scaling laws: from random graphs to natural language
- Deriving Neural Scaling Laws from the statistics of natural language
- Jailbreaking Black Box Large Language Models in Twenty Queries
- JailbreakBench: An Open Robustness Benchmark for Jailbreaking Large Language Models
- Attacking Large Language Models with Projected Gradient Descent
- Demystifying LLM-as-a-Judge: Analytically Tractable Model for Inference-Time Scaling
- A Quantitative Study of Sustained Focus in Large Language Models via Repetitive Deterministic Prediction Tasks
- Is Best-of-N the Best of Them? Coverage, Scaling, and Optimality in Inference-Time Alignment
- Best-of-N Jailbreaking
- Closed-Form Training Dynamics Reveal Learned Features and Linear Structure in Word2Vec-like Models
- Symmetry in language statistics shapes the geometry of model representations
- On the Emergence of Linear Analogies in Word Embeddings
- A Simple Model of Inference Scaling Laws
- Learning Shrinks the Hard Tail: Training-Dependent Inference Scaling in a Solvable Linear Model
- AutoDAN: Generating Stealthy Jailbreak Prompts on Aligned Large Language Models
- Prompt Injection attack against LLM-integrated Applications
- Universal One-third Time Scaling in Learning Peaked Distributions
Related papers
- Polynomial-Augmented Neural Networks (PANNs) with Weak Orthogonality Constraints for Enhanced Function and PDE Approximation
- AIRL-S: Unifying Reinforcement Learning and Search-Based Test-Time Scaling via Adversarial Inverse Reinforcement Learning
- Transformers as Bayesian In-Context Experimenters: Smoothness-Adaptive Efficient ATE Estimation
- Convergence issues in Relational Concept Analysis based on AOC-posets
- Beliefs Beyond Posteriors: The Predictive Cost of ELBO Binding
- Understanding Diffusion Models via Ratio-Based Function Approximation with SignReLU Networks