<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Is SGD a Bayesian sampler? Well, almost · HackerPapers discussions</title><link>https://hackerpaper.kaipfister.de/p/2006.15191/</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/2006.15191/feed.xml" rel="self" type="application/rss+xml" /><item><title>Is SGD a Bayesian sampler? Well, almost — mentioned by sinenomine</title><link>https://news.ycombinator.com/item?id=34319044</link><guid isPermaLink="false">urn:hackerpapers:mention:2006.15191:34319044</guid><pubDate>Tue, 10 Jan 2023 01:22:27 GMT</pubDate><description>&lt;p&gt;Ironic, since the relatively recently discovered double descent makes it clear that bias-variance tradeoff as we know it from statistical learning theory simply doesn&amp;#x27;t apply to &amp;quot;overparameterized&amp;quot; deep models. Much of old theory is barely applicable and people are, understandably, bewildered and in denial. If someone were to be inclined to theory, I&amp;#x27;d just recommend reading papers that don&amp;#x27;t try oversimplify the domain: https://arxiv.org/abs/2006.15191 https://arxiv.org/abs/2210.10749 https://arxiv.org/abs/2205.10343 https://arxiv.org/abs/2105.04026&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/2006.15191/"&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>Is SGD a Bayesian sampler? Well, almost — mentioned by sinenomine</title><link>https://news.ycombinator.com/item?id=34188360</link><guid isPermaLink="false">urn:hackerpapers:mention:2006.15191:34188360</guid><pubDate>Fri, 30 Dec 2022 18:44:32 GMT</pubDate><description>&lt;p&gt;If gradient-descent in DNNs indeed has an intrinsic bias for short and simple solutions, like this paper https://arxiv.org/abs/2006.15191 shows, and if the &amp;quot;reasoning&amp;quot; is among the shortest solutions to match the textual data with the language modeling loss, then at some limit of model+data scaling the model has to recover this solution. Or maybe even something better, &amp;quot;reasoning++&amp;quot;? It&amp;#x27;s all too easy to dismiss the success of infinitely plastic, scalable systems.&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/2006.15191/"&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>
