atlas

Research map / Reinforcement learning / MDPs and planning

Near-optimal Offline Reinforcement Learning with Linear Representation: Leveraging Variance Information with Pessimism

ICLR 2022 · Reinforcement learning › MDPs and planning · approach: Function approximation in RL theory · 3 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
Reweight Bellman residuals using estimated conditional value variancePessimistic value iteration for linear MDPs · Time-inhomogeneous episodic linear MDPssuboptimality bound: improves PEVI over O(\sqrt{d}) on the feature dimension; enjoys O(\sqrt{H}) improvement over PEVI in the tabular caseHelped
Use the tighter penalty \Gamma_h^I instead of the VAPVI penalty (ablation)VAPVI · Tabular MDPs under single-policy concentrabilitysuboptimality bound: enjoys a $S$ state improvement over Theorem~[ref]Helped
Use variance-aware weighting and the stated pessimistic design in deterministic systemsVAPVI · Fully deterministic systemsconvergence rate: O(\frac{1}{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