<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Landmark Attention: Random-Access Infinite Context Length for Transformers · HackerPapers discussions</title><link>https://hackerpaper.kaipfister.de/p/2305.16300/</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.16300/feed.xml" rel="self" type="application/rss+xml" /><item><title>Landmark Attention: Random-Access Infinite Context Length for Transformers — mentioned by AaronFriel</title><link>https://news.ycombinator.com/item?id=39854164</link><guid isPermaLink="false">urn:hackerpapers:mention:2305.16300:39854164</guid><pubDate>Thu, 28 Mar 2024 16:49:40 GMT</pubDate><description>&lt;p&gt;It indeed is. An attention mechanism&amp;#x27;s key and value matrices grow linearly with context length. With PagedAttention[1], we could imagine an external service providing context. The hard part is the how, of course. We can&amp;#x27;t load our entire database in every conversation, and I suspect there are also challenges around training (perhaps addressed via LandmarkAttention[2]) and building a service efficiently retrieve additional key-value matrices. The external service vector database may require tight timings necessary to avoid stalling LLMs. To manage 20-50 tokens/sec, answers must arrive within…&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/2305.16300/"&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>Landmark Attention: Random-Access Infinite Context Length for Transformers — mentioned by Tostino</title><link>https://news.ycombinator.com/item?id=36152132</link><guid isPermaLink="false">urn:hackerpapers:mention:2305.16300:36152132</guid><pubDate>Thu, 01 Jun 2023 15:08:13 GMT</pubDate><description>&lt;p&gt;Completely agree here. And the fact of the matter is, long term memory is actively being worked on. You can already approximate reasonably with a Vector DB and embeddings, feeding the relevant results into the context. As is increasing the &amp;quot;working memory&amp;quot; (context size) in a more efficient manner: https://arxiv.org/abs/2305.16300 This isn&amp;#x27;t even getting into using things like Tree of Thought techniques to improve reasoning abilities and limit the search space for each portion of the problem to a reasonable size.&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/2305.16300/"&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>Landmark Attention: Random-Access Infinite Context Length for Transformers — HN submission</title><link>https://news.ycombinator.com/item?id=36098879</link><guid isPermaLink="false">urn:hackerpapers:submission:2305.16300:36098879</guid><pubDate>Sat, 27 May 2023 22:09:44 GMT</pubDate><description>&lt;p&gt;Landmark Attention: Random-Access Infinite Context Length for Transformers&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;22 points; 4 discussion replies on HN. &lt;a href="https://hackerpaper.kaipfister.de/p/2305.16300/"&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>Landmark Attention: Random-Access Infinite Context Length for Transformers — HN submission</title><link>https://news.ycombinator.com/item?id=36093879</link><guid isPermaLink="false">urn:hackerpapers:submission:2305.16300:36093879</guid><pubDate>Sat, 27 May 2023 11:39:12 GMT</pubDate><description>&lt;p&gt;Random-Access Infinite Context Length for Transformers&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;1 point; 0 discussion replies on HN. &lt;a href="https://hackerpaper.kaipfister.de/p/2305.16300/"&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>
