Research map / Bandits and online learning / Online convex optimization and games
Lazy-CFR: fast and near-optimal regret minimization for extensive games with imperfect information
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.
Measured effects reported in the paper
| What was changed | Where | Measured | Effect |
|---|---|---|---|
| Apply lazy updates to CFR | CFR · Leduc-5 | convergence | Hurt |
| Apply lazy updates to CFR | CFR · Leduc variants larger than Leduc-5 | convergence | Helped |
| Apply lazy updates to CFR+ | CFR+ · Leduc Hold'em variants | convergence | Helped |
| Apply lazy updates to CFR | CFR · Leduc-15 | convergence speedup: over 200 times faster | Helped |
| Apply lazy updates to CFR+ | CFR+ · Leduc-15 | convergence speedup: over 500 times faster | Helped |
Closest papers by meaning
- Solving Imperfect-Information Games via Discounted Regret Minimization (AAAI 2019 · similarity 0.95)
- Strategy-Based Warm Starting for Regret Minimization in Games (AAAI 2016 · similarity 0.92)
- Faster Game Solving via Hyperparameter Schedules (AAAI 2026 · similarity 0.91)
- Model-Free Online Learning in Unknown Sequential Decision Making Problems and Games (AAAI 2021 · similarity 0.91)
- Regret Circuits: Composability of Regret Minimizers (ICML 2019 · similarity 0.91)
- Optimism Without Regularization: Constant Regret in Zero-Sum Games (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.