Autoencoding Dynamics: Topological Limitations and Capabilities

Matthew D. Kvalheim, Eduardo D. Sontag
11/6/2025
cs.LGmath.DS

No confident code implementation found for this paper.

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.

View on arXivView PDF

Code Implementations

No confident code match yet

We couldn't find an author-owned or strongly-evidenced community implementation for this paper. Any repos shown below are weak matches — verify before relying on them.

No code implementations found yet.

Know of an implementation? Let us know in the comments below!

Similar Papers

Cite this paper

@article{kvalheim2025autoencoding,
  title  = {Autoencoding Dynamics: Topological Limitations and Capabilities},
  author = {Matthew D. Kvalheim and Eduardo D. Sontag},
  year   = {2025},
  eprint = {2511.04807},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2511.04807v2}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2511.04807.svg)](https://codeofpaper.com/paper/2511.04807)

Discussion