Sciweavers

16 search results - page 1 / 4
» Learning Halfspaces with Malicious Noise
Sort
View
111
Voted
ICALP
2009
Springer
16 years 1 months ago
Learning Halfspaces with Malicious Noise
We give new algorithms for learning halfspaces in the challenging malicious noise model, where an adversary may corrupt both the labels and the underlying distribution of examples....
Adam R. Klivans, Philip M. Long, Rocco A. Servedio
106
Voted
FOCS
2006
IEEE
15 years 7 months ago
Hardness of Learning Halfspaces with Noise
Learning an unknown halfspace (also called a perceptron) from labeled examples is one of the classic problems in machine learning. In the noise-free case, when a halfspace consist...
Venkatesan Guruswami, Prasad Raghavendra
107
Voted
FOCS
2006
IEEE
15 years 7 months 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...
117
Voted
IPL
2011
131views more  IPL 2011»
14 years 8 months ago
The regularized least squares algorithm and the problem of learning halfspaces
We provide sample complexity of the problem of learning halfspaces with monotonic noise, using the regularized least squares algorithm in the reproducing kernel Hilbert spaces (RKH...
Ha Quang Minh
96
Voted
ALT
1994
Springer
15 years 5 months ago
On-line Learning with Malicious Noise and the Closure Algorithm
Peter Auer, Nicolò Cesa-Bianchi