MAC: A Meta-Learning Approach for Feature Learning and Recombination
Not on the map. Why?
Abstract (arXiv)
Optimization-based meta-learning aims to learn an initialization so that a new unseen task can be learned within a few gradient updates. Model Agnostic Meta-Learning (MAML) is a benchmark algorithm comprising two optimization loops. The inner loop is dedicated to learning a new task and the outer loop leads to meta-initialization. However, ANIL (almost no inner loop) algorithm shows that feature reuse is an alternative to rapid learning in MAML. Thus, the meta-initialization phase makes MAML primed for feature reuse and obviates the need for rapid learning. Contrary to ANIL, we hypothesize that there may be a need to learn new features during meta-testing. A new unseen task from non-similar distribution would necessitate rapid learning in addition reuse and recombination of existing features. In this paper, we invoke the width-depth duality of neural networks, wherein, we increase the width of the network by adding extra computational units (ACU). The ACUs enable the learning of new atomic features in the meta-testing task, and the associated increased width facilitates information propagation in the forwarding pass. The newly learnt features combine with existing features in the last layer for meta-learning. Experimental results show that our proposed MAC method outperformed existing ANIL algorithm for non-similar task distribution by approximately 13% (5-shot task setting)
Key facts. Cited by 1 paper in the map (data through 14 Oct 2026). Builds on 25 of its 45 references that are in the map. First posted on arXiv 20 Sep 2022.
Builds on
25 of 45 references.
References · 25
- 2017Attention Is All You Needcited by 60,361
- 2017Model-Agnostic Meta-Learning for Fast Adaptation of Deep Networkscited by 4,897
- 2017Prototypical Networks for Few-shot Learningcited by 3,015
- 2016Matching Networks for One Shot Learningcited by 2,255
- 2017Learning to Compare: Relation Network for Few-Shot Learningcited by 1,143
- 2018On First-Order Meta-Learning Algorithmscited by 1,018
- 2016End to End Learning for Self-Driving Carscited by 1,009
- 2019A Closer Look at Few-shot Classificationcited by 684
- 2018Meta-Learning with Latent Embedding Optimizationcited by 476
- 2020Rethinking Few-Shot Image Classification: a Good Embedding Is All You Need?cited by 437
- 2018TADAM: Task dependent adaptive metric for improved few-shot learningcited by 408
- 2017Meta-SGD: Learning to Learn Quickly for Few-Shot Learningcited by 379
13 more
- 2019Rapid Learning or Feature Reuse? Towards Understanding the Effectiveness of MAMLcited by 359
- 2019Meta-Dataset: A Dataset of Datasets for Learning to Learn from Few Examplescited by 315
- 2018How to train your MAMLcited by 309
- 2018Meta-Transfer Learning for Few-Shot Learningcited by 306
- 2017Meta Networkscited by 269
- 2020Do Wide and Deep Networks Learn the Same Things? Uncovering How Neural Network Representations Vary with Width and Depthcited by 245
- 2018Task-Agnostic Meta-Learning for Few-shot Learningcited by 151
- 2017The loss surface of deep and wide neural networkscited by 74
- 2019Hierarchically Structured Meta-learningcited by 68
- 2019Torchmeta: A Meta-Learning library for PyTorchcited by 52
- 2020Quasi-Equivalence of Width and Depth of Neural Networkscited by 7
- 2018Deep Learning for Forecasting Stock Returns in the Cross-Sectioncited by 6
- 2021Does MAML Only Work via Feature Re-use? A Data Centric Perspectivecited by 2
Built on by
Citing papers per year: 2025: 1.
1 paper.