Research map / Bandits and online learning / RL theory and MDPs
Worst-Case Regret Bounds for Exploration via Randomized Value Functions
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.
Measured effects reported in the paper
| What was changed | Where | Measured | Effect |
|---|---|---|---|
| Use randomized value functions generated by adding Gaussian noise to estimated rewards, rather than directly randomizing actions | RLSVI exploration in tabular finite-horizon MDPs · Tabular finite-horizon MDPs | worst-case regret | Helped |
Closest papers by meaning
- Randomized Exploration for Reinforcement Learning with Multinomial Logistic Function Approximation (NeurIPS 2024 · similarity 0.89)
- Horizon-Free Regret for Linear Markov Decision Processes (ICLR 2024 · similarity 0.88)
- Concurrent Reinforcement Learning with Aggregated States via Randomized Least Squares Value Iteration (ICML 2025 · similarity 0.88)
- Position: Constants are Critical in Regret Bounds for Reinforcement Learning (ICML 2025 · similarity 0.88)
- Random Latent Exploration for Deep Reinforcement Learning (ICML 2024 · similarity 0.88)
- Efficient Exploration in Average-Reward Constrained Reinforcement Learning: Achieving Near-Optimal Regret With Posterior Sampling (ICML 2024 · 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.