Pith. sign in

REVIEW 11 cited by

Align Your Steps: Optimizing Sampling Schedules in Diffusion Models

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2404.14507 v1 pith:HZMBNDPF submitted 2024-04-22 cs.CV cs.LG

Align Your Steps: Optimizing Sampling Schedules in Diffusion Models

classification cs.CV cs.LG
keywords samplingschedulesapproachaligndifferentdiffusionhand-craftedmodels
verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved
0 comments
Share X Bluesky LinkedIn Reddit HN
abstract

Diffusion models (DMs) have established themselves as the state-of-the-art generative modeling approach in the visual domain and beyond. A crucial drawback of DMs is their slow sampling speed, relying on many sequential function evaluations through large neural networks. Sampling from DMs can be seen as solving a differential equation through a discretized set of noise levels known as the sampling schedule. While past works primarily focused on deriving efficient solvers, little attention has been given to finding optimal sampling schedules, and the entire literature relies on hand-crafted heuristics. In this work, for the first time, we propose a general and principled approach to optimizing the sampling schedules of DMs for high-quality outputs, called $\textit{Align Your Steps}$. We leverage methods from stochastic calculus and find optimal schedules specific to different solvers, trained DMs and datasets. We evaluate our novel approach on several image, video as well as 2D toy data synthesis benchmarks, using a variety of different samplers, and observe that our optimized schedules outperform previous hand-crafted schedules in almost all experiments. Our method demonstrates the untapped potential of sampling schedule optimization, especially in the few-step synthesis regime.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 11 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. Asymptotic Preservation and Uniform Accuracy of Diffusion and Flow-Matching Samplers

    cs.LG 2026-07 accept novelty 7.5

    DDIM (σ-clock Euler) is the unique layer-exact fixed-step sampler; deterministic residual budgets stay O(1) with no log(1/σ_min), while stochastic path-KL scales as Λ²/N from the Itô term alone.

  2. Entropy Across the Bridge: Conditional-Marginal Discretization for Flow and Schr\"odinger Samplers

    cs.LG 2026-05 unverdicted novelty 7.0

    Derives a conditional-marginal entropy-rate objective for bridge-aware discretization that yields U-shaped schedules and improves low-NFE sample quality on 2D, CIFAR-10, and protein tasks.

  3. $Z^2$-Sampling: Zero-Cost Zigzag Trajectories for Semantic Alignment in Diffusion Models

    cs.CV 2026-04 unverdicted novelty 7.0

    Z²-Sampling implicitly realizes zero-cost zigzag trajectories for curvature-aware semantic alignment in diffusion models by reducing multi-step paths via operator dualities and temporal caching while synthesizing a di...

  4. Efficient Video Diffusion Models: Advancements and Challenges

    cs.CV 2026-04 unverdicted novelty 7.0

    A survey that groups efficient video diffusion methods into four paradigms—step distillation, efficient attention, model compression, and cache/trajectory optimization—and outlines open challenges for practical use.

  5. A Decomposable Probe for Few-Step Diffusion Models: Prompt, Latent, and Score Selectivity across Backbone Families and Distillation Paradigms

    cs.CV 2026-07 conditional novelty 6.5

    A three-layer perturbation probe shows latent selectivity is a near-binary rectified-flow fingerprint that survives ADD distillation, while score selectivity tracks distillation objective across 23 T2I models.

  6. Amortized Moment Matching for Visual Generation

    cs.LG 2026-07 accept novelty 6.0

    Amortized Fréchet Distance uses neural nets to match conditional means and covariances, yielding stronger one-step visual generators than explicit FD-loss or multi-step teachers.

  7. Asymptotic Preservation and Uniform Accuracy of Diffusion and Flow-Matching Samplers

    cs.LG 2026-07 conditional novelty 6.0

    A diffusion sampler's terminal rule and grid, not its update formula alone, determine its zero-noise behavior; one fitted terminal map restores asymptotic preservation and new Hermite maps raise the provable endpoint ...

  8. Budget-Constrained Step-Level Diffusion Caching

    cs.CV 2026-06 conditional novelty 6.0

    BudCache optimizes step cache policies for a fixed inference budget in diffusion models via combinatorial search, outperforming threshold heuristics in quality on FLUX.1-dev and Wan2.1.

  9. SANTS: A State-Adaptive Scheduler for World Action Models

    cs.RO 2026-05 conditional novelty 6.0

    A state-adaptive noise-trajectory scheduler selects intermediate video conditions for action generation, matching or beating full-denoising WAMs at far lower latency.

  10. SANTS: A State-Adaptive Scheduler for World Action Models

    cs.RO 2026-05 unverdicted novelty 5.0

    SANTS adaptively chooses denoising depth in video-based robot action diffusion policies using a state-dependent stopping hazard and noise ratio, trained via downstream action reward to reduce latency.

  11. Designing Instance-Level Sampling Schedules via REINFORCE with James-Stein Shrinkage

    cs.LG 2025-11 unverdicted novelty 5.0

    Instance-level sampling schedules optimized via REINFORCE with James-Stein estimator improve text-to-image alignment and allow 5-step Flux generation to match deliberately distilled samplers.