Generative Modelling with Flow Matching, Optimal Transport, and Schrödinger bridge
Flow matching reframes generative modeling as deterministic transport from noise to data via learned velocity fields, eliminating stochastic reversal steps Optimal transport coupling pairs source and target samples by minimum squared distance, producing straighter trajectories that integrate in far fewer ODE steps Schrödinger bridge generalizes both linear and OT paths as stochastic interpolants controlled by a diffusivity parameter σ The same training loop and network architecture support all f
Analysis
TL;DR
- Flow matching reframes generative modeling as deterministic transport from noise to data via learned velocity fields, eliminating stochastic reversal steps
- Optimal transport coupling pairs source and target samples by minimum squared distance, producing straighter trajectories that integrate in far fewer ODE steps
- Schrödinger bridge generalizes both linear and OT paths as stochastic interpolants controlled by a diffusivity parameter σ
- The same training loop and network architecture support all four configurations (linear/VP/Schrödinger × independent/OT coupling)
- Inverse problems (inpainting, denoising, super-resolution) can reuse a single trained field by steering the sampling ODE with measurement constraints
Why It Matters
This unified formulation collapses what appeared to be five separate generative methods into configurations of one object, giving practitioners a single codebase to explore tradeoffs between speed, quality, and flexibility. For AI engineers, it means diffusion-like models can generate high-quality samples in 50 steps instead of hundreds, directly impacting inference cost and real-time deployment.
Technical Details
- Core objective: Train neural network vθ(x,t) to predict conditional velocity ut given interpolated state xt = (1-t)x0 + tx1, minimizing E[||vθ(xt,t) - ut||²] over sampled endpoint pairs and uniform time t
- Interpolants: Linear (constant velocity, straight paths), Variance-Preserving (trigonometric schedule α²t + σ²t = 1, curved diffusion-style paths), Schrödinger Bridge (Brownian bridge with diffusivity σ, stochastic corridor widening at middle times)
- OT Coupling: Within each mini-batch, solve discrete assignment π minimizing Σ||x0_i - x1_π(i)||² via Hungarian algorithm; reduces mean transport cost from 8.60 (independent) to 4.92 (OT), eliminates crossing trajectories
- Sampling: ODE solver dx/dt = vθ(x,t) from t=0 to t=1; explicit Euler needs many steps for curved fields, Heun (second-order trapezoidal) achieves quality in ~50 steps with OT-coupled straight paths
- Inverse problems: Given measurement y = Ax1 + noise, steer sampling via posterior p(x1|y) by adding gradient guidance term to ODE at each solver step, reusing unconditional field without retraining
Industry Insight
- The modular separation of interpolant × coupling × loss × solver means teams can swap components independently; adopting OT coupling alone can cut inference steps by 10x without changing model architecture
- Schrödinger bridge with σ > 0 provides a continuous interpolation between deterministic flow matching and stochastic diffusion, offering a tunable knob for exploring entropy-regularized transport in production systems
- Inverse problem reuse is a practical differentiator: one trained generator serves denoising, inpainting, and super-resolution simultaneously, reducing model inventory and deployment complexity for media/medical imaging pipelines
Disclaimer: The above content is generated by AI and is for reference only.