SOTAVerified

The Variational Fair Autoencoder

2015-11-03Code Available0· sign in to hype

Christos Louizos, Kevin Swersky, Yujia Li, Max Welling, Richard Zemel

Code Available — Be the first to reproduce this paper.

Reproduce

Code

Abstract

We investigate the problem of learning representations that are invariant to certain nuisance or sensitive factors of variation in the data while retaining as much of the remaining information as possible. Our model is based on a variational autoencoding architecture with priors that encourage independence between sensitive and latent factors of variation. Any subsequent processing, such as classification, can then be performed on this purged latent representation. To remove any remaining dependencies we incorporate an additional penalty term based on the "Maximum Mean Discrepancy" (MMD) measure. We discuss how these architectures can be efficiently trained on data and show in experiments that this method is more effective than previous work in removing unwanted sources of variation while maintaining informative latent representations.

Tasks

Benchmark Results

DatasetModelMetricClaimedVerifiedStatus
Multi-Domain Sentiment DatasetVFAEDVD76.57Unverified

Reproductions