AI Paper Atlas

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

Online Convex Optimization in Adversarial Markov Decision Processes

ICML 2019 · Bandits and online learning › RL theory and MDPs · approach: Adversarial MDPs with bandit feedback · 42 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 UC-O-REPS with entropic online mirror descent and confidence sets for unknown transitionsepisodic loop-free adversarial MDPs · Convexly-measurable performance criteriaregret upper bound: 15 F L|X| \sqrt{T |A|\ln{\frac{T|X||A|}{\delta}}}Helped
Use UC-O-REPS instead of the prior adversarial-MDP boundadversarial MDPs with unknown transitions · Expected average lossregret upper bound: \tilde{O}(L|X||A|\sqrt{T}) to achieve \tilde{O}(L|X|\sqrt{|A|T})Helped
Extend the criterion beyond total expected loss to convex performance criteriaUC-O-REPS · Convex performance criteria, including risk-sensitive and robust objectivesregret guaranteeHelped
Combine online mirror descent with UCRL-2-style confidence setsUC-O-REPS · Unknown-transition adversarial MDPsregret upper bound: \tilde{O}(L|X|\sqrt{|A|T})Helped

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