atlas

Research map / Image generation / Fast diffusion sampling

Accelerating Diffusion Sampling with Optimized Time Steps

CVPR 2024 · Image generation › Fast diffusion sampling · approach: Fast diffusion ODE solvers · 25 citations (OpenAlex)

Read the paperCheck your idea against 108,967 papers

AI-extracted summary. Written by AI from the paper's full text. Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.

Optimizes diffusion sampling time steps by minimizing a surrogate error bound for high-order ODE solvers (UniPC, DPM-Solver++), solved via constrained trust region in seconds, improving FID at 5 NFEs across pixel and latent DPMs.

Problem

Training-free diffusion ODE samplers with few steps use uniform (or hand-designed) time-step schedules, which are suboptimal when the number of sampling steps is small.

Approach

Derive an upper bound on the distance between the approximate ODE solution from a general local-polynomial explicit solver and the ground-truth x0, under a score-error assumption; minimize the bound over time steps with a constrained trust-region solver, yielding a plug-and-play, near-zero-cost optimized schedule.

Key results

Measured effects reported in the paper

What was changedWhereMeasuredEffect
Optimize UniPC time steps instead of using uniform-λ stepsUniPC on CIFAR-10 32x32 · CIFAR-10 32x32, 5 NFEsFID: 23.22 -> 12.11Helped
Optimize DPM-Solver++ time steps instead of using uniform-λ stepsDPM-Solver++ on CIFAR-10 32x32 · CIFAR-10 32x32, 5 NFEsFID: 29.22 -> 12.91Helped
Optimize UniPC time steps instead of using uniform-λ stepsUniPC on ImageNet 64x64 · ImageNet 64x64, 5 NFEsFIDHelped
Optimize UniPC time steps instead of using uniform-t stepsUniPC on ImageNet 256x256 · ImageNet 256x256, 5 NFEsFID: 23.48 -> 8.66Helped
Optimize UniPC time steps instead of using uniform-t stepsUniPC on ImageNet 512x512 · ImageNet 512x512, 5 NFEsFID: 20.28 -> 11.40Helped
Optimize UniPC time steps instead of baseline discretization schemesUniPC on FFHQ 64x64 · FFHQ 64x64, 5 NFEsFIDHelped
Optimize UniPC time steps instead of baseline discretization schemesUniPC on AFHQv2 64x64 · AFHQv2 64x64, 5 NFEsFIDHelped

Surprising findings

Limitations

Experimental setup

Datasets: CIFAR-10 ImageNet 64x64 FFHQ 64x64 AFHQv2 64x64 ImageNet 256x256 ImageNet 512x512

Benchmarks: CIFAR-10 ImageNet 64x64 FFHQ 64x64 AFHQv2 64x64 ImageNet 256x256 ImageNet 512x512

Metrics: FID

Baselines: UniPC with uniform-t UniPC with uniform-λ UniPC with EDM schedule DPM-Solver++ with uniform-λ DPM-Solver++ with uniform-t DPM-Solver++ with EDM

Builds on: UniPC DPM-Solver++ EDM DDIM

Closest papers by meaning

Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.

Open scime draft

Get the next scime Dispatch and a monthly field update

Free. We send a confirmation link first; every email has a one-click unsubscribe. Privacy