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
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 changed | Where | Measured | Effect |
|---|---|---|---|
| Use L-SVRHG instead of the compared methods | Stochastic bilinear game · Stochastic bilinear game | convergence speed | Improved |
| Use decreasing-step-size SHGD | Stochastic bilinear game · Stochastic bilinear game | convergence rate | Mixed |
| Use Hamiltonian methods instead of SGDA or SVRE | Stochastic bilinear game · 2D stochastic bilinear game | convergence speed | Improved |
| Use SGDA instead of Hamiltonian methods | Sufficiently-bilinear game · 2D sufficiently-bilinear game | rotation | Hurt |
| Use L-SVRHG without restart rather than the restarted variant (ablation) | Sufficiently-bilinear game · Sufficiently-bilinear game | convergence | No clear effect |
| Use SGDA instead of L-SVRHG | WGAN · GaussianGAN WGAN | convergence | Hurt |
| Use Hamiltonian-based algorithms instead of SGDA | GaussianGAN · GaussianGAN satGAN | Hamiltonian decrease | Hurt |
Closest papers by meaning
- Stochastic Gradient Descent-Ascent and Consensus Optimization for Smooth Games: Convergence Analysis under Expected Co-coercivity (NeurIPS 2021 · similarity 0.90)
- Average-case Acceleration for Bilinear Games and Normal Matrices (ICLR 2021 · similarity 0.88)
- Hamiltonian Descent Algorithms for Optimization: Accelerated Rates via Randomized Integration Time (NeurIPS 2025 · similarity 0.87)
- Gradient-Variation Online Learning under Generalized Smoothness (NeurIPS 2024 · similarity 0.87)
- Generalized Smooth Stochastic Variational Inequalities: Almost Sure Convergence and Convergence Rates (NeurIPS 2026 · similarity 0.87)
- The Global Convergence Time of Stochastic Gradient Descent in Non-Convex Landscapes: Sharp Estimates via Large Deviations (ICML 2025 · similarity 0.86)
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.
