Research map / Bandits and online learning / Online convex optimization and games
Deep (Predictive) Discounted Counterfactual Regret Minimization
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
- Double Neural Counterfactual Regret Minimization (ICLR 2020 · similarity 0.95)
- Faster Game Solving via Hyperparameter Schedules (AAAI 2026 · similarity 0.92)
- Dynamic Discounted Counterfactual Regret Minimization (ICLR 2024 · similarity 0.92)
- Accelerating Nash Equilibrium Convergence in Monte Carlo Settings Through Counterfactual Value Based Fictitious Play (NeurIPS 2024 · similarity 0.90)
- Learning Not to Regret (AAAI 2024 · similarity 0.88)
- Preference-CFR: Beyond Nash Equilibrium for Better Game Strategies (ICML 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.