<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Visualizing the Loss Landscape of Neural Nets · HackerPapers discussions</title><link>https://hackerpaper.kaipfister.de/p/1712.09913/</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/1712.09913/feed.xml" rel="self" type="application/rss+xml" /><item><title>Visualizing the Loss Landscape of Neural Nets — mentioned by blackbear_</title><link>https://news.ycombinator.com/item?id=45788604</link><guid isPermaLink="false">urn:hackerpapers:mention:1712.09913: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/1712.09913/"&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>Visualizing the Loss Landscape of Neural Nets — mentioned by dontwearitout</title><link>https://news.ycombinator.com/item?id=40569355</link><guid isPermaLink="false">urn:hackerpapers:mention:1712.09913:40569355</guid><pubDate>Tue, 04 Jun 2024 00:25:27 GMT</pubDate><description>&lt;p&gt;I haven&amp;#x27;t heard the term &amp;quot;shallow basin hypothesis&amp;quot; but I know what it refers to, these two papers spring to mind for me: 1) Loss Surfaces, Mode Connectivity, and Fast Ensembling of DNNs https://arxiv.org/abs/1802.10026 2) Visualizing the Loss Landscape of Neural Nets https://arxiv.org/abs/1712.09913 There&amp;#x27;s also a very interesting body of work on merging trained models, such as by interpolating between points in weight space, which relates to the concept of &amp;quot;basins&amp;quot; of similar solutions. Skim the intro of this if you&amp;#x27;re interested in learning more: https://arxiv.org/abs/2211.08403&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/1712.09913/"&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>Visualizing the Loss Landscape of Neural Nets — mentioned by Imnimo</title><link>https://news.ycombinator.com/item?id=40294100</link><guid isPermaLink="false">urn:hackerpapers:mention:1712.09913:40294100</guid><pubDate>Wed, 08 May 2024 03:38:12 GMT</pubDate><description>&lt;p&gt;Yes. To be more specific, it&amp;#x27;s that nearly all points where the derivative is zero are saddle points rather than minima. Note that some portion of this nice behavior seems to be due to design choices in modern architectures, like residual connections, rather than being a general fact about all high dimensional problems. https://arxiv.org/pdf/1712.09913 This paper has some nice visualizations.&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/1712.09913/"&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>Visualizing the Loss Landscape of Neural Nets — mentioned by nerdponx</title><link>https://news.ycombinator.com/item?id=39415819</link><guid isPermaLink="false">urn:hackerpapers:mention:1712.09913:39415819</guid><pubDate>Sun, 18 Feb 2024 03:11:36 GMT</pubDate><description>&lt;p&gt;This is the one example I had in mind because of all the pretty pictures: https://arxiv.org/abs/1712.09913 Hao Li, Zheng Xu, Gavin Taylor, Christoph Studer, Tom Goldstein. 2018. &amp;quot;Visualizing the Loss Landscape of Neural Nets&amp;quot;.&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/1712.09913/"&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>Visualizing the Loss Landscape of Neural Nets — mentioned by muppet_frog</title><link>https://news.ycombinator.com/item?id=24842493</link><guid isPermaLink="false">urn:hackerpapers:mention:1712.09913:24842493</guid><pubDate>Tue, 20 Oct 2020 21:26:08 GMT</pubDate><description>&lt;p&gt;...hmm, that was counter to my understanding (limited though it may be...) which was partially formed by this paper: https://arxiv.org/abs/1712.09913 TLDR - loss landscapes are nasty, but you can tame them with skip connections.&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/1712.09913/"&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>Visualizing the Loss Landscape of Neural Nets — mentioned by currymj</title><link>https://news.ycombinator.com/item?id=18799242</link><guid isPermaLink="false">urn:hackerpapers:mention:1712.09913:18799242</guid><pubDate>Tue, 01 Jan 2019 06:28:24 GMT</pubDate><description>&lt;p&gt;As others have said, you don&amp;#x27;t actually want the global optimum of a neural network because that would be terrible overfitting. There is some evidence that architectural tricks (like ResNet) that empirically help performance are making the loss landscape &amp;quot;more convex&amp;quot;, though. https://arxiv.org/pdf/1712.09913.pdf&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/1712.09913/"&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>Visualizing the Loss Landscape of Neural Nets — mentioned by hadsed</title><link>https://news.ycombinator.com/item?id=16352187</link><guid isPermaLink="false">urn:hackerpapers:mention:1712.09913:16352187</guid><pubDate>Sun, 11 Feb 2018 11:07:45 GMT</pubDate><description>&lt;p&gt;I find your comment a little strange. First you say something interesting about Deep Dream being an early attempt at better understanding of vision networks but that it&amp;#x27;s not enough. Then you say the end is in sight? If you just take the visualization part we have a massive amount of work to do. Understanding how these networks solve problem in sophisticated ways will motivate new advances to mitigate shortcomings. It is a software problem that can have huge benefits. For example, see the paper Visualizing Loss Functions For Neural Networks as an example of the incredible insight to be gained…&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/1712.09913/"&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>Visualizing the Loss Landscape of Neural Nets — HN submission</title><link>https://news.ycombinator.com/item?id=16031668</link><guid isPermaLink="false">urn:hackerpapers:submission:1712.09913:16031668</guid><pubDate>Fri, 29 Dec 2017 20:11:12 GMT</pubDate><description>&lt;p&gt;Visualizing the Loss Landscape of Neural Nets [pdf]&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;1 point; 0 discussion replies on HN. &lt;a href="https://hackerpaper.kaipfister.de/p/1712.09913/"&gt;Paper and source history&lt;/a&gt;. A submission is not an endorsement.&lt;/p&gt;</description><category>cs.LG</category></item></channel></rss>
