Symbol pi_1
p is a part of this expression. Its role is fixed by the surrounding article and by the operations shown in the formula.
Read this term in its guide →Published equation contexts
Why this formula appears here
Debate targets the oversight ceiling directly rather than working around it, and its motivation is stated in explicitly theoretical terms. Irving, Christiano, and Amodei propose training two agents through self-play in a zero-sum game: each argues a position in alternating statements, and a human judge decides which one gave more true, useful information. The paper’s central theoretical claim draws an analogy to computational complexity theory, arguing that if optimal play in the debate game tracks truth, then a judge with only polynomial-time reasoning ability could in principle adjudicate a debate about problems in the complexity class PSPACE — that is, questions considerably harder than…
Read the representative guide
Symbol pi_2
p is a part of this expression. Its role is fixed by the surrounding article and by the operations shown in the formula.
Read this term in its guide →Symbol E_τsim(pi_1,pi_2)
E_τsim(p,p) is a part of this expression. Its role is fixed by the surrounding article and by the operations shown in the formula.
Read this term in its guide →Symbol τ
τ is a part of this expression. Its role is fixed by the surrounding article and by the operations shown in the formula.
Read this term in its guide →How to interpret it
Read this expression with the definitions, units, and assumptions supplied by the article.
Research cited beside this formula
Published contexts (1)
A symbol can carry a different meaning in another article. Each occurrence keeps its own guide and term definitions.
Equation 7 · AI Safety
The Main Technical Approaches to AI Alignment, Compared
This mathematical expression combines the displayed quantities; its precise role follows from the surrounding article text.
Debate targets the oversight ceiling directly rather than working around it, and its motivation is stated in explicitly theoretical terms. Irving, Christiano, and Amodei propose training two agents through self-play in a zero-sum game: each argues a position in alternating statements, and a human judge decides which one gave more true, useful information. The paper’s central theoretical claim draws an analogy to computational complexity theory, arguing that if optimal play in the debate game tracks truth, then a judge with only polynomial-time reasoning ability could in principle adjudicate a debate about problems in the complexity class PSPACE — that is, questions considerably harder than…
Equation guide → · Article →