atlas

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

Efficient Bias-Span-Constrained Exploration-Exploitation in Reinforcement Learning

ICML 2018 · Bandits and online learning › RL theory and MDPs · approach: Average-reward and latent MDPs · 4 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
Constrain optimistic planning using an upper bound on the optimal bias spanSCAL vs. UCRL · Three-state communicating MDP with large diameter and small bias spancumulative regretHelped
Use bias-span-constrained exploration rather than unconstrained optimismSCAL vs. UCRL · Weakly communicating MDP with infinite diameterregretHelped
Reduce the bias-span constraint c (ablation)SCAL · Three-state communicating MDPcumulative regretHelped
Set the transition-probability perturbation η to 0 (ablation)SCAL · Numerical experimentsconvergence of REGOPTNo clear effect
Use a constraint c smaller than the true optimal bias span (ablation)SCAL · MDPs where c < SP(h*_{M*})policy performanceHurt
Use the span-constrained algorithm without a valid span bound (ablation)SCAL · MDPs where c < SP(h*_{M*})regret guaranteeHurt

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