Methods › Computer Vision › Generative Adversarial Networks › Relativistic GAN

Relativistic GAN

6 papers tagged archive 2025-07-28

Introduced by Alexia Jolicoeur-Martineau in The relativistic discriminator: a key element missing from standard GAN

archive 2025-07-28 Description, source and code snippet are the archive's method entry.

A Relativistic GAN is a type of generative adversarial network. It has a relativistic discriminator which estimates the probability that the given real data is more realistic than a randomly sampled fake data. The idea is to endow GANs with the property that the probability of real data being real (D(xᵣ)) should decrease as the probability of fake data being real (D(x_f)) increases.

With a standard GAN, we can achieve this as follows. The standard GAN discriminator can be defined, in term of the non-transformed layer C(x), as D(x) = sigmoid(C(x)). A simple way to make discriminator relativistic - having the output of D depend on both real and fake data - is to sample from real/fake data pairs x̃ = (xᵣ, x_f) and define it as D(x̃) = sigmoid(C(xᵣ) − C(x_f)). The modification can be interpreted as: the discriminator estimates the probability that the given real data is more realistic than a randomly sampled fake data.

More generally a Relativistic GAN can be interpreted as having a discriminator of the form a(C(xᵣ)−C(x_f)), where a is the activation function, to be relativistic.

PaperSourceSee Code · eriklindernoren/PyTorch-GAN

In Syntology name not resolved (unknown_name). The lookup matched no method, paper or venue by this name; that asserts nothing about whether code exists.

Near matches the lookup lists, each a different name: Relativistic Pairing GAN (RpGAN); GT-GAN; PR-GAN; PD-GAN; IG-GAN; DE-GAN; Cr-GAN; IB-GAN.

Syntology's have check for this name (free, it answers coverage only), read 2026-10-05; ask it again live. A level is the served verification level of that one answer; nothing here is summed across methods.

Papers archive 2025-07-28

archive papers tagged: 6 · with a code link: 3 · where Syntology ran a sample: 3 (3 with a run with no instrument failure, 0 where every run was a failure of Syntology's instrument) Syntology

Show: all tagged papersonly where code ran (3 of 6 tagged: 3 with a run with no instrument failure, 0 where every run was a failure of Syntology's instrument)

Page 1 of 1: papers 1 to 6 of 6, newest first by the archive's date (ties by slug), in archive order.

Repository counts are the archive's code-links table. A Syntology line states what Syntology ran from that paper's harvested code, as “N ran (of which C constructed an object rather than computing a result; K with no instrument failure: H honoured, V violated, P with no contract checked; I where Syntology's instrument failed) · U unverified”; the instrument figure counts failures of Syntology's instrument, not of the code. It is per sample and not a correctness claim. When the archive marks a repository official for the paper, the line starts with that repository's state (the archive's flag, not a verdict on who wrote the code; “community repositories only” when every sample that ran came from a community repository, “official: no sample here; runs from other or unrecorded repositories” when some came from a repository the paper names or has in its text, or from none recorded); hover it for the repositories the samples that ran came from.

Tasks archive 2025-07-28

9 tasks the archive attaches to papers tagged with this method, by distinct papers. A task without a page in the catalog is plain text.

TaskPapers
Image Generation3
Generative Adversarial Network2
Image Super-Resolution2
Super-Resolution2
Decoder1
Face Hallucination1
Image-to-Image Translation1
Translation1
Video Super-Resolution1

Usage over time archive 2025-07-28

Papers per year tagged with Relativistic GAN: 2018 to 2025, peak 2 2 0 2018: 2 papers 2018 2019: 1 paper 2019 2020: 0 papers 2020 2021: 1 paper 2021 2022: 0 papers 2022 2023: 1 paper 2023 2024: 0 papers 2024 2025: 1 paper 2025
Papers per year the archive tags with this method, by the paper's archive date (6 dated). Bars are counts, not a trend claim.

Components: the archive holds no method-to-method composition, so PwC's Components table cannot be rebuilt; the Papers list carries no Results column for the same reason (the archive does not join its leaderboard rows to method tags).

Categories archive 2025-07-28

Generative Adversarial Networks

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