mlsanityData to 7 Oct 2026

Robust MAML: Prioritization task buffer with adaptive learning process for model-agnostic meta-learning

arXiv 2103.08233 ↗First posted 15 Mar 2021cs.LG cs.AI cs.SYcited by 8

Not on the map. Why?

Abstract (arXiv)

Model agnostic meta-learning (MAML) is a popular state-of-the-art meta-learning algorithm that provides good weight initialization of a model given a variety of learning tasks. The model initialized by provided weight can be fine-tuned to an unseen task despite only using a small amount of samples and within a few adaptation steps. MAML is simple and versatile but requires costly learning rate tuning and careful design of the task distribution which affects its scalability and generalization. This paper proposes a more robust MAML based on an adaptive learning scheme and a prioritization task buffer(PTB) referred to as Robust MAML (RMAML) for improving scalability of training process and alleviating the problem of distribution mismatch. RMAML uses gradient-based hyper-parameter optimization to automatically find the optimal learning rate and uses the PTB to gradually adjust train-ing task distribution toward testing task distribution over the course of training. Experimental results on meta reinforcement learning environments demonstrate a substantial performance gain as well as being less sensitive to hyper-parameter choice and robust to distribution mismatch.

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

Builds on

16 of 24 references.

References · 16

  1. 2017Model-Agnostic Meta-Learning for Fast Adaptation of Deep Networkscited by 4,861
  2. 2017Prototypical Networks for Few-shot Learningcited by 3,001
  3. 2015Trust Region Policy Optimizationcited by 2,503
  4. 2016Matching Networks for One Shot Learningcited by 2,246
  5. 2017Learning to Compare: Relation Network for Few-Shot Learningcited by 1,139
  6. 2018On First-Order Meta-Learning Algorithmscited by 1,003
  7. 2014Neural Turing Machinescited by 630
  8. 2016RL2: Fast Reinforcement Learning via Slow Reinforcement Learningcited by 490
  9. 2019Efficient Off-Policy Meta-Reinforcement Learning via Probabilistic Context Variablescited by 372
  10. 2015Gradient-based Hyperparameter Optimization through Reversible Learningcited by 357
  11. 2018How to train your MAMLcited by 306
  12. 2017Meta Networkscited by 268
4 more
  1. 2018Probabilistic Model-Agnostic Meta-Learningcited by 254
  2. 2018Distributed Distributional Deterministic Policy Gradientscited by 195
  3. 2017Online Learning Rate Adaptation with Hypergradient Descentcited by 117
  4. 2020Curriculum in Gradient-Based Meta-Reinforcement Learningcited by 9

Built on by

Cited by year (2026 to 7 Oct)

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

8 papers.