<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Hessian Averaging in Stochastic Newton Methods Achieves Superlinear Convergence · HackerPapers discussions</title><link>https://hackerpaper.kaipfister.de/p/2204.09266/</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/2204.09266/feed.xml" rel="self" type="application/rss+xml" /><item><title>Hessian Averaging in Stochastic Newton Methods Achieves Superlinear Convergence — mentioned by hodgehog11</title><link>https://news.ycombinator.com/item?id=46640127</link><guid isPermaLink="false">urn:hackerpapers:mention:2204.09266:46640127</guid><pubDate>Thu, 15 Jan 2026 22:14:20 GMT</pubDate><description>&lt;p&gt;Just a heads up in case you didn&amp;#x27;t know, taking the Hessian over batches is indeed referred to as Stochastic Newton, and methods of this kind have been studied for quite some time. Inverting the Hessian is often done with CG, which tends to work pretty well. The only problem is that the Hessian is often not invertible so you need a regularizer (same as here I believe). Newton methods work at scale, but no-one with the resources to try them at scale seems to be aware of them. It&amp;#x27;s an interesting trick though, so I&amp;#x27;d be curious to see how it compares to CG. [1] https://arxiv.org/abs/2204.09266…&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/2204.09266/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>math.OC</category></item></channel></rss>
