<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Scalable Second Order Optimization for Deep Learning · HackerPapers discussions</title><link>https://hackerpaper.kaipfister.de/p/2002.09018/</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/2002.09018/feed.xml" rel="self" type="application/rss+xml" /><item><title>Scalable Second Order Optimization for Deep Learning — mentioned by nil-sec</title><link>https://news.ycombinator.com/item?id=23019760</link><guid isPermaLink="false">urn:hackerpapers:mention:2002.09018:23019760</guid><pubDate>Wed, 29 Apr 2020 14:37:10 GMT</pubDate><description>&lt;p&gt;Actually there is no need for gradient decent at all if you have a linear regression problem, because you can find the min/max exactly by inverting your weight-matrix (pseudo-inverse if degenerate). Additionally, second order optimisation, i.e. using the Hessian in addition to the gradient is a well studied problem in the literature. My understanding is that it is in general not worth it because calculating the Hessian is very expensive (see e.g. https://arxiv.org/abs/2002.09018).&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/2002.09018/"&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>
