<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>The boundary of neural network trainability is fractal · HackerPapers discussions</title><link>https://hackerpaper.kaipfister.de/p/2402.06184/</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/2402.06184/feed.xml" rel="self" type="application/rss+xml" /><item><title>The boundary of neural network trainability is fractal — mentioned by somethingsome</title><link>https://news.ycombinator.com/item?id=42838921</link><guid isPermaLink="false">urn:hackerpapers:mention:2402.06184:42838921</guid><pubDate>Mon, 27 Jan 2025 09:04:07 GMT</pubDate><description>&lt;p&gt;&amp;gt; Convolution Nice idea, but I&amp;#x27;m also planning a book on advanced cuda programming, and I will cover convolutions there, I&amp;#x27;ll think if it is interesting to have some kind of cross chapter that is valid for both books. &amp;gt; Noises I cover those in normal mapping &amp;gt; anisotropy I have a full chapter on brdf that includes anysotropy for raster and raytracing, I use it also to derive anisotropic filtering &amp;gt; Color spaces I have to make choices, and I don&amp;#x27;t think I&amp;#x27;ll cover in depth color spaces, it&amp;#x27;s a topic I know, but I find it very annoying to write about, in particular, making it fun to read is…&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/2402.06184/"&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 boundary of neural network trainability is fractal — HN submission</title><link>https://news.ycombinator.com/item?id=39428047</link><guid isPermaLink="false">urn:hackerpapers:submission:2402.06184:39428047</guid><pubDate>Mon, 19 Feb 2024 10:27:52 GMT</pubDate><description>&lt;p&gt;The boundary of neural network trainability is fractal&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;200 points; 65 discussion replies on HN. &lt;a href="https://hackerpaper.kaipfister.de/p/2402.06184/"&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 boundary of neural network trainability is fractal — mentioned by bluetintedfort</title><link>https://news.ycombinator.com/item?id=39356140</link><guid isPermaLink="false">urn:hackerpapers:mention:2402.06184:39356140</guid><pubDate>Tue, 13 Feb 2024 09:55:19 GMT</pubDate><description>&lt;p&gt;The sister paper[1] contains the fractal dimensions of some of the images using a boxcount paper. [1]: https://arxiv.org/pdf/2402.06184.pdf&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/2402.06184/"&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 boundary of neural network trainability is fractal — mentioned by rayval</title><link>https://news.ycombinator.com/item?id=39353047</link><guid isPermaLink="false">urn:hackerpapers:mention:2402.06184:39353047</guid><pubDate>Tue, 13 Feb 2024 01:13:07 GMT</pubDate><description>&lt;p&gt;Arxiv paper is here: https://arxiv.org/pdf/2402.06184.pdf&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/2402.06184/"&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 boundary of neural network trainability is fractal — mentioned by telotortium</title><link>https://news.ycombinator.com/item?id=39350015</link><guid isPermaLink="false">urn:hackerpapers:mention:2402.06184:39350015</guid><pubDate>Mon, 12 Feb 2024 20:27:39 GMT</pubDate><description>&lt;p&gt;Twitter: https://twitter.com/jaschasd/status/1756930242965606582 ArXiv: https://arxiv.org/abs/2402.06184 Abstract: &amp;quot;Some fractals -- for instance those associated with the Mandelbrot and quadratic Julia sets -- are computed by iterating a function, and identifying the boundary between hyperparameters for which the resulting series diverges or remains bounded. Neural network training similarly involves iterating an update function (e.g. repeated steps of gradient descent), can result in convergent or divergent behavior, and can be extremely sensitive to small changes in hyperparameters.…&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/2402.06184/"&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>
