Papers › The relativistic discriminator: a key element missing from standard GAN

The relativistic discriminator: a key element missing from standard GAN

2 Jul 2018ICLR 2019 5arXiv:1807.00734archive 2025-07-28

Alexia Jolicoeur-Martineau

In standard generative adversarial network (SGAN), the discriminator estimates the probability that the input data is real. The generator is trained to increase the probability that fake data is real. We argue that it should also simultaneously decrease the probability that real data is real because 1) this would account for a priori knowledge that half of the data in the mini-batch is fake, 2) this would be observed with divergence minimization, and 3) in optimal settings, SGAN would be equivalent to integral probability metric (IPM) GANs. We show that this property can be induced by using a relativistic discriminator which estimate the probability that the given real data is more realistic than a randomly sampled fake data. We also present a variant in which the discriminator estimate the probability that the given real data is more realistic than fake data, on average. We generalize both approaches to non-standard GAN loss functions and we refer to them respectively as Relativistic GANs (RGANs) and Relativistic average GANs (RaGANs). We show that IPM-based GANs are a subset of RGANs which use the identity function. Empirically, we observe that 1) RGANs and RaGANs are significantly more stable and generate higher quality data samples than their non-relativistic counterparts, 2) Standard RaGAN with gradient penalty generate data of better quality than WGAN-GP while only requiring a single discriminator update per generator update (reducing the time taken for reaching the state-of-the-art by 400%), and 3) RaGANs are able to generate plausible high resolutions images (256x256) from a very small sample (N=2011), while GAN and LSGAN cannot; these images are of significantly better quality than the ones generated by WGAN-GP and SGAN with spectral normalization.

PaperPDFConference PDFCodeCode Syntology ran

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

For agents, Syntology's MCP tool lists every function and class Syntology harvested from this paper and whether it ran (how to connect): get_harvested_code_for_paper(arxiv_id="1807.00734")

Code

Syntology Ran 1 of 9 code samples harvested from 2 repositories linked to this paper; 8 have no recorded run. Of those that ran: 1 ran · violated contract.

By repository: official repository: 1 sample from 1 repository, 1 ran; community (archive-listed): 7 samples from 1 repository, 0 ran; 1 identical to code first harvested elsewhere. The run record, sample by sample. “Ran” means executed on a synthesized input, not that the code is correct or reproduces the paper.

AlexiaJM/RelativisticGAN officialmentioned in papermentioned on GitHubpytorch report
AlexiaJM/GANsBeyondDivergenceMin mentioned on GitHubpytorch report
beresandras/gan-flavours-keras mentioned on GitHubtfMIT report
eriklindernoren/PyTorch-GAN mentioned on GitHubpytorch report
jpjuvo/64-3D-RaSGAN mentioned on GitHubtf report
taki0112/RelativisticGAN-Tensorflow mentioned on GitHubtfMIT report
weishenho/SAGAN-with-relativistic mentioned on GitHubpytorch report
zxr931120/- mentioned on GitHubnot reachable when probed 2026-09-18 — repositories for recent papers often appear after camera-ready 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.

Code Syntology ran Syntology

9 samples harvested; 1 ran; 0 honoured the contract we drafted; 8 have no recorded run. Read from Syntology's graph 2026-09-24; that is when this build read the record, not when the samples ran.

1ran · violated contract
8unverified

Licence: 2 of the 9 samples are pointer only, meaning Syntology does not serve that copy's text. This page shows no code text for any sample; each one links to its file in the repository.

Harvested from 2 repositories linked to this paper, official or community; each sample names its own and says which. Some samples are identical code Syntology first harvested from another repository; for those, this paper's copy is not located and its licence is not recorded. “Ran” means the sample executed on a synthesized input. It does not mean the output is correct, and nothing here reproduces the paper's results. “Honoured” and “violated” refer to a contract Syntology drafted from the code itself; “our draft was wrong” and “fixture could not drive it” are failures of Syntology's instrument, not of the code.

Each sample ends with its code_sha256, Syntology's identity for that exact code. An agent fetches the stored sample with Syntology's MCP tool get_code(code_sha256="…") (how to connect); click an identity to copy that call.

Repository labels, per sample. official repository: The archive marks this repository official for the paper. named in the paper: The archive records that the paper mentions this repository; it is not marked official. community (archive-listed): In the archive's code links for this paper, not marked official and not recorded as mentioned in the paper. found in paper text by Syntology: Syntology found this repository in the paper's own text; whether it is the authors' implementation is not asserted. community: Not in the archive's code links for this paper; a community repository Syntology harvested. Samples from a repository marked official are listed first. Licence labels name the repository's licence as recorded at harvest. “Pointer only” means Syntology does not serve that copy's text, for one of four reasons: no licence file was found; the licence was not identified; the licence is recorded as permissive but that copy's record is not marked cleared; or the licence is outside the permissive list Syntology serves text under (MIT, Apache-2.0, BSD and similar). Some licences outside that list permit redistribution, such as WTFPL, and GPL-3.0 under its conditions; they are simply not on the list. Hover a licence label for the reason. File links open the file on GitHub at the default branch, which may have changed since the harvest.

strToBool AlexiaJM/RelativisticGAN/code/GAN_losses_iter.py official repository ran · violated contract no licence file found · pointer only · 9617b12aa6ac6bbe · report
conv taki0112/RelativisticGAN-Tensorflow/ops.py community (archive-listed) unverified MIT (permissive) · 0f5619b402c78306 · report
deconv taki0112/RelativisticGAN-Tensorflow/ops.py community (archive-listed) unverified MIT (permissive) · 4700cd22b8033044 · report
flatten taki0112/RelativisticGAN-Tensorflow/ops.py community (archive-listed) unverified MIT (permissive) · d29bc3068b3eae3f · report
get_confirm_token taki0112/RelativisticGAN-Tensorflow/download.py community (archive-listed) unverified MIT (permissive) · 135b3dc835ffe6ad · report
load_cifar10 taki0112/RelativisticGAN-Tensorflow/utils.py community (archive-listed) unverified MIT (permissive) · 66e93b6f5e7a8457 · report
load_data taki0112/RelativisticGAN-Tensorflow/utils.py community (archive-listed) unverified MIT (permissive) · 316a5cc5d22912a0 · report
load_mnist taki0112/RelativisticGAN-Tensorflow/utils.py community (archive-listed) unverified MIT (permissive) · a5d19dceb0c8a790 · report
continue_download identical code first harvested elsewhere unverified licence of this copy not recorded · 444f08bdefd32bb7 · report

Tasks

Image Generation

1 archive task tag without a task page not shown.

Results from the paper archive 2025-07-28

TaskDatasetModelMetricValueRank at snapshotLeaderboardReport
Image Generation CAT 256x256 RaSGAN FID 32.11 #2 of 3 Archive leaderboard report
Image Generation CIFAR-10 RSGAN-GP FID 25.60 #64 of 78 Archive leaderboard report

Ranks are positions in the archive's leaderboards as they stood at the 2025-07-28 snapshot. Results published since then are not among these rows, so a rank here is not a current standing.

Methods

Introduced by this paper: Relativistic GAN

AdamBatch NormalizationConvolutionDense ConnectionsGAN Least Squares LossLSGANReLURelativistic GANSpectral NormalizationWGAN-GP Loss

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