Research map / Bandits and online learning / Online convex optimization and games
Efficient Phi-Regret Minimization in Extensive-Form Games via Online Mirror Descent
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
- The Power of Regularization in Solving Extensive-Form Games (ICLR 2023 · similarity 0.92)
- Efficient Last-Iterate Convergence in Solving Extensive-Form Games (NeurIPS 2025 · similarity 0.91)
- Efficient $\Phi$-Regret Minimization with Low-Degree Swap Deviations in Extensive-Form Games (NeurIPS 2024 · similarity 0.89)
- Comparator-Adaptive $\Phi$-Regret: Improved Bounds, Simpler Algorithms, and Applications to Games (NeurIPS 2025 · similarity 0.89)
- On the Optimality of Dilated Entropy and Lower Bounds for Online Learning in Extensive-Form Games (NeurIPS 2024 · similarity 0.88)
- On the Universal Near Optimality of Hedge in Combinatorial Settings (NeurIPS 2025 · 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.