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
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 changed | Where | Measured | Effect |
|---|---|---|---|
| Approximate the optimal occupancy measure to epsilon = 1/(16 γ T) instead of exact solve | OMG-CMDP! policy computation · Adversarial CMDP theory | regret bound order | No clear effect |
| Gap between upper bound and lower bound | OMG-CMDP! regret · Adversarial CMDP theory | regret exponent in H: H^2 gap | Hurt |
Closest papers by meaning
- Regret Bounds for Adversarial Contextual Bandits with General Function Approximation and Delayed Feedback (NeurIPS 2025 · similarity 0.91)
- Near-Optimal Dynamic Regret for Adversarial Linear Mixture MDPs (NeurIPS 2024 · similarity 0.90)
- Beating Adversarial Low-Rank MDPs with Unknown Transition and Bandit Feedback (NeurIPS 2024 · similarity 0.90)
- Towards Optimal Regret in Adversarial Linear MDPs with Bandit Feedback (ICLR 2024 · similarity 0.89)
- Dynamic Regret of Adversarial MDPs with Unknown Transition and Linear Function Approximation (AAAI 2024 · similarity 0.89)
- Learning Adversarial MDPs with Stochastic Hard Constraints (ICML 2025 · similarity 0.89)
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.
