AI Paper Atlas

Research map / Reinforcement learning / Offline RL

On Instance-Dependent Bounds for Offline Reinforcement Learning with Linear Function Approximation

Thanh Nguyen-Tang, Ming Yin, Sunil Gupta, Svetha Venkatesh, Raman Arora

AAAI 2023 · Reinforcement learning › Offline RL · approach: Offline RL sample complexity theory · 5 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
Use BCP-VI under unique optimality and spanning features once K exceeds k^*Offline RL with linear function approximation · Linear MDP, OPC, unique optimality and spanning featuressub-optimality: 0Improved
Set pessimism parameter β to 1 rather than 0 (ablation)BCP-VI · Linear MDP simulation, H ∈ {20,30,50,80}sub-optimalityImproved
Remove pessimism by setting β = 0 (ablation)BCP-VI · Linear MDP simulation, H ∈ {20,30,50,80}sub-optimalityHurt
Use β values in {0, 0.1, 0.2, 0.5, 1, 2} (ablation)BCP-VI · Linear MDP simulation, H ∈ {20,30,50,80}sub-optimalityMixed

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