Any-Way Meta Learning
Not on the map. Why?
Abstract (arXiv)
Although meta-learning seems promising performance in the realm of rapid adaptability, it is constrained by fixed cardinality. When faced with tasks of varying cardinalities that were unseen during training, the model lacks its ability. In this paper, we address and resolve this challenge by harnessing `label equivalence' emerged from stochastic numeric label assignments during episodic task sampling. Questioning what defines ``true" meta-learning, we introduce the ``any-way" learning paradigm, an innovative model training approach that liberates model from fixed cardinality constraints. Surprisingly, this model not only matches but often outperforms traditional fixed-way models in terms of performance, convergence speed, and stability. This disrupts established notions about domain generalization. Furthermore, we argue that the inherent label equivalence naturally lacks semantic information. To bridge this semantic information gap arising from label equivalence, we further propose a mechanism for infusing semantic class information into the model. This would enhance the model's comprehension and functionality. Experiments conducted on renowned architectures like MAML and ProtoNet affirm the effectiveness of our method.
Key facts. Cited by 1 paper in the map (data through 7 Oct 2026). Builds on 19 of its 28 references that are in the map. First posted on arXiv 10 Jan 2024.
Builds on
19 of 28 references.
References · 19
- 2014ImageNet Large Scale Visual Recognition Challengecited by 8,441
- 2017Model-Agnostic Meta-Learning for Fast Adaptation of Deep Networkscited by 4,861
- 2016Overcoming catastrophic forgetting in neural networkscited by 4,718
- 2017Prototypical Networks for Few-shot Learningcited by 3,001
- 2016Matching Networks for One Shot Learningcited by 2,246
- 2015Unsupervised Visual Representation Learning by Context Predictioncited by 1,062
- 2018On First-Order Meta-Learning Algorithmscited by 1,003
- 2017Learning to Generalize: Meta-Learning for Domain Generalizationcited by 762
- 2019A Closer Look at Few-shot Classificationcited by 679
- 2019Meta-Learning with Implicit Gradientscited by 523
- 2018Meta-Learning with Latent Embedding Optimizationcited by 476
- 2018Meta-Learning for Semi-Supervised Few-Shot Classificationcited by 456
7 more
- 2019Rapid Learning or Feature Reuse? Towards Understanding the Effectiveness of MAMLcited by 359
- 2015Domain Generalization for Object Recognition with Multi-task Autoencoderscited by 253
- 2015The Benefit of Multitask Representation Learningcited by 194
- 2019Meta-Learning with Warped Gradient Descentcited by 98
- 2019Torchmeta: A Meta-Learning library for PyTorchcited by 52
- 2021Label Hallucination for Few-Shot Classificationcited by 11
- 2023SHOT: Suppressing the Hessian along the Optimization Trajectory for Gradient-Based Meta-Learningcited by 1
Built on by
Citing papers per year: 2025: 1.
1 paper.