Invariant Meta Learning for Out-of-Distribution Generalization
Not on the map. Why?
Abstract (arXiv)
Modern deep learning techniques have illustrated their excellent capabilities in many areas, but relies on large training data. Optimization-based meta-learning train a model on a variety tasks, such that it can solve new learning tasks using only a small number of training samples.However, these methods assumes that training and test dataare identically and independently distributed. To overcome such limitation, in this paper, we propose invariant meta learning for out-of-distribution tasks. Specifically, invariant meta learning find invariant optimal meta-initialization,and fast adapt to out-of-distribution tasks with regularization penalty. Extensive experiments demonstrate the effectiveness of our proposed invariant meta learning on out-of-distribution few-shot tasks.
Key facts. Cited by 1 paper in the map (data through 7 Oct 2026). Builds on 17 of its 25 references that are in the map. First posted on arXiv 26 Jan 2023.
Builds on
17 of 25 references.
References · 17
- 2014Adam: A Method for Stochastic Optimizationcited by 36,960
- 2017Model-Agnostic Meta-Learning for Fast Adaptation of Deep Networkscited by 4,861
- 2017Prototypical Networks for Few-shot Learningcited by 3,001
- 2016Matching Networks for One Shot Learningcited by 2,246
- 2017Learning to Compare: Relation Network for Few-Shot Learningcited by 1,139
- 2018On First-Order Meta-Learning Algorithmscited by 1,003
- 2020Meta-Learning in Neural Networks: A Surveycited by 944
- 2019A Closer Look at Few-shot Classificationcited by 679
- 2019Meta-Learning with Implicit Gradientscited by 523
- 2018Meta-Learning with Latent Embedding Optimizationcited by 476
- 2017Meta-SGD: Learning to Learn Quickly for Few-Shot Learningcited by 377
- 2018Federated Meta-Learning with Fast Convergence and Efficient Communicationcited by 154
5 more
- 2019Multimodal Model-Agnostic Meta-Learning via Task-Aware Modulationcited by 103
- 2017Meta-Learning and Universality: Deep Representations and Gradient Descent can Approximate any Learning Algorithmcited by 65
- 2018Deep Bilevel Learningcited by 48
- 2019Learning to Balance: Bayesian Meta-Learning for Imbalanced and Out-of-distribution Taskscited by 48
- 2020Is Support Set Diversity Necessary for Meta-Learning?cited by 14
Built on by
Citing papers per year: 2023: 1.
1 paper.