Backend
Revisiting GAN with Bayes-Optimal Discrimination
arXiv eess.SP0 views
arXiv:2510.25609v4 Announce Type: replace-cross Abstract: We approach generative adversarial network (GAN) training from its original real-versus-fake classification viewpoint, replacing the cross-entropy discriminator objective with an upper bound on the Bayes error rate (BER). Using the Bayes optimal learning threshold (BOLT) loss, we formulate an adversarial game in which the discriminator tightens this bound and the generator maximizes it. We characterize the unrestricted optimal discriminator and show that, under balanced class priors, the population game is equivalent to minimizing total variation between the data and generator distributions. Restricting the bounded discriminator to be 1-Lipschitz yields BOLT-GAN. For balanced priors and the full discriminator class, we establish upper and lower bounds relating its population discrepancy to Wasserstein-1 distance on bounded domains. Controlled experiments on four image-generation benchmarks show improved sample quality and coverage over WGAN-GP under matched architectures, optimization settings, and gradient penalties. At a common 20-epoch budget, BOLT-GAN reduces Fr\'echet Inception Distance (FID) from 60.0 to 44.2 on CIFAR-10 and from 102.5 to 28.4 on LSUN Bedroom-64.
Source:https://arxiv.org/abs/2510.25609PreviousAre EEG Sequences Time Series? EEG Classification with Time Series Models and Joint Subject TrainingNextHC-AINet: An Auditory-Inspired Network with Harmonic Compensation for Low-Complexity Speech Enhancement
Related posts
FiveM Script Database Migrations: What to Check Before You Install
0dev.to
The insurance edge case that breaks event-driven policy pipelines
0dev.to
The fix for an empty state isn't filling it
0dev.to UX
Five Things That Make Dependabot Painful for Terraform
0dev.to GitHub
Tracking Roblox player counts: what the public data actually gives you
0dev.to Data
Telegram gold signals this week: results to Oct 30
0dev.to Data