提出新型混合子空间建模,让扩散模型更高效生成高质量图像。
Multi-Subspace Multi-Modal Modeling for Diffusion Models: Estimation, Convergence and Mixture of Experts
- 用低秩混合高斯建模数据子空间,捕捉潜在分布的多模态特性。
- 理论证明可突破维度诅咒,误差仅随样本数平方根下降。
- 在参数量少10倍时,生成效果媲美主流模型,适合小数据场景。
近期扩散模型在小样本(大小为n)和快速优化下表现优异,但其估计误差受维度诅咒影响,呈$n^{-1/D}$。由于图像通常为低维流形的并集,现有方法将数据建模为线性子空间上的高斯潜变量,实现$1/\sqrt{n}$误差界。然而高斯潜变量无法刻画潜流形的多模态性。为此,本文提出低秩混合高斯(MoLR-MoG)子空间建模:将目标数据视为K个线性子空间的并集,每个子空间内潜变量为具有$n_k$个模态、维度为$d_k$的混合高斯分布。该建模使对应得分函数自然具备混合专家(MoE)结构,能捕获多模态信息并含非线性特性。实验表明,基于MoE潜变量的混合高斯神经网络生成效果显著优于高斯潜变量模型;且在参数量仅为基准模型1/10的情况下,性能相当。进一步,基于此模型,本文给出估计误差界:$R^4\sqrt{\sum_{k=1}^K n_k}\sqrt{\sum_{k=1}^K n_k d_k}/\sqrt{n}$,利用数据结构逃逸维度诅咒。最后,在该建模下证明了优化过程的收敛性。综合结果表明,在接近真实数据设定下,解释了为何扩散模型只需少量训练样本即可快速达到高性能。
原文摘要 · Abstract (English)
Recently, diffusion models have achieved a great performance with a small dataset of size $n$ and a fast optimization process. However, the estimation error of diffusion models suffers from the curse of dimensionality $n^{-1/D}$ with the data dimension $D$. Since images are usually a union of low-dimensional manifolds, current works model the data as a union of linear subspaces with Gaussian latent and achieve a $1/\sqrt{n}$ bound. Though this modeling reflects the multi-manifold property, the Gaussian latent can not capture the multi-modal property of the latent manifold. To bridge this gap, we propose the mixture subspace of low-rank mixture of Gaussian (MoLR-MoG) modeling, which models the target data as a union of $K$ linear subspaces, and each subspace admits a mixture of Gaussian latent ($n_k$ modals with dimension $d_k$). With this modeling, the corresponding score function naturally has a mixture of expert (MoE) structure, captures the multi-modal information, and contains nonlinear property. We first conduct real-world experiments to show that the generation results of MoE-latent MoG NN are much better than MoE-latent Gaussian score. Furthermore, MoE-latent MoG NN achieves a comparable performance with MoE-latent Unet with $10 \times$ parameters. These results indicate that the MoLR-MoG modeling is reasonable and suitable for real-world data. After that, based on such MoE-latent MoG score, we provide a $R^4\sqrt{Σ_{k=1}^Kn_k}\sqrt{Σ_{k=1}^Kn_kd_k}/\sqrt{n}$ estimation error, which escapes the curse of dimensionality by using data structure. Finally, we study the optimization process and prove the convergence guarantee under the MoLR-MoG modeling. Combined with these results, under a setting close to real-world data, this work explains why diffusion models only require a small training sample and enjoy a fast optimization process to achieve a great performance.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。