Position: Membership Inference Attacks Cannot Prove That a Model was Trained on Your Data

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 statistically 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 three paths forward, by showing that membership inference on special canary data, watermarked training data, and data extraction attacks can be used to create sound training data proofs.

Authors

Institutions

Publication Details

Published
2025-04-09
DOI
https://doi.org/10.1109/satml64287.2025.00025
Citations
3
Primary Topic
Scientific Computing and Data Management
Type
article
Field-Weighted Citation Impact
12.51

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Position: Membership Inference Attacks Cannot Prove That a Model was Trained on Your Data

Florian Tramèr, Jie Zhang, Gautam Kamath, Debeshee Das
3 citations
Scientific Computing and Data Management
12.51
article

Position: Membership Inference Attacks Cannot Prove That a Model was Trained on Your Data

Florian Tramèr, Jie Zhang, Gautam Kamath, Debeshee Das
article en
3 citations

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 statistically 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 three paths forward, by showing that membership inference on special canary data, watermarked training data, and data extraction attacks can be used to create sound training data proofs.

University of Waterloo (CA), ETH Zurich (CH)
Schweizerischer Nationalfonds zur Förderung der Wissenschaftlichen Forschung
Openalex Percentile: Top 2%
Scientific Computing and Data Management
12.51
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Position: Membership Inference Attacks Cannot Prove That a Model was Trained on Your Data — Florian Tramèr, Jie Zhang, et al. · (2025) | TGRS Research Map | TGRS