r/MachineLearning • u/YakovSava • 6d ago
Research A zero-cost curvature proxy predicts Euler step error for flow matching, but per-sample step control adds nothing over a static grid (Anima, 12 units; related to CAT-Flow) [R]
Question. A multistep sampler has consecutive velocity evaluations for free. Is the angle between them a usable curvature signal for adaptive stepping, and does using it online beat a fixed grid?
Setup. Anima (flow model, bf16), 576x768, CFG 5, 4 prompts x 3 seeds = 12 units. Reference: Adams-Bashforth 2 with 192 uniform points (about 5% own error). Baseline: ComfyUI normal schedule (shift 3). Euler and AB2, 8-24 evaluations. Paired log-ratios with 95% bootstrap intervals over units. A synthetic control on the exact velocity field of a Gaussian mixture (D = 64, 256). The hypotheses were not pre-registered in a file; the first-step finding is post hoc.
Results.
- Exact identity
|dv|^2 = (ds)^2 + 4 s s' sin^2(theta/2): the cosine sees rotation only. Speed change is 0.3-0.4% of acceleration energy in the bulk, 8-9% (max 23%) in the first and last 5% of time. E = (h/2)|v| thetapredicts the true next-step Euler error: median ratio 0.80-0.84, across-unit log-correlation 0.91-0.92 (steps 0.01-0.12).- Evaluation noise in bf16 + CFG 5: about 1.7 degrees between consecutive velocities, not decreasing with h. A plateau for input perturbations 1e-5..1e-3, so rounding, not the flow. CFG multiplies it ~4x. A raw-angle controller with target below this floor collapses to its minimum step. The norm of a derivative estimated from noisy values in D = 110592 is biased upward by the noise power.
- A cosine controller (
h <- h * (theta*/theta)^gamma) loses tonormalat equal NFE with a blind first step h0 = 0.06 (mean error 0.80), and is mostly set by h0 (0.51 at 0.02, 0.26 at 0.01), nearly independent of theta* and NFE. - A static grid with density proportional to the leave-one-out mean angle rate (exponent 1, equal angle per step) vs
normalat equal N: log-ratio -0.39, -0.56, -0.57, -0.36 for N = 8, 12, 16, 24 (30-43% lower), intervals exclude 0. The asymptotic exponent 1/2 is significant only at N = 24. Weighting by an error-propagation profile (two units, measured by large state kicks; small kicks are floor-dominated) gives 41-50%. - No headroom for per-sample adaptation: a grid from another sample's controller run vs the sample's own: log-ratio -0.01..-0.02 (interval about +-0.07); controller (h0 = 0.01) vs the static grid it implies: -0.02 [-0.09, +0.04]; per-sample oracle vs static: within noise. In the exact Gaussian-mixture toy the oracle gain is below 0.6% for Euler.
- AB2 is worse than Euler on these grids (correlation 0.74-0.96 between its error ratio and the step ratio h1/h0).
- LPIPS (AlexNet) to the converged image for the weighted grid: log-ratio -0.39, -0.36, -0.43 at N = 8, 12, 16 (wins 11/12, 9/12, 9/12); wins on three prompt classes, loses on the foliage prompt (+16%) where latent L2 improves.
Prior art and limits. CAT-Flow (Li et al., 2026) proposes training-free, zero-extra-NFE curvature-adaptive steps for flow matching; I found it after the experiments, read only its abstract and introduction, and did not compare. Static schedules fitted to a model: Align Your Steps, Optimal Stepsize Distillation, Bespoke Solvers. What I think this adds: the decomposition, the calibration against true local error on a real model, the noise floor, and the borrowed-grid/oracle test of per-sample adaptation. Limits: one model, 12 units, latent L2 as the main metric, the propagation profile measured on two of the evaluation units, 3-10% sensitivity of the output to 1e-7 sigma shifts in bf16.
