aiqbench analysis
This paper advances generative modeling theory by decomposing flow-matching schedules into independent variance paths and factorizations, offering closed-form solutions to minimize regression variance during training. The analysis provides rigorous bounds on finite-step Euler accuracy for sampling, directly connecting geodesic and logarithmic paths in the context of centered commuting Gaussians. These theoretical insights are critical for optimizing the stability and efficiency of next-generation diffusion and flow-based models.
Gaussian Flow-Matching Schedules: Implications for Sampling and Training
arXiv:2609.25839v1 Announce Type: new Abstract: Flow-matching schedules affect both sampling dynamics and the variance of the regression target. For centered commuting Gaussians, we show that a direction-dependent schedule decomposes into two independent design choices: a variance path, which fully determines the intermediate laws and probability flow, and a factorization, which leaves this flow unchanged while controlling irreducible regression variance. On the sampling side, we analyze finite-step Euler accuracy and derive a necessary drift bound for exact N -step sampling, connecting the geodesic and the logarithmic path. On the training side, for any fixed path, we derive closed-form factorizations that either minimize time-averaged regression variance or make it constant along the path.
Abstract:Flow-matching schedules affect both sampling dynamics and the variance of the regression target. For centered commuting Gaussians, we show that a direction-dependent schedule decomposes into two independent design choices: a variance path, which fully determines the intermediate laws and probability flow, and a factorization, which leaves this flow unchanged while controlling irreducible regression variance. On the sampling side, we analyze finite-step Euler accuracy and derive a necessary drift bound for exact N -step sampling, connecting the geodesic and the logarithmic path. On the training side, for any fixed path, we derive closed-form factorizations that either minimize time-averaged regression variance or make it constant along the path.
Machine Learning (cs.LG)
arXiv:2609.25839 [cs.LG]
(or arXiv:2609.25839v1 [cs.LG] for this version)
https://doi.org/10.48550/arXiv.2609.25839 Focus to learn more arXiv-issued DOI via DataCite (pending registration)
arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.
Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.
Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.
Full text under the publisher's open licence · 200 words
Related coverage

[AINews] Meta Muse Wonder & Wonder Full: MSL’s Claude 5.5-tier Frontier Model
Latent Space · Oct 13, 2026

Scaling Categorical Flow Maps
Apple · Aug 7, 2026
On the Design Space of Continuous Diffusion Language Models
arXiv · Oct 12, 2026
The Loss Floor of Denoising Score Matching: Fisher Geometry from Schr\"odinger Bridges
arXiv · Aug 26, 2026