<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>The Loss Surfaces of Multilayer Networks · HackerPapers discussions</title><link>https://hackerpaper.kaipfister.de/p/1412.0233/</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/1412.0233/feed.xml" rel="self" type="application/rss+xml" /><item><title>The Loss Surfaces of Multilayer Networks — mentioned by ChrisRackauckas</title><link>https://news.ycombinator.com/item?id=24293505</link><guid isPermaLink="false">urn:hackerpapers:mention:1412.0233:24293505</guid><pubDate>Thu, 27 Aug 2020 13:35:02 GMT</pubDate><description>&lt;p&gt;There is a saying in mathematics that the fastest way to a solution is through the complex plane. This was discovered because a lot of proofs are nicer by doing analytical continuation and analyzing the properties of the continued function. Complex-step differentiation is another example of this. In some sense, something similar applies to neural networks in this context. Have you done a lot of fitting of classical basis methods inside of differential equations? They are very prone to local minima, so direct training of polynomials inside of a differential equation is rather hard. But through…&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/1412.0233/"&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>The Loss Surfaces of Multilayer Networks — HN submission</title><link>https://news.ycombinator.com/item?id=19016495</link><guid isPermaLink="false">urn:hackerpapers:submission:1412.0233:19016495</guid><pubDate>Mon, 28 Jan 2019 10:57:50 GMT</pubDate><description>&lt;p&gt;The Loss Surfaces of Multilayer Networks&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;2 points; 0 discussion replies on HN. &lt;a href="https://hackerpaper.kaipfister.de/p/1412.0233/"&gt;Paper and source history&lt;/a&gt;. A submission is not an endorsement.&lt;/p&gt;</description><category>cs.LG</category></item><item><title>The Loss Surfaces of Multilayer Networks — mentioned by nabla9</title><link>https://news.ycombinator.com/item?id=15941472</link><guid isPermaLink="false">urn:hackerpapers:mention:1412.0233:15941472</guid><pubDate>Sat, 16 Dec 2017 19:40:00 GMT</pubDate><description>&lt;p&gt;https://arxiv.org/abs/1412.0233&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/1412.0233/"&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>The Loss Surfaces of Multilayer Networks — mentioned by aoki</title><link>https://news.ycombinator.com/item?id=15903203</link><guid isPermaLink="false">urn:hackerpapers:mention:1412.0233:15903203</guid><pubDate>Tue, 12 Dec 2017 05:26:26 GMT</pubDate><description>&lt;p&gt;i suspect that what he&amp;#x27;s referring to is that he&amp;#x27;s heuristically minimizing a somewhat arbitrary (loss) function in a million-ish dimensions using the simple variants of gradient descent that work under these conditions. it sounds far too WIBNI to produce good results reliably (in practice, let alone in theory). the landscape has so many stationary points at which to get stuck; why would you ever get good results? there&amp;#x27;s a small cottage industry of papers (like [0]) that try to explain this. [0] https://arxiv.org/pdf/1412.0233.pdf&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/1412.0233/"&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>The Loss Surfaces of Multilayer Networks — mentioned by deepnet</title><link>https://news.ycombinator.com/item?id=14455404</link><guid isPermaLink="false">urn:hackerpapers:mention:1412.0233:14455404</guid><pubDate>Wed, 31 May 2017 19:55:08 GMT</pubDate><description>&lt;p&gt;Analogously Neural Network learning, i.e. learning modeled as a phase transition between disorder and order: “... studies the connection between the highly non-convex loss function of a simple model of the fully-connected feed-forward neural network and the Hamiltonian of the spherical spin-glass model” from &amp;quot;The Loss Surfaces of Multilayer Networks&amp;quot; Choromanska, Henaff, Mathieu, Arous, &amp;amp; LeCun [1] [1] https://arxiv.org/abs/1412.0233 Also the physics of collapsing sand piles.&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/1412.0233/"&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>The Loss Surfaces of Multilayer Networks — mentioned by reader5000</title><link>https://news.ycombinator.com/item?id=14288239</link><guid isPermaLink="false">urn:hackerpapers:mention:1412.0233:14288239</guid><pubDate>Sun, 07 May 2017 23:18:44 GMT</pubDate><description>&lt;p&gt;Are you referencing https://arxiv.org/abs/1412.0233?&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/1412.0233/"&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>The Loss Surfaces of Multilayer Networks — mentioned by rm999</title><link>https://news.ycombinator.com/item?id=12323875</link><guid isPermaLink="false">urn:hackerpapers:mention:1412.0233:12323875</guid><pubDate>Fri, 19 Aug 2016 22:12:39 GMT</pubDate><description>&lt;p&gt;If you mean the lack of theoretical guarantees due to a highly non-convex optimization, you could argue the same thing about 30 year old 2-layer networks. And we actually do have a decent idea why deep learning works well: http://arxiv.org/pdf/1412.6544v4.pdf http://arxiv.org/pdf/1412.0233.pdf&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/1412.0233/"&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>The Loss Surfaces of Multilayer Networks — mentioned by Houshalter</title><link>https://news.ycombinator.com/item?id=11049773</link><guid isPermaLink="false">urn:hackerpapers:mention:1412.0233:11049773</guid><pubDate>Sat, 06 Feb 2016 20:49:55 GMT</pubDate><description>&lt;p&gt;I believe that has to do with the vanishing gradient issue which has been studied. As for why nets converge at all, there&amp;#x27;s this paper whichI believe tries to establish some theory why bigger nets don&amp;#x27;t have such a big problem with local optima: http://arxiv.org/abs/1412.0233&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/1412.0233/"&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>The Loss Surfaces of Multilayer Networks — mentioned by Houshalter</title><link>https://news.ycombinator.com/item?id=11049750</link><guid isPermaLink="false">urn:hackerpapers:mention:1412.0233:11049750</guid><pubDate>Sat, 06 Feb 2016 20:45:41 GMT</pubDate><description>&lt;p&gt;&amp;gt;an infinitely deep net (whatever that means) would not generalize on little data, and would get even harder to train the deeper it gets. Not with proper priors/regularization. &amp;gt;You&amp;#x27;ve argued some ideas from intuition. There is little theoretical rigor around this, however. There&amp;#x27;s this paper which goes more into theoretical depth on the idea: http://arxiv.org/abs/1412.0233&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/1412.0233/"&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>The Loss Surfaces of Multilayer Networks — mentioned by Houshalter</title><link>https://news.ycombinator.com/item?id=11049748</link><guid isPermaLink="false">urn:hackerpapers:mention:1412.0233:11049748</guid><pubDate>Sat, 06 Feb 2016 20:44:31 GMT</pubDate><description>&lt;p&gt;http://arxiv.org/abs/1412.0233 &amp;gt;The number of local minima outside that band diminishes exponentially with the size of the network. We empirically verify that the mathematical model exhibits similar behavior as the computer simulations, despite the presence of high dependencies in real networks. We conjecture that both simulated annealing and SGD converge to the band of low critical points, and that all critical points found there are local minima of high quality measured by the test error. This emphasizes a major difference between large- and small-size networks where for the latter poor…&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/1412.0233/"&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>The Loss Surfaces of Multilayer Networks — mentioned by deepnet</title><link>https://news.ycombinator.com/item?id=10011587</link><guid isPermaLink="false">urn:hackerpapers:mention:1412.0233:10011587</guid><pubDate>Wed, 05 Aug 2015 18:01:39 GMT</pubDate><description>&lt;p&gt;As a counterpoint, the Blessing of Dimensionality is that local minima are mostly as good as the global minima. In David Silver&amp;#x27;s RLDM 2015 talk @20 mins in http://videolectures.net/rldm2015_silver_reinforcement_learn... he recounts this as his experience. the paper The Loss Surfaces of Multilayer Networks goes in depth http://arxiv.org/abs/1412.0233 [edit] and the paper Qualitative Characterisation of Neural Net Optimisation http://arxiv.org/abs/1412.6544v4&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/1412.0233/"&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>The Loss Surfaces of Multilayer Networks — mentioned by selimthegrim</title><link>https://news.ycombinator.com/item?id=9715608</link><guid isPermaLink="false">urn:hackerpapers:mention:1412.0233:9715608</guid><pubDate>Sun, 14 Jun 2015 17:16:08 GMT</pubDate><description>&lt;p&gt;http://arxiv.org/abs/1412.0233 (and the references within he cites by Gerard Ben Arous)&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/1412.0233/"&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>The Loss Surfaces of Multilayer Networks — mentioned by selimthegrim</title><link>https://news.ycombinator.com/item?id=9248929</link><guid isPermaLink="false">urn:hackerpapers:mention:1412.0233:9248929</guid><pubDate>Mon, 23 Mar 2015 00:59:21 GMT</pubDate><description>&lt;p&gt;This is as good a post as any about the theory of why deep learning works so well - esp. if you know a little about spin models from statistical mechanics https://charlesmartin14.wordpress.com/2015/02/26/why-does-de... additional flavor: http://arxiv.org/pdf/1412.0233.pdf and slides 16-22 of https://docs.google.com/viewer?a=v&amp;amp;pid=sites&amp;amp;srcid=ZGVmYXVsd...&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/1412.0233/"&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>
