<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Efficient Content-Based Sparse Attention with Routing Transformers · HackerPapers discussions</title><link>https://hackerpaper.kaipfister.de/p/2003.05997/</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/2003.05997/feed.xml" rel="self" type="application/rss+xml" /><item><title>Efficient Content-Based Sparse Attention with Routing Transformers — mentioned by in-silico</title><link>https://news.ycombinator.com/item?id=48032596</link><guid isPermaLink="false">urn:hackerpapers:mention:2003.05997:48032596</guid><pubDate>Wed, 06 May 2026 05:32:27 GMT</pubDate><description>&lt;p&gt;I wonder how different their method actually is from other sub-quadratic sparse attention methods like Reformer [1] and Routing Transformer [2]. [1]: https://arxiv.org/abs/2001.04451 [2]: https://arxiv.org/abs/2003.05997&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/2003.05997/"&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>
