Research map / Learning theory and algorithms / Sample complexity
Sharp asymptotic theory for Q-learning with \texttt{LD2Z} learning rate and its generalization
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
- Linear $Q$-Learning Does Not Diverge in $L^2$: Convergence Rates to a Bounded Set (ICML 2025 · similarity 0.89)
- Non-Asymptotic Guarantees for Average-Reward Q-Learning with Adaptive Stepsizes (NeurIPS 2025 · similarity 0.89)
- Faster Non-asymptotic Convergence for Double Q-learning (NeurIPS 2021 · similarity 0.89)
- Finite-Time Analysis for Double Q-learning (NeurIPS 2020 · similarity 0.88)
- Long-Horizon Q-Learning: Accurate Value Learning via n-Step Inequalities (NeurIPS 2026 · similarity 0.87)
- Gap-Dependent Bounds for Q-Learning using Reference-Advantage Decomposition (ICLR 2025 · similarity 0.86)
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.
