<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>SparseGPT: Massive Language Models Can Be Accurately Pruned in One-Shot · HackerPapers discussions</title><link>https://hackerpaper.kaipfister.de/p/2301.00774/</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/2301.00774/feed.xml" rel="self" type="application/rss+xml" /><item><title>SparseGPT: Massive Language Models Can Be Accurately Pruned in One-Shot — mentioned by renonce</title><link>https://news.ycombinator.com/item?id=40073067</link><guid isPermaLink="false">urn:hackerpapers:mention:2301.00774:40073067</guid><pubDate>Thu, 18 Apr 2024 04:50:03 GMT</pubDate><description>&lt;p&gt;Essentially the algorithm is about pruning parameters on the fly and making the weight matrix sparse by setting least significant weights to zero, where &amp;quot;least significant&amp;quot; is defined in terms of the rank of the absolute value of the pruned weight within its group? A search for model pruning turns out many results, including https://arxiv.org/abs/2305.11627 which discusses &amp;quot;magnitude pruning&amp;quot; as a baseline, and refers to https://arxiv.org/pdf/2301.00774.pdf, which asserts in the introduction: &amp;gt; First, as shown in Figure 1, SparseGPT can induce uniform layerwise sparsity of up to 60% in e.g.…&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/2301.00774/"&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>SparseGPT: Massive Language Models Can Be Accurately Pruned in One-Shot — mentioned by yarg</title><link>https://news.ycombinator.com/item?id=35968943</link><guid isPermaLink="false">urn:hackerpapers:mention:2301.00774:35968943</guid><pubDate>Tue, 16 May 2023 23:05:50 GMT</pubDate><description>&lt;p&gt;There&amp;#x27;s no chance that we&amp;#x27;ve peeked from a bang for buck sense - we still haven&amp;#x27;t adequately investigated sparse networks. Relevantish: https://arxiv.org/abs/2301.00774 The fact that we can reach those levels of sparseness with pruning also indicates that we&amp;#x27;re not doing a very good job of generating the initial network conditions. Being able to come up with trainable initial settings for sparse networks across different topologies is hard, but given that we&amp;#x27;ve had a degree of success with pre-trained networks, pre-training and pre-pruning might also allow for sparse networks with minimally…&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/2301.00774/"&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>SparseGPT: Massive Language Models Can Be Accurately Pruned in One-Shot — mentioned by sp332</title><link>https://news.ycombinator.com/item?id=35942032</link><guid isPermaLink="false">urn:hackerpapers:mention:2301.00774:35942032</guid><pubDate>Sun, 14 May 2023 22:45:39 GMT</pubDate><description>&lt;p&gt;Training uses gradient descent, so you want to have good precision during that process. But once you have the overall structure of the network, https://arxiv.org/abs/2210.17323 (GPTQ) showed that you can cut down the precision quite a bit without losing a lot of accuracy. It seems you can cut down further for larger models. For the 13B Llama-based ones, going below 5 bits per parameter is noticeably worse, but for 30B models you can do 4 bits. The same group did another paper https://arxiv.org/abs/2301.00774 which shows that in addition to reducing the precision of each parameter, you can…&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/2301.00774/"&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>SparseGPT: Massive Language Models Can Be Accurately Pruned in One-Shot — HN submission</title><link>https://news.ycombinator.com/item?id=35804556</link><guid isPermaLink="false">urn:hackerpapers:submission:2301.00774:35804556</guid><pubDate>Wed, 03 May 2023 16:44:19 GMT</pubDate><description>&lt;p&gt;SparseGPT: Language Models Can Be Accurately Pruned in One-Shot&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;211 points; 62 discussion replies on HN. &lt;a href="https://hackerpaper.kaipfister.de/p/2301.00774/"&gt;Paper and source history&lt;/a&gt;. A submission is not an endorsement.&lt;/p&gt;</description><category>cs.LG</category></item><item><title>SparseGPT: Massive Language Models Can Be Accurately Pruned in One-Shot — mentioned by sebzim4500</title><link>https://news.ycombinator.com/item?id=35800271</link><guid isPermaLink="false">urn:hackerpapers:mention:2301.00774:35800271</guid><pubDate>Wed, 03 May 2023 10:04:18 GMT</pubDate><description>&lt;p&gt;https://arxiv.org/pdf/2301.00774.pdf&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/2301.00774/"&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>SparseGPT: Massive Language Models Can Be Accurately Pruned in One-Shot — mentioned by lhl</title><link>https://news.ycombinator.com/item?id=35661192</link><guid isPermaLink="false">urn:hackerpapers:mention:2301.00774:35661192</guid><pubDate>Fri, 21 Apr 2023 22:37:52 GMT</pubDate><description>&lt;p&gt;While I agree we probably aren&amp;#x27;t getting exponentially increasing parameter counts (GPT4 is by all accounts 1T paramaters and of course, it is significantly better than GPT3) we are still seeing lots of improvements - 3.5 is much better than 3, based &amp;quot;just&amp;quot; on InstructGPT/RLHF training. Models are getting better as well - LLaMA 30B beats/matches GPT-3 on raw eval benchmarks at 1/6 the parameter count. We&amp;#x27;re also seeing lots of optimizations with new models (RoPE/RoPER embedding, Swish/GeLU activation, Flash Attention, etc) but I think some the most interesting gains we&amp;#x27;ll be seeing soon is…&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/2301.00774/"&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>SparseGPT: Massive Language Models Can Be Accurately Pruned in One-Shot — mentioned by lhl</title><link>https://news.ycombinator.com/item?id=35631998</link><guid isPermaLink="false">urn:hackerpapers:mention:2301.00774:35631998</guid><pubDate>Wed, 19 Apr 2023 19:05:24 GMT</pubDate><description>&lt;p&gt;I think &amp;quot;sweet spot&amp;quot; is going to depend on your task, but here&amp;#x27;s a good recent paper that may give you some more context on thinking about training and model sizes: https://www.harmdevries.com/post/model-size-vs-compute-overh... There have also been quite a few developments on sparsity lately. Here&amp;#x27;s a technique SparseGPT which suggests that you can prune 50% of parameters with almost no loss in performance for example: https://arxiv.org/abs/2301.00774&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/2301.00774/"&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>SparseGPT: Massive Language Models Can Be Accurately Pruned in One-Shot — mentioned by snerbles</title><link>https://news.ycombinator.com/item?id=35350337</link><guid isPermaLink="false">urn:hackerpapers:mention:2301.00774:35350337</guid><pubDate>Wed, 29 Mar 2023 00:36:51 GMT</pubDate><description>&lt;p&gt;&amp;quot;Pruning&amp;quot; is the main term you are looking for, with a variety of methods to do so. https://blog.dataiku.com/making-neural-networks-smaller-for-... https://arxiv.org/abs/2301.00774 https://tivadardanka.com/blog/how-to-compress-a-neural-netwo... There&amp;#x27;s also quantization. It&amp;#x27;s currently where a lot of the current grassroots research is happening, if you&amp;#x27;ve seen the llama.cpp repo posted here on HN, it uses the original 16-bit float weights downsized to 4-bit integers with a comparable reduction in resource usage with relatively little performance loss. The big players are also using…&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/2301.00774/"&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>SparseGPT: Massive Language Models Can Be Accurately Pruned in One-Shot — mentioned by p1esk</title><link>https://news.ycombinator.com/item?id=35018904</link><guid isPermaLink="false">urn:hackerpapers:mention:2301.00774:35018904</guid><pubDate>Sat, 04 Mar 2023 07:10:21 GMT</pubDate><description>&lt;p&gt;what percentage of weights could be thrown out post-training At least 60% according to this paper: https://arxiv.org/abs/2301.00774&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/2301.00774/"&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>SparseGPT: Massive Language Models Can Be Accurately Pruned in One-Shot — mentioned by woodson</title><link>https://news.ycombinator.com/item?id=34236485</link><guid isPermaLink="false">urn:hackerpapers:mention:2301.00774:34236485</guid><pubDate>Tue, 03 Jan 2023 19:15:23 GMT</pubDate><description>&lt;p&gt;I think quantization (e.g. 4-bit, https://arxiv.org/abs/2212.09720) and sparsity (e.g. SparseGPT, https://arxiv.org/abs/2301.00774) will bring down inference cost. Edit: This isn’t handwaving btw, this is to say some fairly decent solutions are available now.&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/2301.00774/"&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>
