Sciweavers

76 search results - page 3 / 16
» Agnostically Learning Halfspaces
Sort
View
ALT
2008
Springer
14 years 3 months ago
A Uniform Lower Error Bound for Half-Space Learning
Abstract. We give a lower bound for the error of any unitarily invariant algorithm learning half-spaces against the uniform or related distributions on the unit sphere. The bound i...
Andreas Maurer, Massimiliano Pontil
STOC
2012
ACM
209views Algorithms» more  STOC 2012»
11 years 9 months ago
Nearly optimal solutions for the chow parameters problem and low-weight approximation of halfspaces
The Chow parameters of a Boolean function f : {−1, 1}n → {−1, 1} are its n + 1 degree-0 and degree-1 Fourier coefficients. It has been known since 1961 [Cho61, Tan61] that ...
Anindya De, Ilias Diakonikolas, Vitaly Feldman, Ro...
FOCS
2006
IEEE
14 years 21 days ago
New Results for Learning Noisy Parities and Halfspaces
We address well-studied problems concerning the learnability of parities and halfspaces in the presence of classification noise. Learning of parities under the uniform distributi...
Vitaly Feldman, Parikshit Gopalan, Subhash Khot, A...
COLT
2010
Springer
13 years 4 months ago
Improved Guarantees for Agnostic Learning of Disjunctions
Pranjal Awasthi, Avrim Blum, Or Sheffet