Research map / Optimization / Nonconvex and smooth optimization
The Power of Regularization in Solving Extensive-Form Games
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
- Efficient Last-Iterate Convergence in Solving Extensive-Form Games (NeurIPS 2025 · similarity 0.94)
- Local and Adaptive Mirror Descents in Extensive-Form Games (NeurIPS 2024 · similarity 0.90)
- Accelerated Regularized Learning in Finite N-Person Games (NeurIPS 2024 · similarity 0.89)
- Learning Imperfect Information Extensive-form Games with Last-iterate Convergence under Bandit Feedback (ICML 2025 · similarity 0.89)
- On the Optimality of Dilated Entropy and Lower Bounds for Online Learning in Extensive-Form Games (NeurIPS 2024 · similarity 0.89)
- From Average-Iterate to Last-Iterate Convergence in Games: A Reduction and Its Applications (NeurIPS 2025 · similarity 0.89)
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.
