Skip to content

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

Sep 2026 · 0 citations · 20 references
Computer Science

TL;DR

GeometricSPRINT (Geometric Step Pruning for Inference in Trajectories), a training-free framework for constructing non-uniform sampling schedules from the geometry of denoising trajectories, consistently improves over uniform DDIM (Denoising Diffusion Implicit Models) schedules at matched NFE budgets.

Abstract

Diffusion models achieve high sample quality but remain expensive at inference time because sampling requires many sequential neural function evaluations (NFEs). Existing acceleration methods either use fixed step-skipping schedules, adapt step sizes based on local numerical error, or require additional training. We introduce GeoSPRINT (Geometric Step Pruning for Inference in Trajectories), a training-free framework for constructing non-uniform sampling schedules from the geometry of denoising trajectories. GeoSPRINT detects geometrically redundant steps using a hyperplanarity test in latent space, implemented efficiently via QR factorization, and converts the resulting redundancy profile into a sampling schedule that allocates more steps to high-curvature regions of the trajectory. In addition, we introduce the trajectory projection score $\alpha_{\mathrm{traj}}$, a residual-variance metric that quantifies trajectory straightness and serves as a model-free diagnostic for rectified flow quality. Across CIFAR-10 ($32{\times}32$), LSUN Church ($256{\times}256$), and Stable Diffusion v1.5 ($512{\times}512$ latent), GeoSPRINT consistently improves over uniform DDIM (Denoising Diffusion Implicit Models) schedules at matched NFE budgets. On CIFAR-10, GeoSPRINT improves FID (Fr\'echet Inception Distance) by 0.7-1.1 over DDIM across 49-89 NFEs and surpasses DPM-Solver++ at NFE${\geq}30$ despite using a first-order DDIM solver. On LSUN Church, it reduces FID from 1.48 to 1.26 at 52 steps, and on Stable Diffusion v1.5 it achieves up to 1.93 FID improvement over DDIM. These results show that trajectory geometry provides a useful global signal for allocating inference steps and that schedule quality can substantially improve diffusion sampling efficiency without retraining.

View source

Similar papers

#machine learning Preprint Sep 2026

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

Diffusion models generate a sample by traversing a denoising trajectory, a sequence of stochastic noise-reduction steps that transforms pure noise into a draw from a target distribution. At deployment time, additional computation can improve sample quality without retraining: at each step, the sampler draws several can...

Yuan Cao, Yi-Fu Tang, Hang-Qi Li et al. · 0 citations
#machine learning Preprint Sep 2026

Schedule optimization for tau-leaping in masked discrete diffusion

Masked discrete diffusion models are commonly accelerated using the so-called tau-leaping discretization method, which reveals several coordinates in parallel at each sampling step. The sampler replaces the joint conditional law of each revealed block by a product distribution, incurring a factorization error $\varepsi...

C. Secchi, Giacomo Zanella · 0 citations
Conference Aug 2026

A Comprehensive Evaluation of Timestep Discretization Strategies in Text-to-Image Diffusion Models

Text-to-image latent diffusion models produce unprecedented visual fidelity but remain severely bottlenecked by the computational latency of iterative sampling. While optimizing the discretization of the continuous-time variable offers a powerful, training-free acceleration pathway, the comparative tradeoffs of foundat...

Tan-Yan Bao, Huy-Tan Thai · 0 citations
Preprint Aug 2026

Density-Reweighted Entropic Optimal Transport: Decoupling Geometry from Sampling Density

Dataset alignment is a central step in data analysis across science and engineering, where the goal is to match observations between datasets. Entropic Optimal Transport (EOT) offers a computationally tractable framework for this task by encoding cross-dataset affinities in a transport plan. However, when two datasets...

Keyi Li, Y. Kluger, Boris Landa · 0 citations
#artificial intelligence Preprint Sep 2026

Accelerating Video Diffusion via Training-Free Trajectory Routing

TRACK: TRajectory-Aware Capacity routing via top-K selection is presented, a heterogeneous denoising strategy that switches between compatible large and small models at selected steps, reducing the average cost per denoising evaluation.

Mustafa Munir, H. Vũ, Shreyas Misra et al. · 0 citations
Preprint Aug 2026

XYZFlow:Scaling Multi dimensional Shortcut Flows for Efficient Generative Modeling

High-fidelity image generation faces a trade-off between speed and quality. Diffusion models produce strong visuals but require costly iterative sampling. Existing efficient methods mainly distill pretrained models into few-step samplers, a challenging process that depends heavily on teacher-model quality. In this pape...

Jin-Xiu Liu, Xuan Liu, Kang-Fu Mei et al. · 0 citations

Related blog posts

MIT News · Artificial Intelligence Sep 29, 2026

Who we become when we talk to machines

Professor Sherry Turkle’s new book, “Artificial Intimacy,” offers a withering critique of chatbots and the antisocial dynamics she believes they encourage.

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.