(Un)supervised Learning of Maximal Lyapunov Functions
Matthieu Barreau, Nicola Bastianello
TL;DR
The paper tackles the problem of identifying the region of attraction for nonlinear dynamical systems by learning a maximal Lyapunov function $V^*$ that certifies stability. It introduces Taylor-Neural Lyapunov functions, a neural architecture that blends a local quadratic form with neural residuals modeling higher-order Taylor terms, and trains them through physics-informed unsupervised learning, with a primal-dual algorithm and boundary-estimation techniques. A universal approximation theorem is established for the architecture, and a supervised variant incorporating simulator data is also developed. Across multiple dynamical scenarios including high-dimensional and stiff systems, the method yields ROA estimates that match or surpass state-of-the-art approaches, demonstrating robustness to initialization and scalability to complex dynamics.
Abstract
In this paper, we address the problem of discovering maximal Lyapunov functions, as a means of determining the region of attraction of a dynamical system. To this end, we design a novel neural network architecture, which we prove to be a universal approximator of (maximal) Lyapunov functions. The architecture combines a local quadratic approximation with the output of a neural network, which models global higher-order terms in the Taylor expansion. We formulate the problem of training the Lyapunov function as an unsupervised optimization problem with dynamical constraints, which can be solved leveraging techniques from physics-informed learning. We propose and analyze a tailored training algorithm, based on the primal-dual algorithm, that can efficiently solve the problem. Additionally, we show how the learning problem formulation can be adapted to integrate data, when available. We apply the proposed approach to different classes of systems, showing that it matches or outperforms state-of-the-art alternatives in the accuracy of the approximated regions of attraction.
