atlas

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

Horizon-Free and Variance-Dependent Reinforcement Learning for Latent Markov Decision Processes

ICML 2023 · Bandits and online learning › RL theory and MDPs · approach: Average-reward and latent MDPs · 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
Use Bernstein-type confidence set (model-optimistic) or variance-dependent MVP bonus (value-optimistic) in LMDP planningLMDP with context in hindsight · theoretical regret analysisregret dependence on horizon HHelped
Replace Azuma-type dependence with variance-dependent bound (sqrt(Var* M Γ S A K)) instead of sqrt(H)-scaling boundLMDP regret · theoretical regret analysisregret order in Var*Helped
Scale the number of states dependence from S (prior) to sqrt(S Γ)LMDP regret · theoretical comparisonregret dependence on SHelped
Upper bound matched by lower bound with Γ=2 (minimax optimal for constant Γ)variance-bounded LMDPs · theoretical lower bound comparisonoptimality gapNo 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