Membership Inference Attacks Against Fine-tuned Diffusion Language Models

Yuetian Chen, Kaiyuan Zhang, Yuntao Du, Edoardo Stoppa, Charles Fleming +3 more
1/27/2026
cs.LGcs.AI

No official code found. Best implementation: Stry233/SAMA (8 stars, MIT, last commit 2026-04-13).

Abstract

Diffusion Language Models (DLMs) represent a promising alternative to autoregressive language models, using bidirectional masked token prediction. Yet their susceptibility to privacy leakage via Membership Inference Attacks (MIA) remains critically underexplored. This paper presents the first systematic investigation of MIA vulnerabilities in DLMs. Unlike the autoregressive models' single fixed prediction pattern, DLMs' multiple maskable configurations exponentially increase attack opportunities. This ability to probe many independent masks dramatically improves detection chances. To exploit this, we introduce SAMA (Subset-Aggregated Membership Attack), which addresses the sparse signal challenge through robust aggregation. SAMA samples masked subsets across progressive densities and applies sign-based statistics that remain effective despite heavy-tailed noise. Through inverse-weighted aggregation prioritizing sparse masks' cleaner signals, SAMA transforms sparse memorization detection into a robust voting mechanism. Experiments on nine datasets show SAMA achieves 30% relative AUC improvement over the best baseline, with up to 8 times improvement at low false positive rates. These findings reveal significant, previously unknown vulnerabilities in DLMs, necessitating the development of tailored privacy defenses.

View on arXivView PDF

Code Implementations(1)

Stry233/SAMACommunity65%
MIT

[ICLR'26] Membership Inference Attacks Against Fine-tuned Diffusion Language Models

80PythonJan 28, 20266 months agoMIT

Cite this paper

@article{chen2026membership,
  title  = {Membership Inference Attacks Against Fine-tuned Diffusion Language Models},
  author = {Yuetian Chen and Kaiyuan Zhang and Yuntao Du and Edoardo Stoppa and Charles Fleming and Ashish Kundu and Bruno Ribeiro and Ninghui Li},
  year   = {2026},
  eprint = {2601.20125},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2601.20125v3}
}

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/2601.20125.svg)](https://codeofpaper.com/paper/2601.20125)

Discussion