about
Topological Autoencoders (arxiv.org)
3 points by pizza on Dec 14, 2020 | hide | past | pdf | discuss on HN

In plain words: An autoencoder usually only tries to copy its input, so its compressed code can scramble the data's shape. This one adds a penalty that compares the loops and connections in the data and the code across scales, keeping the shape while still reconstructing accurately.

Abstract

We propose a novel approach for preserving topological structures of the input space in latent representations of autoencoders. Using persistent homology, a technique from topological data analysis, we calculate topological signatures of both the input and latent space to derive a topological loss term. Under weak theoretical assumptions, we construct this loss in a differentiable manner, such that the encoding learns to retain multi-scale connectivity information. We show that our approach is theoretically well-founded and that it exhibits favourable latent representations on a synthetic manifold as well as on real-world image data sets, while preserving low reconstruction errors.

Michael Moor, Max Horn, Bastian Rieck, Karsten Borgwardt
arXiv:1906.00722 · cs.LG, math.AT, stat.ML · submitted Jun 3, 2019 · updated May 31, 2021
abstract · pdf · html · Accepted at the International Conference on Machine Learning (ICML) 2020; camera-ready version

add comment on HN