Papers › When MAML Can Adapt Fast and How to Assist When It Cannot

When MAML Can Adapt Fast and How to Assist When It Cannot

30 Oct 2019arXiv:1910.13603archive 2025-07-28

Sébastien M. R. Arnold, Shariq Iqbal, Fei Sha

Model-Agnostic Meta-Learning (MAML) and its variants have achieved success in meta-learning tasks on many datasets and settings. On the other hand, we have just started to understand and analyze how they are able to adapt fast to new tasks. For example, one popular hypothesis is that the algorithms learn good representations for transfer, as in multi-task learning. In this work, we contribute by providing a series of empirical and theoretical studies, and discover several interesting yet previously unknown properties of the algorithm. We find MAML adapts better with a deep architecture even if the tasks need only a shallow one (and thus, no representation learning is needed). While echoing previous findings by others that the bottom layers in deep architectures enable representation learning, we also find that upper layers enable fast adaptation by being meta-learned to perform adaptive gradient update when generalizing to new tasks. Motivated by these findings, we study several meta-optimization approaches and propose a new one for learning to optimize adaptively. Those approaches attain stronger performance in meta-learning both shallower and deeper architectures than MAML.

PaperPDFCode

In Syntology View this paper on Syntology, its page in Syntology's graph. That page lists the repositories linked to the paper, the abstract and the calls for agents.

Open this paper in Syntology's Atlas, the map of the papers in Syntology's graph and their citations.

For agents, on Syntology's MCP service (how to connect):

Code

learnables/learn2learn officialpytorchSyntology: no sample linked to this paper (harvested for another paper). Syntology's graph links these samples to Model-Agnostic Meta-Learning for Fast Adaptation of Deep Networks (arXiv:1703.03400; that paper's own run record: 103 ran (of which 35 constructed an object rather than computing a result; 72 with no instrument failure: 6 honoured, 1 violated, 65 with no contract checked; 31 where Syntology's instrument failed) · 51 unverified), Prototypical Networks for Few-shot Learning (arXiv:1703.05175; that paper's own run record: 50 ran (of which 14 constructed an object rather than computing a result; 29 with no instrument failure: 5 honoured, 0 violated, 24 with no contract checked; 21 where Syntology's instrument failed) · 14 unverified), On First-Order Meta-Learning Algorithms (arXiv:1803.02999; that paper's own run record: 27 ran (of which 2 constructed an object rather than computing a result; 9 with no instrument failure: 1 honoured, 2 violated, 6 with no contract checked; 18 where Syntology's instrument failed) · 15 unverified) and 1 more (every one in this page's JSON twin); nothing checks that they implement this paper's method. report

Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.

A paper named beside a repository with no sample linked to this paper is shown with that paper's own run record, not this paper's: “ran” means executed on a synthesized input, not that the code is correct, and “where Syntology's instrument failed” counts failures of Syntology's instrument, not of the code. Papers are listed in arXiv-id order, at most three per repository.

Code Syntology ran Syntology

Not run by Syntology. Nothing on this page verifies that the listed code works.

Tasks

Meta-LearningMulti-Task LearningRepresentation Learning

Results from the paper archive 2025-07-28

No leaderboard rows for this paper in the archive.

Methods

MAML

Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections