Data-driven Reachable Set Estimation with Tunable Adversarial and Wasserstein Distributional Guarantees

• URL: http://arxiv.org/abs/2604.12654v1
• Date: Tue, 14 Apr 2026 12:23:14 GMT
• Title: Data-driven Reachable Set Estimation with Tunable Adversarial and Wasserstein Distributional Guarantees
• Abstract summary: We study finite horizon reachable set estimation for unknown discrete-time dynamical systems using only sampled state trajectories.<n>We show how it can be tailored to reachable set estimation, where one must learn a family of sets based on whole trajectories.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: We study finite horizon reachable set estimation for unknown discrete-time dynamical systems using only sampled state trajectories. Rather than treating scenario optimization as a black-box tool, we show how it can be tailored to reachable set estimation, where one must learn a family of sets based on whole trajectories, while preserving probabilistic guarantees on future trajectory inclusion for the entire horizon. To this end, we formulate a relaxed scenario program with slack variables that yields a tunable trade-off between reachable set size and out-of-sample trajectory inclusion over the horizon, thereby reducing sensitivity to outliers. Leveraging the recent results in adversarially robust scenario optimization, we then extend this formulation to account for bounded adversarial perturbations of the observed trajectories and derive a posteriori probabilistic guarantees on future trajectory inclusion. When probability distribution shifts in the Wasserstein distance occur, we obtain an explicit bound on how gracefully the theoretical probabilistic guarantees degrade. For different geometries, i.e., $p$-norm balls, ellipsoids, and zonotopes, we derive tractable convex reformulations and corroborate our theoretical results in simulation.

Related papers

• Active Timepoint Selection for Learning Measure-Valued Trajectories [55.49809248697036]
  Inferring continuous probability paths from snapshots is a fundamental challenge in domains like single-cell biology.<n>We introduce a framework which extends active experimentation to the space of sparse measures.<n>This yields an acquisition policy that iteratively selects measurement times to minimize uncertainty.
  arXiv  Detail & Related papers  (2026-05-28T22:22:35Z)
• Statistical Contraction for Chance-Constrained Trajectory Optimization of Non-Gaussian Stochastic Systems [0.0]
  Our framework employs conformal inference to generate confidence sets for the closed-loop dynamics around arbitrary reference trajectories.<n>Via appropriate constraint tightening, chance constraints can be reformulated into tractable, statistically valid deterministic constraints on the reference trajectories.<n>This enables a formal pathway to leverage and validate learning-based motion planners and controllers, such as those with neural contraction metrics, in safety-critical real-world applications.
  arXiv  Detail & Related papers  (2026-03-07T08:01:20Z)
• Flow-Based Conformal Predictive Distributions [1.2691047660244335]
  We show that a differentiable nonconformity score induces a deterministic flow on the output space whose trajectories converge to the boundary of the corresponding conformal prediction set.<n>This leads to a computationally efficient, training-free method for sampling conformal boundaries in arbitrary dimensions.<n>We evaluate the approach on PDE inverse problems, precipitation downscaling, climate model debiasing, and hurricane trajectory forecasting.
  arXiv  Detail & Related papers  (2026-02-07T17:26:50Z)
• Adaptive Conformal Prediction Intervals Over Trajectory Ensembles [50.31074512684758]
  Future trajectories play an important role across domains such as autonomous driving, hurricane forecasting, and epidemic modeling.<n>We propose a unified framework based on conformal prediction that transforms sampled trajectories into calibrated prediction intervals with theoretical coverage guarantees.
  arXiv  Detail & Related papers  (2025-08-18T21:14:07Z)
• Probabilistic Conformal Prediction with Approximate Conditional Validity [81.30551968980143]
  We develop a new method for generating prediction sets that combines the flexibility of conformal methods with an estimate of the conditional distribution. Our method consistently outperforms existing approaches in terms of conditional coverage.
  arXiv  Detail & Related papers  (2024-07-01T20:44:48Z)
• Probabilistic Forecasting with Stochastic Interpolants and Föllmer Processes [18.344934424278048]
  We propose a framework for probabilistic forecasting of dynamical systems based on generative modeling. We show that the drift and the diffusion coefficients of this SDE can be adjusted after training, and that a specific choice that minimizes the impact of the estimation error gives a F"ollmer process.
  arXiv  Detail & Related papers  (2024-03-20T16:33:06Z)
• Uncertainty estimation of pedestrian future trajectory using Bayesian approximation [137.00426219455116]
  Under dynamic traffic scenarios, planning based on deterministic predictions is not trustworthy. The authors propose to quantify uncertainty during forecasting using approximation which deterministic approaches fail to capture. The effect of dropout weights and long-term prediction on future state uncertainty has been studied.
  arXiv  Detail & Related papers  (2022-05-04T04:23:38Z)
• Distributional Gradient Boosting Machines [77.34726150561087]
  Our framework is based on XGBoost and LightGBM. We show that our framework achieves state-of-the-art forecast accuracy.
  arXiv  Detail & Related papers  (2022-04-02T06:32:19Z)
• Multivariate Probabilistic Regression with Natural Gradient Boosting [63.58097881421937]
  We propose a Natural Gradient Boosting (NGBoost) approach based on nonparametrically modeling the conditional parameters of the multivariate predictive distribution. Our method is robust, works out-of-the-box without extensive tuning, is modular with respect to the assumed target distribution, and performs competitively in comparison to existing approaches.
  arXiv  Detail & Related papers  (2021-06-07T17:44:49Z)
• Online Stochastic Convex Optimization: Wasserstein Distance Variation [15.313864176694832]
  We consider an online proximal-gradient method to track the minimizers of expectations of smooth convex functions. We revisit the concepts of estimation and tracking error inspired by systems and control literature. We provide bounds for them under strong convexity, Lipschitzness of the gradient, and bounds on the probability distribution drift.
  arXiv  Detail & Related papers  (2020-06-02T05:23:22Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.