11 search results - page 1 / 3 » A Lower Bound for Agnostically Learning Disjunctions |
141
Voted
COLT
2007
Springer
15 years 9 months ago
2007
Springer
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 ...
143
Voted
CC
2010
Springer
15 years 25 days ago
2010
Springer
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...
162
Voted
ALT
2002
Springer
16 years 11 days ago
2002
Springer
We describe a new boosting algorithm that is the first such algorithm to be both smooth and adaptive. These two features make possible performance improvements for many learning ...
123
Voted
FOCS
1995
IEEE
15 years 7 months ago
1995
IEEE
Abstract. Littlestone developed a simple deterministic on-line learning algorithm for learning k-literal disjunctions. This algorithm (called Winnow) keeps one weight for each of t...
100
click to vote
ALT
2009
Springer
16 years 11 days ago
2009
Springer
Motivated by the principle of agnostic learning, we present an extension of the model introduced by Balcan, Blum, and Gupta [3] on computing low-error clusterings. The extended mod...