Exact and Approximate Moment Derivation for Probabilistic Loops With Non-Polynomial Assignments

Many stochastic continuous-state dynamical systems can be modeled as probabilistic programs with nonlinear non-polynomial updates in non-nested loops. We present two methods, one approximate and one exact, to automatically compute, without sampling, moment-based invariants for such probabilistic programs as closed-form solutions parameterized by the loop iteration. The exact method applies to probabilistic programs with trigonometric and exponential updates and is embedded in the Polar tool. The approximate method for moment computation applies to any nonlinear random function as it exploits the theory of polynomial chaos expansion to approximate non-polynomial updates as the sum of orthogonal polynomials. This translates the dynamical system to a non-nested loop with polynomial updates, and thus renders it conformable with the Polar tool that computes the moments of any order of the state variables. We evaluate our methods on an extensive number of examples ranging from modeling monetary policy to several physical motion systems in uncertain environments. The experimental results demonstrate the advantages of our approach with respect to the current state-of-the-art.
Comment: Published in ACM Transactions on Modeling and Computer Simulation (TOMACS). Extended version of the conference paper 'Moment-based Invariants for Probabilistic Loops with Non-polynomial Assignments' published at QEST 2022 (Best paper award, see also the preprint arxiv.org/abs/2205.02577). arXiv admin note: substantial text overlap with arXiv:2205.02577