Methods › Computer Vision › Generative Adversarial Networks › LOGAN

LOGAN

6 papers tagged archive 2025-07-28

Introduced by Yan Wu et al. in LOGAN: Latent Optimisation for Generative Adversarial Networks

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

LOGAN is a generative adversarial network that uses a latent optimization approach using natural gradient descent (NGD). For the Fisher matrix in NGD, the authors use the empirical Fisher F′ with Tikhonov damping:

F′ = g ·gᵀ + βI

They also use Euclidian Norm regularization for the optimization step.

For LOGAN's base architecture, BigGAN-deep is used with a few modifications: increasing the size of the latent source from 186 to 256, to compensate the randomness of the source lost when optimising z. 2, using the uniform distribution U(−1, 1) instead of the standard normal distribution N(0, 1) for p(z) to be consistent with the clipping operation, using leaky ReLU (with the slope of 0.2 for the negative part) instead of ReLU as the non-linearity for smoother gradient flow for (δf(z))/δz .

PaperSourceSee Code · Hosein47/LOGAN

In Syntology name not resolved (unknown_name). Other entries in Syntology's graph carry this name; the lookup's note below says what that means for this name.

From the lookup's note on this name: Nothing resolved to this name, but 7 entries in Syntology's graph carry it; the most cited is the paper “LOGAN: Membership Inference Attacks Against Generative Models” (arXiv:1705.07663, 107 citations). The lookup reads this as a miss of its own name matching, not a gap in coverage: the graph holds the name under a spelling the lookup did not reach. For arXiv:1705.07663: its page on this site · ask the lookup about it.

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: 2 · where Syntology ran a sample: 1 (1 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 (1 of 6 tagged: 1 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

8 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
Bias Detection2
Clustering2
BIG-bench Machine Learning1
Computational Efficiency1
Conditional Image Generation1
Denoising1
Fairness1
Image Generation1

Usage over time archive 2025-07-28

Papers per year tagged with LOGAN: 2019 to 2022, peak 2 2 0 2019: 1 paper 2019 2020: 2 papers 2020 2021: 2 papers 2021 2022: 1 paper 2022
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 NetworksGenerative Models

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