Bridging Data-Driven Reachability Analysis and Statistical Estimation via Constrained Matrix Convex Generators
Peng Xie, Zhen Zhang, Rolf Findeisen, Amr Alanwar

TL;DR
This paper introduces a novel approach for data-driven reachability analysis using mixed-norm uncertainty sets and Constrained Convex Generators, resulting in tighter safety verification bounds especially for Gaussian noise.
Contribution
It develops a new geometric framework with matrix convex generators that better fit Gaussian and mixed noise distributions, reducing conservatism in reachability analysis.
Findings
Achieves tighter reachable sets than box-based methods for Gaussian disturbances.
CMC representations coincide with maximum-likelihood confidence ellipsoids for Gaussian noise.
Numerical examples show improved accuracy in safety verification.
Abstract
Data-driven reachability analysis enables safety verification when first-principles models are unavailable. This requires constructing sets of system models consistent with measured trajectories and noise assumptions. Existing approaches rely on zonotopic or box-based approximations, which do not fit the geometry of common noise distributions such as Gaussian disturbances and can lead to significant conservatism, especially in high-dimensional settings. This paper builds on ellipsotope-based representations to introduce mixed-norm uncertainty sets for data-driven reachability. The highest-density region defines the exact minimum-volume noise confidence set, while Constrained Convex Generators (CCG) and their matrix counterpart (CMCG) provide compatible geometric representations at the noise and parameter level. We show that the resulting CMCG coincides with the maximum-likelihood…
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.
