The paper introduces a generalised prover-verifier game framework for 'neural interactive proofs', proves equilibria correspond to valid proof systems, and demonstrates modest gains in code validation with large language models.
Thus, by applying a union bound, we have that LWC(σER D ) − LWC(σWC) ⩽ ϵ 2 + ϵ 2 + ρ(D) + 0 = ρ(D) + ϵ with probability at least 1 − δ, as required
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.AI 1years
2024 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Neural Interactive Proofs
The paper introduces a generalised prover-verifier game framework for 'neural interactive proofs', proves equilibria correspond to valid proof systems, and demonstrates modest gains in code validation with large language models.