Fixed Points of the Set-Based Bellman Operator
Sarah H.Q. Li, Assal\'e Adj\'e, Pierre-Lo\"ic Garoche, Beh\c{c}et, A\c{c}{\i}kme\c{s}e

TL;DR
This paper introduces a set-based Bellman operator for MDPs with uncertain cost parameters, proving the existence of a fixed point using contraction mapping principles, which enhances understanding of robustness in decision processes.
Contribution
It defines a novel set-based Bellman operator for MDPs with parameter uncertainty and proves its fixed point existence, extending classical Bellman operator theory.
Findings
Fixed point of the set-based Bellman operator exists.
The operator is shown to be contractive on a complete metric space.
Provides theoretical foundation for robust MDP solutions.
Abstract
Motivated by uncertain parameters encountered in Markov decision processes (MDPs), we study the effect of parameter uncertainty on Bellman operator-based methods. Specifically, we consider a family of MDPs where the cost parameters are from a given compact set. We then define a Bellman operator acting on an input set of value functions to produce a new set of value functions as the output under all possible variations in the cost parameters. Finally we prove the existence of a fixed point of this set-based Bellman operator by showing that it is a contractive operator on a complete metric space.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Control Systems Optimization · Fuzzy Systems and Optimization · Reinforcement Learning in Robotics
