REVIEW 36 cited by
Flow Matching on General Geometries
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
Flow Matching on General Geometries
read the original abstract
We propose Riemannian Flow Matching (RFM), a simple yet powerful framework for training continuous normalizing flows on manifolds. Existing methods for generative modeling on manifolds either require expensive simulation, are inherently unable to scale to high dimensions, or use approximations for limiting quantities that result in biased training objectives. Riemannian Flow Matching bypasses these limitations and offers several advantages over previous approaches: it is simulation-free on simple geometries, does not require divergence computation, and computes its target vector field in closed-form. The key ingredient behind RFM is the construction of a relatively simple premetric for defining target vector fields, which encompasses the existing Euclidean case. To extend to general geometries, we rely on the use of spectral decompositions to efficiently compute premetrics on the fly. Our method achieves state-of-the-art performance on many real-world non-Euclidean datasets, and we demonstrate tractable training on general geometries, including triangular meshes with highly non-trivial curvature and boundaries.
Forward citations
Cited by 36 Pith papers
-
A-CODE: Fully Atomic Protein Co-Design with Unified Multimodal Diffusion
A-CODE presents a fully atomic one-stage multimodal diffusion model for protein co-design that claims superior unconditional generation performance over prior one- and two-stage models plus a tenfold success-rate gain...
-
Quotient-Space Diffusion Models
Quotient-space diffusion models generate correct symmetric distributions by removing redundancy on the quotient space, simplifying learning and improving results on small molecules and proteins under SE(3) symmetry.
-
Learning Standard Model structure from LHC data with Riemannian flow matching
ShellFlow, a Riemannian flow-matching transformer fed only on-shell and invariant-mass priors and ~8×10^8 recorded ATLAS events, reproduces the SM's dilepton resonances, Weinberg angle, and top/W mass peaks in a singl...
-
Diffeomorphic Optimization
Proposes diffeomorphic optimization for manifold-constrained problems in generative models via flow maps, with Lie-group extensions for protein design showing metric improvements.
-
Panel Flow Matching: A Generative Approach to Learning Distributions of Longitudinal Data
Panel Flow Matching is a generative method to estimate panel densities from longitudinal data with statistical guarantees under irregular sampling, supporting completion, synthetic data, and classification.
-
Intrinsic Flow Matching on Quantum Pure-State Manifolds with Phase-Aligned Transport
IFM learns deterministic tangent velocity fields on CP^{d-1} via Pancharatnam phase-aligned paths, recovering marginal transport with endpoint and stability guarantees while showing empirical gains over Euclidean flow...
-
Geodesic Flow Matching on a Riemannian Degradation Manifold for Blind Image Restoration
Introduces geodesic flow matching on a Riemannian degradation manifold to generalize linear flow matching for blind image restoration.
-
Mat\'ern Noise for Triangulation-Agnostic Flow Matching on Meshes
Proposes discretized Matérn process noise for triangulation-agnostic flow matching on meshes with PoissonNet denoiser, tested on elastic states and humanoid poses for meshes exceeding one million triangles.
-
Learning Unbiased Permutations via Flow Matching
PermFlow applies conditional flow matching on the affine subspace of doubly stochastic matrices with a closed-form tangent projector and nearest-target coupling to capture multimodal permutation distributions.
-
SDFlow: Similarity-Driven Flow Matching for Time Series Generation
SDFlow uses similarity-driven flow matching with low-rank manifold decomposition and a categorical posterior to generate high-fidelity long time series in VQ space without step-wise error accumulation.
-
Generative Modeling with Orbit-Space Particle Flow Matching
OGPP is a particle flow-matching method using orbit-space canonicalization and geometric paths that achieves lower error and fewer steps than prior approaches on 3D benchmarks.
-
Diffusion Processes on Implicit Manifolds
Defines diffusion processes on implicit data manifolds via proximity-graph approximations to the infinitesimal generator and carré-du-champ operator, proves convergence in law to the continuous manifold process, and p...
-
Diffusion Processes on Implicit Manifolds
Implicit Manifold-valued Diffusions (IMDs) are data-driven SDEs built from proximity graphs that converge in law to smooth manifold diffusions as sample count increases.
-
CoLA-Flow Policy: Temporally Coherent Imitation Learning via Continuous Latent Action Flow Matching for Robotic Manipulation
CoLA-Flow Policy encodes action sequences into a continuous latent space and learns an explicit flow there, yielding near-single-step inference with up to 93.7% smoother trajectories and 25-point higher task success t...
-
FPSGen: Flexible Point Cloud Scene Generation with BEV-Supported Transport Flows
A two-stage flow-matching model that seeds point-cloud generation from a generated BEV density map, using teacher-estimated point pairings to keep transport paths straight, achieves SOTA JSD/IoU on SemanticKITTI compl...
-
x-Prediction Is All You Need:Training-Free Accelerated Generation via Endpoint Decodability
Affine probability paths make the clean endpoint algebraically recoverable from any intermediate state and velocity, so early-exit decoding yields training-free 20–70% NFE savings at near-matched quality.
-
Stable Autoregressive Speech Generation with Low-Frame-Rate High-Dimensional Continuous Tokens
Autoregressive TTS from 8-Hz, 768-dimensional continuous tokens works when the tokenizer shapes its latent space with a low-dimensional core and an energy hierarchy, and the generator separates guidance into local, se...
-
Probabilistic Inversion with Flow Matching
Adapts Flow Matching from generative AI to probabilistic inversion, evaluated on a simple 2D velocity model and the OpenFWI seismic dataset.
-
RiT: Vanilla Diffusion Transformers Suffice in Representation Space
A vanilla Diffusion Transformer trained via x-prediction on frozen DINOv2 features reaches FID 1.14 on ImageNet 256x256 with fewer parameters and faster sampling than prior DiT variants.
-
Flowing with Confidence
FMwC computes per-sample confidence scores for flow matching models via closed-form propagation of input-dependent multiplicative noise variance along the sampling ODE, supporting filtering, editing, and adaptive stepping.
-
Aligning Latent Geometry for Spherical Flow Matching in Image Generation
Projecting VAE latents to a fixed spherical radius and replacing linear interpolation with spherical linear interpolation improves class-conditional ImageNet-256 FID while leaving the diffusion architecture unchanged.
-
BRICKS: Compositional Neural Markov Kernels for Zero-Shot Radiation-Matter Simulation
BRICKS creates compositional neural Markov kernels via hybrid transformers and Riemannian Flow Matching on product manifolds to enable zero-shot simulation of radiation-matter interactions across arbitrary material di...
-
SDFlow: Similarity-Driven Flow Matching for Time Series Generation
SDFlow learns a global transport map via similarity-driven flow matching in VQ latent space, using low-rank manifold decomposition and a categorical posterior to handle discreteness, yielding SOTA long-horizon perform...
-
Quotient-Space Diffusion Models
Quotient-space diffusion models handle symmetries by diffusing on the space of equivalent configurations under group actions like SE(3), reducing learning complexity and guaranteeing correct sampling for molecular generation.
-
Continuous Adversarial Flow Models
Continuous adversarial flow models replace MSE in flow matching with adversarial training via a discriminator, improving guidance-free FID on ImageNet from 8.26 to 3.63 for SiT and similar gains for JiT and text-to-im...
-
Jeffreys Flow: Robust Boltzmann Generators for Rare Event Sampling via Parallel Tempering Distillation
Jeffreys Flow distills Parallel Tempering trajectories via Jeffreys divergence to produce robust Boltzmann generators that suppress mode collapse and correct sampling inaccuracies for rare event sampling.
-
MIOFlow 2.0: A unified framework for inferring cellular stochastic dynamics from single cell and spatial transcriptomics data
MIOFlow 2.0 learns stochastic cellular trajectories from transcriptomics data via neural SDEs, unbalanced optimal transport for growth, and a joint latent space unifying gene expression with spatial features.
-
CoLA-Flow Policy: Temporally Coherent Imitation Learning via Continuous Latent Action Flow Matching for Robotic Manipulation
Flow matching robot policies trained in a continuous latent action space produce smoother, more successful long-horizon manipulation than raw-action-space flow matching, at near-single-step inference speed.
-
CT-OT Flow: Estimating Continuous-Time Dynamics from Discrete Temporal Snapshots
CT-OT Flow reconstructs continuous-time dynamics from discrete aggregated snapshots via partial optimal transport for time inference and kernel smoothing, showing lower errors than baselines on synthetic and real datasets.
-
CT-OT Flow: Estimating Continuous-Time Dynamics from Discrete Temporal Snapshots
CT-OT Flow estimates continuous-time dynamics from discrete temporal snapshots by using partial optimal transport to align intervals and kernel smoothing to reconstruct distributions for ODE/SDE training.
-
Safe Vision Language Action Models via Barrier Enhanced Flow Matching
A control-barrier-function safety filter embedded in flow-matching denoising generates safe robot action chunks without retraining the base VLA model.
-
x-Prediction Is All You Need:Training-Free Accelerated Generation via Endpoint Decodability
Truncated Jump Sampling stops the ODE early and outputs the algebraically decoded x0 estimate, reducing NFEs by 20-70% across six model families with no retraining.
-
Recursive Flow Matching
RecFM uses recursive self-consistency in flow matching to enable high-fidelity one- and few-step (2-4 step) generation of scientific dynamics, claiming 20x speedup over diffusion emulators and 15% lower MSE than vanil...
-
Learning on the Manifold: Unlocking Standard Diffusion Transformers with Representation Encoders
Training flow matching along sphere geodesics with a curvature-aware loss weight lets standard DiT-B converge on DINOv2 features (FID 3.37 with guidance), contradicting the need for width scaling.
-
CoLA-Flow Policy: Temporally Coherent Imitation Learning via Continuous Latent Action Flow Matching for Robotic Manipulation
CoLA-Flow Policy encodes action sequences into latent trajectories and performs flow matching there, yielding near-single-step inference with up to 93.7% smoother trajectories and 25-point higher success rates than ra...
-
On the Importance of Tactile Sensing for Imitation Learning: A Case Study on Robotic Match Lighting
A multimodal visuotactile imitation learning framework using transformers and flow-based models improves robotic performance on the contact-rich task of match lighting.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.