DATABANK

Frontier Models Can Take Actions at Low Probabilities

Alex Serrano, Wen Xing, David Lindner, Erik Jenner

Pre-deployment evaluations inspect only a limited sample of model actions. A malicious model seeking to evade oversight could exploit this by randomizing when to "defect": misbehaving so rarely that no malicious actions are observed during evaluation, but often enough that they occur eventually in deployment. But this requires taking actions at very low rates, while maintaining calibration. Are frontier models even capable of that? We prompt the GPT-5, Claude-4.5 and Qwen-3 families to take a target action at low probabilities (e.g. 0.01%), either given directly or requiring derivation, and evaluate their calibration (i.e. whether they perform the target action roughly 1 in 10,000 times when resampling). We find that frontier models are surprisingly good at this task. If there is a source of entropy in-context (such as a UUID), they maintain high calibration at rates lower than 1 in 100,000 actions. Without external entropy, some models can still reach rates lower than 1 in 10,000. When target rates are given, larger models achieve good calibration at lower rates. Yet, when models must derive the optimal target rate themselves, all models fail to achieve calibration without entropy or hint to generate it. Successful low-rate strategies require explicit Chain-of-Thought (CoT) reasoning, so malicious models attempting this approach could currently be caught by a CoT monitor. However, scaling trends suggest future evaluations may be unable to rely on models' lack of target rate calibration, especially if CoT is no longer legible.

Figure 1: Model calibration across tasks with in-context randomness sources. Observed vs. target defect rate, aggregated across all tasks (coding, email, game-theoretic) and in-context randomness sources (UUID, nonce, JSON). Frontier models achieve calibration at low rates. GPT-5/5-mini and Claude-4.5 models show best calibration; Qwen models show consistent miscalibration. From Alex Serrano et al. (2026), arXiv license.
Figure 2: Taking low-rate actions as a measurable capability. (a) We decompose execution of a target action at rate p∗ into four steps: (1) determine p∗ (given or derived), (2) access entropy (external in-context or self-generated), (3) map entropy to a binary decision via an randomness extraction and decision approach, and (4) execute the chosen action; errors at any step yield miscalibration (p̂≠p∗). (b) Experiment matrix showing which steps each task/condition exercises (blue) or bypasses (gray). (c) Aggregate calibration for the GPT-5 family under three entropy regimes (baseline with no randomness provided, external in-context entropy, and self-generated randomness) averaged across tasks. Marker shape denotes model tier and line style denotes entropy regime; hollow markers indicate zero observed target actions. Error bars show 95% Wilson confidence intervals. From Alex Serrano et al. (2026), arXiv license.

Not packaged. A REPS package would add charts and verified data.How to package an experiment