AI Paper Atlas

Research map / Reinforcement learning / MDPs and planning

On Gap-dependent Bounds for Offline Reinforcement Learning

Xinqi Wang, Qiwen Cui, Simon Shaolei Du

NeurIPS 2022 · Reinforcement learning › MDPs and planning · approach: Offline RL sample complexity · 3 citations (OpenAlex)

Read the paper

AI-extracted. The measured effects below were read by AI from the paper's full text (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
add positive sub-optimality gap assumption to optimal policy coverageVI-LCB · tabular offline RLsample complexity bound: 1/epsilon^2 -> 1/epsilonImproved

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