AI Paper Atlas

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

Regret Bounds for Markov Decision Processes with Recursive Optimized Certainty Equivalents

ICML 2023 · Bandits and online learning › RL theory and MDPs · approach: Average-reward and latent MDPs · 5 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 OCE-VI for learning recursive OCE MDPsTabular episodic MDPs with recursive OCEs · Recursive OCE MDPsregret dependence on episodes and actions: optimal dependence on the number of episodes K and the number of actions A, up to logarithmic factorsHelped
Use the OCE-VI exploration bonus instead of the ICVaR exploration bonusIterated CVaR MDPs · Iterated CVaR MDPs, 0 < α ≤ (3 − √5)/2regret upper bound: improves the result of [cite] by a factor of H^2Helped
Use OCE-VI rather than RSVI2 or RSQ2Entropic-risk MDPs · Randomly generated MDP instancesperformanceMixed
Use a Bernstein-style exploration bonus instead of the current bonus (ablation)OCE-VI · Recursive OCE MDPsregret upper boundNo 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