<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Transformers learn in-context by gradient descent · HackerPapers discussions</title><link>https://hackerpaper.kaipfister.de/p/2212.07677/</link><description>Collected HN comments and submissions linking this paper.</description><language>en</language><lastBuildDate>Wed, 04 Nov 2026 05:35:47 GMT</lastBuildDate><atom:link href="https://hackerpaper.kaipfister.de/p/2212.07677/feed.xml" rel="self" type="application/rss+xml" /><item><title>Transformers learn in-context by gradient descent — mentioned by joe_the_user</title><link>https://news.ycombinator.com/item?id=50343799</link><guid isPermaLink="false">urn:hackerpapers:mention:2212.07677:50343799</guid><pubDate>Mon, 02 Nov 2026 21:09:18 GMT</pubDate><description>&lt;p&gt;A few years ago it was discovered that LLMs can implement gradient descent in their processes. Producing a full trained neural network would be an extension of this. See: https://arxiv.org/abs/2212.07677&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/2212.07677/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>cs.LG</category></item><item><title>Transformers learn in-context by gradient descent — mentioned by pona-a</title><link>https://news.ycombinator.com/item?id=43260067</link><guid isPermaLink="false">urn:hackerpapers:mention:2212.07677:43260067</guid><pubDate>Tue, 04 Mar 2025 21:39:48 GMT</pubDate><description>&lt;p&gt;Would that make in-context learning a superset or a subset of pretraining? This paper claimed transformers learn a gradient-descent mesa-optimizer as part of in-context learning, while being guided by the pretraining objective, and as the parent mentioned, any general reasoner can bootstrap a world model from first principles. [0] https://arxiv.org/pdf/2212.07677&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/2212.07677/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>cs.LG</category></item><item><title>Transformers learn in-context by gradient descent — mentioned by sebzim4500</title><link>https://news.ycombinator.com/item?id=35531505</link><guid isPermaLink="false">urn:hackerpapers:mention:2212.07677:35531505</guid><pubDate>Tue, 11 Apr 2023 21:01:52 GMT</pubDate><description>&lt;p&gt;I used to agree with you. The paper that made me unsure was &amp;quot;Transformers learn in-context by gradient descent&amp;quot; [1]. Basically, the model learns weights that let it run gradient descent at inference time in order to do in context learning. If transformers can learn this, then I think they can learn almost anything given enough compute/parameters/data. Of course, even if this is true then it&amp;#x27;s possible that there simply isn&amp;#x27;t enough high quality data, or that the amount of compute required is beyond our current hardware. [1] https://arxiv.org/abs/2212.07677&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/2212.07677/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>cs.LG</category></item><item><title>Transformers learn in-context by gradient descent — mentioned by sebzim4500</title><link>https://news.ycombinator.com/item?id=35531200</link><guid isPermaLink="false">urn:hackerpapers:mention:2212.07677:35531200</guid><pubDate>Tue, 11 Apr 2023 20:36:57 GMT</pubDate><description>&lt;p&gt;Clearly it doesn&amp;#x27;t need to have seen the exact input before because you can ask GPT-4 to add together two 6 digit numbers and it will get it right. More impressively, if you generate a random small neural network and then put some samples in the prompt it can do a surprisingly good job of predicting the result of putting other inputs into the network. Presumably doing something that looks a bit like gradient decent, see https://arxiv.org/pdf/2212.07677.pdf Solely in order to predict the next token, LLMs are learning an incredibly sophisticed model of both computation and the outside world.&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/2212.07677/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>cs.LG</category></item><item><title>Transformers learn in-context by gradient descent — mentioned by spyder</title><link>https://news.ycombinator.com/item?id=35522514</link><guid isPermaLink="false">urn:hackerpapers:mention:2212.07677:35522514</guid><pubDate>Tue, 11 Apr 2023 08:48:37 GMT</pubDate><description>&lt;p&gt;I agree, the in-context, few shot learning is the most interesting thing a about these transformer models, they have basically learned to learn (meta-learning). Some additional interesting papers about it: Transformers learn in-context by gradient descent: https://arxiv.org/abs/2212.07677 What Can Transformers Learn In-Context? A Case Study of Simple Function Classes: https://arxiv.org/abs/2208.01066 &amp;quot;We also show that we can train Transformers to in-context learn more complex function classes -- namely sparse linear functions, two-layer neural networks, and decision trees -- with performance…&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/2212.07677/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>cs.LG</category></item><item><title>Transformers learn in-context by gradient descent — mentioned by benlivengood</title><link>https://news.ycombinator.com/item?id=34750342</link><guid isPermaLink="false">urn:hackerpapers:mention:2212.07677:34750342</guid><pubDate>Sat, 11 Feb 2023 07:27:11 GMT</pubDate><description>&lt;p&gt;The article doesn&amp;#x27;t understand large language models. It makes an assumption about how they work and uses that assumption to draw a conclusion. Most likely, as found in small models [0], large autoregressive transformers understand machine learning algorithms well enough to apply them to their inputs to achieve in-context learning (few-shot prompting) by performing gradient descent within the overall network [1]. This is fundamentally different from static predictors; LLMs are dynamic modelers that learn from context in order to better predict tokens. [0] https://arxiv.org/pdf/2211.15661 [1]…&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/2212.07677/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>cs.LG</category></item><item><title>Transformers learn in-context by gradient descent — mentioned by cmorez</title><link>https://news.ycombinator.com/item?id=34476149</link><guid isPermaLink="false">urn:hackerpapers:mention:2212.07677:34476149</guid><pubDate>Sun, 22 Jan 2023 10:55:18 GMT</pubDate><description>&lt;p&gt;&amp;gt; Why do people say they don&amp;#x27;t now how it works &amp;quot;Curve Fitting&amp;quot; is the objective, the function encoded in the weights is the solution, and not actually well understood. See work from Anthropic[1] and Google[2] that explores this. As an analogy consider applying the same argument to the AlphaGo value function. It&amp;#x27;s &amp;quot;just&amp;quot; fitting a bunch of curves to the statistics of millions of self-played games. However, to effectively capture those statistics the network needed to develop a bunch of heuristics. Needless to say these heuristics are not understood (else we&amp;#x27;d already know the principles…&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/2212.07677/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>cs.LG</category></item><item><title>Transformers learn in-context by gradient descent — HN submission</title><link>https://news.ycombinator.com/item?id=34026944</link><guid isPermaLink="false">urn:hackerpapers:submission:2212.07677:34026944</guid><pubDate>Sat, 17 Dec 2022 11:36:48 GMT</pubDate><description>&lt;p&gt;Transformers learn in-context 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/2212.07677/"&gt;Paper and source history&lt;/a&gt;. A submission is not an endorsement.&lt;/p&gt;</description><category>cs.LG</category></item></channel></rss>
