<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Resurrecting Recurrent Neural Networks for Long Sequences · HackerPapers discussions</title><link>https://hackerpaper.kaipfister.de/p/2303.06349/</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/2303.06349/feed.xml" rel="self" type="application/rss+xml" /><item><title>Resurrecting Recurrent Neural Networks for Long Sequences — mentioned by tsurba</title><link>https://news.ycombinator.com/item?id=43371817</link><guid isPermaLink="false">urn:hackerpapers:mention:2303.06349:43371817</guid><pubDate>Sat, 15 Mar 2025 11:27:06 GMT</pubDate><description>&lt;p&gt;Proper initialization of layers keeps gradient magnitudes from vanishing/exploding in deep networks. If you make sure the output of each layer has mean 0, std 1, the gradients will be reasonable as well, for example. I recommend e.g. the og resnet paper and its follow-up from Kaiming He et al. For a modern take on RNNs, read https://arxiv.org/abs/2303.06349 by DeepMind. There essentially the point is that largest eigenvalue (spectral radius) needs to be around 1, meaning repeated applications of a linear transformation doesn’t cause increase or decrease of the activations.&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/2303.06349/"&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>Resurrecting Recurrent Neural Networks for Long Sequences — mentioned by scarmig</title><link>https://news.ycombinator.com/item?id=41740803</link><guid isPermaLink="false">urn:hackerpapers:mention:2303.06349: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/2303.06349/"&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>Resurrecting Recurrent Neural Networks for Long Sequences — mentioned by smaddox</title><link>https://news.ycombinator.com/item?id=36625812</link><guid isPermaLink="false">urn:hackerpapers:mention:2303.06349:36625812</guid><pubDate>Fri, 07 Jul 2023 01:27:25 GMT</pubDate><description>&lt;p&gt;&amp;gt; Recurrent neural networks (RNNs) do this implicitly, but we don&amp;#x27;t yet know how to effectively train RNNs on ultra-deep sequences. What would you call &amp;quot;ultra-deep&amp;quot;? [1] shows how to train an RNN in a GPT-like mode, using parallel scan, with great performance on Path-X, which has a sequence length of 16k. It&amp;#x27;s based on prior papers doing the same thing but from a state space model perspective. [1] https://arxiv.org/abs/2303.06349&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/2303.06349/"&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>Resurrecting Recurrent Neural Networks for Long Sequences — mentioned by euclaise</title><link>https://news.ycombinator.com/item?id=36617375</link><guid isPermaLink="false">urn:hackerpapers:mention:2303.06349:36617375</guid><pubDate>Thu, 06 Jul 2023 15:20:05 GMT</pubDate><description>&lt;p&gt;&amp;gt; The bitter lesson [1] is going to eventually come for all of these. Eventually we&amp;#x27;ll figure out how to machine-learn the heuristic rather than hard code it. Recurrent neural networks (RNNs) do this implicitly, but we don&amp;#x27;t yet know how to effectively train RNNs on ultra-deep sequences. Linear RNNs and RWKV are examples of RNNs on deep sequences: https://arxiv.org/abs/2303.06349 https://arxiv.org/abs/2305.13048&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/2303.06349/"&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>Resurrecting Recurrent Neural Networks for Long Sequences — mentioned by smaddox</title><link>https://news.ycombinator.com/item?id=35514579</link><guid isPermaLink="false">urn:hackerpapers:mention:2303.06349:35514579</guid><pubDate>Mon, 10 Apr 2023 17:09:42 GMT</pubDate><description>&lt;p&gt;Other approaches for long sequence lengths: - &amp;quot;Hyena Hierarchy: Towards Larger Convolutional Language Models&amp;quot; https://arxiv.org/pdf/2302.10866.pdf - &amp;quot;Resurrecting Recurrent Neural Networks for Long Sequences&amp;quot; https://arxiv.org/pdf/2303.06349.pdf It&amp;#x27;s unclear (at least to me) if any of these scale as well as transformers at this point.&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/2303.06349/"&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>Resurrecting Recurrent Neural Networks for Long Sequences — HN submission</title><link>https://news.ycombinator.com/item?id=35146223</link><guid isPermaLink="false">urn:hackerpapers:submission:2303.06349:35146223</guid><pubDate>Tue, 14 Mar 2023 01:45:43 GMT</pubDate><description>&lt;p&gt;Resurrecting Recurrent Neural Networks for Long Sequences&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;4 points; 0 discussion replies on HN. &lt;a href="https://hackerpaper.kaipfister.de/p/2303.06349/"&gt;Paper and source history&lt;/a&gt;. A submission is not an endorsement.&lt;/p&gt;</description><category>cs.LG</category></item></channel></rss>
