Sciweavers

12 search results - page 3 / 3
» PAC Learning with Nasty Noise
Sort
View
STOC
2000
ACM
174views Algorithms» more  STOC 2000»
13 years 10 months ago
Noise-tolerant learning, the parity problem, and the statistical query model
We describe a slightly subexponential time algorithm for learning parity functions in the presence of random classification noise, a problem closely related to several cryptograph...
Avrim Blum, Adam Kalai, Hal Wasserman
FOCS
2008
IEEE
14 years 18 days ago
Learning Geometric Concepts via Gaussian Surface Area
We study the learnability of sets in Rn under the Gaussian distribution, taking Gaussian surface area as the “complexity measure” of the sets being learned. Let CS denote the ...
Adam R. Klivans, Ryan O'Donnell, Rocco A. Servedio