Score-based generative models learn manifold-like structures with constrained mixing

Li Kevin Wenliang, Ben Moran
11/16/2023
stat.MLcs.CVcs.LG

No confident code implementation found for this paper.

Abstract

How do score-based generative models (SBMs) learn the data distribution supported on a low-dimensional manifold? We investigate the score model of a trained SBM through its linear approximations and subspaces spanned by local feature vectors. During diffusion as the noise decreases, the local dimensionality increases and becomes more varied between different sample sequences. Importantly, we find that the learned vector field mixes samples by a non-conservative field within the manifold, although it denoises with normal projections as if there is an energy function in off-manifold directions. At each noise level, the subspace spanned by the local features overlap with an effective density function. These observations suggest that SBMs can flexibly mix samples with the learned score field while carefully maintaining a manifold-like structure of the data distribution.

View on arXivView PDF

Code Implementations

No confident code match yet

We couldn't find an author-owned or strongly-evidenced community implementation for this paper. Any repos shown below are weak matches — verify before relying on them.

No code implementations found yet.

Know of an implementation? Let us know in the comments below!

Similar Papers

Cite this paper

@article{wenliang2023scorebased,
  title  = {Score-based generative models learn manifold-like structures with constrained mixing},
  author = {Li Kevin Wenliang and Ben Moran},
  year   = {2023},
  eprint = {2311.09952},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2311.09952v1}
}

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/2311.09952.svg)](https://codeofpaper.com/paper/2311.09952)

Discussion