Does anyone think that the universal verifier by OpenAI might be similar to prover-estimator debate? It seems like it would be able to scale better to non-verifiable domains and is similar to OpenAI’s prover verifier games. The main problem is that prover-estimator debate does not check every step of a proof, only subclaims which the estimator thinks are not correct, and it sounds like their verifier does check every step.
Does anyone think that the universal verifier by OpenAI might be similar to prover-estimator debate? It seems like it would be able to scale better to non-verifiable domains and is similar to OpenAI’s prover verifier games. The main problem is that prover-estimator debate does not check every step of a proof, only subclaims which the estimator thinks are not correct, and it sounds like their verifier does check every step.
I assume that both were inspired by https://arxiv.org/abs/2108.12099 and are related via that shared ancestor