Characterizing High-dimensional Dynamics by Combinatorial-Topological Methods on a Latent Space
TL;DR
An initial study of combinatorial-topological techniques in the dimensionality reduction setting establishes bounds under which an algebraic structure that organizes dynamics can be lifted from the latent space to the original system.
Abstract
Combinatorial-topological methods for characterizing dynamics are rigorous, generalizable, computable, and they only require approximations, but the dimension of the phase space is a computational bottleneck to their wider application. Motivated by the growing number of machine learning techniques for obtaining lower-dimensional latent representations of dynamics, we present an initial study of combinatorial-topological techniques in the dimensionality reduction setting. We establish bounds under which an algebraic structure that organizes dynamics can be lifted from the latent space to the original system. As a corollary, one can conclude the existence of attractors within certain regions of the original phase space. The hypothesis of these results is expressed in terms of an approximate semiconjugacy between the original and latent dynamics. To demonstrate the ideas, we combine autoencoder-based models with Conley-Morse graph computations for Leslie population models, a thirteen-dimensional Mediterranean red coral population model, and the Chafee--Infante equation. While the lift of the Conley index is still an open question, the examples recover the expected algebraic topological invariants in several settings.