paper-with-me

홈 › Papers

Learning Markov Processes as Sum-of-Square Forms for Analytical Belief Propagation

2026-04-08 · Peter Amorese, Morteza Lahijanian arxiv

Harnessing the predictive capability of Markov process models requires propagating probability density functions (beliefs) through the model. For many existing models however, belief propagation is analytically infeasible, requiring approximation or sampling to generate predictions. This paper proposes a functional modeling framework leveraging sparse Sum-of-Squares (SoS) forms for valid (conditional) density estimation. We study the theoretical restrictions of modeling conditional densities using the SoS form, and propose a novel functional form for addressing such limitations. The proposed architecture enables generalized simultaneous learning of basis functions and coefficients, while preserving analytical belief propagation. In addition, we propose a training method that allows for exact adherence to the normalization and non-negativity constraints. Our results show that the proposed method achieves accuracy comparable to state-of-the-art approaches while requiring significantly less memory in low-dimensional spaces, and it further scales to 12D systems when existing methods fail beyond 2D.

📄 PDF Abstract BibTeX arXiv:2604.07525

Code (0)

등록된 구현이 없습니다.

Tasks

Density Estimation

Similar Papers 제목 키워드 기반

Improving Training Result of Partially Observable Markov Decision Process by Filtering Beliefs

2021-01-05 · Oscar LiJen Hsu

In this study I proposed a filtering beliefs method for improving performance of Partially Observable Markov Decision Processes(POMDPs), which is a method wildly used in autonomous robot and many other domains concerning…

Analytical Results for the Error in Filtering of Gaussian Processes

2011-12-01 · NeurIPS 2011 12 · Alex K. Susemihl, Ron Meir, Manfred Opper

Bayesian filtering of stochastic stimuli has received a great deal of attention re- cently. It has been applied to describe the way in which biological systems dy- namically represent and make decisions about the environ…

DecoderGaussian ProcessesPoint ProcessesState Estimation

Spike train entropy-rate estimation using hierarchical Dirichlet process priors

2013-12-01 · NeurIPS 2013 12 · Karin C. Knudson, Jonathan W. Pillow

Entropy rate quantifies the amount of disorder in a stochastic process. For spiking neurons, the entropy rate places an upper bound on the rate at which the spike train can convey stimulus information, and a large liter…

Finite Memory Belief Approximation for Optimal Control in Partially Observable Markov Decision Processes

2026-01-06 · Mintae Kim arxiv

We study finite memory belief approximation for partially observable (PO) stochastic optimal control (SOC) problems. While belief states are sufficient for SOC in partially observable Markov decision processes (POMDPs), …

Perseus: Randomized Point-based Value Iteration for POMDPs

2011-09-09 · M. T. J. Spaan, N. Vlassis

Partially observable Markov decision processes (POMDPs) form an attractive and principled framework for agent planning under uncertainty. Point-based approximate techniques for POMDPs compute a policy based on a finite s…