HackerPapers

arXiv:1606.04474cs.NE

Learning to learn by gradient descent by gradient descent

Marcin Andrychowicz, Misha Denil, Sergio Gomez, Matthew W. Hoffman, David Pfau, Tom Schaul, Brendan Shillingford, Nando de Freitas

Abstract

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.

arXiv comments
Journal reference
DOI
Subjects
cs.NENeural and Evolutionary Computing cs.LGMachine Learning

On Hacker News

Linked by 15 identifiable commenters in 15 comments across 13 threads, from Aug 2016 to Mar 2025. Found in 3 HN submissions from Jun 2016 to Jun 2016. Open submission discussions.

Comments linking this paper, per year.

Discussed in comments13 threads

    • How does it compare to previous work on learning to learn? I don't see it referenced https://arxiv.org/abs/1606.04474

      jn2clarkView on HNParent context

    • > So, in case of (stochastic) gradient descent to train a neural network, that would be the neural network that you want to use AD on, not the gradient descent algorithm. Obviously. The specific proposal of differential programming as a paradigm that goes beyond simple…

      radarsat1View on HNParent context

    • Can’t pass on the opportunity to share one of my favorite (and topical!) paper titles: https://arxiv.org/abs/1606.04474

      samatmanView on HNParent context

    • Your algorithm description sounds like a variant of greedy local search with a NN heuristic. While I personaly do not know of a paper that does this kind of local search (I have not looked), I do want to add that there is a rich literature on "learning to learning", including…

      human_scientistView on HNParent context

    • There has been some work related to what you are describing: Learning to learn by gradient descent by gradient descent https://arxiv.org/abs/1606.04474 Related (but less so), there are also some papers about learning neural network architectures: Designing Neural Network…

      chriskananView on HNParent context

  1. First introduction to LaTeX 1 comment
    • Besides Googling for tricks, another way of learning LaTeX is to download the source code for nice-looking papers that you find on the arXiv. For example, for "Learning to learn by gradient descent by gradient descent" arXiv:1606.04474 (https://arxiv.org/abs/1606.04474), if you…

      greeneggsView on HNParent context

    • I think it's important to note that all of these methods have been largely superseded by deep learning techniques. For example, we can now directly learn algorithms such as gradient descent[1] and classical inverse problems like superresolution are solvable with deep networks…

      digitalemble72View on HNParent context

    • Disclaimer: Interested in NN, but no real knowledge yet. A ML-learning group at my university recently discussed Learning to learn by gradient descent by gradient descent [1], the topic seems related. This indicates to me that at least some progress was made. [1]…

      LeanderKView on HNParent context

    • The obvious citation is the wonderfully titled Learning to learn by gradient descent by gradient descent https://arxiv.org/abs/1606.04474

      joshvmView on HNParent context

    • GANs (and InfoGAN[0] in particular) has shown there are still pretty huge breakthoughs out there. Some other things you may be interested in: Learning to learn by gradient descent by gradient descent[1] Neural Architecture Search with Reinforcement Learning[2] [0]…

      nlView on HNParent context

  2. Tool AIs want to be agent AIs 1 comment
    • Blog spam pass through to the original: http://sebastianruder.com/optimizing-gradient-descent/ Useful reference, 6 months old. Side note, anybody aware of any implementations of the "learning to learn gradient descent by gradient descent" work [0]? I'd love to boost my training…

      highdView on HNParent context

    • > Humans can design good features for the ML algorithm to use though For now. Articles like [1] make me wonder whether this current generation of programmers might be the last. [1] https://arxiv.org/abs/1606.04474

      quotemstrView on HNParent context

Submitted to Hacker News

Connected through shared HN threads, not inferred similarity or a recommendation.