<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Scalable MatMul-free Language Modeling · HackerPapers discussions</title><link>https://hackerpaper.kaipfister.de/p/2406.02528/</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/2406.02528/feed.xml" rel="self" type="application/rss+xml" /><item><title>Scalable MatMul-free Language Modeling — mentioned by akrymski</title><link>https://news.ycombinator.com/item?id=41732977</link><guid isPermaLink="false">urn:hackerpapers:mention:2406.02528:41732977</guid><pubDate>Thu, 03 Oct 2024 17:45:57 GMT</pubDate><description>&lt;p&gt;Fantastic result, on par with another similar effort: https://arxiv.org/pdf/2406.02528 It seems to me that we&amp;#x27;ve stumbled upon this method of GPU-heavy matrix-multiplications in deep neural nets, and have only scratched the surface of alternative methods that are actually optimized for current CPU architectures such as Tsetlin Machines, Hyperdimensional Vectors, etc.&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/2406.02528/"&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>Scalable MatMul-free Language Modeling — mentioned by smusamashah</title><link>https://news.ycombinator.com/item?id=41473176</link><guid isPermaLink="false">urn:hackerpapers:mention:2406.02528:41473176</guid><pubDate>Sat, 07 Sep 2024 11:06:49 GMT</pubDate><description>&lt;p&gt;There was a paper about LLM running on same power as a light bulb. https://arxiv.org/abs/2406.02528 https://news.ucsc.edu/2024/06/matmul-free-llm.html&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/2406.02528/"&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>Scalable MatMul-free Language Modeling — mentioned by MiguelX413</title><link>https://news.ycombinator.com/item?id=40802788</link><guid isPermaLink="false">urn:hackerpapers:mention:2406.02528:40802788</guid><pubDate>Wed, 26 Jun 2024 18:13:59 GMT</pubDate><description>&lt;p&gt;The pre-print is https://doi.org/10.48550/arXiv.2406.02528&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/2406.02528/"&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>Scalable MatMul-free Language Modeling — mentioned by tomohelix</title><link>https://news.ycombinator.com/item?id=40794842</link><guid isPermaLink="false">urn:hackerpapers:mention:2406.02528:40794842</guid><pubDate>Tue, 25 Jun 2024 23:25:10 GMT</pubDate><description>&lt;p&gt;The relevant paper: https://arxiv.org/abs/2406.02528 In summary, they forced the model to process data in ternary system and then build a custom FPGA chip to process the data more efficiently. Tested to be &amp;quot;comparable&amp;quot; to small models (3B), theoretically scale to 70B, unknown for SOTAs (&amp;gt;100B params). We have always known custom chips are more efficient especially for tasks like these where it is basically approximating an analog process (i.e. the brain). What is impressive is how fast it is prgressing. These 3B params models would demolish GPT2 which was, what, 4-5 years old? And they would…&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/2406.02528/"&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>Scalable MatMul-free Language Modeling — mentioned by Aurornis</title><link>https://news.ycombinator.com/item?id=40788024</link><guid isPermaLink="false">urn:hackerpapers:mention:2406.02528:40788024</guid><pubDate>Tue, 25 Jun 2024 12:58:17 GMT</pubDate><description>&lt;p&gt;The press release is devoid of useful information, unsurprisingly. You can run an LLM under almost any energy envelope if you’re willing to wait long enough for the result. Total energy consumed and the time difference are the more important metrics. The actual paper is here: https://arxiv.org/abs/2406.02528 The key part from the summary: &amp;gt; To properly quantify the efficiency of our architecture, we build a custom hardware solution on an FPGA which exploits lightweight operations beyond what GPUs are capable of. We processed billion-parameter scale models at 13W beyond human readable…&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/2406.02528/"&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>Scalable MatMul-free Language Modeling — mentioned by cs702</title><link>https://news.ycombinator.com/item?id=40787942</link><guid isPermaLink="false">urn:hackerpapers:mention:2406.02528:40787942</guid><pubDate>Tue, 25 Jun 2024 12:49:13 GMT</pubDate><description>&lt;p&gt;Paper: https://arxiv.org/abs/2406.02528 -- always better than a press release. Code: https://github.com/ridgerchu/matmulfreellm --- Like others before them, the authors train LLMs using parameters consisting of ternary digits, or trits, with values in {-1, 0, 1}. What&amp;#x27;s new is that the authors then build a custom hardware solution on an FPGA and run billion-parameter LLMs consuming only 13W, moving LLM inference closer to brain-like efficiency. Sure, it&amp;#x27;s on an FPGA, and it&amp;#x27;s only a lab experiment, but we&amp;#x27;re talking about an early proof of concept, not a commercial product. As far as I know…&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/2406.02528/"&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>Scalable MatMul-free Language Modeling — HN submission</title><link>https://news.ycombinator.com/item?id=40620955</link><guid isPermaLink="false">urn:hackerpapers:submission:2406.02528:40620955</guid><pubDate>Sun, 09 Jun 2024 00:00:48 GMT</pubDate><description>&lt;p&gt;Scalable MatMul-Free Language Modeling&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;205 points; 30 discussion replies on HN. &lt;a href="https://hackerpaper.kaipfister.de/p/2406.02528/"&gt;Paper and source history&lt;/a&gt;. A submission is not an endorsement.&lt;/p&gt;</description><category>cs.CL</category></item><item><title>Scalable MatMul-free Language Modeling — HN submission</title><link>https://news.ycombinator.com/item?id=40617529</link><guid isPermaLink="false">urn:hackerpapers:submission:2406.02528:40617529</guid><pubDate>Sat, 08 Jun 2024 13:48:43 GMT</pubDate><description>&lt;p&gt;Scalable MatMul-Free Language Modeling&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;3 points; 0 discussion replies on HN. &lt;a href="https://hackerpaper.kaipfister.de/p/2406.02528/"&gt;Paper and source history&lt;/a&gt;. A submission is not an endorsement.&lt;/p&gt;</description><category>cs.CL</category></item><item><title>Scalable MatMul-free Language Modeling — HN submission</title><link>https://news.ycombinator.com/item?id=40607640</link><guid isPermaLink="false">urn:hackerpapers:submission:2406.02528:40607640</guid><pubDate>Fri, 07 Jun 2024 11:40:02 GMT</pubDate><description>&lt;p&gt;Scalable MatMul-Free Language Modeling&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;3 points; 0 discussion replies on HN. &lt;a href="https://hackerpaper.kaipfister.de/p/2406.02528/"&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>
