<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>A Theory of Generalization in Deep Learning · HackerPapers discussions</title><link>https://hackerpaper.kaipfister.de/p/2605.01172/</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/2605.01172/feed.xml" rel="self" type="application/rss+xml" /><item><title>A Theory of Generalization in Deep Learning — mentioned by T-A</title><link>https://news.ycombinator.com/item?id=48047098</link><guid isPermaLink="false">urn:hackerpapers:mention:2605.01172:48047098</guid><pubDate>Thu, 07 May 2026 08:59:02 GMT</pubDate><description>&lt;p&gt;Did you also know about this? Lastly, we derive an exact population-risk objective from a single training run with no validation data, for any architecture, loss, or optimizer, and prove that it measures precisely the noise in the signal channel. This objective reduces in practice to an SNR preconditioner on top of Adam, adding one state vector at no extra cost; it accelerates grokking by 5x, suppresses memorization in PINNs and implicit neural representations, and improves DPO fine-tuning under noisy preferences while staying 3x closer to the reference policy. [1] [1]…&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/2605.01172/"&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 of Generalization in Deep Learning — mentioned by r0ze-at-hn</title><link>https://news.ycombinator.com/item?id=48046789</link><guid isPermaLink="false">urn:hackerpapers:mention:2605.01172:48046789</guid><pubDate>Thu, 07 May 2026 08:14:14 GMT</pubDate><description>&lt;p&gt;Linking to the paper: https://arxiv.org/pdf/2605.01172 which is also a fantastic read, the application to deep learning is good. It does a lot of cross-mapping and highlighting a bunch of old stuff that is named differently in this paper and worth calling out for those with those backgrounds: &amp;quot;Cumulative Dissipation Gramian&amp;quot; Ws = Observability Gramian (from Control Theory). For example the spectral cutoff is exactly the Hankel singular value truncation from model reduction. &amp;quot;Signal Channel&amp;quot; / &amp;quot;Reservoir&amp;quot; is Controllable/Observable vs. Uncontrollable/Unobservable Subspaces. Using…&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/2605.01172/"&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 of Generalization in Deep Learning — mentioned by vessenes</title><link>https://news.ycombinator.com/item?id=48043763</link><guid isPermaLink="false">urn:hackerpapers:mention:2605.01172:48043763</guid><pubDate>Thu, 07 May 2026 00:19:48 GMT</pubDate><description>&lt;p&gt;So, this is either the paper of the year, or ... definitely not the paper of the year. https://arxiv.org/pdf/2605.01172 is the current version. The money graphs are page 8 and on where they show (some weirdly thick) line charts with loss results reached in roughly 1/5 the number of steps that Adam takes, just what the blog post mentions. They also claim holding back test data is not needed, also with more graphs. I&amp;#x27;m not an ML scientist, and I did not attempt to seriously parse the math. It reads to me as something precisely in that liminal space some math papers do where there&amp;#x27;s enough new…&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/2605.01172/"&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 of Generalization in Deep Learning — mentioned by ks2048</title><link>https://news.ycombinator.com/item?id=48040799</link><guid isPermaLink="false">urn:hackerpapers:mention:2605.01172:48040799</guid><pubDate>Wed, 06 May 2026 19:45:51 GMT</pubDate><description>&lt;p&gt;The relevant paper: &amp;quot;A Theory of Generalization in Deep Learning&amp;quot;. https://arxiv.org/abs/2605.01172&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/2605.01172/"&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 of Generalization in Deep Learning — HN submission</title><link>https://news.ycombinator.com/item?id=48026577</link><guid isPermaLink="false">urn:hackerpapers:submission:2605.01172:48026577</guid><pubDate>Tue, 05 May 2026 18:31:23 GMT</pubDate><description>&lt;p&gt;A Theory of Generalization in Deep Learning&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;4 points; 0 discussion replies on HN. &lt;a href="https://hackerpaper.kaipfister.de/p/2605.01172/"&gt;Paper and source history&lt;/a&gt;. A submission is not an endorsement.&lt;/p&gt;</description><category>cs.LG</category></item></channel></rss>
