atlas

Research map / Optimization / Nonconvex and smooth optimization

Implicit Learning Dynamics in Stackelberg Games: Equilibria Characterization, Convergence Analysis, and Empirical Study

ICML 2020 · Optimization › Nonconvex and smooth optimization · approach: Equilibrium learning in zero-sum games · 38 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
Stackelberg learning dynamics (implicit, leader accounts for follower best response) instead of simultaneous gradient descentcovariance learning Wasserstein GAN (zero-sum) · Learning covariance matrix, m=2,5,10distance from equilibrium ||Sigma - VV^T||_2 and ||W + W^T||_2 convergence speedHelped
Stackelberg learning dynamics instead of simultaneous gradient descentGAN training, circle configuration (non-saturating objective, ReLU) · Learning mixture of Gaussians (circle)training stability / convergence to ground-truth distributionHelped
Stackelberg learning dynamics instead of simultaneous gradient descentGAN training, diamond configuration (saturating objective, Tanh) · Learning mixture of Gaussians (diamond)generator/discriminator quality at end of trainingNo clear effect
Stackelberg learning dynamics instead of simultaneous gradient descentMNIST DCGAN · MNIST GAN, mean Inception score over 10 seedsInception scoreHelped

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