atlas

Research map / Reinforcement learning / Policy gradient and actor-critic

Online Nonstochastic Model-Free Reinforcement Learning

NeurIPS 2023 · Reinforcement learning › Policy gradient and actor-critic · approach: Model-based RL with guarantees · 2 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 action-space exploration rather than policy-space explorationBandit GPC · Bandit linear control, convex costsregret upper bound: O(\sqrt{d_x d_u d_{min}} T^{3/4}) -> O(\sqrt{d_u d_{min}} T^{3/4})Helped
Use action-space exploration rather than policy-space explorationBandit GPC · Bandit linear control, smooth costsregret upper bound: The paper says the improvement carries over to smooth costs but gives no paired prior bound here.Helped
Add pseudo-disturbance policies using PD2 or PD3DDPG · Noisy Hopper, Noisy Walker 2D, and Noisy Antepisode returnHelped
Add the PD1 pseudo-disturbance estimateDDPG · Noisy Hopper and other RL settingsepisode returnMixed
Add MF-GPC with PD1DDPG · Noisy Hopperepisode returnHelped
Use RBPC rather than BPCLinear dynamical systems · High-dimensional LDSepisode returnHelped
Use RBPC rather than BPCLinear dynamical systems · Low-dimensional LDSepisode returnNo 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