Chordal sparsity for SDP-based neural network verification

DOI10.1016/j.automatica.2023.111487arXiv2206.03482WikidataQ129670532 ScholiaQ129670532MaRDI QIDQ6119748

Lars Lindemann, Anton Xue, Rajeev Alur

Publication date: 20 February 2024

Published in: Automatica (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2206.03482

zbMATH Keywords

convex optimizationneural networkssafety verification

Mathematics Subject Classification ID

Artificial neural networks and deep learning (68T07) Convex programming (90C25)

Cites Work

• Unnamed Item
• Positive semidefinite matrices with a given sparsity pattern
• Reluplex: an efficient SMT solver for verifying deep neural networks
• Julia: A Fresh Approach to Numerical Computing
• Pre- and Post-Processing Sum-of-Squares Programs in Practice
• On the existence of convex decompositions of partially separable functions
• JuMP: A Modeling Language for Mathematical Optimization

This page was built for publication: Chordal sparsity for SDP-based neural network verification