pith. sign in

arxiv: 1812.05069 · v1 · pith:N7D6ULFVnew · submitted 2018-12-12 · 💻 cs.LG · cs.CV· stat.ML

Recent Advances in Autoencoder-Based Representation Learning

classification 💻 cs.LG cs.CVstat.ML
keywords learningrepresentationautoencoder-baseddistributionusefuladvancesdownstreamprior
0
0 comments X
read the original abstract

Learning useful representations with little or no supervision is a key challenge in artificial intelligence. We provide an in-depth review of recent advances in representation learning with a focus on autoencoder-based models. To organize these results we make use of meta-priors believed useful for downstream tasks, such as disentanglement and hierarchical organization of features. In particular, we uncover three main mechanisms to enforce such properties, namely (i) regularizing the (approximate or aggregate) posterior distribution, (ii) factorizing the encoding and decoding distribution, or (iii) introducing a structured prior distribution. While there are some promising results, implicit or explicit supervision remains a key enabler and all current methods use strong inductive biases and modeling assumptions. Finally, we provide an analysis of autoencoder-based representation learning through the lens of rate-distortion theory and identify a clear tradeoff between the amount of prior knowledge available about the downstream tasks, and how useful the representation is for this task.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 8 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. Constrained Variable Projection for Structured Problems

    math.OC 2026-06 unverdicted novelty 6.0

    Extends variable projection to constrained separable nonlinear least-squares via bilevel collapse, yielding exact reduced gradients and a convergent conditional-gradient algorithm.

  2. MEDAL: Manifold Embedding Distillation via Autoencoder Learning

    stat.ML 2026-05 unverdicted novelty 6.0

    MEDAL distills manifold embeddings into autoencoders to enable out-of-sample extension and held-out validation of dimension reduction methods.

  3. The Rate-Distortion-Polysemanticity Tradeoff in SAEs

    cs.LG 2026-05 unverdicted novelty 6.0

    SAEs exhibit a rate-distortion-polysemanticity tradeoff where monosemanticity increases rate and distortion, with optimal polysemanticity set by feature co-occurrence probabilities in the data.

  4. Interests Burn-down Diffusion Process for Personalized Collaborative Filtering

    cs.IR 2026-05 unverdicted novelty 6.0

    A new interests burn-down diffusion process models decaying user interests for personalized collaborative filtering and outperforms prior generative methods in the StageCF implementation.

  5. A Large-scale Study of Representation Learning with the Visual Task Adaptation Benchmark

    cs.CV 2019-10 accept novelty 6.0

    VTAB is a 19-task benchmark that measures representation quality by few-shot adaptation performance across diverse vision domains, with a controlled large-scale comparison of popular pretraining methods.

  6. Disentangling Influence: Using Disentangled Representations to Audit Model Predictions

    cs.LG 2019-06 unverdicted novelty 6.0

    Disentangled representations enable a new auditing procedure to identify proxy features and quantify their influence on model outcomes more effectively than prior methods.

  7. Cloning Deterministic Worlds: The Critical Role of Latent Geometry in Long-Horizon World Models

    cs.LG 2025-10 unverdicted novelty 5.0

    GRWM uses temporal contrastive learning to geometrically regularize latent spaces in world models for high-fidelity cloning of deterministic 3D worlds.

  8. Variational Autoencoder Layer

    cs.LG 2026-06 unverdicted novelty 4.0

    Proposes VAE as a neural network layer with new training strategy and performance analysis.