Table of Contents
Fetching ...

Shallow diffusion networks provably learn hidden low-dimensional structure

Nicholas M. Boffi, Arthur Jacot, Stephen Tu, Ingvar Ziemann

TL;DR

This work shows that shallow diffusion models provably adapt to simple forms of low dimensional structure, thereby avoiding the curse of dimensionality and providing an end-to-end sample complexity bound for learning to sample from structured distributions.

Abstract

Diffusion-based generative models provide a powerful framework for learning to sample from a complex target distribution. The remarkable empirical success of these models applied to high-dimensional signals, including images and video, stands in stark contrast to classical results highlighting the curse of dimensionality for distribution recovery. In this work, we take a step towards understanding this gap through a careful analysis of learning diffusion models over the Barron space of single layer neural networks. In particular, we show that these shallow models provably adapt to simple forms of low dimensional structure, thereby avoiding the curse of dimensionality. We combine our results with recent analyses of sampling with diffusion models to provide an end-to-end sample complexity bound for learning to sample from structured distributions. Importantly, our results do not require specialized architectures tailored to particular latent structures, and instead rely on the low-index structure of the Barron space to adapt to the underlying distribution.

Shallow diffusion networks provably learn hidden low-dimensional structure

TL;DR

This work shows that shallow diffusion models provably adapt to simple forms of low dimensional structure, thereby avoiding the curse of dimensionality and providing an end-to-end sample complexity bound for learning to sample from structured distributions.

Abstract

Diffusion-based generative models provide a powerful framework for learning to sample from a complex target distribution. The remarkable empirical success of these models applied to high-dimensional signals, including images and video, stands in stark contrast to classical results highlighting the curse of dimensionality for distribution recovery. In this work, we take a step towards understanding this gap through a careful analysis of learning diffusion models over the Barron space of single layer neural networks. In particular, we show that these shallow models provably adapt to simple forms of low dimensional structure, thereby avoiding the curse of dimensionality. We combine our results with recent analyses of sampling with diffusion models to provide an end-to-end sample complexity bound for learning to sample from structured distributions. Importantly, our results do not require specialized architectures tailored to particular latent structures, and instead rely on the low-index structure of the Barron space to adapt to the underlying distribution.

Paper Structure

This paper contains 25 sections, 30 theorems, 193 equations.

Key Result

Theorem 3.2

Suppose that $p_0$ follows the latent structure eq:subspace_structure, and that both assumption:sub_gaussian_z_0 and assumption:lipschitz_pi_t hold. Fix a $t > 0$ and define where $\bar{R}_t$ does not depend on $n$.The explicit dependence of $\bar{R}_t$ on the other problem parameters is detailed in the proof. Suppose that $n$ satisfies Then, the empirical risk minimizer $\hat{s}_t \in \mathop{\

Theorems & Definitions (50)

  • Theorem 3.2
  • Corollary 3.2
  • Theorem 3.4
  • Corollary 3.4
  • Proposition 4.1: see e.g., chen2023subspace
  • Proposition 4.2
  • Lemma 4.3
  • proof
  • Lemma A.2: Sampler quality from $L_2$ score bounds benton2024nearly
  • proof
  • ...and 40 more