atlas

Research map / Reinforcement learning / MDPs and planning

Nearly Minimax Optimal Reinforcement Learning for Linear Markov Decision Processes

ICML 2023 · Reinforcement learning › MDPs and planning · approach: Offline RL sample complexity · 4 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.

Measured effects reported in the paper

What was changedWhereMeasuredEffect
Use the proposed algorithm instead of LSVI-UCBLinear MDP · Linear MDPregret: $\tilde O\big(\sqrt{d^3H^4K}\big) -> $\tilde O\big(d\sqrt{H^3K}\big)Helped
Use variance-aware weighted ridge regressionProposed algorithm · Linear MDPregret: a $\sqrt{H}$ improvementHelped
Estimate variance directly for the optimal value function rather than the optimistic value functionProposed algorithm · Linear MDPregret: remove the additional $\sqrt{d}$ dependencyHelped
Use rare-switching updates for the value-function estimatorProposed algorithm · Linear MDPnumber of value-function updates: $O(dH \log(1+K/\lambda))$Helped
Use rare-switching updates rather than updating the value function every episodeProposed algorithm · Linear MDPtotal computational complexity: improves the original LSVI-UCB algorithm by a factor of $K$Helped

Closest papers by meaning

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.

Open scime draft

Get the next scime Dispatch and a monthly field update

Free. We send a confirmation link first; every email has a one-click unsubscribe. Privacy