Research map / Bandits and online learning / RL theory and MDPs
Near-Optimal Randomized Exploration for Tabular Markov Decision Processes
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
- Worst-Case Regret Bounds for Exploration via Randomized Value Functions (NeurIPS 2019 · similarity 0.95)
- Randomized Exploration in Reinforcement Learning with General Value Function Approximation (ICML 2021 · similarity 0.92)
- Randomized Exploration for Reinforcement Learning with Multinomial Logistic Function Approximation (NeurIPS 2024 · similarity 0.91)
- Random Exploration in Bayesian Optimization: Order-Optimal Regret and Computational Efficiency (ICML 2024 · similarity 0.89)
- Beyond Optimism: Exploration With Partially Observable Rewards (NeurIPS 2024 · similarity 0.89)
- Concurrent Reinforcement Learning with Aggregated States via Randomized Least Squares Value Iteration (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.