<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>A Theory for Emergence of Complex Skills in Language Models · HackerPapers discussions</title><link>https://hackerpaper.kaipfister.de/p/2307.15936/</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/2307.15936/feed.xml" rel="self" type="application/rss+xml" /><item><title>A Theory for Emergence of Complex Skills in Language Models — mentioned by neerajk</title><link>https://news.ycombinator.com/item?id=49088091</link><guid isPermaLink="false">urn:hackerpapers:mention:2307.15936:49088091</guid><pubDate>Tue, 28 Jul 2026 18:37:52 GMT</pubDate><description>&lt;p&gt;There is a Sanjeev Arora paper &amp;quot;A Theory for Emergence of Complex Skills in Language Models&amp;quot; (https://arxiv.org/pdf/2307.15936) on this subject. The key idea is there is cross entropy (how &amp;quot;surprised&amp;quot; the model is with the &amp;quot;correct&amp;quot; next token, lower is better), some of which is inherent in the language and therefore unavoidable, and the rest is model error, and that this portion of the cross entropy is reduced with scaling. And as scaling reduces a model&amp;#x27;s excess entropy, the model can become good at combinations of skills much faster than you would expect if it had to separately see and…&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/2307.15936/"&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>A Theory for Emergence of Complex Skills in Language Models — mentioned by visarga</title><link>https://news.ycombinator.com/item?id=39106437</link><guid isPermaLink="false">urn:hackerpapers:mention:2307.15936:39106437</guid><pubDate>Tue, 23 Jan 2024 17:25:06 GMT</pubDate><description>&lt;p&gt;This article is 3 years old, right before GPT-3&amp;#x27;s launch. So it doesn&amp;#x27;t have all the recent info. We&amp;#x27;re not using meta-learning much, the problem of using few examples to train a model has been solved by few-shot prompting, zero shot, or fine-tuning with a small dataset. The problem with meta-learning is that it tries to back-propagate through the inner loop (the model) to the outer loop (meta-model), and this is hard to do. Since LLMs have such huge and diverse training sets, almost everything is in-distribution. LLMs are conditional probability distributions that can be steered with prompts…&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/2307.15936/"&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>A Theory for Emergence of Complex Skills in Language Models — mentioned by svat</title><link>https://news.ycombinator.com/item?id=39093788</link><guid isPermaLink="false">urn:hackerpapers:mention:2307.15936:39093788</guid><pubDate>Mon, 22 Jan 2024 19:02:57 GMT</pubDate><description>&lt;p&gt;What I understood: they assume a hypothetical bipartite graph with text nodes (like hypothetical paragraphs / chunks of texts) on one side, and “skill” nodes on the other. The skills could be things like: • ability to understand the word “because” [causality] • ability to divide two numbers • ability to detect irony Each text node is connected to all the skill nodes that are required to understand it. (This is a hypothetical graph, so we don&amp;#x27;t need to be able to write down the graph precisely, or define what “understand” or “required” mean here.) Further, each text node is either “successful”…&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/2307.15936/"&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>A Theory for Emergence of Complex Skills in Language Models — mentioned by blackbear_</title><link>https://news.ycombinator.com/item?id=39093112</link><guid isPermaLink="false">urn:hackerpapers:mention:2307.15936:39093112</guid><pubDate>Mon, 22 Jan 2024 18:19:39 GMT</pubDate><description>&lt;p&gt;Clearly no link to the actual research, so here it is: https://arxiv.org/abs/2307.15936&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/2307.15936/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>cs.LG</category></item></channel></rss>
