Detecting Benchmark Contamination Through Watermarking

Fuente: arXiv
Gespeichert in:
Bibliographische Detailangaben
Hauptverfasser: Sander, Tom, Fernandez, Pierre, Mahloujifar, Saeed, Durmus, Alain, Guo, Chuan
Format: Preprint
Veröffentlicht: 2025
Schlagworte:
Online-Zugang:
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
_version_ 1866909697743781888
author Sander, Tom
Fernandez, Pierre
Mahloujifar, Saeed
Durmus, Alain
Guo, Chuan
author_facet Sander, Tom
Fernandez, Pierre
Mahloujifar, Saeed
Durmus, Alain
Guo, Chuan
contents Benchmark contamination poses a significant challenge to the reliability of Large Language Models (LLMs) evaluations, as it is difficult to assert whether a model has been trained on a test set. We introduce a solution to this problem by watermarking benchmarks before their release. The embedding involves reformulating the original questions with a watermarked LLM, in a way that does not alter the benchmark utility. During evaluation, we can detect ``radioactivity'', \ie traces that the text watermarks leave in the model during training, using a theoretically grounded statistical test. We test our method by pre-training 1B models from scratch on 10B tokens with controlled benchmark contamination, and validate its effectiveness in detecting contamination on ARC-Easy, ARC-Challenge, and MMLU. Results show similar benchmark utility post-watermarking and successful contamination detection when models are contaminated enough to enhance performance, \eg $p$-val $=10^{-3}$ for +5$\%$ on ARC-Easy.
format Preprint
id arxiv_https___arxiv_org_abs_2502_17259
institution arXiv
publishDate 2025
record_format arxiv
spellingShingle Detecting Benchmark Contamination Through Watermarking
Sander, Tom
Fernandez, Pierre
Mahloujifar, Saeed
Durmus, Alain
Guo, Chuan
Cryptography and Security
Artificial Intelligence
Benchmark contamination poses a significant challenge to the reliability of Large Language Models (LLMs) evaluations, as it is difficult to assert whether a model has been trained on a test set. We introduce a solution to this problem by watermarking benchmarks before their release. The embedding involves reformulating the original questions with a watermarked LLM, in a way that does not alter the benchmark utility. During evaluation, we can detect ``radioactivity'', \ie traces that the text watermarks leave in the model during training, using a theoretically grounded statistical test. We test our method by pre-training 1B models from scratch on 10B tokens with controlled benchmark contamination, and validate its effectiveness in detecting contamination on ARC-Easy, ARC-Challenge, and MMLU. Results show similar benchmark utility post-watermarking and successful contamination detection when models are contaminated enough to enhance performance, \eg $p$-val $=10^{-3}$ for +5$\%$ on ARC-Easy.
title Detecting Benchmark Contamination Through Watermarking
topic Cryptography and Security
Artificial Intelligence
url https://arxiv.org/abs/2502.17259