arXiv Statistics ML By Kaichen Shen, Wei Zhu

Latent Nonlinear Denoising Score Matching for Enhanced Learning of Structured Distributions

Read the original on arXiv Statistics ML →

The paper introduces Latent Nonlinear Denoising Score Matching (LNDSM), a method that integrates nonlinear, structure-informed latent diffusions with a variational autoencoder framework. LNDSM designs the forward diffusion to admit a chosen reference distribution, such as a Gaussian mixture, and derives a computable approximation to a cross‑entropy upper bound using Euler‑Maruyama discretization. Experiments on benchmark image datasets show that LNDSM improves sample quality, mode balance, and training efficiency compared to conventional latent score‑based generative models.

Machine-generated by The Flow from the publisher's headline and feed description — not written or checked by a human. The full article lives at arXiv Statistics ML.

arXiv Machine Learning
Aug 26

Generalization, memorization, and overfitting for diffusion models trained in the lazy high-dimensional regime

The paper investigates diffusion models trained in a lazy high‑dimensional regime, extending benign overfitting theory to generative settings. By analyzing denoising score matching in a vector‑valued RKHS with an inner‑product kernel, the authors derive exact risk trajectories under gradient flow when the number of samples scales proportionally with dimensionality. These trajectories reveal three distinct phases—spectral generalization, noise‑dominated interpolation, and empirical Bayes memorization—whose interplay shapes the distribution of generated samples.

By Hugo Latourelle-Vigeant, Sinho Chewi, Aram-Alexandre Pooladian, John Sous, Theodor Misiakiewicz
Hugging Face Trending Papers
Jun 29

Simplifying Flow Matching Transformations with Low-Rank Mixture Models

Normalizing flows are powerful generative models that learn an invertible mapping between complex data distributions and simple latent distributions, typically a standard normal density. However, this choice of latent density can impose unnecessary complexity on the learned flow transformation due to the topological mismatch between the latent and data densities, leading to slower training and suboptimal performance.