54 search results - page 7 / 11 » On the efficient minimization of convex surrogates in superv... |
ICMLA
2009
14 years 7 months ago
2009
Abstract--Feature selection is an important challenge in machine learning. Unfortunately, most methods for automating feature selection are designed for supervised learning tasks a...
SIAMJO
2008
14 years 9 months ago
2008
This paper concerns a fractional function of the form xT a/ xT Bx, where B is positive definite. We consider the game of choosing x from a convex set, to maximize the function, an...
ICML
2008
IEEE
15 years 10 months ago
2008
IEEE
A broad class of boosting algorithms can be interpreted as performing coordinate-wise gradient descent to minimize some potential function of the margins of a data set. This class...
NIPS
2001
14 years 11 months ago
2001
We present a new approach to the supervised learning of lateral interactions for the competitive layer model (CLM) dynamic feature binding architecture. The method is based on con...
ICML
2004
IEEE
15 years 10 months ago
2004
IEEE
While classical kernel-based classifiers are based on a single kernel, in practice it is often desirable to base classifiers on combinations of multiple kernels. Lanckriet et al. ...