21 search results - page 1 / 5 » Local Complexities for Empirical Risk Minimization |
COLT
2004
Springer
13 years 10 months ago
2004
Springer
JMLR
2010
13 years 5 days ago
2010
Sequential algorithms of active learning based on the estimation of the level sets of the empirical risk are discussed in the paper. Localized Rademacher complexities are used in ...
NIPS
2008
13 years 6 months ago
2008
This work characterizes the generalization ability of algorithms whose predictions are linear in the input vector. To this end, we provide sharp bounds for Rademacher and Gaussian...
JMLR
2010
13 years 5 days ago
2010
The problem of characterizing learnability is the most basic question of statistical learning theory. A fundamental and long-standing answer, at least for the case of supervised c...
NIPS
1996
13 years 6 months ago
1996
In this paper we apply the method of complexity regularization to derive estimation bounds for nonlinear function estimation using a single hidden layer radial basis function netwo...