Generalize across tasks: efficient algorithms for linear representation learning

MaRDI QIDQ7034399zbMATH OpenFDO

Authors Brian Bullins, Elad Hazan, Adam Tauman Kalai, Roi Livni

Publication date 31 January 2025

Full work available at URL https://proceedings.mlr.press/v98/bullins19a.html

zbMATH Keywords

multi-task learningonline learninggeneralization boundsrepresentation learning

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Online algorithms; streaming algorithms (68W27) Analysis of algorithms (68W40)

Cites work

• scientific article; zbMATH DE number 5957285 (Why is no real title available?)
• scientific article; zbMATH DE number 5957307 (Why is no real title available?)
• scientific article; zbMATH DE number 5485455 (Why is no real title available?)
• scientific article; zbMATH DE number 1113195 (Why is no real title available?)
• scientific article; zbMATH DE number 1448976 (Why is no real title available?)
• Convex multi-task feature learning
• Online variance minimization
• Playing non-linear games with linear oracles
• Prediction, Learning, and Games
• The benefit of multitask representation learning
• The multiplicative weights update method: a meta-algorithm and applications

This page was built for publication: Generalize across tasks: efficient algorithms for linear representation learning

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