TL;DR
This paper introduces a novel adversarial autoencoder framework that enhances privacy-utility tradeoffs by incorporating randomness and removing Gaussian assumptions, tested across multiple datasets with multiple adversaries.
Contribution
It proposes a new stochastic autoencoder-based method that improves privacy and utility guarantees under data-type aware and ignorant conditions, surpassing existing approaches.
Findings
Outperforms existing methods in privacy and utility metrics.
Effective across diverse datasets including MNIST and Census data.
Handles multiple adversaries simultaneously for robust privacy protection.
Abstract
We propose an adversarial learning framework that deals with the privacy-utility tradeoff problem under two types of conditions: data-type ignorant, and data-type aware. Under data-type aware conditions, the privacy mechanism provides a one-hot encoding of categorical features, representing exactly one class, while under data-type ignorant conditions the categorical variables are represented by a collection of scores, one for each class. We use a neural network architecture consisting of a generator and a discriminator, where the generator consists of an encoder-decoder pair, and the discriminator consists of an adversary and a utility provider. Unlike previous research considering this kind of architecture, which leverages autoencoders (AEs) without introducing any randomness, or variational autoencoders (VAEs) based on learning latent representations which are then forced into a…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Code & Models
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
MethodsAttentive Walk-Aggregating Graph Neural Network
