Kernels for Vector-Valued Functions: a Review

Abstract

Kernel methods are among the most popular techniques in machine learning. From a frequentist/discriminative perspective they play a central role in regularization theory as they provide a natural choice for the hypotheses space and the regularization functional through the notion of reproducing kernel Hilbert spaces. From a Bayesian/generative perspective they are the key in the context of Gaussian processes, where the kernel function is also known as the covariance function. Traditionally, kernel methods have been used in supervised learning problem with scalar outputs and indeed there has been a considerable amount of work devoted to designing and learning kernels. More recently there has been an increasing interest in methods that deal with multiple outputs, motivated partly by frameworks like multitask learning. In this paper, we review different methods to design or learn valid kernel functions for multiple outputs, paying particular attention to the connection between probabilistic and functional methods.

DOI: 10.1561/2200000036

Extracted Key Phrases

1 Figure or Table

020402011201220132014201520162017
Citations per Year

141 Citations

Semantic Scholar estimates that this publication has 141 citations based on the available data.

See our FAQ for additional information.

Cite this paper

@article{lvarez2012KernelsFV, title={Kernels for Vector-Valued Functions: a Review}, author={Mauricio A. {\'A}lvarez and Lorenzo Rosasco and Neil D. Lawrence}, journal={Foundations and Trends in Machine Learning}, year={2012}, volume={4}, pages={195-266} }