atlas

Research map / Reinforcement learning / MDPs and planning

Online RL in Linearly $q^\pi$-Realizable MDPs Is as Easy as in Linear MDPs If You Learn What to Ignore

NeurIPS 2023 · Reinforcement learning › MDPs and planning · approach: Function approximation in RL 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
Learn which low-range states to skip, then run a linear-MDP learning algorithm on the resulting reduced problemOnline RL in linearly q^π-realizable MDPs · Linearly q^π-realizable episodic MDPsonline interactions: \tilde{\mathcal{O}}\left(H^{11}d^7/\varepsilon^2\right)Helped
Skip low-range states by following a fixed policy until reaching a state with meaningful action-value differencesLinearly q^π-realizable MDPs · Linearly q^π-realizable episodic MDPsMDP structureHelped

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