Revisiting GAN with Bayes-Optimal Discrimination
Not on the map. Why?
Abstract (arXiv)
We propose an alternative to the standard GAN training approach, in which the discriminator is a binary classifier trained by cross-entropy to distinguish real samples from generated ones. Instead, we directly target the discrimination Bayes error rate (BER). To this end, we use the recently proposed Bayes optimal learning threshold (BOLT) loss and train the generator to maximize a surrogate of the discrimination BER. This viewpoint gives a unified perspective on GAN training: different objectives can be interpreted as parameterized bounds on the discrimination BER that describe a trade-off between smoothness and tightness. We show that, under balanced class priors, maximizing the surrogate BER with an unconstrained discriminator minimizes the total variation between the data and generator distributions. By constraining the discriminator to be 1-Lipschitz, the proposed maximization objective defines a discrepancy that is upper-bounded by the Wasserstein-1 distance, thereby linking it to Wasserstein GAN. Experiments on several image-generation datasets under matched architectures and optimization settings show that GAN training using the surrogate BER improves sample quality and coverage over standard baselines. This analysis suggests that the proposed Bayesian viewpoint can achieve a better trade-off between training stability and convergence of the generator to the data distribution.
Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 21 of its 37 references that are in the map. First posted on arXiv 29 Oct 2025.
Builds on
21 of 37 references.
References · 21
- 2017Improved Training of Wasserstein GANscited by 2,235
- 2018Spectral Normalization for Generative Adversarial Networkscited by 1,636
- 2016Least Squares Generative Adversarial Networkscited by 1,001
- 2019Improved Precision and Recall Metric for Assessing Generative Modelscited by 944
- 2018Which Training Methods for GANs do actually Converge?cited by 679
- 2016f-GAN: Training Generative Neural Samplers using Variational Divergence Minimizationcited by 506
- 2022StyleGAN-XL: Scaling StyleGAN to Large Diverse Datasetscited by 492
- 2023Scaling up GANs for Text-to-Image Synthesiscited by 492
- 2017Parseval Networks: Improving Robustness to Adversarial Examplescited by 293
- 2018The relativistic discriminator: a key element missing from standard GANcited by 238
- 2018Sorting out Lipschitz function approximationcited by 213
- 2023StyleGAN-T: Unlocking the Power of GANs for Fast Large-Scale Text-to-Image Synthesiscited by 212
9 more
- 2020Deep Network Approximation for Smooth Functionscited by 164
- 2017BEGAN: Boundary Equilibrium Generative Adversarial Networkscited by 121
- 2017On the regularization of Wasserstein GANscited by 65
- 2025The GAN is dead; long live the GAN! A Modern GAN Baselinecited by 59
- 2022Is the Performance of My Deep Network Too Good to Be True? A Direct Approach to Estimating the Bayes Error in Binary Classificationcited by 26
- 2019Learning to Benchmark: Determining Best Achievable Misclassification Error from Training Datacited by 11
- 2018Learning to Bound the Multi-class Bayes Errorcited by 9
- 2017Rate-optimal Meta Learning of Classification Errorcited by 1
- 2025BOLT: Universal Classifier Training via a Bayes-Error Upper Boundcited by 1
Built on by
Not cited yet.