AI Paper Atlas

Research map / Reinforcement learning / MDPs and planning

Robust Average-Reward Markov Decision Processes

AAAI 2023 · Reinforcement learning › MDPs and planning · approach: Robust MDP policy gradient · 6 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 robust methods instead of non-robust value iterationValue iteration on Garnet problem G(20,40) · Garnet problem, contamination model (R=0.4)robust average-rewardHelped
Use robust methods instead of non-robust value iterationValue iteration on Garnet problem G(20,40) · Garnet problem, total variation model (R=0.6)robust average-rewardHelped
Use robust methods instead of non-robust value iterationValue iteration on Garnet problem G(20,40) · Garnet problem, KL-divergence model (R=0.8)robust average-rewardHelped
Use limit-based robust value iteration or direct robust relative value iterationRobust average-reward optimal control · Garnet problem, contamination, total variation, and KL-divergence modelsrobust average-rewardNo 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