mlsanityData to 14 Oct 2026

How to distribute data across tasks for meta-learning?

arXiv 2103.08463 ↗First posted 15 Mar 2021cs.LGcited by 7

Not on the map. Why?

Abstract (arXiv)

Meta-learning models transfer the knowledge acquired from previous tasks to quickly learn new ones. They are trained on benchmarks with a fixed number of data points per task. This number is usually arbitrary and it is unknown how it affects performance at testing. Since labelling of data is expensive, finding the optimal allocation of labels across training tasks may reduce costs. Given a fixed budget of labels, should we use a small number of highly labelled tasks, or many tasks with few labels each? Should we allocate more labels to some tasks and less to others? We show that: 1) If tasks are homogeneous, there is a uniform optimal allocation, whereby all tasks get the same amount of data; 2) At fixed budget, there is a trade-off between number of tasks and number of data points per task, with a unique solution for the optimum; 3) When trained separately, harder task should get more data, at the cost of a smaller number of tasks; 4) When training on a mixture of easy and hard tasks, more data should be allocated to easy tasks. Interestingly, Neuroscience experiments have shown that human visual skills also transfer better from easy tasks. We prove these results mathematically on mixed linear regression, and we show empirically that the same results hold for few-shot image classification on CIFAR-FS and mini-ImageNet. Our results provide guidance for allocating labels across tasks when collecting data for meta-learning.

Key facts. Cited by 7 papers in the map (data through 14 Oct 2026). Builds on 21 of its 41 references that are in the map. First posted on arXiv 15 Mar 2021.

Builds on

21 of 41 references.

References · 21

  1. 2014Adam: A Method for Stochastic Optimizationcited by 37,240
  2. 2017Model-Agnostic Meta-Learning for Fast Adaptation of Deep Networkscited by 4,897
  3. 2016Matching Networks for One Shot Learningcited by 2,255
  4. 2020Meta-Learning in Neural Networks: A Surveycited by 950
  5. 2019Deep Double Descent: Where Bigger Models and More Data Hurtcited by 672
  6. 2020Learning from Noisy Labels with Deep Neural Networks: A Surveycited by 582
  7. 2013DeCAF: A Deep Convolutional Activation Feature for Generic Visual Recognitioncited by 424
  8. 2018Meta-learning with differentiable closed-form solverscited by 397
  9. 2017Few-Shot Learning with Graph Neural Networkscited by 324
  10. 2018Probabilistic Model-Agnostic Meta-Learningcited by 256
  11. 2020Few-Shot Learning via Learning the Representation, Provablycited by 214
  12. 2018Bayesian Model-Agnostic Meta-Learningcited by 194
9 more
  1. 2020Provable Meta-Learning of Linear Representationscited by 161
  2. 2019Fast and Flexible Multi-Task Classification Using Conditional Neural Adaptive Processescited by 131
  3. 2014Curriculum Learning of Multiple Taskscited by 66
  4. 2020Meta-learning for mixed linear regressioncited by 44
  5. 2017Learning Algorithms for Active Learningcited by 30
  6. 2020How Important is the Train-Validation Split in Meta-Learning?cited by 30
  7. 2016Multi-Task Learning with Labeled and Unlabeled Taskscited by 17
  8. 2020Modeling and Optimization Trade-off in Meta-learningcited by 13
  9. 2021Meta-learning with negative learning ratescited by 11

Built on by

Cited by year (2026 to 14 Oct)

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

7 papers.