Research map / Optimization / Nonconvex and smooth optimization
Faster Non-asymptotic Convergence 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.
Closest papers by meaning
- Finite-Time Analysis for Double Q-learning (NeurIPS 2020 · similarity 0.94)
- The Mean-Squared Error of Double Q-Learning (NeurIPS 2020 · similarity 0.90)
- A Unified Switching System Perspective and Convergence Analysis of Q-Learning Algorithms (NeurIPS 2020 · similarity 0.89)
- Sharp asymptotic theory for Q-learning with \texttt{LD2Z} learning rate and its generalization (ICLR 2026 · similarity 0.89)
- Linear $Q$-Learning Does Not Diverge in $L^2$: Convergence Rates to a Bounded Set (ICML 2025 · similarity 0.86)
- Deep Double Q-learning (NeurIPS 2026 · 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.