<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>A Law of Next-Token Prediction in Large Language Models · HackerPapers discussions</title><link>https://hackerpaper.kaipfister.de/p/2408.13442/</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/2408.13442/feed.xml" rel="self" type="application/rss+xml" /><item><title>A Law of Next-Token Prediction in Large Language Models — mentioned by pizza</title><link>https://news.ycombinator.com/item?id=42380610</link><guid isPermaLink="false">urn:hackerpapers:mention:2408.13442:42380610</guid><pubDate>Tue, 10 Dec 2024 19:42:38 GMT</pubDate><description>&lt;p&gt;Yes: for eg BPE, due to how it progressively pushes compound tokens of already seen - hence more common - subtokens to the ‘top’ of the vocab), you can train a model to do regression over vocabulary index for the next token from the current token embedding - using the same single regression model for all layer depths. If you plot mse of token index prediction versus layer depth then you can see that the mse of the prediction decreases steadily per additional layer. This appears to be because token index in eg BPE is actually fairly smooth and so it seems like the model is capable of…&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/2408.13442/"&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>
