CalibDCD is proposed, a broadly applicable calibration framework for feature-based DCD methods, comprising Multi-View Shift Detection, which identifies recurring feature shifts associated with post-training, and Bounded Feature Correction, which selectively mitigates their influence on membership prediction.
Abstract
Large language models (LLMs) are trained on massive and largely undisclosed corpora that may contain copyrighted or privacy-sensitive content. Data contamination detection (DCD) therefore aims to determine whether a given text is a member of the pre-training corpus of a target LLM. Recent state-of-the-art DCD methods follow a feature-based paradigm that derives membership features from the input text and the corresponding model output. However, most modern LLMs undergo post-training, such as instruction tuning, preference optimization, and reasoning-oriented training, which can alter model outputs and shift the corresponding membership features, thereby reducing the separability between members and non-members. To address this problem, we propose CalibDCD, a broadly applicable calibration framework for feature-based DCD methods, comprising (1) Multi-View Shift Detection, which identifies recurring feature shifts associated with post-training, and (2) Bounded Feature Correction, which selectively mitigates their influence on membership prediction. Specifically, Multi-View Shift Detection evaluates controlled prompt variants on known non-member texts and consolidates the most informative views to identify recurring feature shifts. Bounded Feature Correction selectively adjusts feature components aligned with the detected shifts and controls the correction extent to preserve useful detection information. Experiments show that CalibDCD consistently improves existing feature-based detectors, with gains of up to 7.0% in AUC and 15.0% in TPR@5%FPR.
Membership inference on large language models (LLMs) aims to determine whether a given text sample was included in an LLM's training data, without access to its training corpus. Despite recent progress, existing benchmarks suffer from three limitations: limited coverage of training stages, insufficient distributional a...
Tao-Quan Shi, Chao Xiang, Qiong-Kai Xu et al.· 0 citations
FedRAT is proposed, a privacy-preserving federated framework that couples paired paraphrase consistency, generator-family auxiliary supervision, differentially private client updates, and loss-dependent aggregation within a unified detection setting.
Zi-Hao Zhang· International journal of pat...· 0 citations
SupportCal is introduced, a label-free post-hoc method that retains agreement examples at unit weight and assigns disagreement examples continuous weights based on the own-base PLM's relative support and corroboration from pretrained references selected from a size-compatible candidate pool.
Linhan Luo, Le-Quan Lin, Dai Shi et al.· 0 citations
In the domain of confidentiality management, secret point recognition stands as a precise and efficient technical solution. However, it faces significant hurdles in machine learning-based implementations: stringent confidentiality constraints on confidential data and restricted data accessibility often lead to insuffic...
Zhendong Wu, Hu Li, Liang Zhang et al.· International Conference on...· 0 citations
This work analyses the linearity and quality of MGT representations and shows that simple linear probes outperform a wide range of detectors while being substantially more sample-efficient, and demonstrates the potential of linear probes as as robust and sample-efficient MGT detectors.
Gerrit Quaremba, Hanqi Yan, E. Black et al.· 0 citations
FRAUDSkill is proposed, a structured frozen-weight adaptation framework that leaves the underlying audio-language model unchanged while optimizing an external layer of skill programs, route-specific policies, and decision rules and combines structured output control with validation-guided multi-path inference to ensure...
Cheng-Xian Hu, Zhi-Ming Ma, Ming-Jun Pan et al.· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.