Skip to content
Preprint

Analytic Planning under Uncertainty with Moment Closure

Aug 2026 · 0 citations · 21 references
Computer Science

TL;DR

This work reduces target variance and yields well-calibrated predictive uncertainty under stochastic observations in continuous control, providing a principled framework for planning with learned distribution models.

Abstract

Effective model-based reinforcement learning in stochastic environments requires planning that accounts for predictive uncertainty. Propagating full state distributions analytically offers a principled way to do this, but has traditionally required restrictive policy or reward structures to remain tractable. Consequently, modern deep reinforcement learning has largely retreated to either stochastic sampling, which introduces significant target variance, or deterministic point estimates that ignore predictive covariance entirely. We investigate whether distribution-aware planning is possible without these constraints. Using a quadratic action-value parameterization, we first reduce the Bellman backup to an expectation over the state-value function alone; the key idea is then a compatibility principle between the predictive transition distribution and the value function class, under which this expectation is analytic in the distribution's moments. We instantiate this principle with a Gaussian transition model paired with a radial-basis value function, yielding a closed-form backup that propagates both predictive mean and covariance. Empirically, our approach reduces target variance and yields well-calibrated predictive uncertainty under stochastic observations in continuous control, providing a principled framework for planning with learned distribution models.

View source

Similar papers

#artificial intelligence Preprint Sep 2026

EPIG-Tree: Compute-Optimal Branching for Gradient-Efficient Reinforcement Learning

Empirically, EPIG reduces gradient MSE in cloned-state control, winning in all nine dense continuous-control environments of a 13-environment sweep and recovering the reference gradient direction near-perfectly, and it improves frozen-LLM gradient calibration relative to entropy branching.

Nikita Khomich, L. Hermansson, Ido Hakimi · 1 citation
Open access Aug 2026

Embodied Learning under Policy and Dynamics Shifts

This work proposes Transition Occupancy Matching as a unifying principle to resolve policy and dynamics shifts within a single mathematical framework and introduces Occupancy-Matching Policy Optimization (OMPO), a novel algorithm that optimizes a surrogate objective explicitly correcting for transition discrepancies.

Yu Luo, Lei Lv, Fu-Chun Sun et al. · 0 citations
#machine learning Preprint Sep 2026

Statistical Convergence of Transformer Encoder-Accelerated Robust Reinforcement Learning

Obtaining the optimal action-value function in Markov decision processes is computationally intensive in large state--action spaces. In this study, we present statistically rigorous convergence results for a robust reinforcement learning algorithm warm-started by a transformer-based action-value function prediction, wh...

Suman Banerjee, Hiroyasu Tsukamoto · 0 citations
#artificial intelligence Conference Sep 2026

Online Robust Reinforcement Learning Through Monte-Carlo Planning

A new robust variant of MCTS that mitigates dynamical model ambiguities to bridge the gap between simulation-based planning and real-world deployment and empirical evidence is provided that this method achieves robust performance in planning problems even under significant ambiguity in the underlying reward distributio...

T. Dam, Kishan Panaganti, Brahim Driss et al. · 5 citations · ⚡1
#machine learning Preprint Sep 2026

Model-based Bootstrap for Offline Policy Evaluation in Tabular Reinforcement Learning

This paper proposes a model-based bootstrap framework for uncertainty quantification of OPE in finite-horizon, time-inhomogeneous Markov decision processes (MDPs), and establishes bootstrap distributional consistency, asymptotically valid confidence intervals, and consistent variance estimation for the target policy va...

Wei-Wei Wang, Yu-Qiang Li, Xian-Yi Wu et al. · 0 citations
#artificial intelligence Preprint Sep 2026

Scalable Rao-Blackwellized Online Planning for High-Dimensional POMDPs

The Rao-Blackwellized online POMDP (RB-POMDP) framework is extended to improve its generalizability in high-dimensional settings through hybrid continuous-discrete belief representations and suggests that structured high-dimensional robotic problems admitting tractable sufficient statistics can be effectively leveraged...

Jiho Lee, Nisar R. Ahmed, Kyle Hollins Wray et al. · 0 citations

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.