arXiv Machine Learning
Jun 4
Geometry-Preserving Encoder/Decoder in Latent Generative Models
arXiv:2501. 09876v3 Announce Type: replace-cross Abstract: Generative modeling aims to generate new data samples that resemble a given dataset.
Generalization in VAE and Diffusion Models: A Unified Information-Theoretic Analysis
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.
Related stories
arXiv Machine Learning
Aug 6
Regularization can make diffusion models more efficient
arXiv:2502. 09151v3 Announce Type: replace Abstract: Diffusion models are one of the key architectures of generative AI.
arXiv AI
Jul 24
From Atoms to Entropy: Optimal Noise Allocation for Diffusion Training in the Convex Regime
arXiv:2607. 20540v1 Announce Type: cross Abstract: How should a diffusion model decide which noise levels to train on, and how much?
arXiv Machine Learning
Jun 10
The Emergence of Reproducibility and Generalizability in Diffusion Models
arXiv:2310. 05264v5 Announce Type: replace Abstract: In this work, we investigate an intriguing and prevalent phenomenon of diffusion models which we term as "consistent model reproducibility": given the same starting noise input and a deterministic sampler, different diffusion models often yield remarkably similar outputs.
arXiv Machine Learning
Jul 22
ROMS-IMLE: A Minimalist Approach to Competitive Single-Step Generative Modelling
arXiv:2607. 19332v1 Announce Type: new Abstract: Generative models have undergone many generations of evolution, from VAEs/GANs to diffusion/flow matching.
arXiv Machine Learning
Jun 9
Self-Consistent Generative Paths via Admissible Random Variational Transport
arXiv:2606. 08953v1 Announce Type: new Abstract: Modern generative models often define an entire probability path from a simple prior to the data law, rather than only an endpoint map.
Hugging Face Trending Papers
Jun 22
PeLAP-A: Adaptive Latent Pruning for Lightweight Latent Diffusion Models
Latent diffusion models achieve strong generative performance by operating in a compressed latent space produced by a variational autoencoder (VAE). However, it remains unclear whether all latent channels contribute equally to the diffusion process, or whether significant redundancy exists.
arXiv AI
Jun 9
Unified Energy for Invariant and Independent Decoding in Diffusion Language Models
arXiv:2606. 09159v1 Announce Type: cross Abstract: Diffusion Language Models (DLMs) enable parallel text generation by iteratively denoising a full sequence, offering attractive flexibility compared to auto-regressive (AR) decoding.
arXiv AI
Jun 2
Ideas in Inference-time Scaling can Benefit Generative Pre-training Algorithms
arXiv:2503. 07154v3 Announce Type: replace-cross Abstract: Generative pre-training is often framed through a false dichotomy between autoregressive models for discrete signals and diffusion models for continuous signals.
arXiv Machine Learning
Aug 4
Pseudorandom Streams within Diffusion Models Act as Learnable Inputs That Affect Generation Quality
arXiv:2608. 02575v1 Announce Type: new Abstract: Diffusion models rely on stochastic inputs, yet on finite-precision hardware, the "randomness" they consume is realized as deterministic numerical orbits generated by pseudorandom rules.
arXiv Machine Learning
Jul 28
From Score Learning to Discretized Sampling: An End-to-End Generalization Analysis of Diffusion Models
arXiv:2607. 23226v1 Announce Type: new Abstract: Despite the empirical success of score-based diffusion models, a complete theoretical understanding of how finite-sample learning, network parameterization, and numerical discretization jointly dictate generative quality remains underdeveloped.
arXiv AI
Sep 3
Language Diffusion Models are Associative Memories Capable of Retrieving Unseen Data
The paper investigates when language diffusion models, specifically Uniform-based Discrete Diffusion Models (UDDMs), shift from memorizing training data to generalizing to new data. It shows that UDDMs act as associative memories, forming basins of attraction around stored examples without requiring an explicit energy function. By measuring token recovery and conditional entropy, the authors identify a sharp transition governed by training set size, where memorization (vanishing entropy) gives way to generalization (finite entropy).