Papers › Geometric GAN

Geometric GAN

8 May 2017arXiv:1705.02894archive 2025-07-28

Jae Hyun Lim, Jong Chul Ye

Generative Adversarial Nets (GANs) represent an important milestone for effective generative models, which has inspired numerous variants seemingly different from each other. One of the main contributions of this paper is to reveal a unified geometric structure in GAN and its variants. Specifically, we show that the adversarial generative model training can be decomposed into three geometric steps: separating hyperplane search, discriminator parameter update away from the separating hyperplane, and the generator update along the normal vector direction of the separating hyperplane. This geometric intuition reveals the limitations of the existing approaches and leads us to propose a new formulation called geometric GAN using SVM separating hyperplane that maximizes the margin. Our theoretical analysis shows that the geometric GAN converges to a Nash equilibrium between the discriminator and generator. In addition, extensive numerical results show that the superior performance of geometric GAN.

PaperPDFCode

In Syntology View this paper on Syntology, its page in Syntology's graph. That page lists the repositories linked to the paper, the abstract and the calls for agents.

Open this paper in Syntology's Atlas, the map of the papers in Syntology's graph and their citations.

For agents, on Syntology's MCP service (how to connect):

Code

WangZesen/GAN-Hinge-Loss mentioned on GitHubtfSyntology: not harvested report
WangZesen/Spectral-Normalization-GAN mentioned on GitHubtfSyntology: no sample linked to this paper (harvested for another paper). Syntology's graph links these samples to Spectral Normalization for Generative Adversarial Networks (arXiv:1802.05957; that paper's own run record: 25 ran (of which 9 constructed an object rather than computing a result; 21 with no instrument failure: 0 honoured, 1 violated, 20 with no contract checked; 4 where Syntology's instrument failed) · 6 unverified); nothing checks that they implement this paper's method. report
beresandras/gan-flavours-keras mentioned on GitHubtfMITSyntology: no sample linked to this paper (harvested for another paper). Syntology's graph links these samples to Training Generative Adversarial Networks with Limited Data (arXiv:2006.06676; that paper's own run record: 21 ran (of which 0 constructed an object rather than computing a result; 19 with no instrument failure: 2 honoured, 1 violated, 16 with no contract checked; 2 where Syntology's instrument failed) · 8 unverified); nothing checks that they implement this paper's method. report
ChristophReich1996/Dirac-GAN pytorchSyntology: no sample linked to this paper (harvested for another paper). Syntology's graph links these samples to Improved Training of Wasserstein GANs (arXiv:1704.00028; that paper's own run record: 27 ran (of which 10 constructed an object rather than computing a result; 19 with no instrument failure: 1 honoured, 0 violated, 18 with no contract checked; 8 where Syntology's instrument failed) · 22 unverified); nothing checks that they implement this paper's method. report
ChristophReich1996/Mode_Collapse pytorchSyntology: no sample linked to this paper (harvested for another paper). Syntology's graph links these samples to Improved Training of Wasserstein GANs (arXiv:1704.00028; that paper's own run record: 27 ran (of which 10 constructed an object rather than computing a result; 19 with no instrument failure: 1 honoured, 0 violated, 18 with no contract checked; 8 where Syntology's instrument failed) · 22 unverified); nothing checks that they implement this paper's method. report
open-mmlab/mmgeneration pytorchSyntology: not harvested report

Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.

A paper named beside a repository with no sample linked to this paper is shown with that paper's own run record, not this paper's: “ran” means executed on a synthesized input, not that the code is correct, and “where Syntology's instrument failed” counts failures of Syntology's instrument, not of the code. Papers are listed in arXiv-id order, at most three per repository.

Code Syntology ran Syntology

Not run by Syntology. Nothing on this page verifies that the listed code works.

Tasks

Text Generation

Results from the paper archive 2025-07-28

No leaderboard rows for this paper in the archive.

Methods

Introduced by this paper: GAN Hinge Loss

ConvolutionGAN Hinge LossSVM

Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections