atlas

Research map / Optimization / Nonconvex and smooth optimization

Towards Better Understanding of Adaptive Gradient Algorithms in Generative Adversarial Nets

ICLR 2020 · Optimization › Nonconvex and smooth optimization · approach: Gradient descent ascent for minimax · 19 citations (OpenAlex)

Read the paperCheck your idea against 108,967 papers

AI-extracted summary. Written by AI from the paper's title only (no summary yet). Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.

Measured effects reported in the paper

What was changedWhereMeasuredEffect
use coordinate-wise adaptive steps based on cumulative gradient history instead of a fixed metricOAdagrad versus OSG · Non-convex non-concave min-max optimizationiteration complexity: O(1/\epsilon^4) -> O(\epsilon^{-\frac{2}{1-\alpha}})Helped
use OAdagrad instead of OSGWGAN-GP · CIFAR10Inception ScoreHelped
use OAdagrad instead of Alternating AdamWGAN-GP · CIFAR10Inception ScoreHelped
use OAdagrad instead of Simultaneous AdamSelf-Attention GAN · ImageNetInception ScoreHelped
use OAdagrad instead of Simultaneous AdamSelf-Attention GAN · ImageNetFréchet Inception DistanceHelped
use OAdagrad instead of OSGGAN training · WGAN-GP on CIFAR10cumulative stochastic gradient growth degree: 0.2Mixed
use OAdagrad for GAN training where cumulative stochastic gradients grow slowlyOAdagrad · WGAN on LSUN Bedroomcumulative stochastic gradient growth degree: 0.07Helped

Closest papers by meaning

Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.

Open scime draft

Get the next scime Dispatch and a monthly field update

Free. We send a confirmation link first; every email has a one-click unsubscribe. Privacy