AI Paper Atlas

Research map / Reinforcement learning / MDPs and planning

Distributionally Robust Model-Based Offline Reinforcement Learning with Near-Optimal Sample Complexity

Laixi Shi, Yuejie Chi

JMLR 2024 · Reinforcement learning › MDPs and planning · approach: Function approximation in RL theory · 51 citations (OpenAlex)

Read the paperCheck your idea against 137,217 papers

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 pessimism (LCB penalty) to distributionally robust value iteration (ablation)DRVI-LCB vs DRVI · Gambler's problem, small sample (N=100)sub-optimality value gapImproved
add pessimism (LCB penalty) to distributionally robust value iteration (ablation)DRVI-LCB vs DRVI · Gambler's problem, varying N (100 to 5000)sub-optimality gapImproved
add pessimism (LCB penalty) to distributionally robust value iteration (ablation)DRVI-LCB vs DRVI · Gambler's problem, growing number of states Svalue gapImproved
add pessimism (LCB penalty) to distributionally robust value iteration (ablation)DRVI-LCB vs DRVI · Gambler's problem, trajectory data (K trajectories)sub-optimality value gapImproved
train with distributional robustness (sigma 0.01 or 0.2) instead of the non-robust optimal policy (ablation)DRVI-LCB policy, N=1000 · Gambler's problem, perturbed p_head in [0.25,0.75]ratio of winningImproved

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