Methods › General › Optimization › TTUR

Two Time-scale Update Rule

TTUR

133 papers tagged archive 2025-07-28

Introduced by Martin Heusel et al. in GANs Trained by a Two Time-Scale Update Rule Converge to a Local Nash Equilibrium

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

The Two Time-scale Update Rule (TTUR) is an update rule for generative adversarial networks trained with stochastic gradient descent. TTUR has an individual learning rate for both the discriminator and the generator. The main premise is that the discriminator converges to a local minimum when the generator is fixed. If the generator changes slowly enough, then the discriminator still converges, since the generator perturbations are small. Besides ensuring convergence, the performance may also improve since the discriminator must first learn new patterns before they are transferred to the generator. In contrast, a generator which is overly fast, drives the discriminator steadily into new regions without capturing its gathered information.

PaperSourceSee Code · yccyenchicheng/pytorch-WGAN-GP-TTUR-CelebA

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.

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: 133 · with a code link: 70 · where Syntology ran a sample: 23 (17 with a run with no instrument failure, 6 where every run was a failure of Syntology's instrument) Syntology

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

Page 1 of 2: papers 1 to 100 of 133, 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 142 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 Generation37
Conditional Image Generation14
Generative Adversarial Network10
reinforcement-learning9
Multi-agent Reinforcement Learning7
Reinforcement Learning7
Data Augmentation6
Reinforcement Learning (RL)6
Super-Resolution6
Decision Making5
Unconditional Image Generation5
Vocal Bursts Intensity Prediction5
Attribute4
Clustering4
Denoising4
Diversity4
Object4
Transfer Learning4
Benchmarking3
Decoder3

Usage over time archive 2025-07-28

Papers per year tagged with TTUR: 2017 to 2024, peak 37 37 0 2017: 1 paper 2017 2018: 2 papers 2018 2019: 9 papers 2019 2020: 28 papers 2020 2021: 20 papers 2021 2022: 34 papers 2022 2023: 37 papers 2023 2024: 2 papers 2024
Papers per year the archive tags with this method, by the paper's archive date (133 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

Optimization

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