ResearchTrend.AI
  • Papers
  • Communities
  • Events
  • Blog
  • Pricing
Papers
Communities
Social Events
Terms and Conditions
Pricing
Parameter LabParameter LabTwitterGitHubLinkedInBlueskyYoutube

© 2025 ResearchTrend.AI, All rights reserved.

  1. Home
  2. Papers
  3. 2006.14567
  4. Cited By
Taming GANs with Lookahead-Minmax

Taming GANs with Lookahead-Minmax

25 June 2020
Tatjana Chavdarova
Matteo Pagliardini
Sebastian U. Stich
F. Fleuret
Martin Jaggi
    GAN
ArXivPDFHTML

Papers citing "Taming GANs with Lookahead-Minmax"

6 / 6 papers shown
Title
Optimal Guarantees for Algorithmic Reproducibility and Gradient
  Complexity in Convex Optimization
Optimal Guarantees for Algorithmic Reproducibility and Gradient Complexity in Convex Optimization
Liang Zhang
Junchi Yang
Amin Karbasi
Niao He
26
2
0
26 Oct 2023
Stable Nonconvex-Nonconcave Training via Linear Interpolation
Stable Nonconvex-Nonconcave Training via Linear Interpolation
Thomas Pethick
Wanyun Xie
V. Cevher
27
5
0
20 Oct 2023
Private GANs, Revisited
Private GANs, Revisited
Alex Bie
Gautam Kamath
Guojun Zhang
11
14
0
06 Feb 2023
Training Generative Adversarial Networks with Adaptive Composite
  Gradient
Training Generative Adversarial Networks with Adaptive Composite Gradient
Huiqing Qi
Fang Li
Shengli Tan
Xiangyun Zhang
GAN
21
3
0
10 Nov 2021
Decentralized Local Stochastic Extra-Gradient for Variational
  Inequalities
Decentralized Local Stochastic Extra-Gradient for Variational Inequalities
Aleksandr Beznosikov
Pavel Dvurechensky
Anastasia Koloskova
V. Samokhin
Sebastian U. Stich
Alexander Gasnikov
26
43
0
15 Jun 2021
On Solving Minimax Optimization Locally: A Follow-the-Ridge Approach
On Solving Minimax Optimization Locally: A Follow-the-Ridge Approach
Yuanhao Wang
Guodong Zhang
Jimmy Ba
33
100
0
16 Oct 2019
1