AI Paper Atlas

Research map / Optimization / Nonconvex and smooth optimization

Stochastic Hamiltonian Gradient Methods for Smooth Games

Nicolas Loizou, Hugo Berard, Alexia Jolicoeur-Martineau, Pascal Vincent, Simon Lacoste-Julien, Ioannis Mitliagkas

ICML 2020 · Optimization › Nonconvex and smooth optimization · approach: Equilibrium learning in zero-sum games · 14 citations (OpenAlex)

Read the paperCheck your idea against 137,217 papers

AI-extracted. The measured effects below were read by AI from the paper's full text (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 L-SVRHG instead of the compared methodsStochastic bilinear game · Stochastic bilinear gameconvergence speedImproved
Use decreasing-step-size SHGDStochastic bilinear game · Stochastic bilinear gameconvergence rateMixed
Use Hamiltonian methods instead of SGDA or SVREStochastic bilinear game · 2D stochastic bilinear gameconvergence speedImproved
Use SGDA instead of Hamiltonian methodsSufficiently-bilinear game · 2D sufficiently-bilinear gamerotationHurt
Use L-SVRHG without restart rather than the restarted variant (ablation)Sufficiently-bilinear game · Sufficiently-bilinear gameconvergenceNo clear effect
Use SGDA instead of L-SVRHGWGAN · GaussianGAN WGANconvergenceHurt
Use Hamiltonian-based algorithms instead of SGDAGaussianGAN · GaussianGAN satGANHamiltonian decreaseHurt

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