Meta-learning the Learning Trends Shared Across Tasks
Not on the map. Why?
Abstract (arXiv)
Meta-learning stands for 'learning to learn' such that generalization to new tasks is achieved. Among these methods, Gradient-based meta-learning algorithms are a specific sub-class that excel at quick adaptation to new tasks with limited data. This demonstrates their ability to acquire transferable knowledge, a capability that is central to human learning. However, the existing meta-learning approaches only depend on the current task information during the adaptation, and do not share the meta-knowledge of how a similar task has been adapted before. To address this gap, we propose a 'Path-aware' model-agnostic meta-learning approach. Specifically, our approach not only learns a good initialization for adaptation, it also learns an optimal way to adapt these parameters to a set of task-specific parameters, with learnable update directions, learning rates and, most importantly, the way updates evolve over different time-steps. Compared to the existing meta-learning methods, our approach offers: (a) The ability to learn gradient-preconditioning at different time-steps of the inner-loop, thereby modeling the dynamic learning behavior shared across tasks, and (b) The capability of aggregating the learning context through the provision of direct gradient-skip connections from the old time-steps, thus avoiding overfitting and improving generalization. In essence, our approach not only learns a transferable initialization, but also models the optimal update directions, learning rates, and task-specific learning trends. Specifically, in terms of learning trends, our approach determines the way update directions shape up as the task-specific learning progresses and how the previous update history helps in the current update. Our approach is simple to implement and demonstrates faster convergence. We report significant performance improvements on a number of FSL datasets.
Key facts. Cited by 8 papers in the map (data through 14 Oct 2026). First posted on arXiv 19 Oct 2020.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2022: 4; 2023: 1; 2024: 2; 2025: 1.
8 papers.
- 2022HyperShot: Few-Shot Learning by Kernel HyperNetworkscited by 24
- 2022HyperMAML: Few-Shot Adaptation of Deep Models with Hypernetworkscited by 17
- 2023Meta-Learning with a Geometry-Adaptive Preconditionercited by 11
- 2024FewShotNeRF: Meta-Learning-based Novel View Synthesis for Rapid Scene-Specific Adaptationcited by 2
- 2024Task-Specific Preconditioner for Cross-Domain Few-Shot Learningcited by 1
- 2022Hypernetwork approach to Bayesian MAMLcited by 0
- 2022Meta-Shop: Improving Item Advertisement For Small Businessescited by 0
- 2025Learnable Loss Geometries with Mirror Descent for Scalable and Convergent Meta-Learningcited by 0
- 2025Learnable Loss Geometries with Mirror Descent for Scalable and Convergent Meta-Learning2 Sep 2025
- 2024Task-Specific Preconditioner for Cross-Domain Few-Shot Learning20 Dec 2024
- 2024FewShotNeRF: Meta-Learning-based Novel View Synthesis for Rapid Scene-Specific Adaptation9 Aug 2024
- 2023Meta-Learning with a Geometry-Adaptive Preconditioner4 Apr 2023
- 2022Meta-Shop: Improving Item Advertisement For Small Businesses2 Dec 2022
- 2022Hypernetwork approach to Bayesian MAML6 Oct 2022
- 2022HyperMAML: Few-Shot Adaptation of Deep Models with Hypernetworks31 May 2022
- 2022HyperShot: Few-Shot Learning by Kernel HyperNetworks21 Mar 2022