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.
By Ualibyek Nurgulan, Seungwoo Yoo, Prin Phunyaphibarn, Minhyuk Sung
arXiv:2609.25659v1 Announce Type: new
Abstract: Many scientific datasets, such as molecular conformational ensembles or single-cell tissue measurements, are naturally modeled as meta-distributions: d...
By Doron Haviv, Edward De Brouwer, Rishabh Anand, Rex Ying, A\"icha Bentaieb, Gabriele Scalia, Hector Corrada Bravo
arXiv:2609.37649v1 Announce Type: cross
Abstract: Many datasets carry an intrinsic directionality: citations point backward in time, cells differentiate along lineages, and traffic follows preferred...
By Gwendal Debaussart-Joniec (CB, ENS Paris Saclay), Th\'eau Blanchard (HeKA | U1346, GE Healthcare), Argyris Kalogeratos (CB, ENS Paris Saclay)
arXiv:2409. 18804v3 Announce Type: replace-cross Abstract: Denoising Diffusion Probabilistic Models (DDPM) are powerful state-of-the-art methods used to generate synthetic data from high-dimensional data distributions and are widely used for image, audio, and video generation as well as many more applications in science and beyond.
By Iskander Azangulov, George Deligiannidis, Judith Rousseau
arXiv:2606. 14334v1 Announce Type: new Abstract: High-dimensional datasets often concentrate near low-dimensional structures, but estimating their geometry from samples typically relies on graphs and kernels that scale poorly with dataset size and dimension.
By Jacob Bamberger, Adam Gosztolai, Pierre Vandergheynst, Michael Bronstein, Iolo Jones
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.
By Zichen Liu, Wei Zhang, Christof Sch\"utte, Tiejun Li
arXiv:2608. 04827v1 Announce Type: cross Abstract: We introduce the Intrinsic Hybrid Latent Diffusion Model (ILDM), a generative framework that integrates probabilistic dimensionality reduction with geometry-aware diffusion on unknown manifolds.
By Yizhu Wang, Mu Niu, Xiaochen Yang
arXiv:2609.36568v1 Announce Type: new
Abstract: Diffusion models have emerged as state-of-the-art generative models, with recent extensions from Euclidean spaces to Riemannian manifolds. However, exi...
By Yuhao Liu, Longbo Huang
We introduce the Intrinsic Hybrid Latent Diffusion Model (ILDM), a generative framework that integrates probabilistic dimensionality reduction with geometry-aware diffusion on unknown manifolds. While diffusion models (DMs) have achieved state-of-the-art results in high-dimensional data synthesis, they rely on large training datasets and ignore intrinsic geometric structure.
arXiv:2607. 03145v1 Announce Type: cross Abstract: The informativeness of a training set is as consequential as its size, yet most sampling strategies remain agnostic to the intrinsic geometry of the data distribution.
By Alexandre L. M. Levada
arXiv:2607. 22381v1 Announce Type: new Abstract: Curvature notions on graphs, particularly Ollivier-Ricci and Forman, have emerged as powerful tools for addressing fundamental issues in Graph Neural Networks (GNNs) such as oversmoothing and oversquashing, but rely almost exclusively on local edge-level comparisons and therefore fail to certify how information actually propagates over long distances.
By Rachid Caich, Yassine Abbahaddou
Pheno-GS is a new method for computing scalable, geometry-aware optimal transport distances between large patient cohorts of single‑cell data. It uses graph connectivity regularization, an unbalanced OT formulation with KL marginal penalties, and a batched matrix algorithm that dramatically speeds up pairwise distance calculations. The authors validate the approach on synthetic benchmarks and a CyTOF perturbation dataset.
By Alistair Wilkinson, Christopher J. Tape, Smita Krishnaswamy