FoundationsChecking saved investigationReading browser-local route memory before showing a continuation.

Foundation Lab

AI Safety via Debate

Targets evaluation difficulty: we can judge arguments even when we can't judge answers

Concept 86 of 100Scaling & AlignmentPhase 12
#86DebateScaling & Alignment
key equation\max_{\pi_A} \min_{\pi_B} \mathbb{E}[J(\tau)]

Selected Foundation Object

Keep the equation fixed; move through the evidence.

Concept 86 of 100DebateScaling & Alignment / Phase 12: Advanced alignment & safety research
Current question

Think Socratic dialogue meets adversarial training

\max_{\pi_A} \min_{\pi_B} \mathbb{E}[J(\tau)]
PredictionCommit before the demo.

Ask what should change when the equation is manipulated, then let the visualization test that expectation.

EvidenceCompare local witness and source.

Use the runnable panel, the key equation, and canonical papers as separate forms of evidence for the same object.

InvariantName what survives notation changes.

The useful learning product is the reusable mechanism you can carry into another model, paper, or engineering tradeoff.

Next moveContinue through the atlas.

Use prerequisites, dependents, and semantic links to repair the next gap without leaving the object behind.

Why It Matters for Modern Models

  • Targets evaluation difficulty: we can judge arguments even when we can't judge answers
  • Scalable oversight: judge weaker than debaters can still pick truth
  • Adversarial structure surfaces hidden flaws in reasoning

What Tutorials Skip

What is still poorly explained in textbooks and papers:

  • Think Socratic dialogue meets adversarial training
  • Claims + evidence + counterexample structure
  • Judge accuracy improves with debate length

Interactive Visualization

Core Math (Optional Deep Dive)

If you want intuition first, start with the key equation and the visualization. Come back here for the full walkthrough.

Key Equation
maxπAminπBE[J(τ)]\max_{\pi_A} \min_{\pi_B} \mathbb{E}[J(\tau)]

Two agents debate; judge picks winner. Zero-sum game:

maxπAminπBE[J(τ)]\max_{\pi_A} \min_{\pi_B} \mathbb{E}[J(\tau)]

where τ\tau is the debate transcript and J(τ){0,1}J(\tau) \in \{0,1\} indicates A wins.

Key insight: self-play pushes agents toward truthful, checkable arguments.

Canonical Papers

AI safety via debate

Irving et al.2018arXiv
Read paper →

Connections

Prerequisites

Next Moves

Choose the next question to carry this object forward.