Research map / Optimization / Nonconvex and smooth optimization
Stochastic No-regret Learning for General Games with Variance Reduction
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.
Closest papers by meaning
- Optimistic Mirror Descent Either Converges to Nash or to Strong Coarse Correlated Equilibria in Bimatrix Games (NeurIPS 2022 · similarity 0.93)
- Let’s be Honest: An Optimal No-Regret Framework for Zero-Sum Games (ICML 2018 · similarity 0.92)
- Local and Adaptive Mirror Descents in Extensive-Form Games (NeurIPS 2024 · similarity 0.90)
- Uncoupled and Convergent Learning in Monotone Games under Bandit Feedback (NeurIPS 2025 · similarity 0.89)
- Optimism Without Regularization: Constant Regret in Zero-Sum Games (NeurIPS 2025 · similarity 0.88)
- Adaptively Perturbed Mirror Descent for Learning in Games (ICML 2024 · similarity 0.88)
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.