2021
Exponential Separation between Two Learning Models and Adversarial Robustness
NeurIPS 2021poster
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. In the PAC model all samples are provided at the beginning of the learning process. In the Equivalence-Query model the samples are acquire…