<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>NoLiMa: Long-Context Evaluation Beyond Literal Matching · HackerPapers discussions</title><link>https://hackerpaper.kaipfister.de/p/2502.05167/</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/2502.05167/feed.xml" rel="self" type="application/rss+xml" /><item><title>NoLiMa: Long-Context Evaluation Beyond Literal Matching — HN submission</title><link>https://news.ycombinator.com/item?id=47772971</link><guid isPermaLink="false">urn:hackerpapers:submission:2502.05167:47772971</guid><pubDate>Tue, 14 Apr 2026 23:50:47 GMT</pubDate><description>&lt;p&gt;Ask HN: At ~165k tokens, does Opus 4.6 1M outperform Opus 4.6 200k?&lt;/p&gt;&lt;p&gt;Here is a question for which I cannot find an answer, and cannot yet afford to answer myself: NoLiMa [0] and &amp;quot;context rot&amp;quot; [1] would indicate that with a ~165k request, Opus 200k would suck, and Opus 1M would be better (as a lower percentage of the context window was used)... but they are the same model, right? However, there are practical inference deployment differences that could change the whole paradigm, right? I am so confused. Anthropic says it&amp;#x27;s the same model [2]. But, Claude Code&amp;#x27;s own source treats them as distinct variants with separate routing [3]. Closest test I found [4]…&lt;/p&gt;&lt;p&gt;1 point; 0 discussion replies on HN. &lt;a href="https://hackerpaper.kaipfister.de/p/2502.05167/"&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>NoLiMa: Long-Context Evaluation Beyond Literal Matching — mentioned by consumer451</title><link>https://news.ycombinator.com/item?id=47772574</link><guid isPermaLink="false">urn:hackerpapers:mention:2502.05167:47772574</guid><pubDate>Tue, 14 Apr 2026 23:03:00 GMT</pubDate><description>&lt;p&gt;super-edit: Sorry, this is not a usage related question, I have move it to: https://news.ycombinator.com/item?id=47772971 Here is the question for which I cannot find an answer, and cannot yet afford to answer myself: In Claude Code, I use Opus 4.6 1M, but stay under 250k via careful session management to avoid known NoLiMa [0] / context rot [1] crap. The question I keep wanting answered though: at ~165k tokens used, does Opus 1M actually deliver higher quality than Opus 200k? NoLiMa would indicate that with a ~165k request, Opus 200k would suck, and Opus 1M would be better (as a lower…&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/2502.05167/"&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>NoLiMa: Long-Context Evaluation Beyond Literal Matching — mentioned by ivzak</title><link>https://news.ycombinator.com/item?id=47372191</link><guid isPermaLink="false">urn:hackerpapers:mention:2502.05167:47372191</guid><pubDate>Sat, 14 Mar 2026 01:06:21 GMT</pubDate><description>&lt;p&gt;It seems to be the hit rate of a very straightforward (literal matching) retrieval. Just checked the benchmark description (https://huggingface.co/datasets/openai/mrcr), here it is: &amp;quot;The task is as follows: The model is given a long, multi-turn, synthetically generated conversation between user and model where the user asks for a piece of writing about a topic, e.g. &amp;quot;write a poem about tapirs&amp;quot; or &amp;quot;write a blog post about rocks&amp;quot;. Hidden in this conversation are 2, 4, or 8 identical asks, and the model is ultimately prompted to return the i-th instance of one of those asks. For example, &amp;quot;Return…&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/2502.05167/"&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>NoLiMa: Long-Context Evaluation Beyond Literal Matching — HN submission</title><link>https://news.ycombinator.com/item?id=44914825</link><guid isPermaLink="false">urn:hackerpapers:submission:2502.05167:44914825</guid><pubDate>Fri, 15 Aug 2025 17:04:46 GMT</pubDate><description>&lt;p&gt;NoLiMa: Long-Context Evaluation Beyond Literal Matching&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;2 points; 0 discussion replies on HN. &lt;a href="https://hackerpaper.kaipfister.de/p/2502.05167/"&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>NoLiMa: Long-Context Evaluation Beyond Literal Matching — mentioned by consumer451</title><link>https://news.ycombinator.com/item?id=44121007</link><guid isPermaLink="false">urn:hackerpapers:mention:2502.05167:44121007</guid><pubDate>Wed, 28 May 2025 21:55:28 GMT</pubDate><description>&lt;p&gt;Hello Simon, sorry for asking about this tangent here, but have you seen this paper? Is it as important as it appears to be? Should this metric be on all system cards? &amp;gt; We evaluate 12 popular LLMs that claim to support contexts of at least 128K tokens. While they perform well in short contexts (&amp;lt;1K), performance degrades significantly as context length increases. At 32K, for instance, 10 models drop below 50% of their strong short-length baselines. Even GPT-4o, one of the top-performing exceptions, experiences a reduction from an almost-perfect baseline of 99.3% to 69.7%.…&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/2502.05167/"&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>NoLiMa: Long-Context Evaluation Beyond Literal Matching — mentioned by consumer451</title><link>https://news.ycombinator.com/item?id=44107537</link><guid isPermaLink="false">urn:hackerpapers:mention:2502.05167:44107537</guid><pubDate>Tue, 27 May 2025 14:51:48 GMT</pubDate><description>&lt;p&gt;Related paper: https://arxiv.org/abs/2502.05167 &amp;gt; We evaluate 12 popular LLMs that claim to support contexts of at least 128K tokens. While they perform well in short contexts (&amp;lt;1K), performance degrades significantly as context length increases. At 32K, for instance, 10 models drop below 50% of their strong short-length baselines. Even GPT-4o, one of the top-performing exceptions, experiences a reduction from an almost-perfect baseline of 99.3% to 69.7%. I post this because this information seems very important for users of LLMs, and devs implementing LLMs in their own solutions. The…&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/2502.05167/"&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>NoLiMa: Long-Context Evaluation Beyond Literal Matching — mentioned by evertedsphere</title><link>https://news.ycombinator.com/item?id=44067816</link><guid isPermaLink="false">urn:hackerpapers:mention:2502.05167:44067816</guid><pubDate>Thu, 22 May 2025 22:24:57 GMT</pubDate><description>&lt;p&gt;ruler https://arxiv.org/abs/2404.06654 nolima https://arxiv.org/abs/2502.05167&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/2502.05167/"&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>NoLiMa: Long-Context Evaluation Beyond Literal Matching — mentioned by consumer451</title><link>https://news.ycombinator.com/item?id=43689200</link><guid isPermaLink="false">urn:hackerpapers:mention:2502.05167:43689200</guid><pubDate>Tue, 15 Apr 2025 05:21:01 GMT</pubDate><description>&lt;p&gt;This is a paper which echoes your experience, in general. I really wish that when papers like this one were created, someone took the methodology and kept running with it for every model: &amp;gt; For instance, the NoLiMa benchmark revealed that models like GPT-4o experienced a significant drop from a 99.3% performance rate at 1,000 tokens to 69.7% at 32,000 tokens. Similarly, Llama 3.3 70B&amp;#x27;s effectiveness decreased from 97.3% at 1,000 tokens to 42.7% at 32,000 tokens, highlighting the challenges LLMs face with longer contexts. https://arxiv.org/abs/2502.05167&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/2502.05167/"&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>NoLiMa: Long-Context Evaluation Beyond Literal Matching — mentioned by daemonologist</title><link>https://news.ycombinator.com/item?id=43644421</link><guid isPermaLink="false">urn:hackerpapers:mention:2502.05167:43644421</guid><pubDate>Thu, 10 Apr 2025 14:53:39 GMT</pubDate><description>&lt;p&gt;I only ran the benchmark on Quasar Alpha*; the rest of the scores come from the original paper [0] which was published before 3.7 was available. This is a pretty expensive benchmark to run if you&amp;#x27;re paying for API usage - I&amp;#x27;d actually originally set out to run it on Llama 4 but abandoned that after estimating the cost. * - I also reproduced the Llama 3.1 8B result to check my setup. [0] - https://arxiv.org/abs/2502.05167 / https://github.com/adobe-research/NoLiMa&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/2502.05167/"&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>NoLiMa: Long-Context Evaluation Beyond Literal Matching — mentioned by consumer451</title><link>https://news.ycombinator.com/item?id=43422238</link><guid isPermaLink="false">urn:hackerpapers:mention:2502.05167:43422238</guid><pubDate>Thu, 20 Mar 2025 12:33:52 GMT</pubDate><description>&lt;p&gt;I am very curious how 3.7 and o1 pro perform in this regard: &amp;gt; We evaluate 12 popular LLMs that claim to support contexts of at least 128K tokens. While they perform well in short contexts (&amp;lt;1K), performance degrades significantly as context length increases. At 32K, for instance, 10 models drop below 50% of their strong short-length baselines. Even GPT-4o, one of the top-performing exceptions, experiences a reduction from an almost-perfect baseline of 99.3% to 69.7%. https://arxiv.org/abs/2502.05167&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/2502.05167/"&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>NoLiMa: Long-Context Evaluation Beyond Literal Matching — mentioned by consumer451</title><link>https://news.ycombinator.com/item?id=43388114</link><guid isPermaLink="false">urn:hackerpapers:mention:2502.05167:43388114</guid><pubDate>Mon, 17 Mar 2025 13:02:33 GMT</pubDate><description>&lt;p&gt;I just learned something about LLMs: start a new chat as often as possible. I knew that this was a best practice, but I didn&amp;#x27;t know how quickly the situation becomes dire. &amp;gt; We evaluate 12 popular LLMs that claim to support contexts of at least 128K tokens. While they perform well in short contexts (&amp;lt;1K), performance degrades significantly as context length increases. At 32K, for instance, 10 models drop below 50% of their strong short-length baselines. Even GPT-4o, one of the top-performing exceptions, experiences a reduction from an almost-perfect baseline of 99.3% to 69.7%. [0] I copied…&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/2502.05167/"&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>NoLiMa: Long-Context Evaluation Beyond Literal Matching — HN submission</title><link>https://news.ycombinator.com/item?id=43384101</link><guid isPermaLink="false">urn:hackerpapers:submission:2502.05167:43384101</guid><pubDate>Mon, 17 Mar 2025 00:54:05 GMT</pubDate><description>&lt;p&gt;NoLiMa: Long-Context Evaluation Beyond Literal Matching&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;1 point; 1 discussion reply on HN. &lt;a href="https://hackerpaper.kaipfister.de/p/2502.05167/"&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>NoLiMa: Long-Context Evaluation Beyond Literal Matching — HN submission</title><link>https://news.ycombinator.com/item?id=43323291</link><guid isPermaLink="false">urn:hackerpapers:submission:2502.05167:43323291</guid><pubDate>Mon, 10 Mar 2025 17:52:40 GMT</pubDate><description>&lt;p&gt;NoLiMa: Long-Context Evaluation Beyond Literal Matching&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;2 points; 0 discussion replies on HN. &lt;a href="https://hackerpaper.kaipfister.de/p/2502.05167/"&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>NoLiMa: Long-Context Evaluation Beyond Literal Matching — HN submission</title><link>https://news.ycombinator.com/item?id=43151569</link><guid isPermaLink="false">urn:hackerpapers:submission:2502.05167:43151569</guid><pubDate>Sun, 23 Feb 2025 18:16:04 GMT</pubDate><description>&lt;p&gt;NoLiMa: Long-Context Evaluation Beyond Literal Matching&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/2502.05167/"&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>NoLiMa: Long-Context Evaluation Beyond Literal Matching — HN submission</title><link>https://news.ycombinator.com/item?id=43137508</link><guid isPermaLink="false">urn:hackerpapers:submission:2502.05167:43137508</guid><pubDate>Sat, 22 Feb 2025 09:24:41 GMT</pubDate><description>&lt;p&gt;NoLiMa: Long-Context Evaluation Beyond Literal Matching&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/2502.05167/"&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>NoLiMa: Long-Context Evaluation Beyond Literal Matching — HN submission</title><link>https://news.ycombinator.com/item?id=43128934</link><guid isPermaLink="false">urn:hackerpapers:submission:2502.05167:43128934</guid><pubDate>Fri, 21 Feb 2025 15:53:52 GMT</pubDate><description>&lt;p&gt;NoLiMa: Long-Context Evaluation Beyond Literal Matching&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;2 points; 0 discussion replies on HN. &lt;a href="https://hackerpaper.kaipfister.de/p/2502.05167/"&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>NoLiMa: Long-Context Evaluation Beyond Literal Matching — HN submission</title><link>https://news.ycombinator.com/item?id=43049404</link><guid isPermaLink="false">urn:hackerpapers:submission:2502.05167:43049404</guid><pubDate>Fri, 14 Feb 2025 15:35:37 GMT</pubDate><description>&lt;p&gt;NoLiMa: Long-Context Evaluation Beyond Literal Matching&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/2502.05167/"&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>NoLiMa: Long-Context Evaluation Beyond Literal Matching — HN submission</title><link>https://news.ycombinator.com/item?id=43037647</link><guid isPermaLink="false">urn:hackerpapers:submission:2502.05167:43037647</guid><pubDate>Thu, 13 Feb 2025 16:25:48 GMT</pubDate><description>&lt;p&gt;NoLiMa: Long-Context Evaluation Beyond Literal Matching&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;3 points; 1 discussion reply on HN. &lt;a href="https://hackerpaper.kaipfister.de/p/2502.05167/"&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>NoLiMa: Long-Context Evaluation Beyond Literal Matching — HN submission</title><link>https://news.ycombinator.com/item?id=43030792</link><guid isPermaLink="false">urn:hackerpapers:submission:2502.05167:43030792</guid><pubDate>Wed, 12 Feb 2025 23:11:27 GMT</pubDate><description>&lt;p&gt;NoLima: Long-Context Evaluation Beyond Literal Matching&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/2502.05167/"&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>
