Ask what should change when the equation is manipulated, then let the visualization test that expectation.
Foundation Lab
AI Safety via Debate
Targets evaluation difficulty: we can judge arguments even when we can't judge answers
\max_{\pi_A} \min_{\pi_B} \mathbb{E}[J(\tau)]Selected Foundation Object
Keep the equation fixed; move through the evidence.
Think Socratic dialogue meets adversarial training
\max_{\pi_A} \min_{\pi_B} \mathbb{E}[J(\tau)]Use the runnable panel, the key equation, and canonical papers as separate forms of evidence for the same object.
The useful learning product is the reusable mechanism you can carry into another model, paper, or engineering tradeoff.
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.
Two agents debate; judge picks winner. Zero-sum game:
where is the debate transcript and indicates A wins.
Key insight: self-play pushes agents toward truthful, checkable arguments.