Few-Shot Learning by Dimensionality Reduction in Gradient Space
Not on the map. Why?
Abstract (arXiv)
We introduce SubGD, a novel few-shot learning method which is based on the recent finding that stochastic gradient descent updates tend to live in a low-dimensional parameter subspace. In experimental and theoretical analyses, we show that models confined to a suitable predefined subspace generalize well for few-shot learning. A suitable subspace fulfills three criteria across the given tasks: it (a) allows to reduce the training error by gradient flow, (b) leads to models that generalize well, and (c) can be identified by stochastic gradient descent. SubGD identifies these subspaces from an eigendecomposition of the auto-correlation matrix of update directions across different tasks. Demonstrably, we can identify low-dimensional suitable subspaces for few-shot learning of dynamical systems, which have varying properties described by one or few parameters of the analytical system description. Such systems are ubiquitous among real-world applications in science and engineering. We experimentally corroborate the advantages of SubGD on three distinct dynamical systems problem settings, significantly outperforming popular few-shot learning methods both in terms of sample efficiency and performance.
Key facts. Cited by 8 papers in the map (data through 7 Oct 2026). Builds on 31 of its 61 references that are in the map. First posted on arXiv 7 Jun 2022.
Builds on
31 of 61 references.
References · 31
- 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
- 2016Learning to learn by gradient descent by gradient descentcited by 616
- 2017Meta-SGD: Learning to Learn Quickly for Few-Shot Learningcited by 377
- 2018Measuring the Intrinsic Dimension of Objective Landscapescited by 364
- 2019Rapid Learning or Feature Reuse? Towards Understanding the Effectiveness of MAMLcited by 359
- 2018Few-Shot Learning via Embedding Adaptation with Set-to-Set Functionscited by 293
19 more
- 2017High-dimensional dynamics of generalization error in neural networkscited by 238
- 2018Gradient Descent Happens in a Tiny Subspacecited by 208
- 2013Revisiting Natural Gradient for Deep Networkscited by 157
- 2019Multimodal Model-Agnostic Meta-Learning via Task-Aware Modulationcited by 103
- 2019Meta-Learning with Warped Gradient Descentcited by 98
- 2018The Singular Values of Convolutional Layerscited by 95
- 2019Meta-Curvaturecited by 70
- 2019Towards Learning Universal, Regional, and Local Hydrological Behaviors via Machine-Learning Applied to Large-Sample Datasetscited by 68
- 2019Generalization bounds for deep convolutional neural networkscited by 58
- 2021Universal Representation Learning from Multiple Domains for Few-shot Classificationcited by 56
- 2020Few-shot Domain Adaptation by Causal Mechanism Transfercited by 47
- 2019On Generalization Bounds of a Family of Recurrent Neural Networkscited by 42
- 2020Cross-Domain Few-Shot Learning by Representation Fusioncited by 32
- 2021Fast Adaptation with Linearized Neural Networkscited by 32
- 2019Modular Meta-Learning with Shrinkagecited by 31
- 2020Continuous-time system identification with neural networks: Model structures and fitting criteriacited by 28
- 2021How many degrees of freedom do we need to train deep networks: a loss landscape perspectivecited by 28
- 2022On the adaptation of recurrent neural networks for system identificationcited by 13
- 2019NeuralHydrology -- Interpreting LSTMs in Hydrologycited by 12
Built on by
Citing papers per year: 2023: 1; 2024: 7.
8 papers.
- 2024Does SGD really happen in tiny subspaces?cited by 35
- 2023Fine-tuning Happens in Tiny Subspaces: Exploring Intrinsic Task-specific Subspaces of Pre-trained Language Modelscited by 19
- 2024Parameter Efficient Fine-tuning via Explained Variance Adaptationcited by 17
- 2024SymbolicAI: A framework for logic-based approaches combining generative models and solverscited by 15
- 2024A Layer Selection Approach to Test Time Adaptationcited by 7
- 2024Identifying Policy Gradient Subspacescited by 5
- 2024PMSS: Pretrained Matrices Skeleton Selection for LLM Fine-tuningcited by 5
- 2024PARMESAN: Parameter-Free Memory Search and Transduction for Dense Prediction Taskscited by 1
- 2024Parameter Efficient Fine-tuning via Explained Variance Adaptation9 Oct 2024
- 2024PMSS: Pretrained Matrices Skeleton Selection for LLM Fine-tuning25 Sep 2024
- 2024Does SGD really happen in tiny subspaces?25 May 2024
- 2024A Layer Selection Approach to Test Time Adaptation4 Apr 2024
- 2024PARMESAN: Parameter-Free Memory Search and Transduction for Dense Prediction Tasks18 Mar 2024
- 2024SymbolicAI: A framework for logic-based approaches combining generative models and solvers1 Feb 2024
- 2024Identifying Policy Gradient Subspaces12 Jan 2024
- 2023Fine-tuning Happens in Tiny Subspaces: Exploring Intrinsic Task-specific Subspaces of Pre-trained Language Models27 May 2023