%AFazlyab, Mahyar%AMorari, Manfred%APappas, George%D2021%I %K %MOSTI ID: 10331594 %PMedium: X %TAn Introduction to Neural Network Analysis via Semidefinite Programming %XNeural networks have become increasingly effective at many difficult machine learning tasks. However, the nonlinear and large-scale nature of neural networks makes them hard to analyze, and, therefore, they are mostly used as blackbox models without formal guarantees. This issue becomes even more complicated when neural networks are used in learning-enabled closed-loop systems, where a small perturbation can substantially impact the system being controlled. Therefore, it is of utmost importance to develop tools that can provide useful certificates of stability, safety, and robustness for neural network-driven systems.In this overview, we present a convex optimization framework for the analysis of neural networks. The main idea is to abstract hard-to-analyze components of a neural network (e.g., the nonlinear activation functions) with the formalism of quadratic constraints. This abstraction allows us to reason about various properties of neural networks (safety, robustness, generalization, stability in closed-loop settings, etc.) via semidefinite programming. Country unknown/Code not availablehttps://doi.org/10.1109/CDC45484.2021.9683096OSTI-MSA