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:2603. 10718v3 Announce Type: replace Abstract: Flow Matching enables simulation-free training of generative models on Riemannian manifolds, yet sampling typically still relies on numerically integrating a probability-flow ODE.
By Zichen Zhong, Haoliang Sun, Yukun Zhao, Yongshun Gong, Yilong Yin
arXiv:2601.21831v3 Announce Type: replace
Abstract: We propose a geometric latent-subspace framework for generative modeling of discrete data. Specifically, we introduce latent subspaces in the expon...
By Daniel Gonzalez-Alvarado, Jonas Cassel, Stefania Petra, Christoph Schn\"orr
The paper introduces Finsler Flow Matching (FFM), a method for learning continuous stochastic dynamics from discrete Markov transition graphs in single‑cell snapshot data. FFM constructs a Finsler geometry using first and second local moments, learns directed geodesics via neural networks, and employs these to build geometry‑aware stochastic paths that can be simulated without explicit score or flow matching. Benchmark tests show that FFM better recovers intermediate cellular states, especially when dynamics are directional or anisotropic.
By Niklas Canova, Jonas Simon Fleck
arXiv:2505. 04486v4 Announce Type: replace-cross Abstract: Flow matching models have shown great potential in image generation tasks among probabilistic generative models.
By Anirban Samaddar, Yixuan Sun, Viktor Nilsson, Sandeep Madireddy
The paper proposes a continuous‑time generative framework that models time‑dependent data as evolution on a learned data manifold. By using pretrained score‑based models as geometric priors, it learns a vector field that drives data along score‑induced interpolation paths, enabling generation at arbitrary timestamps and temporal super‑resolution. The method includes a regression‑based training objective, a stability‑promoting term interpreted as denoising score matching, and a probabilistic extension for future trajectory distributions, demonstrated on natural video, PDE‑based fields, and molecular dynamics.
By Jan Tauberschmidt, Brian B. Moser, Stanislav Frolov, Andreas Dengel, Andrew B. Duncan, Sebastian J. Vollmer
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.
By Bing Cheng, Yi-Shuai Niu, Howell Tong, Shing-Tung Yau
The paper introduces a new method for perturbing data distributions in a way that respects equality constraints, allowing generative models to better handle constrained data. By adjusting the distribution while preserving the manifold geometry, the approach ensures support matches the ambient space dimension. Experiments with diffusion models and normalizing flows demonstrate improved data recovery and stable sampling across several tasks.
By Katherine Keegan, Lars Ruthotto
arXiv:2602.19600v2 Announce Type: replace
Abstract: Many high-dimensional datasets concentrate near a low-dimensional structure embedded in the ambient space. Generative models for such data must con...
By Xinyu Tian, Xiaotong Shen
arXiv:2606. 07036v1 Announce Type: cross Abstract: Synthetic histopathology image generation addresses critical challenges in computational pathology, including patient privacy and the growing need for large-scale training data for foundation models.
By Won June Cho, Daeky Jeong, Hyeongyeol Lim, Hongjun Yoon
arXiv:2605.05736v3 Announce Type: replace
Abstract: Vector quantization (VQ) with autoregressive (AR) token modeling is a widely adopted and highly competitive paradigm for time-series generation. Ho...
By Wei Li, Shibo Feng, Pengcheng Wu, Xingyu Gao, Min Wu, Peilin Zhao