Detecting RLVR Training Data via Structural Convergence of Reasoning
Hongbo Zhang, Yue Yang, Jianhao Yan, Guangsheng Bao, Yue Zhang, Yue Zhang
TL;DR
This paper shows that reinforcement learning with verifiable rewards (RLVR) reshapes model reasoning by collapsing diverse trajectories into a small set of structural modes, especially in symbolic components, creating a distinct exposure signal for RLVR data. It introduces Min-$k$NN Distance, a fully black-box detector that detects RLVR exposure by measuring the structural similarity of multiple completions for a given prompt, without relying on token probabilities or reference models. Across multiple models, RLVR algorithms, and data sources, Min-$k$NN Distance consistently outperforms baselines, demonstrating robustness to paraphrase, distillation, and cross-domain data. The work contributes a practical, model-agnostic tool for RLVR-data detection, with implications for transparency and reliability in benchmark evaluations and post-training data usage.
Abstract
Reinforcement learning with verifiable rewards (RLVR) is central to training modern reasoning models, but the undisclosed training data raises concerns about benchmark contamination. Unlike pretraining methods, which optimize models using token-level probabilities, RLVR fine-tunes models based on reward feedback from self-generated reasoning trajectories, making conventional likelihood-based detection methods less effective. We show that RLVR induces a distinctive behavioral signature: prompts encountered during RLVR training result in more rigid and similar generations, while unseen prompts retain greater diversity. We introduce Min-$k$NN Distance, a simple black-box detector that quantifies this collapse by sampling multiple completions for a given prompt and computing the average of the $k$ smallest nearest-neighbor edit distances. Min-$k$NN Distance requires no access to the reference model or token probabilities. Experiments across multiple RLVR-trained reasoning models show that Min-$k$NN Distance reliably distinguishes RL-seen examples from unseen ones and outperforms existing membership inference and RL contamination detection baselines.
