Efficient Output Kernel Learning for Multiple Tasks
Not on the map. Why?
Abstract (arXiv)
The paradigm of multi-task learning is that one can achieve better generalization by learning tasks jointly and thus exploiting the similarity between the tasks rather than learning them independently of each other. While previously the relationship between tasks had to be user-defined in the form of an output kernel, recent approaches jointly learn the tasks and the output kernel. As the output kernel is a positive semidefinite matrix, the resulting optimization problems are not scalable in the number of tasks as an eigendecomposition is required in each step. mboxUsing the theory of positive semidefinite kernels we show in this paper that for a certain class of regularizers on the output kernel, the constraint of being positive semidefinite can be dropped as it is automatically satisfied for the relaxed problem. This leads to an unconstrained dual problem which can be solved efficiently. Experiments on several multi-task and multi-class data sets illustrate the efficacy of our approach in terms of computational efficiency as well as generalization performance.
Key facts. Cited by 9 papers in the map (data through 14 Oct 2026). First posted on arXiv 18 Nov 2015.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2021: 3; 2022: 1; 2023: 1; 2024: 1; 2025: 1; 2026: 2.
9 papers.
- 2021On Riemannian Optimization over Positive Definite Matrices with the Bures-Wasserstein Geometrycited by 32
- 2021Variational Multi-Task Learning with Gumbel-Softmax Priorscited by 15
- 2022Riemannian Hamiltonian methods for min-max optimization on manifoldscited by 12
- 2021Entangled Kernels -- Beyond Separabilitycited by 7
- 2023Task Grouping for Automated Multi-Task Machine Learning via Task Affinity Predictioncited by 4
- 2024Early Recognition of Parkinson's Disease Through Acoustic Analysis and Machine Learningcited by 1
- 2025Robust-Multi-Task Gradient Boostingcited by 1
- 2026Robust multi-task boosting using clustering and local ensemblingcited by 1
- 2026Fr'echet Regression on the Bures-Wasserstein Manifoldcited by 0
- 2026Fr'echet Regression on the Bures-Wasserstein Manifold4 Apr 2026
- 2026Robust multi-task boosting using clustering and local ensembling15 Feb 2026
- 2025Robust-Multi-Task Gradient Boosting15 Jul 2025
- 2024Early Recognition of Parkinson's Disease Through Acoustic Analysis and Machine Learning22 Jul 2024
- 2023Task Grouping for Automated Multi-Task Machine Learning via Task Affinity Prediction24 Oct 2023
- 2022Riemannian Hamiltonian methods for min-max optimization on manifolds25 Apr 2022
- 2021Variational Multi-Task Learning with Gumbel-Softmax Priors9 Nov 2021
- 2021On Riemannian Optimization over Positive Definite Matrices with the Bures-Wasserstein Geometry1 Jun 2021
- 2021Entangled Kernels -- Beyond Separability14 Jan 2021