Convergence of non-convex non-concave GANs using sinkhorn divergence
Sinkhorn divergence is a symmetric normalization of entropic regularized optimal transport. It is a smooth and continuous metrized weak-convergence with excellent geometric properties. We use it as an alternative for the minimax objective function in formulating generative adversarial networks. The...
Saved in:
Main Authors: | Adnan, Risman, Saputra, Muchlisin Adi, Fadlil, Junaidillah, Ezerman, Martianus Frederic, Iqbal, Muhamad, Basaruddin, Tjan |
---|---|
Other Authors: | School of Physical and Mathematical Sciences |
Format: | Article |
Language: | English |
Published: |
2022
|
Subjects: | |
Online Access: | https://hdl.handle.net/10356/154075 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | Nanyang Technological University |
Language: | English |
Similar Items
-
Learning GANs in simultaneous game using Sinkhorn with positive features
by: Risman Adnan, et al.
Published: (2022) -
A smoothing newton-type algorithm of stronger convergence for the quadratically constrained convex quadratic programming
by: Huang, Z.-H., et al.
Published: (2014) -
A generalization of the p-series test in determining convergence or divergence of an infinite series
by: Lawas, Cresencia M.
Published: (2003) -
Convergence analysis of convex incremental neural networks
by: Chen, L., et al.
Published: (2013) -
A non-interior continuation algorithm for the P0 or P * LCP with strong global and local convergence properties
by: Huang, Z.-H., et al.
Published: (2013)