mlsanityData to 14 Oct 2026

ESCORT: Efficient Stein-variational and Sliced Consistency-Optimized Temporal Belief Representation for POMDPs

arXiv 2510.21107 ↗First posted 24 Oct 2025cs.LG cs.AI cs.ROcited by 1

Not on the map. Why?

Abstract (arXiv)

In Partially Observable Markov Decision Processes (POMDPs), maintaining and updating belief distributions over possible underlying states provides a principled way to summarize action-observation history for effective decision-making under uncertainty. As environments grow more realistic, belief distributions develop complexity that standard mathematical models cannot accurately capture, creating a fundamental challenge in maintaining representational accuracy. Despite advances in deep learning and probabilistic modeling, existing POMDP belief approximation methods fail to accurately represent complex uncertainty structures such as high-dimensional, multi-modal belief distributions, resulting in estimation errors that lead to suboptimal agent behaviors. To address this challenge, we present ESCORT (Efficient Stein-variational and sliced Consistency-Optimized Representation for Temporal beliefs), a particle-based framework for capturing complex, multi-modal distributions in high-dimensional belief spaces. ESCORT extends SVGD with two key innovations: correlation-aware projections that model dependencies between state dimensions, and temporal consistency constraints that stabilize updates while preserving correlation structures. This approach retains SVGD's attractive-repulsive particle dynamics while enabling accurate modeling of intricate correlation patterns. Unlike particle filters prone to degeneracy or parametric methods with fixed representational capacity, ESCORT dynamically adapts to belief landscape complexity without resampling or restrictive distributional assumptions. We demonstrate ESCORT's effectiveness through extensive evaluations on both POMDP domains and synthetic multi-modal distributions of varying dimensionality, where it consistently outperforms state-of-the-art methods in terms of belief approximation accuracy and downstream decision quality.

Key facts. Cited by 1 paper in the map (data through 14 Oct 2026). Builds on 21 of its 41 references that are in the map. First posted on arXiv 24 Oct 2025.

Builds on

21 of 41 references.

References · 21

  1. 2013Auto-Encoding Variational Bayescited by 4,053
  2. 2016Understanding deep learning requires rethinking generalizationcited by 1,674
  3. 2015Deep Recurrent Q-Learning for Partially Observable MDPscited by 465
  4. 2017Revisiting the Arcade Learning Environment: Evaluation Protocols and Open Problems for General Agentscited by 269
  5. 2019Generalized Sliced Wasserstein Distancescited by 208
  6. 2017Stein Variational Gradient Descent as Gradient Flowcited by 152
  7. 2018Deep Variational Reinforcement Learning for POMDPscited by 125
  8. 2016DESPOT: Online POMDP Planning with Regularizationcited by 106
  9. 2022Partially Observable Markov Decision Processes in Robotics: A Surveycited by 86
  10. 2017Online algorithms for POMDPs with continuous state, action, and observation spacescited by 84
  11. 2018On Improving Deep Reinforcement Learning for POMDPscited by 50
  12. 2021Partially Observable Markov Decision Processes (POMDPs) and Roboticscited by 49
9 more
  1. 2017Message Passing Stein Variational Gradient Descentcited by 47
  2. 2020Projected Stein Variational Gradient Descentcited by 33
  3. 2020Discriminative Particle Filter Reinforcement Learning for Complex Partial Observationscited by 28
  4. 2013Tractable Inference for Complex Stochastic Processescited by 20
  5. 2022Flow-based Recurrent Belief State Learning for POMDPscited by 16
  6. 2013Fighting Sample Degeneracy and Impoverishment in Particle Filters: A Review of Intelligent Approachescited by 7
  7. 2024Shrinking POMCP: A Framework for Real-Time UAV Search and Rescuecited by 2
  8. 2025Observation Adaptation via Annealed Importance Resampling for Partially Observable Markov Decision Processescited by 2
  9. 2017Stein Variational Message Passing for Continuous Graphical Modelscited by 1

Built on by

Cited by year (2026 to 14 Oct)

Citing papers per year: 2026: 1.

1 paper.