Membership Inference Attacks Cannot Prove that a Model Was Trained On Your Data

September 29, 2024 ยท Declared Dead ยท ๐Ÿ› 2025 IEEE Conference on Secure and Trustworthy Machine Learning (SaTML)

๐Ÿ‘ป CAUSE OF DEATH: Ghosted
No code link whatsoever

"No code URL or promise found in abstract"

Evidence collected by the PWNC Scanner

Authors Jie Zhang, Debeshee Das, Gautam Kamath, Florian Tramรจr arXiv ID 2409.19798 Category cs.LG: Machine Learning Cross-listed cs.CR Citations 44 Venue 2025 IEEE Conference on Secure and Trustworthy Machine Learning (SaTML) Last Checked 3 months ago
Abstract
We consider the problem of a training data proof, where a data creator or owner wants to demonstrate to a third party that some machine learning model was trained on their data. Training data proofs play a key role in recent lawsuits against foundation models trained on web-scale data. Many prior works suggest to instantiate training data proofs using membership inference attacks. We argue that this approach is fundamentally unsound: to provide convincing evidence, the data creator needs to demonstrate that their attack has a low false positive rate, i.e., that the attack's output is unlikely under the null hypothesis that the model was not trained on the target data. Yet, sampling from this null hypothesis is impossible, as we do not know the exact contents of the training set, nor can we (efficiently) retrain a large foundation model. We conclude by offering two paths forward, by showing that data extraction attacks and membership inference on special canary data can be used to create sound training data proofs.
Community shame:
Not yet rated
Community Contributions

Found the code? Know the venue? Think something is wrong? Let us know!

๐Ÿ“œ Similar Papers

In the same crypt โ€” Machine Learning

Died the same way โ€” ๐Ÿ‘ป Ghosted