mlsanityData to 7 Oct 2026

Uncertainty Autoencoders: Learning Compressed Representations via Variational Information Maximization

arXiv 1812.10539 ↗First posted 26 Dec 2018stat.ML cs.LG cs.NEcited by 12

Not on the map. Why?

Abstract (arXiv)

Compressed sensing techniques enable efficient acquisition and recovery of sparse, high-dimensional data signals via low-dimensional projections. In this work, we propose Uncertainty Autoencoders, a learning framework for unsupervised representation learning inspired by compressed sensing. We treat the low-dimensional projections as noisy latent representations of an autoencoder and directly learn both the acquisition (i.e., encoding) and amortized recovery (i.e., decoding) procedures. Our learning objective optimizes for a tractable variational lower bound to the mutual information between the datapoints and the latent representations. We show how our framework provides a unified treatment to several lines of research in dimensionality reduction, compressed sensing, and generative modeling. Empirically, we demonstrate a 32% improvement on average over competing approaches for the task of statistical compressed sensing of high-dimensional datasets.

Key facts. Cited by 12 papers in the map (data through 7 Oct 2026). First posted on arXiv 26 Dec 2018.

Builds on

No reference list yet.

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2021: 4; 2022: 2; 2023: 2; 2024: 2; 2025: 1; 2026: 1.

12 papers.