Autoencoding Dynamics: Topological Limitations and Capabilities (2511.04807v1)
Abstract: Given a "data manifold" $M\subset \mathbb{R}n$ and "latent space" $\mathbb{R}\ell$, an autoencoder is a pair of continuous maps consisting of an "encoder" $E\colon \mathbb{R}n\to \mathbb{R}\ell$ and "decoder" $D\colon \mathbb{R}\ell\to \mathbb{R}n$ such that the "round trip" map $D\circ E$ is as close as possible to the identity map $\mbox{id}_M$ on $M$. We present various topological limitations and capabilites inherent to the search for an autoencoder, and describe capabilities for autoencoding dynamical systems having $M$ as an invariant manifold.
Sponsored by Paperpile, the PDF & BibTeX manager trusted by top AI labs.
Get 30 days freePaper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.