cs.LGFeb 6, 2026

From Core to Detail: Unsupervised Disentanglement with Entropy-Ordered Flows

Authors: Daniel Galperin, Ullrich Köthe

Organizations: Heidelberg University

Abstract

The unsupervised discovery of features that are both semantically meaningful and stable across runs remains a central challenge in representation learning. We introduce entropy-ordered flows (EOFlows), a normalizing flow (NF) framework that augments standard maximum likelihood training with an orthogonality regularizer on the decoder Jacobian. The regularizer is rooted in Independent Mechanism Analysis and encourages geometric disentanglement, and a stochastic estimator makes it tractable at image scale (CelebA at D=2352D=2352 and 1228812288). Learned features form near-orthogonal curvilinear coordinates and can be ordered by their explained (manifold) entropy\textit{explained (manifold) entropy} after training, analogous to the ranking by explained variance in PCA, which turns EOFlows into a non-linear generalization of PCA. EOFlows identify an order of magnitude more stable features than existing methods, and these features emerge in distinguishable categories (global, local, and generic) and support tentative semantic interpretations. The local features have strikingly sparse support in pixel space, although our method never enforces this. Retaining only the most important, i.e. highest entropy, features turns the bijective flow into an autoencoder with adjustable bottleneck, rivaling the rate-distortion performance of dedicated autoencoders.

Figures & tables

Appendix figures & tables42 assets

Supplementary material from the paper’s appendix.

Appendix

Explore similar work

CardsList
  1. Unsupervised Disentanglement Without Compromises : How Functional Orthogonality Enforces Identifiability

    Jun 19, 2026Mathieu Cyrille Simon, Pascal Frossard, Christophe De VleeschouwerIdentifiabilityOrthogonality