Data-driven reachability analysis computes over-approximations of reachable sets directly from noisy data. Existing deterministic methods require either known noise bounds or system-specific structural parameters such as Lipschitz constants. We propose Conformalized Data-Driven Reachability (CDDR), a framework that provides Probably Approximately Correct (PAC) coverage guarantees through the Learn Then Test (LTT) calibration procedure, requiring only that calibration and test trajectories be independently and identically distributed. CDDR is developed for three settings: linear time-invariant (LTI) systems with unknown process noise distributions, LTI systems with bounded measurement noise, and general nonlinear systems including non-Lipschitz dynamics. Experiments on a 5-dimensional LTI system under Gaussian and heavy-tailed Student-t noise and on a 2-dimensional non-Lipschitz system with fractional damping demonstrate that CDDR achieves valid coverage where deterministic methods do not provide formal guarantees. Under anisotropic noise, a normalized score function reduces the reachable set volume while preserving the PAC guarantee.
@article{arxiv.2603.12220,
title = {Conformalized Data-Driven Reachability Analysis with PAC Guarantees},
author = {Yanliang Huang and Zhen Zhang and Peng Xie and Zhuoqi Zeng and Amr Alanwar},
journal= {arXiv preprint arXiv:2603.12220},
year = {2026}
}
Comments
Submitted to IEEE Control Systems Letters (L-CSS) with IEEE Conference on Decision and Control (CDC), 6 pages, 3 figures, 3 tables