- Rating
- 2(+1)
- Confidence
- 3
- Informativeness
- 1
- Presentation
- 2
- Soundness
- 1
Read review
Paper summary
The paper proposes a black-box contamination score based on whether adding related documents helps or hurts a model's next-token predictions. It uses lexical similarity to select context and longest common subsequence matching to choose a small number of token positions to query.
Critical strengths
-
The method works without token probabilities, and selecting token positions reduces the number of queries needed.
-
The experiments cover several model families and include useful tests of fine-tuning, sampling temperature, and context selection.
Critical weaknesses
-
The main results may reflect distributional shifts between datasets rather than training exposure. Section 4 compares datasets such as StackExchange and GSM8K, which differ in content and format as well as membership. Appendix C includes controlled contamination experiments, but does not compare against the main baselines or show how the same dataset's score changes with exposure. These checks are necessary because dataset differences alone can produce strong detection results [A].
-
A simple but important baseline is missing: next-token prediction accuracy without extra context. Section 2.1 acknowledges that the proposed score depends on this accuracy, and related black-box accuracy methods already exist [B]. Testing accuracy at the same selected positions would show whether the context comparison adds value, or whether token selection explains most of the improvement.
-
The evaluation does not show how reliably the method can flag an entire dataset. Table 1 measures separation between individual documents, but this does not tell us how often an unseen dataset would be wrongly flagged. The paper needs dataset-level false-positive results and uncertainty estimates.
-
The theory does not directly justify the proposed selection method. Section 2.2 assumes an ideal sampler that already knows which positions have non-zero shifts, whereas LCS selects positions through text overlap. LCS also changes the balance of positive and negative shifts, so the ideal sampler's guarantee does not automatically apply. The analysis motivates targeted sampling, but does not establish an LCS guarantee or prove that 16 tokens is optimal.
[A] Das, Debeshee, Jie Zhang, and Florian Tramèr. "Blind baselines beat membership inference attacks for foundation models." 2025 IEEE Security and Privacy Workshops (SPW). IEEE, 2025.
[B] Xu, Ruijie, et al. "Benchmarking benchmark leakage in large language models." arXiv preprint arXiv:2404.18824 (2024).
Questions for authors
Please see weaknesses above.