Research map / Bandits and online learning / Online convex optimization and games
Faster Game Solving via Asymmetry of Step Sizes
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
- Stable-Predictive Optimistic Counterfactual Regret Minimization (ICML 2019 · similarity 0.92)
- AutoCFR: Learning to Design Counterfactual Regret Minimization Algorithms (AAAI 2022 · similarity 0.91)
- Faster Game Solving via Hyperparameter Schedules (AAAI 2026 · similarity 0.91)
- Efficient Last-Iterate Convergence in Solving Extensive-Form Games (NeurIPS 2025 · similarity 0.90)
- Strategy-Based Warm Starting for Regret Minimization in Games (AAAI 2016 · similarity 0.89)
- Accelerating Nash Equilibrium Convergence in Monte Carlo Settings Through Counterfactual Value Based Fictitious Play (NeurIPS 2024 · 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.