<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Rethinking Benchmark and Contamination for Language Models with Rephrased Samples · HackerPapers discussions</title><link>https://hackerpaper.kaipfister.de/p/2311.04850/</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/2311.04850/feed.xml" rel="self" type="application/rss+xml" /><item><title>Rethinking Benchmark and Contamination for Language Models with Rephrased Samples — mentioned by spmurrayzzz</title><link>https://news.ycombinator.com/item?id=40311848</link><guid isPermaLink="false">urn:hackerpapers:mention:2311.04850:40311848</guid><pubDate>Thu, 09 May 2024 19:08:22 GMT</pubDate><description>&lt;p&gt;Its not impossible, but its definitely difficult. There is some overlap in the methods used to detect benchmark data contamination, though its not entirely the same thing. For the detection use case, you already know the text you&amp;#x27;re looking for and you are just trying to demonstrate that the model has &amp;quot;seen&amp;quot; the data in its training set. The challenge is proving that it is statistically improbable that the model could stochastically generate the same tokens without having seen them during training. Some great research exists in this area [1] and I expect much of it may be repurposed for black…&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/2311.04850/"&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>Rethinking Benchmark and Contamination for Language Models with Rephrased Samples — mentioned by Imnimo</title><link>https://news.ycombinator.com/item?id=39281787</link><guid isPermaLink="false">urn:hackerpapers:mention:2311.04850:39281787</guid><pubDate>Tue, 06 Feb 2024 22:35:36 GMT</pubDate><description>&lt;p&gt;The paper claims: &amp;gt;To avoid benchmark contamination, we follow Guo et al. (2024) to filter out web pages containing questions or answers from English mathematical benchmarks such as GSM8K (Cobbe et al., 2021) and MATH (Hendrycks et al., 2021) and Chinese benchmarks such as CMATH (Wei et al., 2023) and AGIEval (Zhong et al., 2023). The filtering criteria are as follows: any text segment containing a 10-gram string that matches exactly with any sub-string from the evaluation benchmarks is removed from our math training corpus. For benchmark texts that are shorter than 10 grams but have at least…&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/2311.04850/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>cs.CL</category></item></channel></rss>
