Disentanglement Learning via Topology

Nikita Balabin, Daria Voronkova, I. Trofimov, Evgeny Burnaev, S. Barannikov
2/12/2026

No official code found. Best implementation: nikitabalabin/TopDis (7 stars, last commit 2024-05-30).

Abstract

We propose TopDis (Topological Disentanglement), a method for learning disentangled representations via adding a multi-scale topological loss term. Disentanglement is a crucial property of data representations substantial for the explainability and robustness of deep learning models and a step towards high-level cognition. The state-of-the-art methods are based on VAE and encourage the joint distribution of latent variables to be factorized. We take a different perspective on disentanglement by analyzing topological properties of data manifolds. In particular, we optimize the topological similarity for data manifolds traversals. To the best of our knowledge, our paper is the first one to propose a differentiable topological loss for disentanglement learning. Our experiments have shown that the proposed TopDis loss improves disentanglement scores such as MIG, FactorVAE score, SAP score, and DCI disentanglement score with respect to state-of-the-art results while preserving the reconstruction quality. Our method works in an unsupervised manner, permitting us to apply it to problems without labeled factors of variation. The TopDis loss works even when factors of variation are correlated. Additionally, we show how to use the proposed topological loss to find disentangled directions in a trained GAN.

View on arXivView PDF

Code Implementations(1)

72Shell, PythonMay 21, 20242 years ago

Similar Papers

Cite this paper

@article{balabin2026disentanglement,
  title  = {Disentanglement Learning via Topology},
  author = {Nikita Balabin and Daria Voronkova and I. Trofimov and Evgeny Burnaev and S. Barannikov},
  year   = {2026},
  eprint = {2308.12696},
  archivePrefix = {arXiv},
  url    = {https://arxiv.org/pdf/2308.12696},
  journal = {ICML 2023 2023}
}

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/2308.12696.svg)](https://codeofpaper.com/paper/2308.12696)

Discussion