arXiv:2606. 28854v1 Announce Type: cross Abstract: The common factor analytic model is related to Helmholtz and Boltzmann machines, can be conceived as a linear autoencoder, or can be thought of as a single-hidden-layer generative neural network.
By Carel F. W. Peeters
arXiv:2602. 13421v2 Announce Type: replace-cross Abstract: Computation in biological systems is fundamentally energy-constrained, yet standard theories of computation treat energy as freely available.
By Hadi Vafaii, Jacob L. Yates
The paper introduces tunable latent priors for diffusion models, normalizing flows, and variational autoencoders using nested dropout. These priors allow the latent dimensionality to adapt to each inverse problem, reducing reconstruction errors compared to fixed-complexity models across tasks such as compressed sensing, inpainting, denoising, and phase retrieval. In linear denoising, the authors derive the optimal latent complexity in closed form, linking it to noise level and signal spectrum.
By Sean Gunn, Jorio Cocola, Oliver De Candido, Vaggos Chatziafratis, Paul Hand
arXiv:2606. 07120v1 Announce Type: new Abstract: Autoencoders (AEs) learn low-dimensional representations by mapping data into a latent space while minimizing reconstruction error.
By Santanu Das, Ramyak Bilas, Pascal Esser, Satyaki Mukherjee
arXiv:2607. 01275v1 Announce Type: cross Abstract: Variational Autoencoders (VAEs) commonly assume a standard isotropic Gaussian prior over the latent space, an assumption that often fails to capture the true distribution of latent representations for complex datasets.
By Qijun Chen, Shaofan Li
arXiv:2607. 23751v1 Announce Type: new Abstract: The usefulness of a variational autoencoder (VAE) depends on two properties of its latent space that are hard to obtain together: high encoding capacity in the individual latent variables, and a low-dimensional, disentangled organization of those variables.
By Ye Shi
arXiv:2607. 05531v1 Announce Type: new Abstract: Variational Autoencoders (VAEs) frequently suffer from posterior collapse, a failure mode in which the approximate posterior converges to the prior, rendering the latent code uninformative.
By Girum Demisse
arXiv:2601. 10588v2 Announce Type: replace-cross Abstract: Whether neural information processing is entirely classical or involves quantum-mechanical elements remains an open question.
By I. K. Kominis, C. Xie, S. Li, M. Skotiniotis, G. P. Tsironis
arXiv:2501. 09876v3 Announce Type: replace-cross Abstract: Generative modeling aims to generate new data samples that resemble a given dataset.
By Wonjun Lee, Riley C. W. O'Neill, Dongmian Zou, Jeff Calder, Gilad Lerman
arXiv:2606. 09725v1 Announce Type: new Abstract: Disentanglement, the separation of factors of variation in data using neural networks, remains a long-standing challenge in machine learning.
By Jhonny J. Velasquez Olivera, Christo K. Thomas, Walid Saad
arXiv:2506. 00849v2 Announce Type: replace Abstract: Despite the empirical success of Diffusion Models (DMs) and Variational Autoencoders (VAEs), their generalization performance remains theoretically underexplored, especially lacking a full consideration of the shared encoder-generator structure.
By Qi Chen, Jierui Zhu, Florian Shkurti
arXiv:2607. 23182v1 Announce Type: cross Abstract: We prove the identifiability of deep generative models (DGMs) with piecewise-affine (PWA) decoders and Gaussian mixture model (GMM) priors, in a purely unsupervised setting.
By Pengzhou Wu