<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Traces of Memorisation in Large Language Models for Code · HackerPapers discussions</title><link>https://hackerpaper.kaipfister.de/p/2312.11658/</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/2312.11658/feed.xml" rel="self" type="application/rss+xml" /><item><title>Traces of Memorisation in Large Language Models for Code — mentioned by lossolo</title><link>https://news.ycombinator.com/item?id=44817888</link><guid isPermaLink="false">urn:hackerpapers:mention:2312.11658:44817888</guid><pubDate>Wed, 06 Aug 2025 21:10:04 GMT</pubDate><description>&lt;p&gt;12.8 GB is around 110 Gbits. Even at 4.25 bits/weight the network stores ~26 billion &amp;quot;micro weights&amp;quot;. A 1,4k token space invaders snippet occupies ~1.1 kb compressed, the model could parametrize thousands of such snippets and still have more than 99% of its capacity left. This paper about LLM memorization is interesting, if you would to know more: https://arxiv.org/abs/2312.11658 and another recent interesting paper SWE bench illusion shows SOTA code LLM results collapsing once memorised github issues are filtered out: https://arxiv.org/pdf/2506.12286v1 Add to this that the common crawl…&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/2312.11658/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>cs.CR</category></item></channel></rss>
