<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Learning to learn by gradient descent by gradient descent · HackerPapers discussions</title><link>https://hackerpaper.kaipfister.de/p/1606.04474/</link><description>Collected HN comments and submissions linking this paper.</description><language>en</language><lastBuildDate>Mon, 02 Nov 2026 11:16:22 GMT</lastBuildDate><atom:link href="https://hackerpaper.kaipfister.de/p/1606.04474/feed.xml" rel="self" type="application/rss+xml" /><item><title>Learning to learn by gradient descent by gradient descent — mentioned by jn2clark</title><link>https://news.ycombinator.com/item?id=43478591</link><guid isPermaLink="false">urn:hackerpapers:mention:1606.04474:43478591</guid><pubDate>Wed, 26 Mar 2025 03:28:16 GMT</pubDate><description>&lt;p&gt;How does it compare to previous work on learning to learn? I don&amp;#x27;t see it referenced https://arxiv.org/abs/1606.04474&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/1606.04474/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>cs.NE</category></item><item><title>Learning to learn by gradient descent by gradient descent — mentioned by radarsat1</title><link>https://news.ycombinator.com/item?id=32302378</link><guid isPermaLink="false">urn:hackerpapers:mention:1606.04474:32302378</guid><pubDate>Mon, 01 Aug 2022 05:26:41 GMT</pubDate><description>&lt;p&gt;&amp;gt; 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 applications of gradient descent for optimising NNs is exactly to apply gradient descent to optimise learning (and other) algorithms themselves. This may be to select hyperparameters, or to select among a family of algorithms, or to include differentiable constraints in the solver, etc. I wonder, are you familiar with now…&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/1606.04474/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>cs.NE</category></item><item><title>Learning to learn by gradient descent by gradient descent — mentioned by samatman</title><link>https://news.ycombinator.com/item?id=21142456</link><guid isPermaLink="false">urn:hackerpapers:mention:1606.04474:21142456</guid><pubDate>Thu, 03 Oct 2019 00:45:59 GMT</pubDate><description>&lt;p&gt;Can’t pass on the opportunity to share one of my favorite (and topical!) paper titles: https://arxiv.org/abs/1606.04474&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/1606.04474/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>cs.NE</category></item><item><title>Learning to learn by gradient descent by gradient descent — mentioned by human_scientist</title><link>https://news.ycombinator.com/item?id=19470394</link><guid isPermaLink="false">urn:hackerpapers:mention:1606.04474:19470394</guid><pubDate>Sat, 23 Mar 2019 13:38:24 GMT</pubDate><description>&lt;p&gt;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 &amp;quot;learning to learning&amp;quot;, including &amp;quot;learning to optimize&amp;quot; approaches, e.g., https://arxiv.org/abs/1606.04474.&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/1606.04474/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>cs.NE</category></item><item><title>Learning to learn by gradient descent by gradient descent — mentioned by chriskanan</title><link>https://news.ycombinator.com/item?id=14772160</link><guid isPermaLink="false">urn:hackerpapers:mention:1606.04474:14772160</guid><pubDate>Fri, 14 Jul 2017 18:35:50 GMT</pubDate><description>&lt;p&gt;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 Architectures using Reinforcement Learning https://arxiv.org/abs/1611.02167 Neural Architecture Search with Reinforcement Learning https://arxiv.org/abs/1611.01578&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/1606.04474/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>cs.NE</category></item><item><title>Learning to learn by gradient descent by gradient descent — mentioned by greeneggs</title><link>https://news.ycombinator.com/item?id=14233650</link><guid isPermaLink="false">urn:hackerpapers:mention:1606.04474:14233650</guid><pubDate>Sun, 30 Apr 2017 20:27:51 GMT</pubDate><description>&lt;p&gt;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 &amp;quot;Learning to learn by gradient descent by gradient descent&amp;quot; arXiv:1606.04474 (https://arxiv.org/abs/1606.04474), if you click on Download-&amp;gt;Other formats, you get the latex source code and in this case also the Omnigraffle files for the diagrams.&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/1606.04474/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>cs.NE</category></item><item><title>Learning to learn by gradient descent by gradient descent — mentioned by digitalemble72</title><link>https://news.ycombinator.com/item?id=13537972</link><guid isPermaLink="false">urn:hackerpapers:mention:1606.04474:13537972</guid><pubDate>Wed, 01 Feb 2017 03:30:05 GMT</pubDate><description>&lt;p&gt;I think it&amp;#x27;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 [2]. While there still may be a role for tools like CVX, I anticipate all future progress will come from end-to-end differentiable systems. [1] https://arxiv.org/abs/1606.04474 [2] https://arxiv.org/abs/1501.00092&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/1606.04474/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>cs.NE</category></item><item><title>Learning to learn by gradient descent by gradient descent — mentioned by aisofteng</title><link>https://news.ycombinator.com/item?id=13441128</link><guid isPermaLink="false">urn:hackerpapers:mention:1606.04474:13441128</guid><pubDate>Fri, 20 Jan 2017 01:42:26 GMT</pubDate><description>&lt;p&gt;Learning to learn by gradient descent by gradient descent: https://arxiv.org/abs/1606.04474&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/1606.04474/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>cs.NE</category></item><item><title>Learning to learn by gradient descent by gradient descent — mentioned by nl</title><link>https://news.ycombinator.com/item?id=13371423</link><guid isPermaLink="false">urn:hackerpapers:mention:1606.04474:13371423</guid><pubDate>Wed, 11 Jan 2017 03:07:04 GMT</pubDate><description>&lt;p&gt;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] https://arxiv.org/abs/1606.03657, https://arxiv.org/pdf/1701.00160.pdf [1] https://arxiv.org/abs/1606.04474 [2] https://openreview.net/pdf?id=r1Ue8Hcxg&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/1606.04474/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>cs.NE</category></item><item><title>Learning to learn by gradient descent by gradient descent — mentioned by joshvm</title><link>https://news.ycombinator.com/item?id=13371419</link><guid isPermaLink="false">urn:hackerpapers:mention:1606.04474:13371419</guid><pubDate>Wed, 11 Jan 2017 03:06:42 GMT</pubDate><description>&lt;p&gt;The obvious citation is the wonderfully titled Learning to learn by gradient descent by gradient descent https://arxiv.org/abs/1606.04474&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/1606.04474/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>cs.NE</category></item><item><title>Learning to learn by gradient descent by gradient descent — mentioned by LeanderK</title><link>https://news.ycombinator.com/item?id=13368762</link><guid isPermaLink="false">urn:hackerpapers:mention:1606.04474:13368762</guid><pubDate>Tue, 10 Jan 2017 20:40:26 GMT</pubDate><description>&lt;p&gt;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] https://arxiv.org/abs/1606.04474&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/1606.04474/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>cs.NE</category></item><item><title>Learning to learn by gradient descent by gradient descent — mentioned by panarky</title><link>https://news.ycombinator.com/item?id=13305724</link><guid isPermaLink="false">urn:hackerpapers:mention:1606.04474:13305724</guid><pubDate>Tue, 03 Jan 2017 00:40:02 GMT</pubDate><description>&lt;p&gt;&amp;quot;Learning to learn by gradient descent by gradient descent&amp;quot; https://arxiv.org/abs/1606.04474&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/1606.04474/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>cs.NE</category></item><item><title>Learning to learn by gradient descent by gradient descent — mentioned by detaro</title><link>https://news.ycombinator.com/item?id=13236615</link><guid isPermaLink="false">urn:hackerpapers:mention:1606.04474:13236615</guid><pubDate>Thu, 22 Dec 2016 11:44:35 GMT</pubDate><description>&lt;p&gt;I assume this https://arxiv.org/abs/1606.04474 (since the title is basically the quoted text)&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/1606.04474/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>cs.NE</category></item><item><title>Learning to learn by gradient descent by gradient descent — mentioned by highd</title><link>https://news.ycombinator.com/item?id=12914671</link><guid isPermaLink="false">urn:hackerpapers:mention:1606.04474:12914671</guid><pubDate>Wed, 09 Nov 2016 21:08:38 GMT</pubDate><description>&lt;p&gt;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 &amp;quot;learning to learn gradient descent by gradient descent&amp;quot; work [0]? I&amp;#x27;d love to boost my training time, but I&amp;#x27;m worried implementing it myself will just result in an additional set of hyperparameters to tune. [0] https://arxiv.org/abs/1606.04474&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/1606.04474/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>cs.NE</category></item><item><title>Learning to learn by gradient descent by gradient descent — mentioned by quotemstr</title><link>https://news.ycombinator.com/item?id=12236650</link><guid isPermaLink="false">urn:hackerpapers:mention:1606.04474:12236650</guid><pubDate>Sat, 06 Aug 2016 01:32:41 GMT</pubDate><description>&lt;p&gt;&amp;gt; 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&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/1606.04474/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>cs.NE</category></item><item><title>Learning to learn by gradient descent by gradient descent — HN submission</title><link>https://news.ycombinator.com/item?id=11916812</link><guid isPermaLink="false">urn:hackerpapers:submission:1606.04474:11916812</guid><pubDate>Thu, 16 Jun 2016 15:35:13 GMT</pubDate><description>&lt;p&gt;Learning to learn by gradient descent by gradient descent&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;161 points; 40 discussion replies on HN. &lt;a href="https://hackerpaper.kaipfister.de/p/1606.04474/"&gt;Paper and source history&lt;/a&gt;. A submission is not an endorsement.&lt;/p&gt;</description><category>cs.NE</category></item><item><title>Learning to learn by gradient descent by gradient descent — HN submission</title><link>https://news.ycombinator.com/item?id=11914134</link><guid isPermaLink="false">urn:hackerpapers:submission:1606.04474:11914134</guid><pubDate>Thu, 16 Jun 2016 05:07:32 GMT</pubDate><description>&lt;p&gt;Learning to learn by gradient descent by gradient descent&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;2 points; 0 discussion replies on HN. &lt;a href="https://hackerpaper.kaipfister.de/p/1606.04474/"&gt;Paper and source history&lt;/a&gt;. A submission is not an endorsement.&lt;/p&gt;</description><category>cs.NE</category></item><item><title>Learning to learn by gradient descent by gradient descent — HN submission</title><link>https://news.ycombinator.com/item?id=11909749</link><guid isPermaLink="false">urn:hackerpapers:submission:1606.04474:11909749</guid><pubDate>Wed, 15 Jun 2016 15:04:47 GMT</pubDate><description>&lt;p&gt;Learning to learn by gradient descent by gradient descent&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;6 points; 0 discussion replies on HN. &lt;a href="https://hackerpaper.kaipfister.de/p/1606.04474/"&gt;Paper and source history&lt;/a&gt;. A submission is not an endorsement.&lt;/p&gt;</description><category>cs.NE</category></item></channel></rss>
