arXiv Machine Learning

I-SplineFlow: Learning Monotone Spline Stochastic Interpolant Schedulers for Few-Step Generation

I‑SplineFlow introduces a new way to learn monotone spline stochastic interpolant schedulers for few‑step generation with pretrained diffusion and flow models. By parameterizing the scheduler with integrated monotone splines (I‑splines), the method decouples polynomial degree from the number of mixture weights, enabling compact support, better‑conditioned Jacobians, and strictly monotone signal‑to‑noise ratios without ordering constraints. Experiments on EDM, ReFlow, and Simple ReFlow show that I‑SplineFlow consistently improves few‑step FID over Bézier scheduling, especially at low NFEs, while training in only minutes.

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 14

Velocity Scheduled Flow Matching

arXiv:2607. 11442v1 Announce Type: new Abstract: 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.

By Vitalii Bondar
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
Sep 22

Leveraging Inference-Time Compute for Diffusion Models via Global Scheduling of Denoising Trajectories

The paper studies how to allocate a fixed computational budget across the denoising steps of diffusion models to improve sample quality at deployment. It shows that the expected benefit of evaluating multiple candidates at a step can be decomposed into a step‑specific sensitivity and a universal sample‑size factor, and that the optimal allocation follows a water‑filling structure. Experiments demonstrate that this allocation achieves the same quality as a uniform strategy while reducing function evaluations by 20–50%.

By Yuan Cao, Yifu Tang, Hangqi Li, Zeyu Zheng
Hugging Face Trending Papers
Jul 22

Analytic Distribution of Classifier-Free Guidance for Schedule Design

Classifier-free guidance (CFG) is the default mechanism for conditional generation in diffusion models, but the distribution sampled by its deterministic guided dynamics is not captured by the usual product-distribution heuristic $p_0^ωq_0^{1-ω}$. We analyze CFG through the probability flow ODE and derive exact analytic path-integral representations of the induced distributions for both constant and time-dependent guidance.