Pith. sign in

REVIEW 3 cited by

AntiLeakBench: Preventing Data Contamination by Automatically Constructing Benchmarks with Updated Real-World Knowledge

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2412.13670 v2 pith:K23ULI54 submitted 2024-12-18 cs.CL cs.LG

classification cs.CLcs.LG
keywords databenchmarkcollectedcontaminationevaluationknowledgellmsnewly
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

Data contamination hinders fair LLM evaluation by introducing test data into newer models' training sets. Existing studies solve this challenge by updating benchmarks with newly collected data. However, they fail to guarantee contamination-free evaluation as the newly collected data may contain pre-existing knowledge, and their benchmark updates rely on intensive human labor. To address these issues, we in this paper propose AntiLeak-Bench, an automated anti-leakage benchmarking framework. Instead of simply using newly collected data, we construct samples with explicitly new knowledge absent from LLMs' training sets, which thus ensures strictly contamination-free evaluation. We further design a fully automated workflow to build and update our benchmark without human labor. This significantly reduces the cost of benchmark maintenance to accommodate emerging LLMs. Through extensive experiments, we highlight that data contamination likely exists before LLMs' cutoff time and demonstrate AntiLeak-Bench effectively overcomes this challenge.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 3 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. SCOPE: Compress Mathematical Reasoning Steps for Efficient Automated Process Annotation

    cs.AI 2025-05 conditional novelty 7.0 of 10

    SCOPE compresses sampled math reasoning traces into a prefix tree of AST-normalized code steps, yielding PRM training labels at O(N) cost and improving Best-of-N and ProcessBench scores over automated baselines.

  2. Unsupervised Hallucination Detection by Inspecting Reasoning Processes

    cs.CL 2025-09 conditional novelty 6.0 of 10

    IRIS detects LLM hallucinations by training a lightweight probe on hidden states elicited during the model's own step-by-step verification, using the model's verbalized confidence as soft pseudolabels.

  3. Towards Storage-Efficient Visual Document Retrieval: An Empirical Study on Reducing Patch-Level Embeddings

    cs.IR 2025-06 conditional novelty 5.0 of 10

    Semantic clustering of patch embeddings at the final model layer, plus fine-tuning, preserves 94.6 to 98.2% of retrieval performance while reducing stored embedding memory to 1.8 to 11.8% of original.

Pith tools