atlas

Research map / Reinforcement learning / MDPs and planning

Near-Optimal Reward-Free Exploration for Linear Mixture MDPs with Plug-in Solver

ICLR 2022 · Reinforcement learning › MDPs and planning · approach: Function approximation in RL theory · 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 the initial reward-free exploration algorithm to learn a transition model for arbitrary plug-in planningLinear mixture MDP · Reward-free explorationepisodes: \tilde{O}\left(\frac{d^2 H^4}{\epsilon^2}\right)Helped
Refine uncertainty estimation to measure expected total uncertainty along trajectories, using a maximum total-variance boundReward-free Exploration · Linear mixture MDPs, d ≥ H and ε ≤ H/√depisodes: \tilde{O}(d^2H^4/\epsilon^2) -> \tilde{O}(d^2H^3/\epsilon^2)Helped
Use trajectory-wise uncertainty estimation and maximum total-variance analysisReward-free Exploration · Linear mixture MDPs, d ≥ H and ε ≤ H/√depisodes relative to the lower bound: \tilde{O}(d^2H^3/\epsilon^2); lower bound: \Omega(d^2H^3/\epsilon^2)No 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