Research map / Bandits and online learning / RL theory and MDPs
Logarithmic Regret for Reinforcement Learning with Linear Function Approximation
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 |
|---|---|---|---|
| Assume a strictly positive minimal sub-optimality gap | LSVI-UCB under the linear MDP assumption · Linear MDP | regret dependence on T: \sqrt{T} -> \log(T) | Helped |
| Assume a strictly positive minimal sub-optimality gap | UCRL-VTR under the linear mixture MDP assumption · Linear mixture MDP | regret dependence on T: \sqrt{T} -> \log^3(T) | Helped |
Closest papers by meaning
- Nearly Minimax Optimal Reinforcement Learning with Linear Function Approximation (ICML 2022 · similarity 0.92)
- Achieving Constant Regret in Linear Markov Decision Processes (NeurIPS 2024 · similarity 0.91)
- Logarithmic Regret for Linear Markov Decision Processes with Adversarial Corruptions (AAAI 2025 · similarity 0.91)
- Horizon-Free Regret for Linear Markov Decision Processes (ICLR 2024 · similarity 0.90)
- Logarithmic Regret for Online KL-Regularized Reinforcement Learning (ICML 2025 · similarity 0.89)
- Provably Efficient Reinforcement Learning with Multinomial Logit Function Approximation (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.