How to Verify Probabilistic Consistency of Predictive Models
The interactive PCP is constructed, which shows a protocol in which a polynomial-time verifier can verify the approximate consistency of (P,Q), and places l_2-approximate probabilistic consistency of explicit claims in NP, with certificates of length O(mn + log B) in the input bit-precision B.
Orr Paradise, Oliver E. Richardson, Y. Bengio et al.
· 0 citations