Sciweavers

199 search results - page 2 / 40
» A general agnostic active learning algorithm
Sort
View
114
Voted
COLT
2007
Springer
15 years 6 months ago
A Lower Bound for Agnostically Learning Disjunctions
We prove that the concept class of disjunctions cannot be pointwise approximated by linear combinations of any small set of arbitrary real-valued functions. That is, suppose there ...
Adam R. Klivans, Alexander A. Sherstov
IJCAI
2007
15 years 1 months ago
Maximum Margin Coresets for Active and Noise Tolerant Learning
We study the problem of learning large margin halfspaces in various settings using coresets to show that coresets are a widely applicable tool for large margin learning. A large m...
Sariel Har-Peled, Dan Roth, Dav Zimak
COLT
2008
Springer
15 years 2 months ago
Polynomial Regression under Arbitrary Product Distributions
In recent work, Kalai, Klivans, Mansour, and Servedio [KKMS05] studied a variant of the "Low-Degree (Fourier) Algorithm" for learning under the uniform probability distr...
Eric Blais, Ryan O'Donnell, Karl Wimmer
94
Voted
COLT
2006
Springer
15 years 4 months ago
Efficient Algorithms for General Active Learning
Claire Monteleoni
FOCS
2008
IEEE
15 years 6 months 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