In this article, we present algorithms for estimating the forward reachable set of a dynamical system using only a finite collection of independent and identically distributed samples. The produced estimate is the sublevel set of a function called an empirical inverse Christoffel function: empirical inverse Christoffel functions are known to provide good approximations to the support of probability distributions. In addition to reachability analysis, the same approach can be applied to general problems of estimating the support of a random variable, which has applications in data science toward the detection of novelties and outliers in datasets. In applications where safety is a concern, having a guarantee of accuracy that holds on finite datasets is critical. In this article, we prove such bounds for our algorithms under the probably approximately correct (PAC) framework. In addition to applying classical Vapnik–Chervonenkis dimension bound arguments, we apply the PAC-Bayes theorem by leveraging a formal connection between kernelized empirical inverse Christoffel functions and Gaussian process regression models.
No takes yet. Share an insight, caveat, or question.
Devonport et al. (2023) studied this question.
Synapse has enriched 5 related papers. Consider them for comparative context: