Robust Markov Decision Processes 2: The Affine Reward-to-Go Semidefinite Program Is Exact for One Quadratic Constraint and Conservative for SeveralResearch Paper
A Markov decision process (MDP) evaluates a policy by its expected discounted reward, which requires the transition probabilities. In practice these are estimated from data, and the optimal policy of the estimated model can perform badly under the true kernel. Robust MDPs replace the kernel by an ambiguity set of kernels and judge a policy by its worst-case…