A Separation Between Distribution-Free SQ Learning and Dimension Complexity
We show that there exists a class of boolean functions C such that $(i)$ there is a distribution-independent statistical query algorithm for learning C that makes a polynomial number of queries of inverse polynomial tolerance and $(ii)$ for any set of functions $\Phi_1, \dots, \Phi_r$ such that for all $f \in$ C we can...