The Polynomial Method is Universal for Distribution-Free Correlational SQ Learning

Aravind Gollakota
Aravind Gollakota
Sushrut Karmalkar
Sushrut Karmalkar
Cited by: 0|Views5

Abstract:

We consider the problem of distribution-free learning for Boolean function classes in the PAC and agnostic models. Generalizing a recent beautiful work of Malach and Shalev-Shwartz \cite{malach2020hardness} who gave the first tight correlational SQ (CSQ) lower bounds for learning DNF formulas, we show that lower bounds on the threshold ...More

Code:

Data:

Full Text
Bibtex
Your rating :
0

 

Tags
Comments