arXiv Machine Learning

Gaussian Flow-Matching Schedules: Implications for Sampling and Training

The paper studies how flow‑matching schedules influence sampling dynamics and regression variance. For centered commuting Gaussians, it shows that a direction‑dependent schedule splits into a variance path that determines intermediate laws and a factorization that keeps the flow unchanged while controlling irreducible regression variance. The authors analyze finite‑step Euler accuracy, derive a drift bound for exact N‑step sampling, and provide closed‑form factorizations that either minimize time‑averaged regression variance or keep it constant along a fixed path.

arXiv AI
Sep 3

GeoSPRINT: Geometric Redundancy-Aware Step Pruning for Inference in Diffusion Trajectories

GeoSPRINT is a training‑free framework that constructs non‑uniform sampling schedules for diffusion model inference by detecting geometrically redundant steps in denoising trajectories. It uses a hyperplanarity test in latent space, implemented via QR factorization, to allocate more steps to high‑curvature regions, and introduces the trajectory projection score α_traj as a model‑free diagnostic for flow quality. Across CIFAR‑10, LSUN Church, and Stable Diffusion v1.5, GeoSPRINT consistently outperforms uniform DDIM schedules at matched NFE budgets, improving FID scores by up to 1.93 points.

By Arpita Joshi
arXiv Machine Learning
Jul 1

Dynamic Gaussian Processes and the Vanilla-SPDE Exchange

arXiv:2606. 31063v1 Announce Type: cross Abstract: Gaussian process inference is often limited by cubic computational costs, a challenge that becomes more pronounced in spatio-temporal settings where posterior inference is required over dense grids.

By Rui-Yang Zhang, Lachlan Astfalck, Edward Cripps, David Leslie, Henry Moss
arXiv Computer Vision
Aug 24

Difficulty-Calibrated Interpolation Paths for Conditional Flow Matching

The paper introduces Difficulty-Calibrated Flow Matching, a method that adapts the noise-to-data interpolation schedule in Conditional Flow Matching based on a pilot run’s loss profile. By setting the schedule to the quantile function of this difficulty profile, the training trajectory spends more time where the velocity is hardest to learn. Experiments on CIFAR-10, MNIST, and Fashion‑MNIST show that this calibrated path achieves the best FID on CIFAR‑10 and outperforms all fixed schedules in large‑batch, few‑update settings, where compute is most limited.

By Airin Akter Tania, Md Raihan Khan
Hugging Face Trending Papers
Jul 13

Velocity Scheduled Flow Matching

Flow matching trains a neural network to regress the conditional velocity along a linear interpolant between noise and data, and the number of network evaluations~(NFE) sets the cost of sampling. The straight-line interpolant carries an implicit choice: the sample moves at constant speed throughout the trajectory.

arXiv Machine Learning
Jul 16

Heavy-Tailed Flow Matching via Random Clocks

arXiv:2607. 13841v1 Announce Type: new Abstract: Heavy-tailed data arise in many domains where rare events carry disproportionate importance, such as imbalanced image datasets, financial returns, and weather extremes.

By Zhouhao Yang, Yezhen Wang, Kenji Kawaguchi, Vladimir Braverman, Haoyang Cao