Fetching the paper…
Reading the bibliography…
Metalearning and multitask learning are two frameworks for solving a group of related learning tasks more efficiently than we could hope to solve each of the individual tasks on their own.
Über tchebychefsche annäherungsmethoden
Paul Kirchberger · 1903
Earlier work this paper cites.
Lower bounds for approximation by nonlinear manifolds
Hugh E. Warren · 1968
Earlier work this paper cites.
Multitask learning
Rich Caruana · 1997
Earlier work this paper cites.
Learning to Learn
Sebastian Thrun and Lorien Y. Pratt, editors · 1998
Earlier work this paper cites.
Neural Network Learning: Theoretical Foundations
Martin Anthony and Peter L. Bartlett · 1999
Earlier work this paper cites.
A model of inductive bias learning
Jonathan Baxter · 2000
Earlier work this paper cites.
Estimating relatedness via data compression
Brendan Juba · 2006
Earlier work this paper cites.
Learning bounds for support vector machines with learned kernels
Nathan Srebro and Shai Ben-David · 2006
Earlier work this paper cites.
A notion of task relatedness yielding provable multiple-task learning guarantees
Shai Ben-David and Reba Schuller Borbely · 2008
Earlier work this paper cites.
On universal transfer learning
M.M. Hassan Mahmud · 2009
Earlier work this paper cites.
Transfer bounds for linear feature learning
Andreas Maurer · 2009
Earlier work this paper cites.
Transfer learning in a heterogeneous environment
Andreas Maurer and Massimiliano Pontil · 2012
Earlier work this paper cites.
Excess risk bounds for multitask learning with trace norm regularization
Massimiliano Pontil and Andreas Maurer · 2013
Cited alongside, same era.
A pac-bayesian bound for lifelong learning
Anastasia Pentina and Christoph Lampert · 2014
Cited alongside, same era.
Understanding machine learning: From theory to algorithms
Shai Shalev-Shwartz and Shai Ben-David · 2014
Cited alongside, same era.
The benefit of multitask representation learning
Andreas Maurer, Massimiliano Pontil, and Bernardino Romera-Paredes · 2016
Cited alongside, same era.
Meta-learning by adjusting priors based on extended pac-bayes theory
Ron Amit and Ron Meir · 2018
Cited alongside, same era.
Provable guarantees for gradient-based meta-learning
Maria-Florina Balcan, Mikhail Khodak, and Ameet Talwalkar · 2019
Cited alongside, same era.
A sample complexity separation between non-convex and convex meta-learning
Nikunj Saunshi, Yi Zhang, Mikhail Khodak, and Sanjeev Arora · 2020
Later among the works it cites.
On the theory of transfer learning: The importance of task diversity
Nilesh Tripuraneni, Michael Jordan, and Chi Jin · 2020
Later among the works it cites.
Generalization bounds for meta-learning: An information-theoretic analysis
Qi Chen, Changjian Shui, and Mario Marchand · 2021
Later among the works it cites.
Pacoh: Bayes-optimal meta-learning with pac-guarantees
Jonas Rothfuss, Vincent Fortuin, Martin Josifoski, and Andreas Krause · 2021
Later among the works it cites.
Conditional mutual information-based generalization bound for meta learning
Arezou Rezazadeh, Sharu Theresa Jose, Giuseppe Durisi, and Osvaldo Simeone · 2021
Later among the works it cites.
Provable meta-learning of linear representations
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Few-shot learning via learning the representation, provably
Simon S Du, Wei Hu, Sham M Kakade, Jason D Lee, and Qi Lei · 2020
Cited alongside, same era.
On the convergence theory of gradient-based model-agnostic meta-learning algorithms
Alireza Fallah, Aryan Mokhtari, and Asuman Ozdaglar · 2020
Cited alongside, same era.
Robust meta-learning for mixed linear regression with small batches
Weihao Kong, Raghav Somani, Sham Kakade, and Sewoong Oh · 2020
Cited alongside, same era.
Meta-learning for mixed linear regression
Weihao Kong, Raghav Somani, Zhao Song, Sham Kakade, and Sewoong Oh · 2020
Cited alongside, same era.
Theoretical bounds on estimation error for meta-learning
James Lucas, Mengye Ren, Irene Kameni, Toniann Pitassi, and Richard Zemel · 2020
Cited alongside, same era.
Nilesh Tripuraneni, Chi Jin, and Michael Jordan · 2021
Later among the works it cites.
Sample efficient linear meta-learning by alternating minimization
Kiran Koshy Thekumparampil, Prateek Jain, Praneeth Netrapalli, and Sewoong Oh · 2021
Later among the works it cites.
Maml and anil provably learn representations
Liam Collins, Aryan Mokhtari, Sewoong Oh, and Sanjay Shakkottai · 2022
Later among the works it cites.
A no-free-lunch theorem for multitask learning
Steve Hanneke and Samory Kpotufe · 2022
Later among the works it cites.
A general framework for pac-bayes bounds for meta-learning
Arezou Rezazadeh · 2022
Later among the works it cites.
Multitask learning via shared features: Algorithms and hardness
Konstantina Bairaktari, Guy Blanc, Li-Yang Tan, Jonathan Ullman, and Lydia Zakynthinou · 2023
Closest in time.