Partially Observed Optimal Stochastic Control: Regularity, Optimality, Approximations, and Learning
Not on the map. Why?
Abstract (arXiv)
In this review/tutorial article, we present recent progress on optimal control of partially observed Markov Decision Processes (POMDPs). We first present regularity and continuity conditions for POMDPs and their belief-MDP reductions, where these constitute weak Feller and Wasserstein regularity and controlled filter stability. These are then utilized to arrive at existence results on optimal policies for both discounted and average cost problems, and regularity of value functions. Then, we study rigorous approximation results involving quantization based finite model approximations as well as finite window approximations under controlled filter stability. Finally, we present several recent reinforcement learning theoretic results which rigorously establish convergence to near optimality under both criteria.
Key facts. Cited by 2 papers in the map (data through 14 Oct 2026). First posted on arXiv 9 Dec 2024.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2025: 1; 2026: 1.
2 papers.
Similar, not cited
Close in wording, no citation either way
- 2024Near Optimal Approximations and Finite Memory Policies for POMPDs with Continuous Spaces ↗
- 2023Q-Learning for Stochastic Control under General Information Structures and Non-Markovian Environments
- 2025Learning POMDPs with Linear Function Approximation and Finite Memory
- 2021Q-Learning for MDPs with General Spaces: Convergence and Near Optimality via Quantization under Weak Continuity
- 2024Refined Bounds on Near Optimality Finite Window Policies in POMDPs and Their Reinforcement Learning
- 2026Reinforcement Learning with Function Approximation for Non-Markov Processes
- 2025Scalable Policy-Based RL Algorithms for POMDPs
- 2026Reinforcement Learning for Discounted and Ergodic Control of Diffusion Processes