<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Unlimiformer: Long-Range Transformers with Unlimited Length Input · HackerPapers discussions</title><link>https://hackerpaper.kaipfister.de/p/2305.01625/</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.01625/feed.xml" rel="self" type="application/rss+xml" /><item><title>Unlimiformer: Long-Range Transformers with Unlimited Length Input — HN submission</title><link>https://news.ycombinator.com/item?id=41131304</link><guid isPermaLink="false">urn:hackerpapers:submission:2305.01625:41131304</guid><pubDate>Thu, 01 Aug 2024 17:12:15 GMT</pubDate><description>&lt;p&gt;Unlimited Context Length possible? hear NeurIPS paper author Friday Paper Club&lt;/p&gt;&lt;p&gt;Is Unlimited Context Length really possible? At what cost? Amanda Bertsch, author of 2023 NeurIPS paper Unlimiformer, will describe the architecture and take questions at this Friday&amp;#x27;s Oxen.ai Paper Club. Greg Schoeninger u/FallMindless3563, Oxen CEO and Master of Plain Speak, will help interp the concept and relate it to other papers we have reviewed. Call: https://oxen.ai/community The trick asserted to make Unlimited Context Length possible: Offload the cross attention calc to a K-Nearest Neighbors (K-NN) index. I tweeted someone&amp;#x27;s clever animation of K-NN here…&lt;/p&gt;&lt;p&gt;1 point; 1 discussion reply on HN. &lt;a href="https://hackerpaper.kaipfister.de/p/2305.01625/"&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>Unlimiformer: Long-Range Transformers with Unlimited Length Input — mentioned by maskedpirate</title><link>https://news.ycombinator.com/item?id=35912956</link><guid isPermaLink="false">urn:hackerpapers:mention:2305.01625:35912956</guid><pubDate>Fri, 12 May 2023 07:07:12 GMT</pubDate><description>&lt;p&gt;Is there any paper or architecture about this model that explains how they achieved it? is it unlimiformer [https://arxiv.org/abs/2305.01625?utm_source=tldrai] or something different?&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/2305.01625/"&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>Unlimiformer: Long-Range Transformers with Unlimited Length Input — mentioned by j2kun</title><link>https://news.ycombinator.com/item?id=35833438</link><guid isPermaLink="false">urn:hackerpapers:mention:2305.01625:35833438</guid><pubDate>Fri, 05 May 2023 18:37:15 GMT</pubDate><description>&lt;p&gt;Appendix C of the PDF has an example book summary of The Brothers Karamazov, with noted minor factual errors https://arxiv.org/pdf/2305.01625.pdf &amp;gt; Unlimiformer summary: &amp;gt; The first part of the novel focuses on the question of whether or not the Russian nobleman, Dmitri Fyodorovitch, has killed his father. In the town of Ivanovna, the lieutenant-colonel of the Mushenkhanovitch is accused of the murder of his brother Ivanovitch. The lieutenant-incommand, Vasilyevitch, takes the form of a dog, and the two men–the two men and the woman who are questioned by the court-martial–murphy. The two men…&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/2305.01625/"&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>Unlimiformer: Long-Range Transformers with Unlimited Length Input — HN submission</title><link>https://news.ycombinator.com/item?id=35832802</link><guid isPermaLink="false">urn:hackerpapers:submission:2305.01625:35832802</guid><pubDate>Fri, 05 May 2023 17:53:50 GMT</pubDate><description>&lt;p&gt;Unlimiformer: Long-Range Transformers with Unlimited Length Input&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;335 points; 101 discussion replies on HN. &lt;a href="https://hackerpaper.kaipfister.de/p/2305.01625/"&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>Unlimiformer: Long-Range Transformers with Unlimited Length Input — HN submission</title><link>https://news.ycombinator.com/item?id=35826357</link><guid isPermaLink="false">urn:hackerpapers:submission:2305.01625:35826357</guid><pubDate>Fri, 05 May 2023 07:37:11 GMT</pubDate><description>&lt;p&gt;Unlimiformer: Long-Range Transformers With Unlimited Length Input&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.01625/"&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>Unlimiformer: Long-Range Transformers with Unlimited Length Input — HN submission</title><link>https://news.ycombinator.com/item?id=35823039</link><guid isPermaLink="false">urn:hackerpapers:submission:2305.01625:35823039</guid><pubDate>Thu, 04 May 2023 22:35:56 GMT</pubDate><description>&lt;p&gt;Unlimiformer: Long-Range Transformers with Unlimited Length Input&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;3 points; 3 discussion replies on HN. &lt;a href="https://hackerpaper.kaipfister.de/p/2305.01625/"&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>Unlimiformer: Long-Range Transformers with Unlimited Length Input — HN submission</title><link>https://news.ycombinator.com/item?id=35803470</link><guid isPermaLink="false">urn:hackerpapers:submission:2305.01625:35803470</guid><pubDate>Wed, 03 May 2023 15:21:46 GMT</pubDate><description>&lt;p&gt;Unlimiformer: Long-Range Transformers with Unlimited Length Input&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/2305.01625/"&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>Unlimiformer: Long-Range Transformers with Unlimited Length Input — HN submission</title><link>https://news.ycombinator.com/item?id=35799077</link><guid isPermaLink="false">urn:hackerpapers:submission:2305.01625:35799077</guid><pubDate>Wed, 03 May 2023 07:08:13 GMT</pubDate><description>&lt;p&gt;Unlimiformer: Long-Range Transformers with Unlimited Length Input&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/2305.01625/"&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>
