<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Deduplicating Training Data Makes Language Models Better · HackerPapers discussions</title><link>https://hackerpaper.kaipfister.de/p/2107.06499/</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/2107.06499/feed.xml" rel="self" type="application/rss+xml" /><item><title>Deduplicating Training Data Makes Language Models Better — mentioned by YetAnotherNick</title><link>https://news.ycombinator.com/item?id=42570893</link><guid isPermaLink="false">urn:hackerpapers:mention:2107.06499:42570893</guid><pubDate>Thu, 02 Jan 2025 01:45:22 GMT</pubDate><description>&lt;p&gt;There are benchmarks that are decided beforehand and similar sentences are removed from even the first stage of training. This is useful for tracking model performance and comparing different choices. e.g. see section &amp;#x27;Contamination of downstream tasks&amp;#x27; of [1]. Every decent AI lab does this, else the benchmark result couldn&amp;#x27;t be trusted. OpenAI publishes results of ~20 benchmarks[2] and it is safe to assume they have made reasonable attempt to remove it from training set [1]: https://arxiv.org/pdf/2107.06499 [2]: https://openai.com/index/hello-gpt-4o/&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/2107.06499/"&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>Deduplicating Training Data Makes Language Models Better — mentioned by threecheese</title><link>https://news.ycombinator.com/item?id=40744682</link><guid isPermaLink="false">urn:hackerpapers:mention:2107.06499:40744682</guid><pubDate>Thu, 20 Jun 2024 23:39:38 GMT</pubDate><description>&lt;p&gt;The OP’s paper reads: &amp;gt; Document Deduplication … We use the MinHash algorithm to compute 13-gram Jaccard similarities to determine which documents are near-duplicates of each other (Lee et al., 2021a). … We define two documents to be too similar when their Jaccard similarity exceeds 0.8, and randomly remove one of them. The inline referenced [Lee et al](https://arxiv.org/pdf/2107.06499) goes into detail, and notes that one of the algorithms is based on: &amp;gt; 4.2 Approximate Matching with MinHash … perform approximate deduplication based on matching entire examples. This method, which we call…&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/2107.06499/"&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>Deduplicating Training Data Makes Language Models Better — mentioned by visarga</title><link>https://news.ycombinator.com/item?id=33473032</link><guid isPermaLink="false">urn:hackerpapers:mention:2107.06499:33473032</guid><pubDate>Fri, 04 Nov 2022 20:08:55 GMT</pubDate><description>&lt;p&gt;Deduplicating Training Data Makes Language Models Better https://arxiv.org/pdf/2107.06499 Quantifying Memorization Across Neural Language Models https://arxiv.org/pdf/2202.07646.pdf&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/2107.06499/"&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>Deduplicating Training Data Makes Language Models Better — mentioned by ijk</title><link>https://news.ycombinator.com/item?id=32663741</link><guid isPermaLink="false">urn:hackerpapers:mention:2107.06499:32663741</guid><pubDate>Wed, 31 Aug 2022 15:44:58 GMT</pubDate><description>&lt;p&gt;You are probably very aware of it, but just to highlight the importance of this for people who aren&amp;#x27;t aware: data duplication degrades the training and makes memorization (and therefore plagiarism, in the technical sense) more likely. For language models, this includes near-similarities, which I&amp;#x27;d guess would extend to images. Quantifying Memorization Across Neural Language Models https://arxiv.org/abs/2202.07646 Deduplicating Training Data Makes Language Models Better https://arxiv.org/abs/2107.06499 https://twitter.com/arankomatsuzaki/status/14154721921003397...…&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/2107.06499/"&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>Deduplicating Training Data Makes Language Models Better — mentioned by p1esk</title><link>https://news.ycombinator.com/item?id=32328026</link><guid isPermaLink="false">urn:hackerpapers:mention:2107.06499:32328026</guid><pubDate>Wed, 03 Aug 2022 05:39:53 GMT</pubDate><description>&lt;p&gt;Not sure which of the two papers you’re referring to. The Anthropic paper [1] clearly shows an example where not deduping leads to serious quality degradation. However it’s not clear if training for more than one epoch on deduped and well balanced data would help. I personally think it should and the reason people don’t do it might be because it’s too expensive. [1] https://arxiv.org/pdf/2107.06499.pdf&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/2107.06499/"&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>Deduplicating Training Data Makes Language Models Better — mentioned by joshuamorton</title><link>https://news.ycombinator.com/item?id=31237027</link><guid isPermaLink="false">urn:hackerpapers:mention:2107.06499:31237027</guid><pubDate>Mon, 02 May 2022 16:09:39 GMT</pubDate><description>&lt;p&gt;The controversy here is specifically around Stochastic Parrots, by among others Timnit Gebru and &amp;quot;Schmargaret Smitchell&amp;quot;. Timnit had recently been fired by Google for a controversy that started when leadership prevented her and Margaret from being coauthors on the paper (which is critical of Google in some ways) and Mitchell was fired a few months later. Google[0] claims the paper didn&amp;#x27;t meet the bar for publication and ignored too much relevant research. The authors obviously dispute these claims (I generally side with the authors that the &amp;quot;ignored research&amp;quot; line is a stretch). The then…&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/2107.06499/"&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>
