Probabilistic Robustness in Deep Learning: A Concise yet Comprehensive Guide

Xingyu Zhao
2/20/2025
cs.LG

No confident code implementation found for this paper.

Abstract

Deep learning (DL) has demonstrated significant potential across various safety-critical applications, yet ensuring its robustness remains a key challenge. While adversarial robustness has been extensively studied in worst-case scenarios, probabilistic robustness (PR) offers a more practical perspective by quantifying the likelihood of failures under stochastic perturbations. This paper provides a concise yet comprehensive overview of PR, covering its formal definitions, evaluation and enhancement methods. We introduce a reformulated ''min-max'' optimisation framework for adversarial training specifically designed to improve PR. Furthermore, we explore the integration of PR verification evidence into system-level safety assurance, addressing challenges in translating DL model-level robustness to system-level claims. Finally, we highlight open research questions, including benchmarking PR evaluation methods, extending PR to generative AI tasks, and developing rigorous methodologies and case studies for system-level integration.

View on arXivView PDF

Code Implementations

No confident code match yet

We couldn't find an author-owned or strongly-evidenced community implementation for this paper. Any repos shown below are weak matches — verify before relying on them.

No code implementations found yet.

Know of an implementation? Let us know in the comments below!

Similar Papers

Cite this paper

@article{zhao2025probabilistic,
  title  = {Probabilistic Robustness in Deep Learning: A Concise yet Comprehensive Guide},
  author = {Xingyu Zhao},
  year   = {2025},
  eprint = {2502.14833},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2502.14833v2}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2502.14833.svg)](https://codeofpaper.com/paper/2502.14833)

Discussion