Probabilistic Robustness Analysis in High Dimensional Space: Application to Semantic Segmentation Network
Not on the map. Why?
Abstract (arXiv)
Semantic segmentation networks (SSNs) are central to safety-critical applications such as medical imaging and autonomous driving, where robustness under uncertainty is essential. However, existing probabilistic verification methods often fail to scale with the complexity and dimensionality of modern segmentation tasks, producing guarantees that are overly conservative and of limited practical value. We propose a probabilistic verification framework that is architecture-agnostic and scalable to high-dimensional input-output spaces. Our approach employs conformal inference (CI), enhanced by a novel technique that we call the clipping block, to provide provable guarantees while mitigating the excessive conservatism of prior methods. Experiments on large-scale segmentation models across CamVid, OCTA-500, Lung Segmentation, and Cityscapes demonstrate that our framework delivers reliable safety guarantees while substantially reducing conservatism compared to state-of-the-art approaches on segmentation tasks. We also provide a public GitHub repository (https://github.com/Navidhashemicodes/SSNReachCLPSurrogate) for this approach, to support reproducibility.
Key facts. Cited by 3 papers in the map (data through 14 Oct 2026). Builds on 30 of its 54 references that are in the map. First posted on arXiv 15 Sep 2025.
Builds on
30 of 54 references.
References · 30
- 2014Explaining and Harnessing Adversarial Examplescited by 7,364
- 2017Towards Deep Learning Models Resistant to Adversarial Attackscited by 6,415
- 2016The Cityscapes Dataset for Semantic Urban Scene Understandingcited by 4,444
- 2019Deep High-Resolution Representation Learning for Visual Recognitioncited by 1,420
- 2019Certified Adversarial Robustness via Randomized Smoothingcited by 1,340
- 2016Adversarial Machine Learning at Scalecited by 936
- 2021A Gentle Introduction to Conformal Prediction and Distribution-Free Uncertainty Quantificationcited by 792
- 2019Conformal Prediction Under Covariate Shiftcited by 519
- 2017Adversarial Examples for Semantic Segmentation and Object Detectioncited by 275
- 2020NNV: The Neural Network Verification Tool for Deep Neural Networks and Learning-Enabled Cyber-Physical Systemscited by 128
- 2022Safe Planning in Dynamic Environments using Conformal Predictioncited by 119
- 2018Strong mixed-integer programming formulations for trained neural networkscited by 115
18 more
- 2020Robust Validation: Confident Predictions Even When Distributions Shiftcited by 82
- 2024Marabou 2.0: A Versatile Formal Analyzer of Neural Networkscited by 81
- 2020Verification of Deep Convolutional Neural Networks Using ImageStarscited by 75
- 2024The Fifth International Verification of Neural Networks Competition (VNN-COMP 2024): Summary and Resultscited by 43
- 2023Conformal Prediction Regions for Time Series using Linear Complementarity Programmingcited by 33
- 2024Scalable Neural Network Verification with Branch-and-bound Inferred Cutting Planescited by 33
- 2024Formal Verification and Control with Conformal Predictioncited by 26
- 2023A DPLL(T) Framework for Verifying Deep Neural Networkscited by 24
- 2022GSmooth: Certified Robustness against Semantic Transformations via Generalized Randomized Smoothingcited by 23
- 2023Forking Uncertainties: Reliable Prediction and Model Predictive Control with Sequence Models via Conformal Risk Controlcited by 20
- 2023Enumerating Safe Regions in Deep Neural Networks with Provable Probabilistic Guaranteescited by 19
- 2024Verifiably Robust Conformal Predictioncited by 10
- 2023Data-Driven Reachability Analysis of Stochastic Dynamical Systems with Conformal Inferencecited by 9
- 2017Spinal cord gray matter segmentation using deep dilated convolutionscited by 5
- 2024Statistical Reachability Analysis of Stochastic Cyber-Physical Systems under Distribution Shiftcited by 4
- 2016Computing the Approximate Convex Hull in High Dimensionscited by 3
- 2024Adaptive Hierarchical Certification for Segmentation using Randomized Smoothingcited by 3
- 2020Probabilistic reachable and invariant sets for linear systems with correlated disturbancecited by 2
Built on by
Citing papers per year: 2025: 1; 2026: 2.
3 papers.