Diffusion Models for High-Dimensional Clustered Data: Intrinsic-Dimension Adaptivity via Bayesian Classification

arXiv:2608.19067v1 Announce Type: cross Abstract: The empirical success of diffusion models in generative modelling has motivated theoretical work, including quantitative error bounds and qualitative analyses that characterise the different phases of denoising. We bring these two areas together by studying the adaptivity of diffusion models to the structured geometry of multimodal high-dimensional data that consists of multiple clusters in R^D, each with its own low-dimensional structure, and inter-cluster separation depending on D. We employ K-mixture Gaussian distributions as a canonical framework to capture this geometry and establish two theoretical results. First, we interpret denoising as a dynamical Bayesian classifier: the mixture score is a posterior-weighted average of cluster-wise scores, and we show that, with high probability, the posterior class probabilities concentrate on a single cluster once the signal-to-noise ratio reaches the scale Theta (log (KD)/D). Second, by separately analysing the denoising process in its mixing and cluster-commitment phases, we prove that the KL error bound depends linearly on the maximum intrinsic dimension of a cluster, up to a logarithmic factor, even when K grows polynomially with D. This improves on ambient-dimensional bounds and extends existing low-dimensional adaptivity analyses to multimodal distributions with heterogeneous, approximately low-rank covariances.

Related

• Local Hessian Spectral Filtering for Robust Intrinsic Dimension Estimation
• When Diffusion Model Can Ignore Dimension: An Entropy-Based Theory
• Convergence of Diffusion Models Under the Manifold Hypothesis in High-Dimensions
• Intrinsic Wasserstein Rates for Score-Based Generative Models on Smooth Manifolds

Source: arXiv cs.LG | 2026-08-20