Memory-dependent abstractions of stochastic systems through the lens of transfer operators
Adrien Banse, Giannis Delimpaltadakis, Luca Laurenti, Manuel Mazo Jr., Rapha\"el M. Jungers

TL;DR
This paper introduces memory-dependent abstractions for stochastic systems using transfer operators, enabling more accurate modeling of systems with memory effects and providing bounds on approximation errors.
Contribution
It presents a formalism for memory-dependent abstractions based on transfer operators and quantifies the approximation error with total variation bounds.
Findings
Memory-dependent abstractions capture non-Markovian dynamics.
Upper bounds on approximation errors are established.
The approach improves the fidelity of finite-state models of stochastic systems.
Abstract
With the increasing ubiquity of safety-critical autonomous systems operating in uncertain environments, there is a need for mathematical methods for formal verification of stochastic models. Towards formally verifying properties of stochastic systems, methods based on discrete, finite Markov approximations -- abstractions -- thereof have surged in recent years. These are found in contexts where: either a) one only has partial, discrete observations of the underlying continuous stochastic process, or b) the original system is too complex to analyze, so one partitions the continuous state-space of the original system to construct a handleable, finite-state model thereof. In both cases, the abstraction is an approximation of the discrete stochastic process that arises precisely from the discretization of the underlying continuous process. The fact that the abstraction is Markov and the…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsNeural Networks and Applications
