<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Leave No Context Behind: Efficient Infinite Context Transformers with Infini-attention · HackerPapers discussions</title><link>https://hackerpaper.kaipfister.de/p/2404.07143/</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/2404.07143/feed.xml" rel="self" type="application/rss+xml" /><item><title>Leave No Context Behind: Efficient Infinite Context Transformers with Infini-attention — mentioned by westurner</title><link>https://news.ycombinator.com/item?id=40519828</link><guid isPermaLink="false">urn:hackerpapers:mention:2404.07143:40519828</guid><pubDate>Thu, 30 May 2024 03:35:25 GMT</pubDate><description>&lt;p&gt;Because self-attention can be replaced with FFT for a loss in accuracy and a reduction in kWh [1], I suspect that the Quantum Fourier Transform can also be substituted for attention in LLMs. [1] https://syncedreview.com/2021/05/14/deepmind-podracer-tpu-ba... &amp;quot;You Need to Pay Better Attention&amp;quot; (2024) https://arxiv.org/abs/2403.01643 : &amp;gt; Our first contribution is Optimised Attention, which performs similarly to standard attention, but has 3/4 as many parameters and one matrix multiplication fewer per head. Next, we introduce Efficient Attention, which performs on par with standard attention…&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/2404.07143/"&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>Leave No Context Behind: Efficient Infinite Context Transformers with Infini-attention — mentioned by underlines</title><link>https://news.ycombinator.com/item?id=40070022</link><guid isPermaLink="false">urn:hackerpapers:mention:2404.07143:40070022</guid><pubDate>Wed, 17 Apr 2024 21:01:48 GMT</pubDate><description>&lt;p&gt;tons and tons of papers, most of them had some disadvantages. Can&amp;#x27;t have the cake and eat it too: https://arxiv.org/html/2404.08801v1 Meta Megalodon https://arxiv.org/html/2404.07143v1 Google Infini-Attention https://arxiv.org/html/2402.13753v1 LongRoPE and a ton more&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/2404.07143/"&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>Leave No Context Behind: Efficient Infinite Context Transformers with Infini-attention — mentioned by ttul</title><link>https://news.ycombinator.com/item?id=40035383</link><guid isPermaLink="false">urn:hackerpapers:mention:2404.07143:40035383</guid><pubDate>Sun, 14 Apr 2024 23:16:48 GMT</pubDate><description>&lt;p&gt;https://arxiv.org/html/2404.07143v1 “This work introduces an efficient method to scale Transformer-based Large Language Models (LLMs) to infinitely long inputs with bounded memory and computation”&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/2404.07143/"&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>Leave No Context Behind: Efficient Infinite Context Transformers with Infini-attention — mentioned by westurner</title><link>https://news.ycombinator.com/item?id=40020762</link><guid isPermaLink="false">urn:hackerpapers:mention:2404.07143:40020762</guid><pubDate>Sat, 13 Apr 2024 05:33:53 GMT</pubDate><description>&lt;p&gt;&amp;quot;Leave No Context Behind: Efficient Infinite Context Transformers with Infini-attention&amp;quot; (2024) https://arxiv.org/abs/2404.07143 - https://news.ycombinator.com/item?id=40001626#40020560&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/2404.07143/"&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>Leave No Context Behind: Efficient Infinite Context Transformers with Infini-attention — mentioned by westurner</title><link>https://news.ycombinator.com/item?id=40020560</link><guid isPermaLink="false">urn:hackerpapers:mention:2404.07143:40020560</guid><pubDate>Sat, 13 Apr 2024 04:44:34 GMT</pubDate><description>&lt;p&gt;&amp;quot;Leave No Context Behind: Efficient Infinite Context Transformers with Infini-attention&amp;quot; (2024) https://arxiv.org/abs/2404.07143 : &amp;gt; This work introduces an efficient method to scale Transformer-based Large Language Models (LLMs) to infinitely long inputs with bounded memory and computation. A key component in our proposed approach is a new attention technique dubbed Infini-attention. The Infini-attention incorporates a compressive memory into the vanilla attention mechanism and builds in both masked local attention and long-term linear attention mechanisms in a single Transformer block. We…&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/2404.07143/"&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>Leave No Context Behind: Efficient Infinite Context Transformers with Infini-attention — HN submission</title><link>https://news.ycombinator.com/item?id=40008775</link><guid isPermaLink="false">urn:hackerpapers:submission:2404.07143:40008775</guid><pubDate>Fri, 12 Apr 2024 02:09:04 GMT</pubDate><description>&lt;p&gt;Leave No Context Behind: Efficient Infinite Context Transformers&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/2404.07143/"&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>Leave No Context Behind: Efficient Infinite Context Transformers with Infini-attention — mentioned by HarHarVeryFunny</title><link>https://news.ycombinator.com/item?id=40001958</link><guid isPermaLink="false">urn:hackerpapers:mention:2404.07143:40001958</guid><pubDate>Thu, 11 Apr 2024 13:32:55 GMT</pubDate><description>&lt;p&gt;Scaling alone will certainly not get us to AGI, but that&amp;#x27;s trivially obvious. The &amp;quot;scale is all you need&amp;quot; argument, from anyone intelligent, assumes that other obvious deficiencies such as lack of short-term memory (to enable more capable planning/reasoning) will also be taken care of along the way, and I&amp;#x27;d not be surprised to see that particular one addressed in upcoming next-gen models. There&amp;#x27;s a recent paper here from Google suggesting one way to do it, although may other ways too. https://arxiv.org/pdf/2404.07143.pdf The more interesting question is what other components/capabilities…&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/2404.07143/"&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>Leave No Context Behind: Efficient Infinite Context Transformers with Infini-attention — HN submission</title><link>https://news.ycombinator.com/item?id=40001626</link><guid isPermaLink="false">urn:hackerpapers:submission:2404.07143:40001626</guid><pubDate>Thu, 11 Apr 2024 13:01:02 GMT</pubDate><description>&lt;p&gt;Leave No Context Behind: Efficient Infinite Context Transformers&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;39 points; 4 discussion replies on HN. &lt;a href="https://hackerpaper.kaipfister.de/p/2404.07143/"&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>Leave No Context Behind: Efficient Infinite Context Transformers with Infini-attention — HN submission</title><link>https://news.ycombinator.com/item?id=39998228</link><guid isPermaLink="false">urn:hackerpapers:submission:2404.07143:39998228</guid><pubDate>Thu, 11 Apr 2024 03:53:24 GMT</pubDate><description>&lt;p&gt;Google: Efficient Infinite Context Transformers with Infini-Attention&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;4 points; 0 discussion replies on HN. &lt;a href="https://hackerpaper.kaipfister.de/p/2404.07143/"&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>
