mlsanityData to 7 Oct 2026

MGMD-GAN: Generalization Improvement of Generative Adversarial Networks with Multiple Generator Multiple Discriminator Framework Against Membership Inference Attacks

arXiv 2410.07803 ↗First posted 10 Oct 2024cs.LGcited by 0

On the map: LLM safety and security → Membership inference attacks

Abstract (arXiv)

Generative Adversarial Networks (GAN) are among the widely used Generative models in various applications. However, the original GAN architecture may memorize the distribution of the training data and, therefore, poses a threat to Membership Inference Attacks. In this work, we propose a new GAN framework that consists of Multiple Generators and Multiple Discriminators (MGMD-GAN). Disjoint partitions of the training data are used to train this model and it learns the mixture distribution of all the training data partitions. In this way, our proposed model reduces the generalization gap which makes our MGMD-GAN less vulnerable to Membership Inference Attacks. We provide an experimental analysis of our model and also a comparison with other GAN frameworks.

Key facts. No citing papers in the map yet (data through 7 Oct 2026). Placed in Membership inference attacks, one of 12 directions in LLM safety and security. Builds on 4 of its 12 references that are in the map. First posted on arXiv 10 Oct 2024.

Builds on

4 of 12 references.

References · 4

  1. 2016Membership Inference Attacks against Machine Learning Modelscited by 2,221
  2. 2018Differentially Private Generative Adversarial Networkcited by 235
  3. 2017Generalization and Equilibrium in Generative Adversarial Nets (GANs)cited by 165
  4. 2018MD-GAN: Multi-Discriminator Generative Adversarial Networks for Distributed Datasetscited by 49

Built on by

Not cited yet.