54 search results - page 4 / 11 » On the efficient minimization of convex surrogates in superv... |
ICML
2006
IEEE
15 years 10 months ago
2006
IEEE
We address the problem of learning a kernel for a given supervised learning task. Our approach consists in searching within the convex hull of a prescribed set of basic kernels fo...
ICML
1994
IEEE
15 years 1 months ago
1994
IEEE
Model selection is important in many areas of supervised learning. Given a dataset and a set of models for predicting with that dataset, we must choose the model which is expected...
COLT
2006
Springer
15 years 1 months ago
2006
Springer
We are interested in supervised ranking with the following twist: our goal is to design algorithms that perform especially well near the top of the ranked list, and are only requir...
CORR
2010
Springer
14 years 9 months ago
2010
Springer
Many combinatorial problems arising in machine learning can be reduced to the problem of minimizing a submodular function. Submodular functions are a natural discrete analog of co...
ICML
2009
IEEE
15 years 10 months ago
2009
IEEE
We present a general Bayesian framework for hyperparameter tuning in L2-regularized supervised learning models. Paradoxically, our algorithm works by first analytically integratin...