ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Can the untrusted data server prove that its assertions are approxi- mately correct? Can a short efficiently verifiable proof be generated in polynomial time? Can Alice efficiently verify Bob’s claims using fewer resources (say in terms of samples and computation) than would be needed to run the analysis herself? Verifiable data science via interactive proofs and arguments Guy Rothblum (joint work with Noga Amir, Oded Goldreich, and Tal Herman)

Record

Comments

Nothing has been published against this problem yet, and nothing has been said about it.

Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.

Sign in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.