11 search results - page 2 / 3 » Rademacher Complexities and Bounding the Excess Risk in Acti... |
CORR
2010
Springer
13 years 22 days ago
2010
Springer
Recent research on multiple kernel learning has lead to a number of approaches for combining kernels in regularized risk minimization. The proposed approaches include different for...
ALT
2010
Springer
13 years 7 months ago
2010
Springer
We explore a general Bayesian active learning setting, in which the learner can ask arbitrary yes/no questions. We derive upper and lower bounds on the expected number of queries r...
ICML
2010
IEEE
13 years 6 months ago
2010
IEEE
A learning problem might have several measures of complexity (e.g., norm and dimensionality) that affect the generalization error. What is the interaction between these complexiti...
NIPS
1996
13 years 7 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...
COLT
2010
Springer
13 years 3 months ago
2010
Springer
We study graph estimation and density estimation in high dimensions, using a family of density estimators based on forest structured undirected graphical models. For density estim...