<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>On the Generalization Mystery in Deep Learning · HackerPapers discussions</title><link>https://hackerpaper.kaipfister.de/p/2203.10036/</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/2203.10036/feed.xml" rel="self" type="application/rss+xml" /><item><title>On the Generalization Mystery in Deep Learning — mentioned by cgdl</title><link>https://news.ycombinator.com/item?id=43507603</link><guid isPermaLink="false">urn:hackerpapers:mention:2203.10036:43507603</guid><pubDate>Fri, 28 Mar 2025 16:56:13 GMT</pubDate><description>&lt;p&gt;Thank you for the great discussion. You&amp;#x27;ve put your finger on the right thing I think. We can now dispense with the old VC-type thinking (i.e., that it&amp;#x27;s because the hypothesis space is not complex enough that we get generalization). Instead now the real question is this: is it the loss landscape itself, or the particular way in which the landscape is searched that leads to good generalization in deep learning. One can think of perhaps an &amp;quot;exhaustive&amp;quot; search with say God&amp;#x27;s computer of the loss landscape and pick an arbitrary point among all the points that minimize (or are close to the…&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/2203.10036/"&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>On the Generalization Mystery in Deep Learning — mentioned by cgdl</title><link>https://news.ycombinator.com/item?id=43390712</link><guid isPermaLink="false">urn:hackerpapers:mention:2203.10036:43390712</guid><pubDate>Mon, 17 Mar 2025 17:20:51 GMT</pubDate><description>&lt;p&gt;Agreed, but PAC-Bayes or other descendants of VC theory is probably not the best explanation. The notion of algorithmic stability provides a (much) more compelling explanation. See [1] (particularly Sections 11 and 12) [1] https://arxiv.org/abs/2203.10036&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/2203.10036/"&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>On the Generalization Mystery in Deep Learning — mentioned by cgdl</title><link>https://news.ycombinator.com/item?id=42554989</link><guid isPermaLink="false">urn:hackerpapers:mention:2203.10036:42554989</guid><pubDate>Tue, 31 Dec 2024 00:01:47 GMT</pubDate><description>&lt;p&gt;Very interesting. A related paper from a couple of years ago proposed a similar idea to understand generalization in deep learning: https://arxiv.org/abs/2203.10036&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/2203.10036/"&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>
