<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>LLM-Pruner: On the Structural Pruning of Large Language Models · HackerPapers discussions</title><link>https://hackerpaper.kaipfister.de/p/2305.11627/</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.11627/feed.xml" rel="self" type="application/rss+xml" /><item><title>LLM-Pruner: On the Structural Pruning of Large Language Models — mentioned by renonce</title><link>https://news.ycombinator.com/item?id=40073067</link><guid isPermaLink="false">urn:hackerpapers:mention:2305.11627: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/2305.11627/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>cs.CL</category></item></channel></rss>
