A Unifying Generator Loss Function for Generative Adversarial Networks
Fuente:
arXiv
Gespeichert in:
| Hauptverfasser: | , , |
|---|---|
| Format: | Preprint |
| Veröffentlicht: |
2023
|
| Schlagworte: | |
| Online-Zugang: | |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| _version_ | 1866914716473884672 |
|---|---|
| author | Veiner, Justin Alajaji, Fady Gharesifard, Bahman |
| author_facet | Veiner, Justin Alajaji, Fady Gharesifard, Bahman |
| contents | A unifying $α$-parametrized generator loss function is introduced for a dual-objective generative adversarial network (GAN), which uses a canonical (or classical) discriminator loss function such as the one in the original GAN (VanillaGAN) system. The generator loss function is based on a symmetric class probability estimation type function, $\mathcal{L}_α$, and the resulting GAN system is termed $\mathcal{L}_α$-GAN. Under an optimal discriminator, it is shown that the generator's optimization problem consists of minimizing a Jensen-$f_α$-divergence, a natural generalization of the Jensen-Shannon divergence, where $f_α$ is a convex function expressed in terms of the loss function $\mathcal{L}_α$. It is also demonstrated that this $\mathcal{L}_α$-GAN problem recovers as special cases a number of GAN problems in the literature, including VanillaGAN, Least Squares GAN (LSGAN), Least $k$th order GAN (L$k$GAN) and the recently introduced $(α_D,α_G)$-GAN with $α_D=1$. Finally, experimental results are conducted on three datasets, MNIST, CIFAR-10, and Stacked MNIST to illustrate the performance of various examples of the $\mathcal{L}_α$-GAN system. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2308_07233 |
| institution | arXiv |
| publishDate | 2023 |
| record_format | arxiv |
| spellingShingle | A Unifying Generator Loss Function for Generative Adversarial Networks Veiner, Justin Alajaji, Fady Gharesifard, Bahman Machine Learning A unifying $α$-parametrized generator loss function is introduced for a dual-objective generative adversarial network (GAN), which uses a canonical (or classical) discriminator loss function such as the one in the original GAN (VanillaGAN) system. The generator loss function is based on a symmetric class probability estimation type function, $\mathcal{L}_α$, and the resulting GAN system is termed $\mathcal{L}_α$-GAN. Under an optimal discriminator, it is shown that the generator's optimization problem consists of minimizing a Jensen-$f_α$-divergence, a natural generalization of the Jensen-Shannon divergence, where $f_α$ is a convex function expressed in terms of the loss function $\mathcal{L}_α$. It is also demonstrated that this $\mathcal{L}_α$-GAN problem recovers as special cases a number of GAN problems in the literature, including VanillaGAN, Least Squares GAN (LSGAN), Least $k$th order GAN (L$k$GAN) and the recently introduced $(α_D,α_G)$-GAN with $α_D=1$. Finally, experimental results are conducted on three datasets, MNIST, CIFAR-10, and Stacked MNIST to illustrate the performance of various examples of the $\mathcal{L}_α$-GAN system. |
| title | A Unifying Generator Loss Function for Generative Adversarial Networks |
| topic | Machine Learning |
| url | https://arxiv.org/abs/2308.07233 |