On First-Order Meta-Learning Algorithms

By Alex Nichol, Joshua Achiam, John Schulman. arXiv.org, 2018

2,619 citations recorded by the source corpus.

This paper considers meta-learning problems, where there is a distribution of tasks, and we would like to obtain an agent that performs well (i.e., learns quickly) when presented with a previously unseen task sampled from this distribution. We analyze a family of algorithms for learning a parameter initialization that can be fine-tuned quickly on a new task, using only first-order derivatives for the meta-learning updates. This family includes and generalizes first-order MAML, an approximation to MAML obtained by ignoring second-order derivatives. It also includes Reptile, a new algorithm that we introduce here, which works by repeatedly sampling a task, training on it, and moving the initialization towards the trained weights on that task. We expand on the results from Finn et al. showing that first-order meta-learning algorithms perform well on some well-established benchmarks for few-shot classification, and we provide theoretical analysis aimed at understanding why these algorithms work.

Subfields: Artificial Intelligence, Computer Vision and Pattern Recognition, Optimization & Training

View Paper: https://arxiv.org/abs/1803.02999

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Artificial Intelligence

  1. Sergey Levine
  2. Yoshua Bengio
  3. Mohit Bansal
  4. Dacheng Tao
  5. Trevor Darrell
  6. Quoc V. Le
  7. Chelsea Finn
  8. Jianfeng Gao

In Computer Vision and Pattern Recognition

  1. Luc Van Gool
  2. Dacheng Tao
  3. Trevor Darrell
  4. Ming-Hsuan Yang
  5. Xiaogang Wang
  6. Jitendra Malik
  7. Bernt Schiele
  8. Yi Yang

In Optimization & Training

  1. Jakub Konecný
  2. Martin Jaggi
  3. Peter Richtárik
  4. Aryan Mokhtari
  5. Sebastian U. Stich
  6. Sergey Levine
  7. Jianyu Wang
  8. Gauri Joshi

Citations in the corpus