Continual / Methods
verifiedMeta-Learning
Learn something that makes learning the next thing faster. Rather than fitting one task, fit an initialisation, or an update rule, or a representation, such that a handful of examples is enough afterwards. It is training for adaptability rather than for performance.
MAML's version optimises through the inner update, which needs second derivatives and is expensive enough that first-order approximations are the default in practice. The uncomfortable result is that much of the benefit comes from feature reuse rather than rapid adaptation — the learned initialisation is a good representation, and freezing most of it and training a head recovers most of the gain.
Minimise the loss after one or more gradient steps: min sub θ Σ sub tasks L(θ − α∇L sub task (θ)). Differentiating through that inner step gives a Hessian-vector product, which first-order variants drop entirely — and they lose little, which is itself evidence about where the benefit comes from.
adaptation-steps holds 50% of the budget; rest holds the remaining 50%.
Gradient steps taken at adaptation time against the single step the meta-objective is trained through, in steps. Drag the inner loop up to watch adaptation dominate — and the cost of differentiating through it dominate with it.
Reviewed by opendroid · 2026-08-18
- arXiv:1703.03400 — Model-Agnostic Meta-Learning for Fast Adaptation of Deep Networks