mlsanityData to 7 Oct 2026

Distributional Principal Autoencoders

arXiv 2404.13649 ↗First posted 21 Apr 2024stat.ML cs.LG stat.MEcited by 10

Not on the map. Why?

Abstract (arXiv)

Dimension reduction techniques usually lose information in the sense that reconstructed data are not identical to the original data. However, we argue that it is possible to have reconstructed data identically distributed as the original data, irrespective of the retained dimension or the specific mapping. This can be achieved by learning a distributional model that matches the conditional distribution of data given its low-dimensional latent variables. Motivated by this, we propose Distributional Principal Autoencoder (DPA) that consists of an encoder that maps high-dimensional data to low-dimensional latent variables and a decoder that maps the latent variables back to the data space. For reducing the dimension, the DPA encoder aims to minimise the unexplained variability of the data with an adaptive choice of the latent dimension. For reconstructing data, the DPA decoder aims to match the conditional distribution of all data that are mapped to a certain latent value, thus ensuring that the reconstructed data retains the original data distribution. Our numerical results on climate data, single-cell data, and image benchmarks demonstrate the practical feasibility and success of the approach in reconstructing the original distribution of the data. DPA embeddings are shown to preserve meaningful structures of data such as the seasonal cycle for precipitations and cell types for gene expression.

Key facts. Cited by 10 papers in the map (data through 7 Oct 2026). Builds on 20 of its 52 references that are in the map. First posted on arXiv 21 Apr 2024.

Builds on

20 of 52 references.

References · 20

  1. 2014Adam: A Method for Stochastic Optimizationcited by 36,960
  2. 2020Denoising Diffusion Probabilistic Modelscited by 20,851
  3. 2021High-Resolution Image Synthesis with Latent Diffusion Modelscited by 18,694
  4. 2015Deep Unsupervised Learning using Nonequilibrium Thermodynamicscited by 7,005
  5. 2019Normalizing Flows for Probabilistic Modeling and Inferencecited by 1,315
  6. 2018Learning deep representations by mutual information estimation and maximizationcited by 1,265
  7. 2019Variational Autoencoders and Nonlinear ICA: A Unifying Frameworkcited by 494
  8. 2017Wasserstein Auto-Encoderscited by 371
  9. 2015Adversarial Autoencoderscited by 359
  10. 2016Adversarial Feature Learningcited by 350
  11. 2016Adversarially Learned Inferencecited by 216
  12. 2020Flows for simultaneous manifold learning and density estimationcited by 117
8 more
  1. 2013Generalized Denoising Auto-Encoders as Generative Modelscited by 113
  2. 2014Learning Ordered Representations with Nested Dropoutcited by 81
  3. 2022Identifiability of deep generative models without auxiliary informationcited by 70
  4. 2023Engression: Extrapolation through the Lens of Distributional Regressioncited by 49
  5. 2020PCAAE: Principal Component Analysis Autoencoder for organising the latent space of generative networkscited by 16
  6. 2020Bidirectional Generative Modeling Using Adversarial Gradient Estimationcited by 3
  7. 2022Triangular Dropout: Variable Network Width without Retrainingcited by 3
  8. 2023Information-Ordered Bottlenecks for Adaptive Semantic Compressioncited by 3

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2025: 5; 2026: 5.

10 papers.