arXiv:2511.14045cs.CRcs.AI2025-11被引 4

提出新方法检测强化学习中数据泄露,能发现模型对训练提示的隐蔽响应变化。

Auditing Data Membership in Reinforcement Learning With Verifiable Rewards

  • 通过对比微调前后模型在奖励与策略两方面的行为差异,识别数据暴露痕迹。
  • 在白盒设置下达到约0.8的AUC,误报率0.1%时真阳性率提升十倍。
  • 适用于大语言模型训练阶段的数据审计,尤其适合关注隐私安全的研究者。

近期大型语言模型(LLMs)的核心训练阶段依赖于可验证奖励的强化学习(RLVR),其使用非公开高价值提示集引发未经授权数据使用的担忧,亟需暴露审计。传统成员推断攻击(MIAs)针对固定目标字符串的拟合,不适用于RLVR——后者由模型自动生成回应并强化成功样本,难以直接审计。本文证明:尽管如此,数据暴露仍可被检测——因为RLVR会改变模型在训练提示上的响应分布,留下可被定位的行为痕迹。为此,我们提出行为差异审计(DIBA),一种白盒级查询级审计框架。DIBA通过两个维度比较微调后模型与其预训练检查点:奖励侧证据捕捉任务成功性的变化,策略侧证据捕捉提示相关的行为漂移。通过对多个随机采样轨迹聚合,DIBA生成稳定的查询级审计信号。在白盒设置下,DIBA显著优于强基线(包括校准和自生成变体),达到约0.8 AUC,且在0.1%误报率下真阳性率高出一个数量级。进一步分析表明,当训练产生显著提示特异性痕迹时审计效果更强,而基础模型已表现良好时则减弱。在实际灰盒设置下,跨模型规模迁移通常稳健,但受算法影响更大;在分布偏移下,只要精心选择影子数据,迁移仍具有效性。

原文摘要 · Abstract (English)

Reinforcement Learning with Verifiable Rewards (RLVR) has become a core training stage in recent large language models (LLMs). Its reliance on non-public, high-value prompt sets raises concerns about unauthorized data use, creating a need for exposure auditing. A natural tool is membership inference attacks (MIAs), but existing methods detect fitting to a fixed target string. This does not apply to RLVR, which generates responses from the model itself and reinforces successful ones, thus hindering the auditing of data exposure. We show that it remains detectable: RLVR reshapes the model's response distribution on training prompts, producing behavioral traces that can be surfaced through targeted auditing. We propose Divergence-in-Behavior Auditing (DIBA), a white-box query-level auditing framework for RLVR. DIBA compares a fine-tuned model against its pre-RLVR checkpoint along two axes: reward-side evidence capturing changes in verifiable task success, and policy-side evidence capturing prompt-conditioned behavioral drift. By aggregating over multiple stochastic rollouts, DIBA produces a stable query-level auditing signal. Under a white-box setting, DIBA consistently outperforms strong transferred likelihood-based baselines, including calibrated and self-generated variants, achieving around 0.8 AUC and an order-of-magnitude stronger [email protected]%FPR. We further show that RLVR auditing is stronger when training leaves non-trivial prompt-specific traces and weaker when the base model already performs well on the prompt. Under a practical grey-box setting, transfer is often robust across model sizes under the same RLVR algorithm, but more varied across algorithms, and can remain useful under distribution shift with carefully chosen shadow data.

强化学习数据审计隐私保护大模型

Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。