Reasoning about Uncertainties in Discrete-Time Dynamical Systems using Polynomial Forms
Sriram Sankaranarayanan, Yi Chou, Eric Goubault, Sylvie Putot
Abstract
In this paper, we propose polynomial forms to represent distributions of state variables over time for discrete-time stochastic dynamical systems. This problem arises in a variety of applications in areas ranging from biology to robotics. Our approach allows us to rigorously represent the probability distribution of state variables over time, and provide guaranteed bounds on the expectations, moments and probabilities of tail events involving the state variables. First, we recall ideas from interval arithmetic, and use them to rigorously represent the state variables at time t as a function of the initial state variables and noise symbols that model the random exogenous inputs encountered before time t. Next, we show how concentration of measure inequalities can be employed to prove rigorous bounds on the tail probabilities of these state variables. We demonstrate interesting applications that demonstrate how our approach can be useful in some situations to establish mathematically guaranteed bounds that are of a different nature from those obtained through simulations with pseudo-random numbers.
Ask Lune
Know this paper in minutes, not an afternoon.
Lune can read every page of it and the top-tier papers that cite it, and gives you its claims, its evidence and its limits, each one cited to the paper it comes from. No skimming, no AI slop.
1 top-tier paper has cited it since. Know what they found before your reviewers do.
Lune can draw on
the full paper · the top-tier papers that cite it · related work
Free to start. No credit card required.
Lineage
Cited by top-tier papers1
Related papers
- Sampling-Based Robust Control of Autonomous Systems with Non-Gaussian NoiseThom S. Badings, Alessandro Abate, Nils Jansen, David Parker et al.AAAI 2022 · 33 citations
- This is the moment for probabilistic loopsMarcel Moosbrugger, Miroslav Stankovic, Ezio Bartocci, Laura KovácsOOPSLA 2022 · 30 citations
- Central moment analysis for cost accumulators in probabilistic programsDi Wang, Jan Hoffmann, Thomas W. RepsPLDI 2021 · 18 citations
- Safely Learning Controlled Stochastic DynamicsLuc Brogat-Motte, Alessandro Rudi, Riccardo BonalliNeurIPS 2025 · 2 citations
- Automated Tail Bound Analysis for Probabilistic Recurrence RelationsYican Sun, Hongfei Fu, Krishnendu Chatterjee, Amir Kafshdar GoharshadyCAV 2023 · 9 citations
