atlas

Research map / Reinforcement learning / Offline RL

Revisiting the Linear-Programming Framework for Offline RL with General Function Approximation

ICML 2023 · Reinforcement learning › Offline RL · approach: Offline RL sample complexity theory

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
Add validity (occupancy-measure) constraints to the LP instead of behavior regularizationLP-based offline RL with function approximation · theoretical sample complexitysample complexity rate in n: O(1/n^1/6) to O(1/√n)Helped
Add a lower-bound constraint on the density ratio (sum_a w(s,a)πμ(a|s) ≥ 1−γ) in the minimax formulationrealizability-only minimax LP · theoretical sample complexitysample complexity rate in n: realizability-only O(1/√n) with gap dependenceHelped
Tabular reduction of the proposed constrained LPtabular MDPs · theoretical sample complexitydependence on (1-γ): (1-γ)^-1 vs (1-γ)^-3/2 for Rashidinejad et al. 2021Helped

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