Data-driven guessing and gluing of unstable periodic orbits

TL;DR

This paper introduces a data-driven approach using autoencoders to generate initial guesses for unstable periodic orbits in chaotic systems, improving the convergence of algorithms that find these orbits.

Contribution

It proposes a novel low-dimensional latent space method for constructing initial guesses for UPOs, enabling efficient discovery of longer and more complex orbits.

Findings

Autoencoders effectively reduce the dimensionality of fluid flow data.

Latent space loops serve as realistic initial guesses for UPOs.

Gluing known UPOs in latent space can generate longer periodic orbits.

Abstract

Unstable periodic orbits (UPOs) are believed to be the underlying dynamical structures of spatio-temporal chaos and turbulence. Finding these UPOs is however notoriously difficult. Matrix-free loop convergence algorithms deform entire space-time fields (loops) until they satisfy the evolution equations. Initial guesses for these robust variational convergence algorithms are thus periodic space-time fields in a high-dimensional state space, rendering their generation highly challenging. Usually guesses are generated with recurrency methods, which are most suited to shorter and more stable periodic orbits. Here we propose an alternative, data-driven method for generating initial guesses, enabled by the periodic nature of the guesses for loop convergence algorithms: while the dimension of the space used to discretize fluid flows is prohibitively large to construct suitable initial guesses, the dissipative dynamics will collapse onto a chaotic attractor of far lower dimension. We use an autoencoder to obtain a low-dimensional representation of the discretized physical space for the one-dimensional Kuramoto-Sivashinksy equation, in chaotic and hyperchaotic regimes. In this low-dimensional latent space, we construct loops based on the latent POD modes with random periodic coefficients, which are then decoded to physical space and used as initial guesses. These loops are found to be realistic initial guesses and, together with variational convergence algorithms, these guesses help us to quickly converge to UPOs. We further attempt to `glue' known UPOs in the latent space to create guesses for longer ones. This gluing procedure is successful and points towards a hierarchy of UPOs where longer UPOs shadow sequences of shorter ones.