Probabilistic Lipschitz analysis of neural networks
From MaRDI portal
Publication:2233541
DOI10.1007/978-3-030-65474-0_13zbMath1474.68155OpenAlexW3119781287MaRDI QIDQ2233541
Ravi Mangal, Alessandro Orso, Kartik Sarangmath, Aditya V. Nori
Publication date: 18 October 2021
Full work available at URL: https://doi.org/10.1007/978-3-030-65474-0_13
Theory of programming languages (68N15) Semantics in the theory of computing (68Q55) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30) Networks and circuits as models of computation; circuit complexity (68Q06)
Related Items (1)
Cites Work
- A geometric inequality and the complexity of computing volume
- Computing the volume is difficult
- Reluplex: an efficient SMT solver for verifying deep neural networks
- An assertion-based program logic for probabilistic programs
- Probabilistic Abstract Interpretation
- APLicative Programming with Naperian Functors
- Simple relational correctness proofs for static analyses and program transformations
- On the Complexity of Computing the Volume of a Polyhedron
- Proving the Correctness of Multiprocess Programs
- A random polynomial-time algorithm for approximating the volume of convex bodies
- Gaussian Cooling and $O^*(n^3)$ Algorithms for Volume and Gaussian Volume
- Synthesizing Probabilistic Invariants via Doob’s Decomposition
- Linear-Invariant Generation for Probabilistic Programs:
- An Array-Oriented Language with Static Rank Polymorphism
This page was built for publication: Probabilistic Lipschitz analysis of neural networks
