<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Monarch: Expressive Structured Matrices for Efficient and Accurate Training · HackerPapers discussions</title><link>https://hackerpaper.kaipfister.de/p/2204.00595/</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/2204.00595/feed.xml" rel="self" type="application/rss+xml" /><item><title>Monarch: Expressive Structured Matrices for Efficient and Accurate Training — mentioned by sdenton4</title><link>https://news.ycombinator.com/item?id=46012005</link><guid isPermaLink="false">urn:hackerpapers:mention:2204.00595:46012005</guid><pubDate>Sat, 22 Nov 2025 04:04:21 GMT</pubDate><description>&lt;p&gt;A somewhat more beautiful matmul for neural networks is given by the Monarch paper: https://arxiv.org/abs/2204.00595 Generally, low-rank and block-diagonal matrices are both great strategies for producing expressive matmuls with fewer parameters. We can view the FFT as a particularly deft example of factorizing one big matmul into a number of block-diagonal matmuls, greatly reducing the overall number of multiplications by minimizing the block size. However, on a G/TPU, we have a lot more parallelism available, so the sweet spot for size of the blocks may be larger than 2x2... We can also mix…&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/2204.00595/"&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>
