atlas

Research map / Reinforcement learning / MDPs and planning

Safe Exploration Incurs Nearly No Additional Sample Complexity for Reward-Free RL

ICLR 2023 · Reinforcement learning › MDPs and planning · approach: Policy optimization 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
Add safe exploration using a known safe baseline policyTabular-SWEET · Tabular MDP reward-free explorationtrajectory sample complexity: \tilde{O}\left(HS^2A/\epsilon^2\right) (constraint-free); safe bound: \tilde{O}\left(\frac{HSA(S+\log(1/\delta))}{\DeltaNo clear effect
Add safe exploration using a known safe baseline policyLow-rank-SWEET · Low-rank MDP reward-free explorationtrajectory sample complexity: \tilde{O}\left(H^3d^4A^2/\epsilon^2\right) (constraint-free); safe bound: \tilde{O}\left(\frac{H^3d^4A^2\log(1/\delta)}{No clear effect
Use truncated value-function clipping rather than conventional clipping of the action-value functionSWEET · Safe reward-free exploration and planningapproximation-error estimationHelped

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