Blind Baselines Beat Membership Inference Attacks for Foundation Models

Debeshee Das, Jie Zhang, Florian Tramèr
6/23/2024
cs.CRcs.CLcs.LG

No official code found. Best implementation: ethz-spylab/Blind-MIA (3 stars, last commit 2025-03-29).

Abstract

Membership inference (MI) attacks try to determine if a data sample was used to train a machine learning model. For foundation models trained on unknown Web data, MI attacks are often used to detect copyrighted training materials, measure test set contamination, or audit machine unlearning. Unfortunately, we find that evaluations of MI attacks for foundation models are flawed, because they sample members and non-members from different distributions. For 8 published MI evaluation datasets, we show that blind attacks -- that distinguish the member and non-member distributions without looking at any trained model -- outperform state-of-the-art MI attacks. Existing evaluations thus tell us nothing about membership leakage of a foundation model's training data.

View on arXivView PDF

Code Implementations(1)

This is the official code for Blind Baselines Beat Membership Inference Attacks for Foundation Models

30PythonOct 8, 20241 years ago

Similar Papers

Cite this paper

@article{das2024blind,
  title  = {Blind Baselines Beat Membership Inference Attacks for Foundation Models},
  author = {Debeshee Das and Jie Zhang and Florian Tramèr},
  year   = {2024},
  eprint = {2406.16201},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2406.16201v2}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2406.16201.svg)](https://codeofpaper.com/paper/2406.16201)

Discussion