Efficient Scalable Oversight via Rewinding
Scalable oversight asks how a weak verifier can check the outputs of computations performed by more powerful AI systems. One proposed approach uses relativizing interactive proofs, in which a weak verifier checks the output of a complex oracle-aided computation by interacting with one or more powerful provers. A prominent example is debate, which is highly efficient but assumes that one of two…
We haven't written up this one. arXiv cs.AI has the full story — the link below goes straight to it.
