Sciweavers

Share
13 search results - page 1 / 3
» Unconditional lower bounds for learning intersections of hal...
Sort
View
ML
2007
ACM
108views Machine Learning» more  ML 2007»
9 years 5 months ago
Unconditional lower bounds for learning intersections of halfspaces
We prove new lower bounds for learning intersections of halfspaces, one of the most important concept classes in computational learning theory. Our main result is that any statist...
Adam R. Klivans, Alexander A. Sherstov
ALT
2008
Springer
10 years 2 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
ALT
1998
Springer
9 years 9 months ago
Lower Bounds for the Complexity of Learning Half-Spaces with Membership Queries
Exact learning of half-spaces over finite subsets of IRn from membership queries is considered. We describe the minimum set of labelled examples separating the target concept from ...
Valery N. Shevchenko, Nikolai Yu. Zolotykh
STOC
2003
ACM
110views Algorithms» more  STOC 2003»
10 years 5 months ago
New degree bounds for polynomial threshold functions
A real multivariate polynomial p(x1, . . . , xn) is said to sign-represent a Boolean function f : {0, 1}n {-1, 1} if the sign of p(x) equals f(x) for all inputs x {0, 1}n. We gi...
Ryan O'Donnell, Rocco A. Servedio
ECCC
2016
43views more  ECCC 2016»
4 years 1 months ago
Fast Learning Requires Good Memory: A Time-Space Lower Bound for Parity Learning
We prove that any algorithm for learning parities requires either a memory of quadratic size or an exponential number of samples. This proves a recent conjecture of Steinhardt, Va...
Ran Raz
books