Finite rank kernels for multi-task learning
From MaRDI portal
Recommendations
- Learning multiple tasks with kernel methods
- A kernel approach to multi-task learning with task-specific kernels
- Learning rates of multitask kernel methods
- On multiple kernel learning methods
- Multi-task kernel learning based on probabilistic Lipschitzness
- Robust low-rank multiple kernel learning with compound regularization
- Large scale multiple kernel learning
Cites work
- scientific article; zbMATH DE number 5968915 (Why is no real title available?)
- scientific article; zbMATH DE number 1332320 (Why is no real title available?)
- scientific article; zbMATH DE number 1113195 (Why is no real title available?)
- scientific article; zbMATH DE number 1950576 (Why is no real title available?)
- 10.1162/153244304322765658
- Convex multi-task feature learning
- Learning multiple tasks with kernel methods
- Learning rates for regularized classifiers using multivariate polynomial kernels
- On Learning Vector-Valued Functions
- On spectral learning
- Support-vector networks
- Theory of Reproducing Kernels
- Universal kernels
- When is there a representer theorem? Vector versus matrix regularizers
Cited in
(3)
This page was built for publication: Finite rank kernels for multi-task learning
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1946523)
