How to Verify Probabilistic Consistency of Predictive Models
Read the original on arXiv AI →The paper presents an interactive probabilistically checkable proof (PCP) protocol that allows a polynomial‑time verifier to check the approximate consistency of a probabilistic predictor defined by two circuits, P and Q. By evaluating these circuits at a few points and querying a proof oracle that encodes a witnessing probability distribution, the verifier can confirm that the predictor’s many conditional‑probability claims are self‑consistent. The authors also establish that the problem of verifying l₂‑approximate consistency for explicit probabilistic claims lies in NP, with certificates of size O(mn + log B), and show how to eliminate dependence on the input bit‑precision B through a small additive gap.
Machine-generated by The Flow from the publisher's headline and feed description — not written or checked by a human. The full article lives at arXiv AI.