English

Disentanglement as Identifiable Pushforward Factorisation

Machine Learning 2026-04-14 v7 Artificial Intelligence Machine Learning

Abstract

We characterise disentanglement in smooth generative pushforward models, such as in VAEs and GANs. For a generator/decoder g:ZXg:Z\to X and factorised prior p(z)=ipi(zi)p(z)=\prod_i p_i(z_i), we define disentanglement as factorisation of the pushforward density pμ=g#pp_\mu= g_\#p into one-dimensional "seam" factors, where each latent dimension controls an independent generative factor of the data. We prove that pμp_\mu factorises according to the SVD of gg's Jacobian; that disentanglement equates to two conditions on gg (C1-C2); and that under those conditions the seam factors are identifiable, up to permutation and sign. In the particular case of Gaussian (β\beta-)VAEs, we show via an identity how diagonal posteriors promote C1-C2, in expectation, explaining why disentanglement arises modulated by β\beta. Experiments illustrate this mechanism on Gaussian data, dSprites, and CelebA.

Cite

@article{arxiv.2410.22559,
  title  = {Disentanglement as Identifiable Pushforward Factorisation},
  author = {Carl Allen},
  journal= {arXiv preprint arXiv:2410.22559},
  year   = {2026}
}

Comments

9 pages

R2 v1 2026-06-28T19:40:26.866Z