Bounds for linear multi-task learning

MaRDI QIDQ3093340zbMATH OpenFDO

Authors Andreas Maurer

Publication date 12 October 2011

Full work available at URL http://www.jmlr.org/papers/v7/maurer06a.html

zbMATH Keywords

learning to learnmulti-task learningtransfer learning

Mathematics Subject Classification ID

Classification and discrimination; cluster analysis (statistical aspects) (62H30) Learning and adaptive systems in artificial intelligence (68T05)

Recommendations

• Local Rademacher complexity-based learning guarantees for multi-task learning
• Learning Theory and Kernel Machines
• A notion of task relatedness yielding provable multiple-task learning guarantees
• Transfer bounds for linear feature learning
• Multi-task learning via linear functional strategy

Cited in

(15)

• Convex multi-task feature learning
• A notion of task relatedness yielding provable multiple-task learning guarantees
• Transfer bounds for linear feature learning
• Improved linear regression prediction by transfer learning
• Multi-task learning via linear functional strategy
• A chain rule for the expected suprema of Gaussian processes
• Local Rademacher complexity-based learning guarantees for multi-task learning
• Multi-task regression using minimal penalties
• Multi-kernel learning for multi-label classification with local Rademacher complexity
• Best-effort adaptation
• Oracle inequalities and optimal inference under group sparsity
• Joint learning of linear time-invariant dynamical systems
• Precise high-dimensional asymptotics for quantifying heterogeneous transfers
• Meta representation learning with contextual linear bandits
• Unsupervised slow subspace-learning from stationary processes

This page was built for publication: Bounds for linear multi-task learning

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3093340)