<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Scaling Laws for Fact Memorization of Large Language Models · HackerPapers discussions</title><link>https://hackerpaper.kaipfister.de/p/2406.15720/</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/2406.15720/feed.xml" rel="self" type="application/rss+xml" /><item><title>Scaling Laws for Fact Memorization of Large Language Models — mentioned by lossolo</title><link>https://news.ycombinator.com/item?id=44820231</link><guid isPermaLink="false">urn:hackerpapers:mention:2406.15720:44820231</guid><pubDate>Thu, 07 Aug 2025 03:18:35 GMT</pubDate><description>&lt;p&gt;Transformer does not need to emit a byte for byte clone of a training example to benefit from having seen it. It can store a distributed representation of many near duplicate implementations and then sample a novel linear combination. That still short circuits algorithm design so the burden of discovering the game loop, collision logic, sprite sheet etc. was ALREADY SOLVED during pre training. When you temperature sample the same model twice you also get &amp;quot;different&amp;quot; code, diversity alone is not evidence of new reasoning. What matters is functional novelty under controlled transformations…&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/2406.15720/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>cs.CL</category></item></channel></rss>
