Search arXivSearch

arXiv · 2506.13950

Invariant Manifolds of Discrete-time Dynamical Systems with Nonlinear Exosystems via Hybrid Physics-Informed Neural Networks

Abstract

We propose a hybrid physics-informed machine learning framework to approximate invariant manifolds (IMs) of discrete-time dynamical systems driven by exogenous autonomous dynamics (exosystems). Such systems appear in applications ranging from control theory to modeling collective multi-agent behavior (e.g., bird flocks, traffic dynamics) under hierarchical leadership. The IM learning problem is formulated as solving nonlinear functional equations derived from the invariance equation, expressing the manifold as a relationship between exogenous and system states. The proposed approach combines polynomial series with shallow neural networks, leveraging their complementary strengths. We focus on low- to medium-dimensional manifolds where polynomial expansions remain tractable. Near equilibrium, polynomial series provide interpretability and convergence, while farther away neural networks capture global structure through their universal approximation capability. A continuity penalty enforces consistency between both representations at their interface, and training is performed using analytically derived derivatives within the Levenberg-Marquardt scheme. Naturally, depending on the dimensionality of the input-driven system, one may also employ a purely neural network-based IM approximation, for which we also establish a universal approximation theorem based on certain assumptions on system dynamics. The framework is evaluated on two benchmark problems: an enzymatic bioreactor and a leader-follower car-following model. We analyze convergence, approximation accuracy, and computational cost, and compare standalone neural networks, polynomial expansions, and the hybrid method. Results show that the hybrid approach achieves superior accuracy compared to standalone schemes.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Dimitrios G. Patsatzis, Nikolaos Kazantzis, Ioannis G. Kevrekidis, Lucia Russo, Constantinos Siettos. 2026-05-07. Invariant Manifolds of Discrete-time Dynamical Systems with Nonlinear Exosystems via Hybrid Physics-Informed Neural Networks. https://arxiv.org/abs/2506.13950

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

How many continuous measurements are needed to learn a vector?

One can recover vectors from $\mathbb{R}^m$ with arbitrary precision, using only $\lceil \log_2(m)\rceil +1$ continuous measurements that are chosen adaptively. This surprising result is explained and discussed, and we present applications to infinite-dimensional approximation problems.

math.NA

IterativeCUR: Large Rank-Adaptive Approximation From a Small Recycled Sketch

The computation of accurate low-rank matrix approximations is central to improving the scalability of various techniques in machine learning, uncertainty quantification, and control. Traditionally, low-rank approximations are constructed using SVD-based approaches such as truncated SVD or Randomized SVD. Although these SVD approaches---especially Randomized SVD---have proven to be very computationally efficient, other low-rank approximation methods can offer even greater performance. One such approach is the CUR decomposition, which forms a low-rank approximation using direct row and column subsets of a matrix. Because CUR uses direct matrix subsets, it is also often better able to preserve native matrix structures like sparsity or non-negativity than SVD-based approaches and can facilitate data interpretation in many contexts. This paper introduces IterativeCUR, which draws on previous work in randomized numerical linear algebra to build a new algorithm that is highly competitive compared to prior work. IterativeCUR is adaptive in the sense that it takes as an input parameter the desired tolerance $ε$ and outputs (with arbitrarily high probability) an approximation of error bounded by $ε$, rather than requiring an a priori guess of the numerical rank. IterativeCUR typically runs significantly faster than both existing CUR algorithms and techniques such as Randomized SVD. Its asymptotic complexity is $\mathcal{O}(mn + (m+n)r^2)$ for an $m\times n$ matrix of output rank $r$. IterativeCUR relies on a single small sketch from the matrix that is successively downdated as the algorithm proceeds. We demonstrate through extensive experiments that IterativeCUR achieves up to $4\times$ speed-up over state-of-the-art pivoting-on-sketch approaches with no loss of accuracy, and up to $40\times$ speed-up over rank-adaptive randomized SVD approaches.

math.NA

Multigrid with Linear Storage Complexity

As the discretization error for the solution of a partial differential equation (PDE) decreases, the precision required to store the corresponding coefficients naturally increases. Storing the solution's finite element coefficients explicitly requires $\mathcal O(n \log n)$ bits of storage, where $n$ is the number of degrees of freedom (DoFs). This paper presents a full multigrid method to compute the solution in a compressed format that reduces the storage complexity of the solution and intermediate vectors to $\mathcal O(n)$ bits. This reduction allows a matrix-free implementation to solve elliptic PDEs with an overall linear space complexity. For problems limited by the memory capacity of current supercomputers, we expect a memory footprint reduction of about an order of magnitude compared to state-of-the-art mixed-precision methods. We demonstrate the applicability of our algorithm by solving two model problems. Depending on the PDE and polynomial degree, but irrespective of the problem size, the solution vector on the finest grid requires between 4 and 12 bits per DoF, and the residual and correction require 3 to 6 bits each. Additional data is stored on the coarse grids with modestly increasing bit widths toward coarser grids.

math.NA