Analysis of Lurie systems for learning and control
Analysis of Lurie systems for learning and control
Due to the remarkable success of deep learning in a wide variety of applications, neural networks (NNs) are increasingly being adopted to model and control dynamical systems. When controlling dynamical systems, it is key to provide robust guarantees of the system's behaviour, especially in safety-critical applications. However, efficiently verifying such safety and robustness properties for systems involving NNs is challenging, due to the presence and large number of activation functions inside the NN. Furthermore, it is vital to learn robust and generalisable models of dynamical systems, to deal with noise and the, potentially, large space of initial conditions. This is particularly difficult since learning generic, high-dimensional functions is a cursed estimation problem.
This thesis focuses on the forced Lurie system as a general modelling framework which, amongst others, captures many systems involving NNs as special cases. Examples include recurrent neural networks, neural oscillators, and the interconnection of a linear time invariant system with a feed-forward NN. The analysis of Lurie systems has been well-studied in the control theory literature, with the absolute stability problem being a pertinent example. This thesis builds upon this rich literature to develop less conservative stability criteria for Lurie systems involving NNs and to exploit known properties for constructing robust and generalisable models of convergent dynamical systems.
The first contribution develops less conservative stability criteria for Lurie systems, involving NNs with only ReLU activations. Properties of the ReLU function are leveraged to construct tailored quadratic constraints which are incorporated in the stability criteria, posed as semidefinite programs, via the S-procedure. Both continuous and discrete-time cases are examined. The second contribution repeats the same steps for Lurie systems with magnitude nonlinearities. This is a generalisation of the first contribution since a loop transformation between the magnitude and (leaky) ReLU is shown to exist, meaning the stability of Lurie systems involving ReLU or leaky ReLU activations can be verified. Numerical examples highlight the reduced conservatism, particularly for high-dimensional systems.
The final contribution proposes the k-contracting Lurie network (LN) as a robust and generalisable model of convergent dynamical systems. The absolute stability framework is used to establish conditions which guarantee the LN is k-contracting for all slope-restricted nonlinearities. Unconstrained parametrisations of these conditions are then established to restrict training to only search over LNs satisfying the k-contraction property. When tested on dynamical systems datasets involving multiple equilibrium points and limit cycles, the k-contracting LN is an order of magnitude more accurate than existing models, when initial conditions are sampled outside the training distribution and subjected to additive noise.
Stability analysis, Lurie systems, Lyapunov methods, Contraction analysis, Nonlinear systems, System identification, Machine learning, Neural network, semi-definite programming
University of Southampton
Richardson, Carl Robert
3406b6af-f00d-410b-8051-a0ecc27baba5
April 2026
Richardson, Carl Robert
3406b6af-f00d-410b-8051-a0ecc27baba5
Turner, Matthew
6befa01e-0045-4806-9c91-a107c53acba0
Gunn, Steve
306af9b3-a7fa-4381-baf9-5d6a6ec89868
Richardson, Carl Robert
(2026)
Analysis of Lurie systems for learning and control.
University of Southampton, Doctoral Thesis, 173pp.
Record type:
Thesis
(Doctoral)
Abstract
Due to the remarkable success of deep learning in a wide variety of applications, neural networks (NNs) are increasingly being adopted to model and control dynamical systems. When controlling dynamical systems, it is key to provide robust guarantees of the system's behaviour, especially in safety-critical applications. However, efficiently verifying such safety and robustness properties for systems involving NNs is challenging, due to the presence and large number of activation functions inside the NN. Furthermore, it is vital to learn robust and generalisable models of dynamical systems, to deal with noise and the, potentially, large space of initial conditions. This is particularly difficult since learning generic, high-dimensional functions is a cursed estimation problem.
This thesis focuses on the forced Lurie system as a general modelling framework which, amongst others, captures many systems involving NNs as special cases. Examples include recurrent neural networks, neural oscillators, and the interconnection of a linear time invariant system with a feed-forward NN. The analysis of Lurie systems has been well-studied in the control theory literature, with the absolute stability problem being a pertinent example. This thesis builds upon this rich literature to develop less conservative stability criteria for Lurie systems involving NNs and to exploit known properties for constructing robust and generalisable models of convergent dynamical systems.
The first contribution develops less conservative stability criteria for Lurie systems, involving NNs with only ReLU activations. Properties of the ReLU function are leveraged to construct tailored quadratic constraints which are incorporated in the stability criteria, posed as semidefinite programs, via the S-procedure. Both continuous and discrete-time cases are examined. The second contribution repeats the same steps for Lurie systems with magnitude nonlinearities. This is a generalisation of the first contribution since a loop transformation between the magnitude and (leaky) ReLU is shown to exist, meaning the stability of Lurie systems involving ReLU or leaky ReLU activations can be verified. Numerical examples highlight the reduced conservatism, particularly for high-dimensional systems.
The final contribution proposes the k-contracting Lurie network (LN) as a robust and generalisable model of convergent dynamical systems. The absolute stability framework is used to establish conditions which guarantee the LN is k-contracting for all slope-restricted nonlinearities. Unconstrained parametrisations of these conditions are then established to restrict training to only search over LNs satisfying the k-contraction property. When tested on dynamical systems datasets involving multiple equilibrium points and limit cycles, the k-contracting LN is an order of magnitude more accurate than existing models, when initial conditions are sampled outside the training distribution and subjected to additive noise.
Text
Thesis
- Version of Record
Text
Final-thesis-submission-Examination-Mr-Carl-Richardson
Restricted to Repository staff only
More information
Published date: April 2026
Keywords:
Stability analysis, Lurie systems, Lyapunov methods, Contraction analysis, Nonlinear systems, System identification, Machine learning, Neural network, semi-definite programming
Identifiers
Local EPrints ID: 510823
URI: http://eprints.soton.ac.uk/id/eprint/510823
PURE UUID: 22b4fa66-5bea-490b-b341-f53d3f25c11a
Catalogue record
Date deposited: 22 Apr 2026 16:50
Last modified: 23 Apr 2026 02:09
Export record
Altmetrics
Contributors
Author:
Carl Robert Richardson
Thesis advisor:
Matthew Turner
Thesis advisor:
Steve Gunn
Download statistics
Downloads from ePrints over the past year. Other digital versions may also be available to download e.g. from the publisher's website.
View more statistics