A Theory of Speciation in Generative Diffusion Models on Compact Riemannian Manifolds
Read the original on arXiv Machine Learning →The Flow has not summarised this story yet — read it at arXiv Machine Learning.
The Flow has not summarised this story yet — read it at arXiv Machine Learning.
RW-Flow presents a new one‑step generative framework for data on compact manifolds, leveraging Wasserstein gradient flows. The authors derive a necessary and sufficient identifiability condition for velocity fields on compact, connected Riemannian manifolds, showing that a symmetric, Lipschitz‑continuous cost function yields identifiability iff its Gibbs kernel is nondegenerate. Experiments on geospatial events, protein and RNA torsion angles, and discretized manifolds demonstrate that RW‑Flow surpasses existing one‑step methods across most benchmark settings.
arXiv:2607. 06497v1 Announce Type: new Abstract: We introduce EntroPath, a manifold learning method that recovers geodesic geometry from data graphs through ensembles of diffusion paths.
arXiv:2505. 04338v3 Announce Type: replace Abstract: We propose Riemannian Denoising Diffusion Probabilistic Models (RDDPMs) for learning distributions on submanifolds of Euclidean space that are level sets of functions, including most of the manifolds relevant to applications.
The paper introduces Riemannian Neural Hamiltonian Flows, a generative model that extends Hamiltonian normalizing flows to Riemannian manifolds by combining a fixed kinetic energy, a learned scalar potential, and a geodesic leapfrog integrator. It provides an analysis showing how the learned Hamiltonian can be interpreted through an implicit profile and a matched potential, with special cases such as isotropic Gaussian and local harmonic analysis around modes. Experiments on Euclidean, hyperbolic, and spherical spaces demonstrate competitive sample quality and computational efficiency compared to a Riemannian continuous normalizing flow, while confirming the interpretability of the learned potential.
arXiv:2607. 03329v1 Announce Type: new Abstract: Conventional uniform convergence bounds and empirical risk minimization break down in massive over-parameterized models, such as large language transformers and biological sequence networks.
arXiv:2609.24737v1 Announce Type: new Abstract: We introduce Ananke, a representation-learning framework that scaffolds latent representations onto a structured product-torus prior, and its flagship...