Cooperative Meta-Learning with Gradient Augmentation

• URL: http://arxiv.org/abs/2406.04639v1
• Date: Fri, 7 Jun 2024 04:54:00 GMT
• Title: Cooperative Meta-Learning with Gradient Augmentation
• Authors: Jongyun Shin, Seunjin Han, Jangho Kim,
• Abstract summary: We propose a novel cooperative meta-learning framework dubbed CML. In this work, we propose a novel cooperative meta-learning framework dubbed CML.
• Score: 6.472397166280681
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Model agnostic meta-learning (MAML) is one of the most widely used gradient-based meta-learning, consisting of two optimization loops: an inner loop and outer loop. MAML learns the new task from meta-initialization parameters with an inner update and finds the meta-initialization parameters in the outer loop. In general, the injection of noise into the gradient of the model for augmenting the gradient is one of the widely used regularization methods. In this work, we propose a novel cooperative meta-learning framework dubbed CML which leverages gradient-level regularization with gradient augmentation. We inject learnable noise into the gradient of the model for the model generalization. The key idea of CML is introducing the co-learner which has no inner update but the outer loop update to augment gradients for finding better meta-initialization parameters. Since the co-learner does not update in the inner loop, it can be easily deleted after meta-training. Therefore, CML infers with only meta-learner without additional cost and performance degradation. We demonstrate that CML is easily applicable to gradient-based meta-learning methods and CML leads to increased performance in few-shot regression, few-shot image classification and few-shot node classification tasks. Our codes are at https://github.com/JJongyn/CML.

Related papers

• Fast Adaptation with Kernel and Gradient based Meta Leaning [4.763682200721131]
  We propose two algorithms to improve both the inner and outer loops of Model A Meta Learning (MAML) Our first algorithm redefines the optimization problem in the function space to update the model using closed-form solutions. In the outer loop, the second algorithm adjusts the learning of the meta-learner by assigning weights to the losses from each task of the inner loop.
  arXiv  Detail & Related papers  (2024-11-01T07:05:03Z)
• HyperMAML: Few-Shot Adaptation of Deep Models with Hypernetworks [0.0]
  Few-Shot learning aims to train models which can easily adapt to previously unseen tasks. Model-Agnostic Meta-Learning (MAML) is one of the most popular Few-Shot learning approaches. In this paper, we propose HyperMAML, where the training of the update procedure is also part of the model.
  arXiv  Detail & Related papers  (2022-05-31T12:31:21Z)
• Continuous-Time Meta-Learning with Forward Mode Differentiation [65.26189016950343]
  We introduce Continuous Meta-Learning (COMLN), a meta-learning algorithm where adaptation follows the dynamics of a gradient vector field. Treating the learning process as an ODE offers the notable advantage that the length of the trajectory is now continuous. We show empirically its efficiency in terms of runtime and memory usage, and we illustrate its effectiveness on a range of few-shot image classification problems.
  arXiv  Detail & Related papers  (2022-03-02T22:35:58Z)
• One Step at a Time: Pros and Cons of Multi-Step Meta-Gradient Reinforcement Learning [61.662504399411695]
  We introduce a novel method mixing multiple inner steps that enjoys a more accurate and robust meta-gradient signal. When applied to the Snake game, the mixing meta-gradient algorithm can cut the variance by a factor of 3 while achieving similar or higher performance.
  arXiv  Detail & Related papers  (2021-10-30T08:36:52Z)
• Contextual Gradient Scaling for Few-Shot Learning [24.19934081878197]
  We propose contextual gradient scaling (CxGrad) for model-agnostic meta-learning (MAML) CxGrad scales gradient norms of the backbone to facilitate learning task-specific knowledge in the inner-loop. Experimental results show that CxGrad effectively encourages the backbone to learn task-specific knowledge in the inner-loop.
  arXiv  Detail & Related papers  (2021-10-20T03:05:58Z)
• Meta-Learning with Adjoint Methods [16.753336086160598]
  A Meta-Learning (MAML) is widely used to find a good initialization for a family of tasks. Despite its success, a critical challenge in MAML is to calculate the gradient w.r.t the initialization of a long training trajectory for the sampled tasks. We propose Adjoint MAML (A-MAML) to address this problem. We demonstrate the advantage of our approach in both synthetic and real-world meta-learning tasks.
  arXiv  Detail & Related papers  (2021-10-16T01:18:50Z)
• MetaDelta: A Meta-Learning System for Few-shot Image Classification [71.06324527247423]
  We propose MetaDelta, a novel practical meta-learning system for the few-shot image classification. Each meta-learner in MetaDelta is composed of a unique pretrained encoder fine-tuned by batch training and parameter-free decoder used for prediction.
  arXiv  Detail & Related papers  (2021-02-22T02:57:22Z)
• Meta-Learning with Neural Tangent Kernels [58.06951624702086]
  We propose the first meta-learning paradigm in the Reproducing Kernel Hilbert Space (RKHS) induced by the meta-model's Neural Tangent Kernel (NTK) Within this paradigm, we introduce two meta-learning algorithms, which no longer need a sub-optimal iterative inner-loop adaptation as in the MAML framework. We achieve this goal by 1) replacing the adaptation with a fast-adaptive regularizer in the RKHS; and 2) solving the adaptation analytically based on the NTK theory.
  arXiv  Detail & Related papers  (2021-02-07T20:53:23Z)
• Fast Few-Shot Classification by Few-Iteration Meta-Learning [173.32497326674775]
  We introduce a fast optimization-based meta-learning method for few-shot classification. Our strategy enables important aspects of the base learner objective to be learned during meta-training. We perform a comprehensive experimental analysis, demonstrating the speed and effectiveness of our approach.
  arXiv  Detail & Related papers  (2020-10-01T15:59:31Z)
• MetaMix: Improved Meta-Learning with Interpolation-based Consistency Regularization [14.531741503372764]
  We propose an approach called MetaMix to regularize backbone models. It generates virtual feature-target pairs within each episode to regularize the backbone models. It can be integrated with any of the MAML-based algorithms and learn the decision boundaries generalizing better to new tasks.
  arXiv  Detail & Related papers  (2020-09-29T02:44:13Z)
• BOML: A Modularized Bilevel Optimization Library in Python for Meta Learning [52.90643948602659]
  BOML is a modularized optimization library that unifies several meta-learning algorithms into a common bilevel optimization framework. It provides a hierarchical optimization pipeline together with a variety of iteration modules, which can be used to solve the mainstream categories of meta-learning methods.
  arXiv  Detail & Related papers  (2020-09-28T14:21:55Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.