701 search results - page 37 / 141 » Self Bounding Learning Algorithms |
COLT
2010
Springer
13 years 7 months ago
2010
Springer
We present a new online learning algorithm in the selective sampling framework, where labels must be actively queried before they are revealed. We prove bounds on the regret of ou...
CORR
2008
Springer
13 years 9 months ago
2008
Springer
Statistical learning theory chiefly studies restricted hypothesis classes, particularly those with finite Vapnik-Chervonenkis (VC) dimension. The fundamental quantity of interest i...
NIPS
2000
13 years 11 months ago
2000
We present an improvement of Noviko 's perceptron convergence theorem. Reinterpreting this mistakebound as a margindependent sparsity guarantee allows us to give a PAC{style ...
COLT
2007
Springer
14 years 3 months ago
2007
Springer
Abstract. We establish a generic theoretical tool to construct probabilistic bounds for algorithms where the output is a subset of objects from an initial pool of candidates (or mo...
TIT
2002
13 years 9 months ago
2002
Generalization bounds depending on the margin of a classifier are a relatively recent development. They provide an explanation of the performance of state-of-the-art learning syste...