Analysis of learning a flow-based generative model from limited sample complexity

Hugo Cui, Florent Krzakala, Eric Vanden-Eijnden, L. Zdeborov'a
2/12/2026

No official code found. Best implementation: SPOC-group/Diffusion_GMM (2 stars, last commit 2025-01-20).

Abstract

We study the problem of training a flow-based generative model, parametrized by a two-layer autoencoder, to sample from a high-dimensional Gaussian mixture. We provide a sharp end-to-end analysis of the problem. First, we provide a tight closed-form characterization of the learnt velocity field, when parametrized by a shallow denoising auto-encoder trained on a finite number $n$ of samples from the target distribution. Building on this analysis, we provide a sharp description of the corresponding generative flow, which pushes the base Gaussian density forward to an approximation of the target density. In particular, we provide closed-form formulae for the distance between the mean of the generated mixture and the mean of the target mixture, which we show decays as $\Theta_n(\frac{1}{n})$. Finally, this rate is shown to be in fact Bayes-optimal.

View on arXivView PDF

Code Implementations(1)

Repo for the paper : Analysis of Learning a Flow-based Generative Model from Limited Sample Complexity

20Python, Jupyter NotebookOct 2, 20231 years ago

Similar Papers

Cite this paper

@article{cui2026analysis,
  title  = {Analysis of learning a flow-based generative model from limited sample complexity},
  author = {Hugo Cui and Florent Krzakala and Eric Vanden-Eijnden and L. Zdeborov'a},
  year   = {2026},
  eprint = {2310.03575},
  archivePrefix = {arXiv},
  url    = {https://arxiv.org/pdf/2310.03575},
  journal = {ICLR 2023 2023}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2310.03575.svg)](https://codeofpaper.com/paper/2310.03575)

Discussion