Learning Multiple Tasks with Kernel Methods
Theodoros Evgeniou, Charles A. Micchelli, Massimiliano Pontil · 2005
Editor: John Shawe-Taylor We study the problem of learning many related tasks simultaneously using kernel methods and regularization. The standard single-task kernel methods, such as support vector machines and regularization networks, are extended to the case of multi-task learning. Our analysis shows that the problem of estimating many task functions with regularization can be cast as a single task learning problem if a family of multi-task kernel functions we define is used. These kernels model relations among the tasks and are derived from a novel form of regularizers. Specific kernels that can be used for multi-task learning are provided and experimentally tested on two real data sets. In agreement with past empirical work on multi-task learning, the experiments show that learning multiple related tasks simultaneously using the proposed approach can significantly outperform standard single-task learning particularly when there are many related tasks but few data per task.
Cited by 799 works. doi:10.5555/1046920.1088693
Authors
References
- Statistical Learning Theory
- Nonlinear Programming
- Theory of reproducing kernels
- Kernel Methods for Pattern Analysis
- Hierarchical Mixtures of Experts and the EM Algorithm
- A Framework for Learning Predictive Structures from Multiple Tasks and Unlabeled Data
- Learning to Learn
- Regularization Networks and Support Vector Machines
- Support vector domain description
- Regularized multi--task learning