<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Parallelizing Linear Recurrent Neural Nets Over Sequence Length · HackerPapers discussions</title><link>https://hackerpaper.kaipfister.de/p/1709.04057/</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/1709.04057/feed.xml" rel="self" type="application/rss+xml" /><item><title>Parallelizing Linear Recurrent Neural Nets Over Sequence Length — mentioned by lightcatcher</title><link>https://news.ycombinator.com/item?id=27669587</link><guid isPermaLink="false">urn:hackerpapers:mention:1709.04057:27669587</guid><pubDate>Mon, 28 Jun 2021 23:17:20 GMT</pubDate><description>&lt;p&gt;Parallel prefix sum is the most underappreciated parallel algorithm in my opinion, and this paper is the best explanation and visualization of the concept I&amp;#x27;ve seen. A few years ago I worked on a deep learning project using parallel prefix sum as a new way to accelerate recurrent neural nets on GPUs[0]. The paper in this post was the most important reference and source of inspiration. I&amp;#x27;m happy to see this paper shared on HN in hopes that it also sparks ideas in others. [0] https://arxiv.org/abs/1709.04057&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/1709.04057/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>cs.NE</category></item></channel></rss>
