English

Efficient Diffusion Models for Symmetric Manifolds

Machine Learning 2025-05-29 v1 Artificial Intelligence Data Structures and Algorithms Probability Machine Learning

Abstract

We introduce a framework for designing efficient diffusion models for dd-dimensional symmetric-space Riemannian manifolds, including the torus, sphere, special orthogonal group and unitary group. Existing manifold diffusion models often depend on heat kernels, which lack closed-form expressions and require either dd gradient evaluations or exponential-in-dd arithmetic operations per training step. We introduce a new diffusion model for symmetric manifolds with a spatially-varying covariance, allowing us to leverage a projection of Euclidean Brownian motion to bypass heat kernel computations. Our training algorithm minimizes a novel efficient objective derived via Ito's Lemma, allowing each step to run in O(1)O(1) gradient evaluations and nearly-linear-in-dd (O(d1.19)O(d^{1.19})) arithmetic operations, reducing the gap between diffusions on symmetric manifolds and Euclidean space. Manifold symmetries ensure the diffusion satisfies an "average-case" Lipschitz condition, enabling accurate and efficient sample generation. Empirically, our model outperforms prior methods in training speed and improves sample quality on synthetic datasets on the torus, special orthogonal group, and unitary group.

Keywords

Cite

@article{arxiv.2505.21640,
  title  = {Efficient Diffusion Models for Symmetric Manifolds},
  author = {Oren Mangoubi and Neil He and Nisheeth K. Vishnoi},
  journal= {arXiv preprint arXiv:2505.21640},
  year   = {2025}
}

Comments

The conference version of this paper appears in ICML 2025

R2 v1 2026-07-01T02:44:18.825Z