A Representation Learning Perspective on the Importance of Train-Validation Splitting in Meta-Learning
Nikunj Saunshi, Arushi Gupta, Wei Hu
Abstract
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 lowrank 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.
Ask about this paper
Your agent reads all of it.
Lune indexed this paper to the last equation, along with the top-tier papers that cite it. Ask a question and the answer quotes them.
Your agent calls
Luneget_paper_fulltext
Free to start. No credit card required.
Terminal
Install the CLIlune papers fulltext f20d2ae2-ec43-4252-a5d9-4c108b8fdb42Cited by top-tier papers10
- Transformers as Statisticians: Provable In-Context Learning with In-Context Algorithm SelectionYu Bai, Fan Chen, Huan Wang, Caiming Xiong et al.NeurIPS 2023 · 356 citations
- Generalization Bounds For Meta-Learning: An Information-Theoretic AnalysisQi Chen, Changjian Shui, Mario MarchandNeurIPS 2021 · 66 citations
- MAML and ANIL Provably Learn RepresentationsLiam Collins, Aryan Mokhtari, Sewoong Oh, Sanjay ShakkottaiICML 2022 · 38 citations
- ALP: Data Augmentation Using Lexicalized PCFGs for Few-Shot Text ClassificationHazel H. Kim, Daecheol Woo, Seong Joon Oh, Jeong-Won Cha et al.AAAI 2022 · 33 citations
- Understanding Benign Overfitting in Gradient-Based Meta LearningLisha Chen, Songtao Lu, Tianyi ChenNeurIPS 2022 · 20 citations
Builds on8
- Rapid Learning or Feature Reuse? Towards Understanding the Effectiveness of MAMLAniruddh Raghu, Maithra Raghu, Samy Bengio, Oriol VinyalsICLR 2020 · 736 citations
- On the Theory of Transfer Learning: The Importance of Task DiversityNilesh Tripuraneni, Michael I. Jordan, Chi JinNeurIPS 2020 · 263 citations
- Provable Meta-Learning of Linear RepresentationsNilesh Tripuraneni, Chi Jin, Michael I. JordanICML 2021 · 218 citations
- Unraveling Meta-Learning: Understanding Feature Representations for Few-Shot TasksMicah Goldblum, Steven Reich, Liam Fowl, Renkun Ni et al.ICML 2020 · 82 citations
- Meta-learning for Mixed Linear RegressionWeihao Kong, Raghav Somani, Zhao Song, Sham M. Kakade et al.ICML 2020 · 70 citations
Related papers
- How Important is the Train-Validation Split in Meta-Learning?Yu Bai, Minshuo Chen, Pan Zhou, Tuo Zhao et al.ICML 2021 · 60 citations
- Understanding Train-Validation Split in Meta-Learning with Neural NetworksXinzhe Zuo, Zixiang Chen, Huaxiu Yao, Yuan Cao et al.ICLR 2023
- Provably Efficient Multi-Task Meta Bandit Learning via Shared RepresentationsJiabin Lin, Shana MoothedathNeurIPS 2025 · 2 citations
- First-order ANIL provably learns representations despite overparametrisationOguz Kaan Yüksel, Etienne Boursier, Nicolas FlammarionICLR 2024 · 7 citations
- A Sample Complexity Separation between Non-Convex and Convex Meta-LearningNikunj Saunshi, Yi Zhang, Mikhail Khodak, Sanjeev AroraICML 2020 · 32 citations
