<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Efficient Time-Series Approximation with Linear Recurrent Neural Networks: Architecture Learning and Predictive Power · HackerPapers discussions</title><link>https://hackerpaper.kaipfister.de/p/1802.03308/</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/1802.03308/feed.xml" rel="self" type="application/rss+xml" /><item><title>Efficient Time-Series Approximation with Linear Recurrent Neural Networks: Architecture Learning and Predictive Power — mentioned by scarmig</title><link>https://news.ycombinator.com/item?id=41740803</link><guid isPermaLink="false">urn:hackerpapers:mention:1802.03308:41740803</guid><pubDate>Fri, 04 Oct 2024 12:42:15 GMT</pubDate><description>&lt;p&gt;Nonlinearity somewhere is fundamental, but it doesn&amp;#x27;t need to be between each layer. You can, for instance, project each input to a higher dimensional space with a nonlinearity, and the problem becomes linearly separable with high probability (cf Cover&amp;#x27;s Theorem). So, for XOR, (x, y) -&amp;gt; (x, y, xy), and it becomes trivial for a linear NN to solve. Architectures like Mamba have a linear recurrent state space system as their core, so even though you need a nonlinearity somewhere, it doesn&amp;#x27;t need to be pervasive. And linear recurrent networks are surprisingly powerful…&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/1802.03308/"&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>
