Robust MDPs can be solved generically with implicit value iteration that provides anytime precision guarantees for many uncertainty sets, including L2 balls.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.AI 1years
2024 1verdicts
REJECT 1representative citing papers
citing papers explorer
-
Solving Robust Markov Decision Processes: Generic, Reliable, Efficient
Robust MDPs can be solved generically with implicit value iteration that provides anytime precision guarantees for many uncertainty sets, including L2 balls.