<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>RadiX-Net: Structured Sparse Matrices for Deep Neural Networks · HackerPapers discussions</title><link>https://hackerpaper.kaipfister.de/p/1905.00416/</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/1905.00416/feed.xml" rel="self" type="application/rss+xml" /><item><title>RadiX-Net: Structured Sparse Matrices for Deep Neural Networks — mentioned by michelpp</title><link>https://news.ycombinator.com/item?id=21940023</link><guid isPermaLink="false">urn:hackerpapers:mention:1905.00416:21940023</guid><pubDate>Thu, 02 Jan 2020 21:27:00 GMT</pubDate><description>&lt;p&gt;The members of the GraphBLAS forum have discussed this chip a couple of times. There&amp;#x27;s a lot of research on making deep neural networks more sparse, not just by pruning a dense matrix, but by starting with a sparse matrix structure de novo. Lincoln Laboratory&amp;#x27;s Dr. Jeremy Kepner has a good paper on Radix-Net mixed radix topologies that achieve good learning ability but with far fewer neurons and memory requirements. Cited in the paper was a network constructed with these techniques that simulated the size and sparsity of the human brain: https://arxiv.org/pdf/1905.00416.pdf It would be cool…&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/1905.00416/"&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>
