AI Paper Atlas

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

Efficient Rate Optimal Regret for Adversarial Contextual MDPs Using Online Function Approximation

Orin Levy, Alon Cohen, Asaf Cassel, Yishay Mansour

ICML 2023 · Bandits and online learning › RL theory and MDPs · approach: Regret bounds with function approximation · 0 citations (OpenAlex)

Read the paperCheck your idea against 137,217 papers

AI-extracted. The measured effects below were read by AI from the paper's full text (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
Approximate the optimal occupancy measure to epsilon = 1/(16 γ T) instead of exact solveOMG-CMDP! policy computation · Adversarial CMDP theoryregret bound orderNo clear effect
Gap between upper bound and lower boundOMG-CMDP! regret · Adversarial CMDP theoryregret exponent in H: H^2 gapHurt

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