<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Two Sparsities Are Better Than One: Unlocking the Performance Benefits of Sparse-Sparse Networks · HackerPapers discussions</title><link>https://hackerpaper.kaipfister.de/p/2112.13896/</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/2112.13896/feed.xml" rel="self" type="application/rss+xml" /><item><title>Two Sparsities Are Better Than One: Unlocking the Performance Benefits of Sparse-Sparse Networks — mentioned by Datenstrom</title><link>https://news.ycombinator.com/item?id=30351927</link><guid isPermaLink="false">urn:hackerpapers:mention:2112.13896:30351927</guid><pubDate>Tue, 15 Feb 2022 20:08:10 GMT</pubDate><description>&lt;p&gt;While this is true there is also a lot of interesting research going on that makes model training and adaptation to new tasks much more efficient. For example in meta-learning methods like Model Agnostic Meta-Learning (MAML)[1] you learn a model that learns to initialize weights for another model such that it converges very quickly for a new task. For datasets benchmarking new task adaptation there are Meta-Dataset (MD)[2] for Meta-Learning, and the Visual Task Adaptation Benchmark (VTAB)[3] for Representation Learning. Recently to compare the two approaches VTAB+MD[4] was created. Of course…&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/2112.13896/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>cs.LG</category></item><item><title>Two Sparsities Are Better Than One: Unlocking the Performance Benefits of Sparse-Sparse Networks — HN submission</title><link>https://news.ycombinator.com/item?id=30302469</link><guid isPermaLink="false">urn:hackerpapers:submission:2112.13896:30302469</guid><pubDate>Fri, 11 Feb 2022 15:25:25 GMT</pubDate><description>&lt;p&gt;Two sparsities are better than one: Performance of sparse-sparse networks&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;51 points; 7 discussion replies on HN. &lt;a href="https://hackerpaper.kaipfister.de/p/2112.13896/"&gt;Paper and source history&lt;/a&gt;. A submission is not an endorsement.&lt;/p&gt;</description><category>cs.LG</category></item></channel></rss>
