<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Mixture of Sparse Attention: Content-Based Learnable Sparse Attention via Expert-Choice Routing · HackerPapers discussions</title><link>https://hackerpaper.kaipfister.de/p/2505.00315/</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/2505.00315/feed.xml" rel="self" type="application/rss+xml" /><item><title>Mixture of Sparse Attention: Content-Based Learnable Sparse Attention via Expert-Choice Routing — mentioned by remexre</title><link>https://news.ycombinator.com/item?id=46882268</link><guid isPermaLink="false">urn:hackerpapers:mention:2505.00315:46882268</guid><pubDate>Wed, 04 Feb 2026 06:36:45 GMT</pubDate><description>&lt;p&gt;how does this compare to MoSA (arXiv:2505.00315)? do you require that there&amp;#x27;s a single contiguous window? and do you literally predict on position, or with a computed feature?&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/2505.00315/"&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>
