AI Paper Atlas

Research map / Reinforcement learning / MDPs and planning

Non-Stationary Markov Decision Processes, a Worst-Case Approach using Model-Based Reinforcement Learning

NeurIPS 2019 · Reinforcement learning › MDPs and planning · approach: Average-reward and regularized MDPs · 22 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
Plan against the worst-case evolution allowed by Lipschitz bounds instead of optimizing for the current snapshotRATS · Non-Stationary bridgeCVaR at 5%Helped
Plan against worst-case evolution rather than the current snapshotRATS · Non-Stationary bridge across ε valuesdiscounted returnMixed
Optimize expected return under the current snapshot rather than account for future model evolutionDP-snapshot · Non-Stationary bridge across ε valuesdiscounted returnMixed
Use expected-return optimization with access to the true NSMDP model instead of a worst-case objectiveDP-NSMDP · Non-Stationary bridgeCVaR at 5%Hurt

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