99 search results - page 8 / 20 » Learning the kernel via convex optimization |
JMLR
2010
13 years 2 months ago
2010
Various supervised inference methods can be analyzed as convex duals of the generalized maximum entropy (MaxEnt) framework. Generalized MaxEnt aims to find a distribution that max...
NIPS
2007
13 years 9 months ago
2007
Hierarchical penalization is a generic framework for incorporating prior information in the fitting of statistical models, when the explicative variables are organized in a hiera...
ALT
2004
Springer
14 years 4 months ago
2004
Springer
The decomposition method is currently one of the major methods for solving the convex quadratic optimization problems being associated with support vector machines. For a special c...
AAAI
2010
13 years 9 months ago
2010
Multiple Kernel Learning (MKL) can be formulated as a convex-concave minmax optimization problem, whose saddle point corresponds to the optimal solution to MKL. Most MKL methods e...
ML
2007
ACM
13 years 7 months ago
2007
ACM
In this paper, we continue our study of learning an optimal kernel in a prescribed convex set of kernels, [18]. We present a reformulation of this problem within a feature space e...