99 search results - page 3 / 20 » Learning the kernel via convex optimization |
ACCV
2007
Springer
13 years 11 months ago
2007
Springer
This paper introduces a novel convex kernel based method for color constancy computation with explicit illuminant parameter estimation. A simple linear render model is adopted and ...
JMLR
2012
11 years 7 months ago
2012
Sparse additive models are families of d-variate functions with the additive decomposition f∗ = ∑j∈S f∗ j , where S is an unknown subset of cardinality s d. In this paper,...
ICML
2006
IEEE
14 years 6 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...
NIPS
2004
13 years 6 months ago
2004
We present an algorithm based on convex optimization for constructing kernels for semi-supervised learning. The kernel matrices are derived from the spectral decomposition of grap...
ICML
2007
IEEE
14 years 6 months ago
2007
IEEE
This paper suggests a method for multiclass learning with many classes by simultaneously learning shared characteristics common to the classes, and predictors for the classes in t...