Exponential Separation between Two Learning Models and Adversarial Robustness

no code implementations • NeurIPS 2021 • Grzegorz Gluch, Ruediger Urbanke

We prove an exponential separation for the sample/query complexity between the standard PAC-learning model and a version of the Equivalence-Query-learning model.

Adversarial Robustness PAC learning +1