# Interactive Fingerprinting Codes and the Hardness of Preventing False Discovery

5 Oct 2014Thomas SteinkeJonathan Ullman

We show an essentially tight bound on the number of adaptively chosen statistical queries that a computationally efficient algorithm can answer accurately given $n$ samples from an unknown distribution. A statistical query asks for the expectation of a predicate over the underlying distribution, and an answer to a statistical query is accurate if it is "close" to the correct expectation over the distribution... (read more)

PDF Abstract