pith. sign in

arxiv: 2304.14772 · v2 · pith:4TNGF6KDnew · submitted 2023-04-28 · 💻 cs.LG

Multisample Flow Matching: Straightening Flows with Minibatch Couplings

classification 💻 cs.LG
keywords datasamplesflowmatchingnoisepathssampleallows
0
0 comments X
read the original abstract

Simulation-free methods for training continuous-time generative models construct probability paths that go between noise distributions and individual data samples. Recent works, such as Flow Matching, derived paths that are optimal for each data sample. However, these algorithms rely on independent data and noise samples, and do not exploit underlying structure in the data distribution for constructing probability paths. We propose Multisample Flow Matching, a more general framework that uses non-trivial couplings between data and noise samples while satisfying the correct marginal constraints. At very small overhead costs, this generalization allows us to (i) reduce gradient variance during training, (ii) obtain straighter flows for the learned vector field, which allows us to generate high-quality samples using fewer function evaluations, and (iii) obtain transport maps with lower cost in high dimensions, which has applications beyond generative modeling. Importantly, we do so in a completely simulation-free manner with a simple minimization objective. We show that our proposed methods improve sample consistency on downsampled ImageNet data sets, and lead to better low-cost sample generation.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 10 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. MeshFlow: Mesh Generation with Equivariant Flow Matching

    cs.GR 2026-06 unverdicted novelty 7.0

    MeshFlow applies equivariant optimal-transport flow matching to generate triangle meshes as soups, matching autoregressive quality with an 18x inference speedup.

  2. Optimal Transport Flow Matching by Design

    cs.CV 2026-06 unverdicted novelty 7.0

    By designing the prior as the low-frequency projection of data images, flow matching achieves OT-optimal identity couplings without explicit OT computation, reducing trajectory curvature over 2x and improving few-step...

  3. The Velocity Deficit: Initial Energy Injection for Flow Matching

    cs.CV 2026-05 unverdicted novelty 7.0

    Flow matching underestimates velocities due to MSE loss leading to integration lag; Initial Energy Injection corrects the start-end asymmetry, improving FID by 44.6% and achieving 5x speedup on ImageNet-1k.

  4. Coreset-Induced Conditional Velocity Flow Matching

    stat.ML 2026-05 unverdicted novelty 7.0

    CCVFM uses an entropic Sinkhorn coreset to induce a closed-form Gaussian mixture source for hierarchical rectified flow matching, then trains a lightweight correction flow on the residual, achieving competitive few-st...

  5. Coreset-Induced Conditional Velocity Flow Matching

    stat.ML 2026-05 unverdicted novelty 7.0

    CCVFM replaces the inner noise source in hierarchical rectified flow matching with a data-informed Gaussian mixture surrogate from a Sinkhorn coreset, yielding a closed-form conditional velocity law and competitive fe...

  6. Generative Modeling with Orbit-Space Particle Flow Matching

    cs.GR 2026-05 unverdicted novelty 7.0

    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.

  7. SplineFlow: Flow Matching for Dynamical Systems with B-Spline Interpolants

    cs.LG 2026-01 unverdicted novelty 7.0

    SplineFlow uses B-spline interpolation inside flow matching to jointly construct stable conditional paths that satisfy multi-marginal constraints for dynamical systems with irregular observations.

  8. Generative Modeling of Discrete Data Using Geometric Latent Subspaces

    stat.ML 2026-01 unverdicted novelty 7.0

    A geometric latent-subspace model on Riemannian manifolds of categorical distributions enables low-dimensional generative modeling of discrete data via isometries and geometric PCA for flow matching.

  9. From Snapshots to Trajectories: Learning Single-Cell Gene Expression Dynamics via Conditional Flow Matching

    cs.LG 2026-05 unverdicted novelty 5.0

    scFM learns bidirectional velocity fields from entropically regularized OT couplings between snapshots, with added alignment and regularization to reduce drift in long-horizon predictions of single-cell trajectories.

  10. Divergence-Suppressing Couplings for Rectified Flow

    cs.AI 2026-05 unverdicted novelty 5.0

    Divergence-suppressing couplings attenuate the divergent part of the velocity field when generating training couplings for Rectified Flow, yielding straighter paths and better generation quality at no extra inference cost.