Saved in:
Bibliographic Details
Main Authors: Sterling, Benjamin, El-Laham, Yousef, Bugallo, Mónica F.
Format: Preprint
Published: 2025
Subjects:
Online Access:https://arxiv.org/abs/2509.14225
Tags: Add Tag
No Tags, Be the first to tag this record!
_version_ 1866913096157626368
author Sterling, Benjamin
El-Laham, Yousef
Bugallo, Mónica F.
author_facet Sterling, Benjamin
El-Laham, Yousef
Bugallo, Mónica F.
contents Recent advances in generative artificial intelligence applications have raised new data security concerns. This paper focuses on defending diffusion models against membership inference attacks. This type of attack occurs when the attacker can determine if a certain data point was used to train the model. Although diffusion models are intrinsically more resistant to membership inference attacks than other generative models, they are still susceptible. The defense proposed here utilizes critically-damped higher-order Langevin dynamics, which introduces several auxiliary variables and a joint diffusion process along these variables. The idea is that the presence of auxiliary variables mixes external randomness that helps to corrupt sensitive input data earlier on in the diffusion process. This concept is theoretically investigated and validated on a toy dataset and a speech dataset using the Area Under the Receiver Operating Characteristic (AUROC) curves and the FID metric.
format Preprint
id arxiv_https___arxiv_org_abs_2509_14225
institution arXiv
publishDate 2025
record_format arxiv
spellingShingle Defending Diffusion Models Against Membership Inference Attacks via Higher-Order Langevin Dynamics
Sterling, Benjamin
El-Laham, Yousef
Bugallo, Mónica F.
Machine Learning
Recent advances in generative artificial intelligence applications have raised new data security concerns. This paper focuses on defending diffusion models against membership inference attacks. This type of attack occurs when the attacker can determine if a certain data point was used to train the model. Although diffusion models are intrinsically more resistant to membership inference attacks than other generative models, they are still susceptible. The defense proposed here utilizes critically-damped higher-order Langevin dynamics, which introduces several auxiliary variables and a joint diffusion process along these variables. The idea is that the presence of auxiliary variables mixes external randomness that helps to corrupt sensitive input data earlier on in the diffusion process. This concept is theoretically investigated and validated on a toy dataset and a speech dataset using the Area Under the Receiver Operating Characteristic (AUROC) curves and the FID metric.
title Defending Diffusion Models Against Membership Inference Attacks via Higher-Order Langevin Dynamics
topic Machine Learning
url https://arxiv.org/abs/2509.14225