atlas

Research map / Reinforcement learning / MDPs and planning

On Reward-Free Reinforcement Learning with Linear Function Approximation

NeurIPS 2020 · Reinforcement learning › MDPs and planning · approach: Policy optimization theory · 33 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 linear MDP structure and exploration-driven UCB rewards during explorationReward-Free RL for Linear MDPs · Reward-free RL, linear MDPexploration trajectories for an ε-optimal policy: O\left(d^3H^6\log(dH \delta^{-1}\varepsilon^{-1}) / \varepsilon^2\right)Helped
Rely on linear Q* alone rather than the linear MDP assumptionReward-free RL · Reward-free RL, linear Q*; deterministic systemsexploration samples required: \Omega(2^H)Hurt
Provide simulator access to query transitions at selected feature-basis pairsReward-free RL under linear Q* · Deterministic systems with a simulatortransition queries for an optimal policy: dHHelped
Remove simulator accessReward-free RL under linear Q* in deterministic systems · Reward-free RLexploration samples required: dH queries with a simulator; at least Ω(2^H) samples without oneHurt

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