Learning to learn by gradient descent by gradient descent

By Marcin Andrychowicz, Misha Denil, Sergio Gomez Colmenarejo, Matthew W. Hoffman, David Pfau, Tom Schaul, Nando de Freitas. 2016

2,222 citations recorded by the source corpus.

The move from hand-designed features to learned features in machine learning has been wildly successful. In spite of this, optimization algorithms are still designed by hand. In this paper we show how the design of an optimization algorithm can be cast as a learning problem, allowing the algorithm to learn to exploit structure in the problems of interest in an automatic way. Our learned algorithms, implemented by LSTMs, outperform generic, hand-designed competitors on the tasks for which they are trained, and also generalize well to new tasks with similar structure. We demonstrate this on a number of tasks, including simple convex problems, training neural networks, and styling images with neural art.

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

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. Quoc V. Le
  4. Mohit Bansal
  5. Pieter Abbeel
  6. Jianfeng Gao
  7. Chelsea Finn
  8. Ruslan Salakhutdinov

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. Andrew Zisserman
  8. Andrea Vedaldi

In Large Language Models

  1. Luke S. Zettlemoyer
  2. Yejin Choi
  3. Quoc V. Le
  4. Hinrich Schütze
  5. Kyunghyun Cho
  6. Noah A. Smith
  7. Jianfeng Gao
  8. Richard Socher

In Optimization & Training

  1. Quoc V. Le
  2. Sergey Levine
  3. Yoshua Bengio
  4. Pieter Abbeel
  5. Chelsea Finn
  6. Razvan Pascanu
  7. Frank Hutter
  8. Barret Zoph

Citations in the corpus