arXiv Analytics

Sign in

arXiv:2102.02273 [math.OC]AbstractReferencesReviewsResources

Stability and performance verification of dynamical systems controlled by neural networks: algorithms and complexity

Milan Korda

Published 2021-02-03Version 1

This note makes two observations on stability and performance verification of nonlinear dynamical systems controlled by neural networks. First, we show that the stability and performance of a polynomial dynamical system controlled by a neural network with semialgebraically representable activation functions (e.g., ReLU) can be certified by convex semidefinite programming. The result is based on the fact that the semialgebraic representation of the activation functions and polynomial dynamics allows one to search for a Lyapunov function using polynomial sum-of-squares methods; the approach can be viewed as a special case of the general framework of [3]. Second, we remark that even in the case of a linear system controlled by a neural network with ReLU activation functions, the problem of verifying asymptotic stability is undecidable.

Related articles: Most relevant | Search more
arXiv:1609.07537 [math.OC] (Published 2016-09-23)
A Tutorial on Distributed (Non-Bayesian) Learning: Problem, Algorithms and Results
arXiv:1011.3781 [math.OC] (Published 2010-11-16, updated 2010-12-22)
Sparse PCA: Convex Relaxations, Algorithms and Applications
arXiv:2106.07795 [math.OC] (Published 2021-06-14)
Interpretation of Plug-and-Play (PnP) algorithms from a different angle