<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>SpQR: A Sparse-Quantized Representation for Near-Lossless LLM Weight Compression · HackerPapers discussions</title><link>https://hackerpaper.kaipfister.de/p/2306.03078/</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/2306.03078/feed.xml" rel="self" type="application/rss+xml" /><item><title>SpQR: A Sparse-Quantized Representation for Near-Lossless LLM Weight Compression — mentioned by AhtiK</title><link>https://news.ycombinator.com/item?id=39639010</link><guid isPermaLink="false">urn:hackerpapers:mention:2306.03078:39639010</guid><pubDate>Fri, 08 Mar 2024 08:18:45 GMT</pubDate><description>&lt;p&gt;Has anyone seen an implementation of &amp;#x27;SpQR: A Sparse-Quantized Representation,&amp;#x27; published in June 2023 by Tim Dettmers et al.? https://arxiv.org/abs/2306.03078&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/2306.03078/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>cs.CL</category></item><item><title>SpQR: A Sparse-Quantized Representation for Near-Lossless LLM Weight Compression — mentioned by raphlinus</title><link>https://news.ycombinator.com/item?id=37664767</link><guid isPermaLink="false">urn:hackerpapers:mention:2306.03078:37664767</guid><pubDate>Tue, 26 Sep 2023 19:38:21 GMT</pubDate><description>&lt;p&gt;ROCm makes me sad, as it reminds me of how much better GPUs could be than they are today. I&amp;#x27;ve lately been exploring the idea of a &amp;quot;Good Parallel Computer,&amp;quot; which combines most of the agility of a CPU with the efficient parallel throughput of a GPU. The central concept is that the decision to launch a workgroup is made by a programmable controller, rather than just being a cube of (x, y, z) or downstream of triangles. A particular workload it would likely excel at is sparse matrix multiplication, including multiple quantization levels like SpQR[1]. I&amp;#x27;m hopeful that it could be an advance in…&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/2306.03078/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>cs.CL</category></item><item><title>SpQR: A Sparse-Quantized Representation for Near-Lossless LLM Weight Compression — mentioned by GaggiX</title><link>https://news.ycombinator.com/item?id=36274461</link><guid isPermaLink="false">urn:hackerpapers:mention:2306.03078:36274461</guid><pubDate>Sat, 10 Jun 2023 19:58:56 GMT</pubDate><description>&lt;p&gt;https://arxiv.org/abs/2306.03078 From the same author and more recent.&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/2306.03078/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>cs.CL</category></item><item><title>SpQR: A Sparse-Quantized Representation for Near-Lossless LLM Weight Compression — HN submission</title><link>https://news.ycombinator.com/item?id=36216126</link><guid isPermaLink="false">urn:hackerpapers:submission:2306.03078:36216126</guid><pubDate>Tue, 06 Jun 2023 17:23:13 GMT</pubDate><description>&lt;p&gt;SpQR: A Sparse-Quantized Representation for Near-Lossless LLM Weight Compression&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;8 points; 2 discussion replies on HN. &lt;a href="https://hackerpaper.kaipfister.de/p/2306.03078/"&gt;Paper and source history&lt;/a&gt;. A submission is not an endorsement.&lt;/p&gt;</description><category>cs.CL</category></item></channel></rss>
