<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Painless Stochastic Gradient: Interpolation, Line-Search, and Convergence Rates · HackerPapers discussions</title><link>https://hackerpaper.kaipfister.de/p/1905.09997/</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/1905.09997/feed.xml" rel="self" type="application/rss+xml" /><item><title>Painless Stochastic Gradient: Interpolation, Line-Search, and Convergence Rates — mentioned by thesz</title><link>https://news.ycombinator.com/item?id=48960996</link><guid isPermaLink="false">urn:hackerpapers:mention:1905.09997:48960996</guid><pubDate>Sat, 18 Jul 2026 18:50:48 GMT</pubDate><description>&lt;p&gt;ADAM does not work on simple convex problems [1]. [1] https://parameterfree.com/2020/12/06/neural-network-maybe-evolved-to-make-adam-the-best-optimizer/ [2] https://arxiv.org/pdf/1905.09997 [1] refers to [2], which shows that ADAM is not as efficient as gradient descent with line search on some problems, including neural networks.&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/1905.09997/"&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>
