Pith. sign in

REVIEW 21 cited by

Gotta Go Fast When Generating Data with Score-Based 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 2105.14080 v1 pith:FYZJ533R submitted 2021-05-28 cs.LG cs.CVmath.OCstat.ML

classification cs.LGcs.CVmath.OCstat.ML
keywords datasolvermodelssamplesscore-basedstepapproachesdiffusion
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

Score-based (denoising diffusion) generative models have recently gained a lot of success in generating realistic and diverse data. These approaches define a forward diffusion process for transforming data to noise and generate data by reversing it (thereby going from noise to data). Unfortunately, current score-based models generate data very slowly due to the sheer number of score network evaluations required by numerical SDE solvers. In this work, we aim to accelerate this process by devising a more efficient SDE solver. Existing approaches rely on the Euler-Maruyama (EM) solver, which uses a fixed step size. We found that naively replacing it with other SDE solvers fares poorly - they either result in low-quality samples or become slower than EM. To get around this issue, we carefully devise an SDE solver with adaptive step sizes tailored to score-based generative models piece by piece. Our solver requires only two score function evaluations, rarely rejects samples, and leads to high-quality samples. Our approach generates data 2 to 10 times faster than EM while achieving better or equal sample quality. For high-resolution images, our method leads to significantly higher quality samples than all other methods tested. Our SDE solver has the benefit of requiring no step size tuning.

Discussion (0). Sign in to comment.

Forward citations

Cited by 21 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 of 10

    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. Language-Assisted Super-Resolution from Real-World Low-Resolution Patches

    cs.CV 2026-06 unverdicted novelty 7.0 of 10

    LA-SR redefines unpaired super-resolution in language space by projecting images into a semantically rich representation and applying vision-language model guided losses to handle real-world degradations extracted fro...

  3. Lipschitz-Guided Design of Interpolation Schedules in Generative Models

    stat.ML 2025-09 unverdicted novelty 7.0 of 10

    Minimizing averaged squared Lipschitzness of the drift produces interpolation schedules that improve numerical accuracy and mitigate mode collapse in generative models, with closed-form optima for Gaussians and valida...

  4. Diffusion and Flow Matching Models for Tabular Data: A Survey

    cs.LG 2025-02 unverdicted novelty 7.0 of 10

    First dedicated survey organizing diffusion and flow matching models for tabular data synthesis, imputation, anomaly detection, and related tasks, covering literature from 2015 to 2026 and highlighting open problems.

  5. Latent Consistency Models: Synthesizing High-Resolution Images with Few-Step Inference

    cs.CV 2023-10 unverdicted novelty 7.0 of 10

    Latent Consistency Models enable high-fidelity text-to-image generation in 2-4 steps by directly predicting solutions to the probability flow ODE in latent space, distilled from pre-trained LDMs.

  6. Diffusion Posterior Sampling for General Noisy Inverse Problems

    stat.ML 2022-09 unverdicted novelty 7.0 of 10

    Diffusion models solve noisy (non)linear inverse problems via approximated posterior sampling that blends diffusion steps with manifold gradients without strict consistency projection.

  7. Elucidating the Design Space of Diffusion-Based Generative Models

    cs.CV 2022-06 accept novelty 7.0 of 10

    Organizing diffusion model design choices yields SOTA FID of 1.79 on CIFAR-10 with only 35 network evaluations per image and similar gains on ImageNet-64.

  8. Progressive Distillation for Fast Sampling of Diffusion Models

    cs.LG 2022-02 unverdicted novelty 7.0 of 10

    Progressive distillation halves sampling steps repeatedly in diffusion models, reaching 4 steps with FID 3.0 on CIFAR-10 from 8192-step samplers.

  9. Amortized Moment Matching for Visual Generation

    cs.LG 2026-07 accept novelty 6.0 of 10

    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.

  10. Hierarchical Bayesian inference with compositional score modeling for stellar streams

    astro-ph.GA 2026-07 conditional novelty 6.0 of 10

    Combining three stellar streams and the rotation curve with compositional score modeling yields a posterior for the Milky Way potential—mildly oblate inner halo—but the underlying simulator fails a misspecification test.

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

    cs.LG 2026-07 conditional novelty 6.0 of 10

    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 ...

  12. Scale-Adaptive Generative Flows for Multiscale Scientific Data

    stat.ML 2025-09 conditional novelty 6.0 of 10

    For generative flows on multiscale scientific fields, the noise spectrum should be at least as rough as the data's, and a scale-adaptive schedule can tame the terminal-time stiffness of rougher noise.

  13. Compositional amortized inference for large-scale hierarchical Bayesian models

    q-bio.QM 2025-05 unverdicted novelty 6.0 of 10

    A new error-damping estimator for compositional score matching enables stable amortized inference on hierarchical Bayesian models with over 750,000 parameters using fewer than one full model simulation on large problems.

  14. Improved DDIM Sampling with Moment Matching Gaussian Mixtures

    cs.CV 2023-11 unverdicted novelty 6.0 of 10

    Moment-matched GMM kernels in DDIM yield lower FID and higher IS than Gaussian kernels at small sampling steps on CelebA-HQ, FFHQ, ImageNet, and Stable Diffusion tasks.

  15. DPM-Solver++: Fast Solver for Guided Sampling of Diffusion Probabilistic Models

    cs.LG 2022-11 conditional novelty 6.0 of 10

    DPM-Solver++ enables high-quality guided sampling of diffusion models in 15-20 steps via data-prediction ODE solving and multistep stabilization.

  16. Provable diffusion-based posterior sampling for linear inverse problems via DDIM

    cs.LG 2026-07 reject novelty 5.0 of 10

    A SVD-based, coordinate-wise DDIM sampler is claimed to asymptotically sample from the posterior for noisy linear inverse problems, but the proof's posterior identification step does not follow from the stated updates.

  17. Language-Assisted Super-Resolution from Real-World Low-Resolution Patches

    cs.CV 2026-06 unverdicted novelty 5.0 of 10

    LA-SR extracts real LR patches from depth-varying regions in single images and uses vision-language models with linguistic content and quality losses for unpaired super-resolution.

  18. OTCache: Optimal Transport for Geometry-Aware Caching in Diffusion Models

    cs.LG 2026-06 unverdicted novelty 5.0 of 10

    OTCache uses optimal transport to interpolate caching schedules between a graph-based reference and an Optuna-optimized anchor, delivering 3.66x-4.7x speedups on FLUX.1, Qwen-Image and HunyuanVideo with improved fidelity.

  19. LISA: Likelihood Score Alignment for Visual-condition Controllable Generation

    cs.CV 2026-06 unverdicted novelty 5.0 of 10

    LISA adds a likelihood-score alignment loss to the side branch of dual-branch controllable generators, accelerating convergence and improving results across image/video tasks with negligible extra cost.

  20. Mitigating the Contractivity Trap in Diffusion ODEs via Stein Stabilization

    cs.LG 2026-06 unverdicted novelty 5.0 of 10

    SteinDiff applies Stein-derived residual corrections at each step to stabilize large-step inference in diffusion probability flow ODEs without retraining or reference samples.

  21. Censored Sampling for Topology Design: Guiding Diffusion with Human Preferences

    cs.LG 2025-08 unverdicted novelty 4.0 of 10

    Guiding a pretrained topology-diffusion generator with human-preference reward classifiers is claimed to suppress floating-material and boundary-violation failure modes without retraining the generator.

Pith tools