Research map / Bandits and online learning / RL theory and MDPs
Breaking the Sample Complexity Barrier to Regret-Optimal Model-Free Reinforcement 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
- A Provably Efficient Model-Free Posterior Sampling Method for Episodic Reinforcement Learning (NeurIPS 2021 · similarity 0.92)
- Towards instance-dependent regret optimality in Episodic MDPs with Posterior Sampling (NeurIPS 2026 · similarity 0.91)
- Is Q-Learning Provably Efficient? (NeurIPS 2018 · similarity 0.91)
- Sample Efficient Reinforcement Learning with Partial Dynamics Knowledge (AAAI 2024 · similarity 0.90)
- Test-Time Regret Minimization in Meta Reinforcement Learning (ICML 2024 · similarity 0.90)
- Randomized Exploration for Reinforcement Learning with Multinomial Logistic Function Approximation (NeurIPS 2024 · similarity 0.90)
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.