This paper proposes a novel data-driven algorithm to approximate the dominant eigenfunctions (aka.~modes) of the Koopman operator of nonlinear dynamical systems using neural networks. The relevance of learning the dominant Koopman modes is to approximate nonlinear dynamics by linear ones in a lifted space, thereby enabling simplified control and analysis. To fight the curse of dimensionality arising from using expressive templates (here neural networks) for the mode approximation, the proposed method leverages a power-iteration scheme that directly learns the dominant Koopman modes without explicitly constructing the projection of the Koopman operator on the template of functions. Our approach connects to other approaches in the literature that avoid the curse of dimensionality by learning small dictionaries of functions, but differs from them in that we do not require ``anti-collapse mechanisms''to ensure that the learned dictionary is expressive enough to approximate the Koopman operator since our power-iteration scheme is designed to converge toward the dominant modes of the projected Koopman operator. The approach is fully data-driven, requiring only sampled state transitions. Theoretical guarantees are provided, showing convergence under increasing sample size and network width (in connection with the neural tangent kernel theorem). Numerical experiments demonstrate that the method achieves accurate and smooth approximations of dominant modes while avoiding the limitations of traditional techniques such as extended dynamic mode decomposition.
Guillaume O. Berger, Raphael M. Jungers· 0 citations
A central methodological question in data-driven control is whether to adopt a direct or indirect approach. Direct methods infer a controller or certificate directly from data, while indirect methods first identify a system model and then apply model-based control techniques. Recent developments of the direct method have led to finite-sample guarantees for the data-driven stability analysis of switched linear systems under various settings. However, for the indirect method, such guarantees remain largely elusive. In this paper, we provide a novel framework for the stability analysis of switched linear systems from noisy state measurements, using the indirect approach and quadratic Lyapunov analysis. Our framework comes with finite-sample guarantees on the convergence rate of the system. For that, we combine generalization bounds from machine learning and system identification with sensitivity analysis from quadratic Lyapunov analysis. To enable comparison, we also extend existing direct data-driven methods to handle measurement noise beyond the bounded noise case currently available in the literature. Finally, we compare the two approaches through numerical experiments, revealing that under moderate-to-high noise levels the indirect approach yields tighter probabilistic guarantees as well as greater robustness to noise and outliers than the direct approach
Alexis Vuille, Guillaume O. Berger, Raphael M. Jungers· 0 citations