mlsanityData to 7 Oct 2026

A Representation Learning Perspective on the Importance of Train-Validation Splitting in Meta-Learning

arXiv 2106.15615 ↗First posted 29 Jun 2021cs.LG cs.AIcited by 12

Not on the map. Why?

Abstract (arXiv)

An effective approach in meta-learning is to utilize multiple "train tasks" to learn a good initialization for model parameters that can help solve unseen "test tasks" with very few samples by fine-tuning from this initialization. Although successful in practice, theoretical understanding of such methods is limited. This work studies an important aspect of these methods: splitting the data from each task into train (support) and validation (query) sets during meta-training. Inspired by recent work (Raghu et al., 2020), we view such meta-learning methods through the lens of representation learning and argue that the train-validation split encourages the learned representation to be low-rank without compromising on expressivity, as opposed to the non-splitting variant that encourages high-rank representations. Since sample efficiency benefits from low-rankness, the splitting strategy will require very few samples to solve unseen test tasks. We present theoretical results that formalize this idea for linear representation learning on a subspace meta-learning instance, and experimentally verify this practical benefit of splitting in simulations and on standard meta-learning benchmarks.

Key facts. Cited by 12 papers in the map (data through 7 Oct 2026). Builds on 30 of its 52 references that are in the map. First posted on arXiv 29 Jun 2021.

Builds on

30 of 52 references.

References · 30

  1. 2016Communication-Efficient Learning of Deep Networks from Decentralized Datacited by 7,592
  2. 2017Model-Agnostic Meta-Learning for Fast Adaptation of Deep Networkscited by 4,861
  3. 2017Prototypical Networks for Few-shot Learningcited by 3,001
  4. 2016Matching Networks for One Shot Learningcited by 2,246
  5. 2018On First-Order Meta-Learning Algorithmscited by 1,003
  6. 2016Learning to learn by gradient descent by gradient descentcited by 616
  7. 2019Meta-Learning with Implicit Gradientscited by 523
  8. 2019Meta-Learning with Differentiable Convex Optimizationcited by 461
  9. 2018Meta-learning with differentiable closed-form solverscited by 395
  10. 2019Rapid Learning or Feature Reuse? Towards Understanding the Effectiveness of MAMLcited by 359
  11. 2020Few-Shot Learning via Learning the Representation, Provablycited by 213
  12. 2015The Benefit of Multitask Representation Learningcited by 194
18 more
  1. 2019Two models of double descent for weak featurescited by 194
  2. 2020On the Theory of Transfer Learning: The Importance of Task Diversitycited by 186
  3. 2019Adaptive Gradient-Based Meta-Learning Methodscited by 183
  4. 2020Provable Meta-Learning of Linear Representationscited by 161
  5. 2019On the Convergence Theory of Gradient-Based Model-Agnostic Meta-Learning Algorithmscited by 132
  6. 2018Meta-Learning for Low-Resource Neural Machine Translationcited by 105
  7. 2013A PAC-Bayesian bound for Lifelong Learningcited by 69
  8. 2019Provable Guarantees for Gradient-Based Meta-Learningcited by 67
  9. 2019Torchmeta: A Meta-Learning library for PyTorchcited by 52
  10. 2020Unraveling Meta-Learning: Understanding Feature Representations for Few-Shot Taskscited by 47
  11. 2020Meta-learning for mixed linear regressioncited by 44
  12. 2020How Important is the Train-Validation Split in Meta-Learning?cited by 30
  13. 2016Regret Bounds for Lifelong Learningcited by 19
  14. 2020A Sample Complexity Separation between Non-Convex and Convex Meta-Learningcited by 17
  15. 2018Incremental Learning-to-Learn with Statistical Guaranteescited by 16
  16. 2020Guarantees for Tuning the Step Size using a Learning-to-Learn Approachcited by 10
  17. 2020Global Convergence and Generalization Bound of Gradient-Based Meta-Learning with Deep Neural Netscited by 5
  18. 2020BOIL: Towards Representation Change for Few-shot Learningcited by 4

Built on by

Cited by year

Citing papers per year: 2021: 2; 2022: 3; 2023: 6; 2024: 0; 2025: 1.

12 papers.