Data-Driven Reachability Analysis of Stochastic Dynamical Systems with Conformal Inference
Reviewed by Pith T0 review T1 audit T2 compute T3 formal T4 kernel pith:IWDJTBNFrecord.jsonopen to challenge →
read the original abstract
We consider data-driven reachability analysis of discrete-time stochastic dynamical systems using conformal inference. We assume that we are not provided with a symbolic representation of the stochastic system, but instead have access to a dataset of $K$-step trajectories. The reachability problem is to construct a probabilistic flowpipe such that the probability that a $K$-step trajectory can violate the bounds of the flowpipe does not exceed a user-specified failure probability threshold. The key ideas in this paper are: (1) to learn a surrogate predictor model from data, (2) to perform reachability analysis using the surrogate model, and (3) to quantify the surrogate model's incurred error using conformal inference in order to give probabilistic reachability guarantees. We focus on learning-enabled control systems with complex closed-loop dynamics that are difficult to model symbolically, but where state transition pairs can be queried, e.g., using a simulator. We demonstrate the applicability of our method on examples from the domain of learning-enabled cyber-physical systems.
This paper has not been read by Pith yet.
Forward citations
Cited by 1 Pith paper
-
Statistical-Symbolic Verification of Perception-Based Autonomous Systems using State-Dependent Conformal Prediction
State-dependent conformal prediction with genetic-algorithm state partitioning and branch-merging reachability produces tighter high-confidence perception-error bounds for scalable verification of neurally controlled ...
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.