2025/07/04 by R.W. Zhou, Kang Yang, Zhou, Ruikai +9
Computer Science · #Adversarial Robustness in Machine Learning #Cryptography and Security (cs.CR) #Explainable Artificial Intelligence (XAI) #FOS: Computer and information sciences #Topic Modeling
paper · pdf · doi:10.48550/arxiv.2507.03619
openalex publication_date 2025/07/04 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
Today, the training of large language models (LLMs) can involve personally identifiable information and copyrighted material, incurring dataset misuse. To mitigate the problem of dataset misuse, this paper explores dataset inference, which aims to detect if a suspect model M used a victim dataset D in training. Previous research tackles dataset inference by aggregating results of membership inference attacks (MIAs) -- methods to determine whether individual samples are a part of the training dataset. However, restricted by the low accuracy of MIAs, previous research mandates grey-box access to M to get intermediate outputs (probabilities, loss, perplexity, etc.) for obtaining satisfactory results. This leads to reduced practicality, as LLMs, especially those deployed for profits, have limited incentives to return the intermediate outputs. In this paper, we propose a new method of dataset inference with only black-box access to the target model (i.e., assuming only the text-based responses of the target model are available). Our method is enabled by two sets of locally built reference models, one set involving D in training and the other not. By measuring which set of reference model M is closer to, we determine if M used D for training. Evaluations of real-world LLMs in the wild show that our method offers high accuracy in all settings and presents robustness against bypassing attempts.