Research map / Bandits and online learning / RL theory and MDPs
Q-Learning with Fine-Grained Gap-Dependent Regret
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
- Gap-Dependent Bounds for Q-Learning using Reference-Advantage Decomposition (ICLR 2025 · similarity 0.93)
- Beyond Value-Function Gaps: Improved Instance-Dependent Regret Bounds for Episodic Reinforcement Learning (NeurIPS 2021 · similarity 0.92)
- Gap-Dependent Bounds for Federated $Q$-Learning (ICML 2025 · similarity 0.91)
- Sharp Gap-Dependent Variance-Aware Regret Bounds for Tabular MDPs (NeurIPS 2025 · similarity 0.90)
- Achieving Constant Regret in Linear Markov Decision Processes (NeurIPS 2024 · similarity 0.89)
- Position: Constants are Critical in Regret Bounds for Reinforcement Learning (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.
