Methods › General › Latent Variable Sampling › Latent Optimisation

Latent Optimisation

13 papers tagged archive 2025-07-28

Introduced by Yan Wu et al. in Deep Compressed Sensing

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

Latent Optimisation is a technique used for generative adversarial networks to refine the sample quality of z. Specifically, it exploits knowledge from the discriminator D to refine the latent source z. Intuitively, the gradient ∇_zf(z) = δf(z)δz points in the direction that better satisfies the discriminator D, which implies better samples. Therefore, instead of using the randomly sampled z ∼p(z), we uses the optimised latent:

Δz = α(δf(z))/δz

z′ = z + Δz

Source: LOGAN .

PaperSourceSee Code · deepmind/deepmind-research

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: KV-Latent; Latent-IM; latent ODE; Latent-IMH; Latent-OPD; Latent-INR; Latent-DARM; Latent JEPA.

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: 13 · with a code link: 6 · 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 13 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 13 of 13, 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

20 shown of 27 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
Bias Detection2
Clustering2
Conditional Image Generation2
Generative Adversarial Network2
Medical Image Generation2
Anatomy1
Attribute1
BIG-bench Machine Learning1
Cardiac Segmentation1
Computational Efficiency1
Data Augmentation1
Denoising1
Diagnostic1
Edge-computing1
Ethics1
Fairness1
Meta-Learning1
Radiologist Binary Classification1
Segmentation1

Usage over time archive 2025-07-28

Papers per year tagged with Latent Optimisation: 2019 to 2022, peak 5 5 0 2019: 2 papers 2019 2020: 5 papers 2020 2021: 3 papers 2021 2022: 3 papers 2022
Papers per year the archive tags with this method, by the paper's archive date (13 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

Latent Variable Sampling

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