Research map / Optimization / Nonconvex and smooth optimization
Finite-Time Analysis for Double Q-learning
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 |
|---|---|---|---|
| Use double Q-learning instead of vanilla Q-learning | Q-learning · High-accuracy regime (ε ≪ 1−γ) | order-level dependence on ε in iteration complexity | No clear effect |
| Use double Q-learning instead of vanilla Q-learning | Q-learning · Low-accuracy regime (ε ≫ 1−γ) | dependence on 1−γ in iteration complexity | Hurt |
| Use asynchronous rather than synchronous double Q-learning | Double Q-learning · Finite MDP with covering number L | sample complexity | Hurt |
Closest papers by meaning
- Faster Non-asymptotic Convergence for Double Q-learning (NeurIPS 2021 · similarity 0.94)
- Deep Double Q-learning (NeurIPS 2026 · similarity 0.87)
- Linear $Q$-Learning Does Not Diverge in $L^2$: Convergence Rates to a Bounded Set (ICML 2025 · similarity 0.87)
- ADDQ: Adaptive distributional double Q-learning (ICML 2025 · similarity 0.86)
- Long-Horizon Q-Learning: Accurate Value Learning via n-Step Inequalities (NeurIPS 2026 · similarity 0.85)
- Stochastic Q-learning for Large Discrete Action Spaces (ICML 2024 · similarity 0.85)
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.