mlsanityData to 7 Oct 2026

O-GAN: Extremely Concise Approach for Auto-Encoding Generative Adversarial Networks

arXiv 1903.01931 ↗First posted 5 Mar 2019cs.CV cs.LGcited by 4

Not on the map. Why?

Abstract (arXiv)

In this paper, we propose Orthogonal Generative Adversarial Networks (O-GANs). We decompose the network of discriminator orthogonally and add an extra loss into the objective of common GANs, which can enforce discriminator become an effective encoder. The same extra loss can be embedded into any kind of GANs and there is almost no increase in computation. Furthermore, we discuss the principle of our method, which is relative to the fully-exploiting of the remaining degrees of freedom of discriminator. As we know, our solution is the simplest approach to train a generative adversarial network with auto-encoding ability.

Key facts. Cited by 4 papers in the map (data through 7 Oct 2026). First posted on arXiv 5 Mar 2019.

Builds on

No reference list yet.

Built on by

Cited by year

Citing papers per year: 2021: 1; 2022: 1; 2023: 1; 2024: 0; 2025: 1.

4 papers.