<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Physics of Language Models: Part 3.3, Knowledge Capacity Scaling Laws · HackerPapers discussions</title><link>https://hackerpaper.kaipfister.de/p/2404.05405/</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/2404.05405/feed.xml" rel="self" type="application/rss+xml" /><item><title>Physics of Language Models: Part 3.3, Knowledge Capacity Scaling Laws — mentioned by bconsta</title><link>https://news.ycombinator.com/item?id=45476557</link><guid isPermaLink="false">urn:hackerpapers:mention:2404.05405:45476557</guid><pubDate>Sat, 04 Oct 2025 20:46:21 GMT</pubDate><description>&lt;p&gt;There is a study that gives a rule of thumb of ~2 bits per param for a model&amp;#x27;s memorization capacity: https://arxiv.org/abs/2404.05405&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/2404.05405/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>cs.CL</category></item><item><title>Physics of Language Models: Part 3.3, Knowledge Capacity Scaling Laws — mentioned by kouteiheika</title><link>https://news.ycombinator.com/item?id=44287012</link><guid isPermaLink="false">urn:hackerpapers:mention:2404.05405:44287012</guid><pubDate>Mon, 16 Jun 2025 06:08:34 GMT</pubDate><description>&lt;p&gt;No, assuming that just because it was in the training data it must be memorized is hare brained. LLMs have limited capacity to memorize, under ~4 bits per parameter[1][2], and are trained on terabytes of data. It&amp;#x27;s physically impossible for them to memorize everything they&amp;#x27;re trained on. The model memorized chunks of Harry Potter not just because it was directly trained on the whole book, which the article also alludes to: &amp;gt; For example, the researchers found that Llama 3.1 70B only memorized 0.13 percent of Sandman Slim, a 2009 novel by author Richard Kadrey. That’s a tiny fraction of the 42…&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/2404.05405/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>cs.CL</category></item><item><title>Physics of Language Models: Part 3.3, Knowledge Capacity Scaling Laws — mentioned by huac</title><link>https://news.ycombinator.com/item?id=42736388</link><guid isPermaLink="false">urn:hackerpapers:mention:2404.05405:42736388</guid><pubDate>Fri, 17 Jan 2025 11:21:01 GMT</pubDate><description>&lt;p&gt;from an AI research perspective -- it&amp;#x27;s pretty straightforward to mitigate this attack 1. perplexity filtering - small LLM looks at how in-distribution the data is to the LLM&amp;#x27;s distribution. if it&amp;#x27;s too high (gibberish like this) or too low (likely already LLM generated at low temperature or already memorized), toss it out. 2. models can learn to prioritize/deprioritize data just based on the domain name of where it came from. essentially they can learn &amp;#x27;wikipedia good, your random website bad&amp;#x27; without any other explicit labels. https://arxiv.org/abs/2404.05405 and also another recent paper…&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/2404.05405/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>cs.CL</category></item><item><title>Physics of Language Models: Part 3.3, Knowledge Capacity Scaling Laws — mentioned by smaddox</title><link>https://news.ycombinator.com/item?id=40788314</link><guid isPermaLink="false">urn:hackerpapers:mention:2404.05405:40788314</guid><pubDate>Tue, 25 Jun 2024 13:23:48 GMT</pubDate><description>&lt;p&gt;Because existing LLMs store no more than 2bits of knowledge per parameter, despite having many more bits of precision: https://arxiv.org/abs/2404.05405&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/2404.05405/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>cs.CL</category></item><item><title>Physics of Language Models: Part 3.3, Knowledge Capacity Scaling Laws — HN submission</title><link>https://news.ycombinator.com/item?id=39976086</link><guid isPermaLink="false">urn:hackerpapers:submission:2404.05405:39976086</guid><pubDate>Tue, 09 Apr 2024 03:56:53 GMT</pubDate><description>&lt;p&gt;Physics of Language Models: Part 3.3, Knowledge Capacity Scaling Laws&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;5 points; 0 discussion replies on HN. &lt;a href="https://hackerpaper.kaipfister.de/p/2404.05405/"&gt;Paper and source history&lt;/a&gt;. A submission is not an endorsement.&lt;/p&gt;</description><category>cs.CL</category></item></channel></rss>
