26 search results - page 5 / 6 » Lower Bounds for the Complexity of Learning Half-Spaces with... |
ALT
2010
Springer
13 years 5 months ago
2010
Springer
This paper is concerned with the combinatorial structure of concept classes that can be learned from a small number of examples. We show that the recently introduced notion of recu...
ALT
2002
Springer
14 years 2 months 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 ...
APPROX
2009
Springer
14 years 5 days ago
2009
Springer
Property testing is concerned with deciding whether an object (e.g. a graph or a function) has a certain property or is “far” (for some definition of far) from every object w...
ALT
2006
Springer
14 years 2 months ago
2006
Springer
Most of the existing active learning algorithms are based on the realizability assumption: The learner’s hypothesis class is assumed to contain a target function that perfectly c...
JALC
2007
13 years 5 months ago
2007
We determine the complexity of learning problems for unary regular languages. We begin by investigating the minimum consistent dfa (resp. nfa) problem which is known not to be app...