atlas

Research map / Learning theory and algorithms / Sample complexity

Faster Diffusion Sampling with Randomized Midpoints: Sequential and Parallel

ICLR 2025 · Learning theory and algorithms › Sample complexity · approach: Learning under log-concave distributions · 0 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.

Adapts Shen and Lee's randomized midpoint method to diffusion probability-flow ODE sampling with underdamped Langevin correctors, improving TV dimension dependence to d^{5/12} and giving the first provable O(polylog d) parallel-round diffusion sampler.

Problem

Provable diffusion sampling runs in O(sqrt(d)) iterations in total variation, and no provable parallel-sampling guarantees existed for diffusion models; log-concave TV sampling also had an O(sqrt(d)) bound.

Approach

Replace the exponential integrator in the predictor step of the predictor-corrector framework with randomized midpoint discretization (unbiased drift estimate at a random intermediate time), shorten corrector times to trade Wasserstein error against TV error, and parallelize via collocation fixed-point iteration over R sub-windows.

Key results

Measured effects reported in the paper

What was changedWhereMeasuredEffect
Replace the exponential-integrator predictor discretization with randomized midpointDiffusion sampling for arbitrary smooth distributions · Arbitrary smooth distributions (TV)dimension dependence of iteration complexity: \widetilde O(\sqrt{d}) -> \widetilde O(d^{5/12})Helped
Use collocation with fixed-point iteration to parallelize diffusion samplingDiffusion sampling for arbitrary smooth distributions · Arbitrary smooth distributions (TV)parallel rounds: \widetilde O(\log^2 d)Helped
Apply randomized midpoint and a corrector step to underdamped Langevin samplingLog-concave sampling · Log-concave distributions (TV)dimension dependence of iteration complexity: \widetilde O(\sqrt{d}) -> \widetilde O(d^{5/12})Helped

Surprising findings

Limitations

Experimental setup

Metrics: total variation distance iteration complexity parallel rounds

Baselines: exponential integrator predictor-corrector (Chen et al., 2023) DDPM analyses (Benton et al., 2023)

Builds on: Shen and Lee randomized midpoint method predictor-corrector framework (Chen et al. 2023) parallel underdamped Langevin (Anari et al.) probability flow ODE

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