Accelerating Meta-Learning by Sharing Gradients
Not on the map. Why?
Abstract (arXiv)
The success of gradient-based meta-learning is primarily attributed to its ability to leverage related tasks to learn task-invariant information. However, the absence of interactions between different tasks in the inner loop leads to task-specific over-fitting in the initial phase of meta-training. While this is eventually corrected by the presence of these interactions in the outer loop, it comes at a significant cost of slower meta-learning. To address this limitation, we explicitly encode task relatedness via an inner loop regularization mechanism inspired by multi-task learning. Our algorithm shares gradient information from previously encountered tasks as well as concurrent tasks in the same task batch, and scales their contribution with meta-learned parameters. We show using two popular few-shot classification datasets that gradient sharing enables meta-learning under bigger inner loop learning rates and can accelerate the meta-training process by up to 134%.
Key facts. No citing papers in the map yet (data through 7 Oct 2026). Builds on 9 of its 15 references that are in the map. First posted on arXiv 13 Dec 2023.
Builds on
9 of 15 references.
References · 9
- 2017Model-Agnostic Meta-Learning for Fast Adaptation of Deep Networkscited by 4,861
- 2019Meta-Learning with Implicit Gradientscited by 523
- 2017Meta-SGD: Learning to Learn Quickly for Few-Shot Learningcited by 377
- 2018How to train your MAMLcited by 306
- 2018Task-Agnostic Meta-Learning for Few-shot Learningcited by 151
- 2019Meta-Learning without Memorizationcited by 92
- 2019Provable Guarantees for Gradient-Based Meta-Learningcited by 67
- 2019Torchmeta: A Meta-Learning library for PyTorchcited by 52
- 2019Towards Understanding Generalization in Gradient-Based Meta-Learningcited by 12
Built on by
Not cited yet.