Research map / Bandits and online learning / RL theory and MDPs
A Provably Efficient Model-Free Posterior Sampling Method for Episodic 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
- Breaking the Sample Complexity Barrier to Regret-Optimal Model-Free Reinforcement Learning (NeurIPS 2021 · similarity 0.92)
- Optimistic posterior sampling for reinforcement learning: worst-case regret bounds (NeurIPS 2017 · similarity 0.92)
- Efficient Exploration in Average-Reward Constrained Reinforcement Learning: Achieving Near-Optimal Regret With Posterior Sampling (ICML 2024 · similarity 0.90)
- No-Regret Thompson Sampling for Finite-Horizon Markov Decision Processes with Gaussian Processes (NeurIPS 2025 · similarity 0.89)
- Online Posterior Sampling with a Diffusion Prior (NeurIPS 2024 · similarity 0.89)
- Feel-Good Thompson Sampling for Contextual Bandits: a Markov Chain Monte Carlo Showdown (NeurIPS 2025 · similarity 0.89)
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.