<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>On the Generalization Benefit of Noise in Stochastic Gradient Descent · HackerPapers discussions</title><link>https://hackerpaper.kaipfister.de/p/2006.15081/</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.15081/feed.xml" rel="self" type="application/rss+xml" /><item><title>On the Generalization Benefit of Noise in Stochastic Gradient Descent — mentioned by blackbear_</title><link>https://news.ycombinator.com/item?id=45788604</link><guid isPermaLink="false">urn:hackerpapers:mention:2006.15081:45788604</guid><pubDate>Sun, 02 Nov 2025 07:51:40 GMT</pubDate><description>&lt;p&gt;Two thoughts: &amp;gt; how important is computing the exact gradient using calculus Normally the gradient is computed with a small &amp;quot;minibatch&amp;quot; of examples, meaning that on average over many steps the true gradient is followed, but each step individually never moves exacty along the true gradient. This noisy walk is actually quite beneficial for the final performance of the network https://arxiv.org/abs/2006.15081 , https://arxiv.org/abs/1609.04836 so much so that people started wondering what is the best way to &amp;quot;corrupt&amp;quot; this approximate gradient even more to improve performance…&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/2006.15081/"&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>
