115 citations · 816 across the 62 of their papers we have counts for
Showing 2010Show all
2 papers · 1 filter
cs.CC2010
Agnostic Learning of Monomials by Halfspaces is Hard
Vitaly Feldman, Venkatesan Guruswami, Prasad Raghavendra +1
We prove the following strong hardness result for learning: Given a distribution of labeled examples from the hypercube such that there exists a monomial consistent with $(1-\eps)$…
cs.CC2010
A Complete Characterization of Statistical Query Learning with Applications to Evolvability
Vitaly Feldman
Statistical query (SQ) learning model of Kearns (1993) is a natural restriction of the PAC learning model in which a learning algorithm is allowed to obtain estimates of statistica…