atlas

Research map / Reinforcement learning / MDPs and planning

Nearly Horizon-Free Offline Reinforcement Learning

NeurIPS 2021 · Reinforcement learning › MDPs and planning · approach: Offline RL sample complexity · 6 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 a recursion-based bound on total variance in the plug-in estimatorOffline policy evaluation in time-homogeneous MDPs · Offline policy evaluationvalue estimation error: \tilde{O}(\sqrt{\frac{1}{Kd_m}})Helped
Use model-based planning on the empirical MDPOffline policy optimization in time-homogeneous MDPs · Offline policy optimizationsub-optimality gap: \widetilde{O}\left(\sqrt{\frac{1}{Kd_m}} + \frac{\min\{S, d\}}{Kd_m}\right)Helped
Apply the prior time-homogeneous model-based planning bound instead of the proposed boundOffline policy optimization for time-homogeneous linear MDPs · Offline policy optimizationsample complexity: \widetilde{O}\left(\frac{\min\{H, S, d\}}{d_m\epsilon^2}\right) -> \widetilde{O}\left(\frac{1}{d_m \epsilon^2} + \frac{\Hurt

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