mlsanityData to 14 Oct 2026

Learning Low-Rank Latent Spaces with Simple Deterministic Autoencoder: Theoretical and Empirical Insights

arXiv 2310.16194 ↗First posted 24 Oct 2023cs.LG cs.CV eess.IVcited by 1

Not on the map. Why?

Abstract (arXiv)

The autoencoder is an unsupervised learning paradigm that aims to create a compact latent representation of data by minimizing the reconstruction loss. However, it tends to overlook the fact that most data (images) are embedded in a lower-dimensional space, which is crucial for effective data representation. To address this limitation, we propose a novel approach called Low-Rank Autoencoder (LoRAE). In LoRAE, we incorporated a low-rank regularizer to adaptively reconstruct a low-dimensional latent space while preserving the basic objective of an autoencoder. This helps embed the data in a lower-dimensional space while preserving important information. It is a simple autoencoder extension that learns low-rank latent space. Theoretically, we establish a tighter error bound for our model. Empirically, our model's superiority shines through various tasks such as image generation and downstream classification. Both theoretical and practical outcomes highlight the importance of acquiring low-dimensional embeddings.

Key facts. Cited by 1 paper in the map (data through 14 Oct 2026). Builds on 19 of its 31 references that are in the map. First posted on arXiv 24 Oct 2023.

Builds on

19 of 31 references.

References · 19

  1. 2014Adam: A Method for Stochastic Optimizationcited by 37,240
  2. 2020A Simple Framework for Contrastive Learning of Visual Representationscited by 12,049
  3. 2019Momentum Contrast for Unsupervised Visual Representation Learningcited by 7,513
  4. 2017Neural Discrete Representation Learningcited by 4,712
  5. 2015Variational Inference with Normalizing Flowscited by 2,170
  6. 2016Least Squares Generative Adversarial Networkscited by 1,001
  7. 2019Self-Supervised Learning of Pretext-Invariant Representationscited by 808
  8. 2017The Implicit Bias of Gradient Descent on Separable Datacited by 655
  9. 2019Implicit Regularization in Deep Matrix Factorizationcited by 405
  10. 2017Wasserstein Auto-Encoderscited by 373
  11. 2017Implicit Regularization in Matrix Factorizationcited by 322
  12. 2017Are GANs Created Equal? A Large-Scale Studycited by 267
7 more
  1. 2018Implicit Bias of Gradient Descent on Linear Convolutional Networkscited by 251
  2. 2018A mathematical theory of semantic development in deep neural networkscited by 186
  3. 2019From Variational to Deterministic Autoencoderscited by 133
  4. 2019Implicit Regularization of Discrete Gradient Dynamics in Linear Neural Networkscited by 124
  5. 2017Many Paths to Equilibrium: GANs Do Not Need to Decrease a Divergence At Every Stepcited by 45
  6. 2020Implicit Rank-Minimizing Autoencodercited by 35
  7. 2020Improving Local Identifiability in Probabilistic Box Embeddingscited by 35

Built on by

Cited by year

Citing papers per year: 2025: 1.

1 paper.