atlas

Research map / Reinforcement learning / Offline RL

Offline Reinforcement Learning with Differentiable Function Approximation is Provably Efficient

ICLR 2023 · Reinforcement learning › Offline RL · approach: Offline RL sample complexity theory · 0 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
variance-aware reweighting of fitted Q regression (VAFQL) instead of PFQLfitted Q-learning with differentiable function class · theoretical suboptimality boundhorizon dependence of boundHelped
pessimism penalty based on uncertainty Γ_h with differentiable function class (PFQL vs. VFQL)fitted Q-learning with differentiable function approximation · theoretical suboptimality boundassumption required / bound formHelped
minimax lower bound shows gap of at most sqrt(d) vs. upper bound for linear caselinear representation f=<θ,φ> · theoretical minimax lower boundlower bound factorNo clear effect

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