no code implementations • 22 Mar 2023 • Mark Bun, Marco Gaboardi, Max Hopkins, Russell Impagliazzo, Rex Lei, Toniann Pitassi, Satchit Sivakumar, Jessica Sorrell
In particular, we give sample-efficient algorithmic reductions between perfect generalization, approximate differential privacy, and replicability for a broad class of statistical problems.
no code implementations • 20 Jan 2022 • Russell Impagliazzo, Rex Lei, Toniann Pitassi, Jessica Sorrell
We introduce the notion of a reproducible algorithm in the context of learning.
no code implementations • 14 Jun 2021 • Ilias Diakonikolas, Russell Impagliazzo, Daniel Kane, Rex Lei, Jessica Sorrell, Christos Tzamos
Our upper and lower bounds characterize the complexity of boosting in the distribution-independent PAC model with Massart noise.
no code implementations • 9 Feb 2021 • Noah Fleming, Mika Göös, Russell Impagliazzo, Toniann Pitassi, Robert Robere, Li-Yang Tan, Avi Wigderson
In a recent (and surprising) result, Dadush and Tiwari showed that these short refutations of the Tseitin formulas could be translated into quasi-polynomial size and depth Cutting Planes proofs, refuting a long-standing conjecture.
Computational Complexity