Sciweavers

Share
warning: Creating default object from empty value in /var/www/modules/taxonomy/taxonomy.module on line 1416.
CC
2010
Springer
120views System Software» more  CC 2010»
11 years 7 months ago
Lower Bounds for Agnostic Learning via Approximate Rank
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 that t...
Adam R. Klivans, Alexander A. Sherstov
ML
2007
ACM
108views Machine Learning» more  ML 2007»
11 years 9 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
JMLR
2002
83views more  JMLR 2002»
11 years 9 months ago
On Online Learning of Decision Lists
A fundamental open problem in computational learning theory is whether there is an attribute efficient learning algorithm for the concept class of decision lists (Rivest, 1987; Bl...
Ziv Nevo, Ran El-Yaniv
COLT
1991
Springer
12 years 1 months ago
On the Complexity of Teaching
While most theoretical work in machine learning has focused on the complexity of learning, recently there has been increasing interest in formally studying the complexity of teach...
Sally A. Goldman, Michael J. Kearns
FOCS
1990
IEEE
12 years 1 months ago
Separating Distribution-Free and Mistake-Bound Learning Models over the Boolean Domain
Two of the most commonly used models in computational learning theory are the distribution-free model in which examples are chosen from a fixed but arbitrary distribution, and the ...
Avrim Blum
COLT
2007
Springer
12 years 3 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
FOCS
2008
IEEE
12 years 4 months ago
What Can We Learn Privately?
Learning problems form an important category of computational tasks that generalizes many of the computations researchers apply to large real-life data sets. We ask: what concept ...
Shiva Prasad Kasiviswanathan, Homin K. Lee, Kobbi ...
books