Probabilistic Verification and Reachability Analysis of Neural Networks via Semidefinite Programming (Q6326896)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Probabilistic Verification and Reachability Analysis of Neural Networks via Semidefinite Programming |
preprint article from arXiv
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Probabilistic Verification and Reachability Analysis of Neural Networks via Semidefinite Programming |
preprint article from arXiv |
Statements
9 October 2019
0 references
eess.SY
0 references
cs.LG
0 references
cs.SY
0 references
math.OC
0 references
Mahyar Fazlyab
0 references
Manfred Morari
0 references
George J. Pappas
0 references
