AI Paper Atlas

Research map / Reinforcement learning / MDPs and planning

Robust Anytime Learning of Markov Decision Processes

NeurIPS 2022 · Reinforcement learning › MDPs and planning · approach: Robust MDP policy gradient · 4 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 LUI instead of UCRL2 for learning the uMDPChain Problem robust policy · Chain Problemtrajectories to recover optimal policy: $10^5$ -> 100Helped
Use uMDP-based robust policies (LUI, PAC, UCRL2) instead of MAP point estimatesUnfavourable Betting Game · Betting Game (win prob 0.2)policy optimality: almost $10^4$ trajectoriesHelped
Vary the prior strength intervals of LUI (ablation)LUI · Grid environmentperformanceNo clear effect
Lower the bounds on the prior strength (ablation)LUI · Chain with environment changeadaptation speedHelped
Use randomized exploration (xi=0.8) instead of none (xi=1.0) (ablation)Exploration policy · Chain environment changeperformance after changeHelped
Use LUI instead of MAP/PAC/UCRL2 when environment changesChain Problem · Chain environment changeconvergence to optimal policy before and after changeHelped

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