Research map / Bandits and online learning / RL theory and MDPs
Reinforcement Learning with Logarithmic Regret and Policy Switches
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
- Sample-Efficient Reinforcement Learning with loglog(T) Switching Cost (ICML 2022 · similarity 0.92)
- Finite Time Logarithmic Regret Bounds for Self-Tuning Regulation (ICML 2024 · similarity 0.91)
- Regret-Optimal Q-Learning with Low Cost for Single-Agent and Federated Reinforcement Learning (NeurIPS 2025 · similarity 0.90)
- Logarithmic Regret for Online KL-Regularized Reinforcement Learning (ICML 2025 · similarity 0.89)
- Test-Time Regret Minimization in Meta Reinforcement Learning (ICML 2024 · similarity 0.89)
- Achieving Constant Regret in Linear Markov Decision Processes (NeurIPS 2024 · 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.