atlas

Research map / Reinforcement learning / Offline RL

Importance Weighted Actor-Critic for Optimal Conservative Offline Reinforcement Learning

NeurIPS 2023 · Reinforcement learning › Offline RL · approach: Offline RL sample complexity theory · 1 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
Use an importance-weighted average Bellman error regularizer instead of a squared Bellman-error regularizerA-Crab · Offline RL, any covered policysuboptimality rate: O(1/N^{1/3}) -> O \left(\frac{1}{\sqrt{N}}\right)Helped
Replace the importance-weighted average Bellman error regularizer with squared Bellman error (ablation)A-Crab · Constructed two-arm banditsuboptimality: \Omega(1/N^{1/3})Hurt
Use squared Bellman error rather than importance-weighted average Bellman error (ablation)A-Crab · Offline RL, constructed instancessuboptimality rate: O(1/N^{1/3})Hurt

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