arXiv Machine Learning
Bellman Optimality of Average-Reward Robust Markov Decision Processes with a Constant Gain
Read the original on arXiv Machine Learning →The Flow has not summarised this story yet — read it at arXiv Machine Learning.
Related stories
arXiv Machine Learning
Sep 25
Vector Bellman Theory for Multichain Robust Average-Reward Markov Decision Processes
The paper introduces a vector Bellman theory for multichain robust average‑reward Markov decision processes, addressing the state‑dependent optimal long‑run rewards that arise under uncertainty. It develops a gain‑first, bias‑second optimization principle for finite models with compact, post‑action $(s,a)$‑rectangular ambiguity, yielding a coupled vector gain‑bias system and stationary saddle strategies from all initial states. The authors also characterize solvability conditions, provide certificates for asymptotically affine trajectories of the robust Bellman operator, and design a robust approximately shifted Halpern planning algorithm that converges to the optimal gain vector and produces average‑optimal greedy controllers.
arXiv AI
Jul 14
Efficient Q-Learning and Actor-Critic Methods for Robust Average-Reward Reinforcement Learning
arXiv:2506. 07040v4 Announce Type: replace-cross Abstract: We study model-free methods for distributionally robust infinite-horizon average-reward Markov decision processes (MDPs).
arXiv Machine Learning
Jun 9
Bellman Residual Minimization for Control: Geometry, Stationarity, and Convergence
arXiv:2601. 18840v4 Announce Type: replace Abstract: Markov decision problems are most commonly solved via dynamic programming.
arXiv Machine Learning
19h ago
Dissimilarity-Based Markov Decision Processes for Stabilizing State Distributions
arXiv:2610.29024v1 Announce Type: new Abstract: Reinforcement learning for stochastic systems typically optimizes expected cumulative rewards, while reliable and repeatable behavior also depends on h...
arXiv Machine Learning
Jul 7
Entropy Regularization Improves Policy Robustness in Continuous-Time Reinforcement Learning
arXiv:2607. 03168v1 Announce Type: cross Abstract: Entropy regularization is widely used in continuous-time reinforcement learning (RL) to reduce sensitivity to environmental perturbations, yet its robustness benefits lack a rigorous theoretical foundation.
arXiv AI
Jul 1
Reward Redistribution for CVaR MDPs using a Bellman Operator on L-infinity
arXiv:2602. 03778v2 Announce Type: replace-cross Abstract: Tail-end risk measures such as static conditional value-at-risk (CVaR) are used in safety-critical applications to prevent rare, yet catastrophic events.