View a PDF of the paper titled Sequential Monte Carlo for Policy Optimization in Continuous POMDPs, by Hany Abdulsamad and 2 other authors
View PDF
Abstract:Optimal decision-making under partial observability requires agents to balance reducing uncertainty (exploration) against pursuing immediate objectives (exploitation). In this paper, we introduce a novel policy optimization framework for continuous partially observable Markov decision processes (POMDPs) that explicitly addresses this challenge. Our method casts policy learning as probabilistic inference in a non-Markovian Feynman–Kac model that inherently captures the value of information gathering by anticipating future observations, without requiring suboptimal approximations or handcrafted heuristics. To optimize policies under this model, we develop a nested sequential Monte Carlo (SMC) algorithm that efficiently estimates a history-dependent policy gradient under samples from the optimal trajectory distribution induced by the POMDP. We demonstrate the effectiveness of our algorithm across standard continuous POMDP benchmarks, where existing methods struggle to act under uncertainty.
Submission history
From: Hany Abdulsamad [view email]
[v1]
Thu, 22 May 2025 14:45:46 UTC (152 KB)
[v2]
Fri, 10 Oct 2025 07:59:49 UTC (141 KB)
[v3]
Thu, 4 Dec 2025 03:08:20 UTC (219 KB)


![[2505.16732] Sequential Monte Carlo for Policy Optimization in Continuous POMDPs Measuring Intelligence Efficiency of Local AI](https://skytik.cc/wp-content/uploads/2025/11/Measuring-Intelligence-Efficiency-of-Local-AI-768x448.png)