From Euler to Dormand-Prince: ODE Solvers for Flow Matching Generative Models
arXiv:2605.00836v1 Announce Type: new Abstract: Sampling from Flow Matching generative models requires solving an ordinary differential equation (ODE) whose computational cost is dominated by neural network forward passes. We derive four classical ODE solvers — Euler, Explicit Midpoint, Classical Runge-Kutta…
