Research map / Bandits and online learning / RL theory and MDPs

Posterior sampling for reinforcement learning: worst-case regret bounds

NeurIPS 2017 · Bandits and online learning › RL theory and MDPs · approach: Regret bounds with function approximation · 2 citations (OpenAlex)

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

• Optimistic posterior sampling for reinforcement learning: worst-case regret bounds (NeurIPS 2017 · similarity 0.92)
• Why is Posterior Sampling Better than Optimism for Reinforcement Learning? (ICML 2017 · similarity 0.91)
• Efficient Exploration in Average-Reward Constrained Reinforcement Learning: Achieving Near-Optimal Regret With Posterior Sampling (ICML 2024 · similarity 0.90)
• A Provably Efficient Model-Free Posterior Sampling Method for Episodic Reinforcement Learning (NeurIPS 2021 · similarity 0.90)
• Optimistic Posterior Sampling for Reinforcement Learning with Few Samples and Tight Guarantees (NeurIPS 2022 · similarity 0.90)
• Minimax Optimal Reinforcement Learning with Quasi-Optimism (ICLR 2025 · similarity 0.86)