<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Finding Neurons in a Haystack: Case Studies with Sparse Probing · HackerPapers discussions</title><link>https://hackerpaper.kaipfister.de/p/2305.01610/</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/2305.01610/feed.xml" rel="self" type="application/rss+xml" /><item><title>Finding Neurons in a Haystack: Case Studies with Sparse Probing — mentioned by m_ke</title><link>https://news.ycombinator.com/item?id=46017799</link><guid isPermaLink="false">urn:hackerpapers:mention:2305.01610:46017799</guid><pubDate>Sat, 22 Nov 2025 20:05:49 GMT</pubDate><description>&lt;p&gt;Before we had proper GPUs everyone said the same thing about Neural Networks. Current model architectures are optimized to get the most out of GPUs, which is why we have transformers dominating as they&amp;#x27;re mostly large dense matrix multiplies. There&amp;#x27;s plenty of work showing transformers improve with inner dimension size but it&amp;#x27;s not feasible to scale them up further because it blows up parameter and activation sizes (including KV caches) so people to turn to low rank (&amp;quot;sparse&amp;quot;) decompositions like MLA. Lottery ticket hypothesis shows that most of the weights in current models are redundant and…&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/2305.01610/"&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>Finding Neurons in a Haystack: Case Studies with Sparse Probing — HN submission</title><link>https://news.ycombinator.com/item?id=35810243</link><guid isPermaLink="false">urn:hackerpapers:submission:2305.01610:35810243</guid><pubDate>Thu, 04 May 2023 01:38:36 GMT</pubDate><description>&lt;p&gt;Finding Neurons in a Haystack: Case Studies with Sparse Probing&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;2 points; 0 discussion replies on HN. &lt;a href="https://hackerpaper.kaipfister.de/p/2305.01610/"&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>
