Bayesian learning for the stochastic shortest path problem

๐Ÿ“… 2026-06-03
๐Ÿ“ˆ Citations: 0
โœจ Influential: 0
๐Ÿ“„ PDF
๐Ÿค– AI Summary
This work addresses the stochastic shortest path (SSP) problemโ€”a class of undiscounted, infinite-horizon Markov decision processes with absorbing statesโ€”by introducing the first Bayesian framework that directly models the posterior distribution over the optimal action-value function $Q^*$. The approach constructs an exact posterior grounded in the Bellman optimality equation, incorporates a manifold density to capture the intrinsic structure of $Q^*$, and analyzes its identifiability under a Gaussian-relaxed likelihood. In the tabular setting, the posterior probability of optimal actions admits an analytical solution. Empirical evaluations demonstrate that the proposed framework accurately quantifies uncertainty and achieves substantially higher data efficiency than existing Bayesian methods based on temporal-difference learning, particularly on variants of the Deep Sea benchmark.
๐Ÿ“ Abstract
Sequential decision-making problems are often modelled as a Markov decision process (MDP). We focus on the stochastic shortest path (SSP) problem, which is an infinite-horizon undiscounted MDP with absorbing terminal states. We develop a Bayesian framework to learn the optimal decision strategy through interactions with the decision-making task. Specifically, we learn the optimal action-value function $Q^*$, but unlike many existing Bayesian approaches, we do not rely on unrealistic modelling assumptions and ad-hoc approximations. Our approach is to directly construct the posterior beliefs for $Q^*$ through Bellman's optimality equations. For deterministic rewards, we characterise the posterior as a distribution with a manifold density. To facilitate simpler inference, we relax the likelihood so that a Lebesgue density exists. The flip side is to create unidentifiability issues. Specifically, the relaxed posterior can have significant mass on improper decision rules, while the exact posterior will not. We also calculate the exact posterior probabilities for optimal action selections for the tabular parametrisation of $Q^*$, a Gaussian likelihood relaxation and a Gaussian prior, which is useful in benchmarking studies. Numerical studies on variants of the Deep Sea benchmark verify our findings. We demonstrate that our framework faithfully quantifies uncertainty and, compared to other temporal-difference-based Bayesian methodologies, is more data efficient. We conclude with recommendations for future work.
Problem

Research questions and friction points this paper is trying to address.

stochastic shortest path
Bayesian learning
Markov decision process
optimal action-value function
sequential decision-making
Innovation

Methods, ideas, or system contributions that make the work stand out.

Bayesian reinforcement learning
stochastic shortest path
Bellman optimality
posterior inference
uncertainty quantification
๐Ÿ”Ž Similar Papers
No similar papers found.
๐Ÿ’ผ Related Jobs
No related jobs found.
C
Chon Wai Ho
Department of Engineering, University of Cambridge, UK
S
Sumeetpal S. Singh
School of Mathematics and Physics, University of Wollongong, Wollongong, Australia
J
Jiaqi Guo
Department of Engineering, University of Cambridge, UK