<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Nonlinear Approximation and (Deep) ReLU Networks · HackerPapers discussions</title><link>https://hackerpaper.kaipfister.de/p/1905.02199/</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.02199/feed.xml" rel="self" type="application/rss+xml" /><item><title>Nonlinear Approximation and (Deep) ReLU Networks — mentioned by joe_the_user</title><link>https://news.ycombinator.com/item?id=25886895</link><guid isPermaLink="false">urn:hackerpapers:mention:1905.02199:25886895</guid><pubDate>Sat, 23 Jan 2021 22:53:08 GMT</pubDate><description>&lt;p&gt;One thing to consider is the distinction between deep neural networks as mathematical objects and machine learning as currently practiced. Lately, there have been quite a few theories on neural networks as ideal nonlinear approximators [1]. Similarly, people have shown many ways that gradient descent can tend to reach a global maximum of regularized curve-closeness[2]. Which is to say, if your development cycle is: gather-data, train, test, deploy, we know this approximates the data almost ideally; you can&amp;#x27;t really do much better than a deep network. But we know in practice, when deployed…&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/1905.02199/"&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>
