PAC-Bayesian Generalization Bounds for Adversarial Generative Models

02/17/2023
by   Sokhna Diarra Mbacke, et al.
0

We extend PAC-Bayesian theory to generative models and develop generalization bounds for models based on the Wasserstein distance and the total variation distance. Our first result on the Wasserstein distance assumes the instance space is bounded, while our second result takes advantage of dimensionality reduction. Our results naturally apply to Wasserstein GANs and Energy-Based GANs, and our bounds provide new training objectives for these two. Although our work is mainly theoretical, we perform numerical experiments showing non-vacuous generalization bounds for Wasserstein GANs on synthetic datasets.

READ FULL TEXT
research
03/02/2021

Wasserstein GANs Work Because They Fail (to Approximate the Wasserstein Distance)

Wasserstein GANs are based on the idea of minimising the Wasserstein dis...
research
06/07/2022

Shedding a PAC-Bayesian Light on Adaptive Sliced-Wasserstein Distances

The Sliced-Wasserstein distance (SW) is a computationally efficient and ...
research
06/15/2023

On Certified Generalization in Structured Prediction

In structured prediction, target objects have rich internal structure wh...
research
12/13/2022

Score-based Generative Modeling Secretly Minimizes the Wasserstein Distance

Score-based generative models are shown to achieve remarkable empirical ...
research
02/03/2019

Adversarial Networks and Autoencoders: The Primal-Dual Relationship and Generalization Bounds

Since the introduction of Generative Adversarial Networks (GANs) and Var...
research
01/22/2021

Tighter expected generalization error bounds via Wasserstein distance

In this work, we introduce several expected generalization error bounds ...
research
10/20/2017

Learning Wasserstein Embeddings

The Wasserstein distance received a lot of attention recently in the com...

Please sign up or login with your details

Forgot password? Click here to reset