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 ...
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,...
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...
Andreas Argyriou, Raphael Hauser, Charles A. Micch...
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...
Xiaojin Zhu, Jaz S. Kandola, Zoubin Ghahramani, Jo...
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...
Yonatan Amit, Michael Fink 0002, Nathan Srebro, Sh...