<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Fisher-Rao Metric, Geometry, and Complexity of Neural Networks · HackerPapers discussions</title><link>https://hackerpaper.kaipfister.de/p/1711.01530/</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/1711.01530/feed.xml" rel="self" type="application/rss+xml" /><item><title>Fisher-Rao Metric, Geometry, and Complexity of Neural Networks — mentioned by chillee</title><link>https://news.ycombinator.com/item?id=15956040</link><guid isPermaLink="false">urn:hackerpapers:mention:1711.01530:15956040</guid><pubDate>Mon, 18 Dec 2017 22:20:36 GMT</pubDate><description>&lt;p&gt;Sorry, my last sentence &amp;gt; Otherwise, models can achieve very good generalization. was probably unclear. When we talk about generalization, we typically have to assume a lack of distributional shift. Otherwise, if the &amp;quot;truly unseen data&amp;quot; really is drawn from a different distribution (say one where all cats are now called &amp;quot;dogs&amp;quot; and all dogs are now called &amp;quot;cats&amp;quot;), we can get arbitrarily poor performance. As for the flat minima part, lemme pull up some papers from my notes. https://arxiv.org/abs/1609.04836 showed larger batch sizes lead to sharper minima. &amp;gt; ... and as is well known, sharp…&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/1711.01530/"&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>
