atlas

Research map / Bandits and online learning / RL theory and MDPs

Learning Near Optimal Policies with Low Inherent Bellman Error

ICML 2020 · Bandits and online learning › RL theory and MDPs · approach: Linear function approximation in RL · 61 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 ELEANOR's global optimization over linear value-function parametersOnline exploration in finite-horizon MDPs with low inherent Bellman error · Finite-horizon MDPs with low inherent Bellman errorregret: rOp∑_{t=1}^H d_t√K + ∑_{t=1}^H√(d_t I K)qHelped
Use ELEANOR's misspecification-adjusted confidence intervalLINUCB for contextual misspecified linear bandits · Contextual misspecified linear banditsregret: rO(d√K + √dIK)Helped
Allow positive inherent Bellman error IELEANOR · Finite-horizon MDPs with low inherent Bellman errorregret: ∑_{t=1}^H√(d_t I K)Hurt

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