Pith. sign in

REVIEW 4 cited by

Denoising Diffusion Step-aware 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 2310.03337 v5 pith:O67L3Z55 submitted 2023-10-05 cs.CV

classification cs.CV
keywords diffusioncomputationalmodelsddsmdenoisingstep-awaregenerationgenerative
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

Denoising Diffusion Probabilistic Models (DDPMs) have garnered popularity for data generation across various domains. However, a significant bottleneck is the necessity for whole-network computation during every step of the generative process, leading to high computational overheads. This paper presents a novel framework, Denoising Diffusion Step-aware Models (DDSM), to address this challenge. Unlike conventional approaches, DDSM employs a spectrum of neural networks whose sizes are adapted according to the importance of each generative step, as determined through evolutionary search. This step-wise network variation effectively circumvents redundant computational efforts, particularly in less critical steps, thereby enhancing the efficiency of the diffusion model. Furthermore, the step-aware design can be seamlessly integrated with other efficiency-geared diffusion models such as DDIMs and latent diffusion, thus broadening the scope of computational savings. Empirical evaluations demonstrate that DDSM achieves computational savings of 49% for CIFAR-10, 61% for CelebA-HQ, 59% for LSUN-bedroom, 71% for AFHQ, and 76% for ImageNet, all without compromising the generation quality.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 4 Pith papers

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

  1. Fake it till You Make it: Reward Modeling as Discriminative Prediction

    cs.CV 2025-06 conditional novelty 6.0 of 10

    GAN-RM trains a CLIP-based discriminator to distinguish a few hundred preference proxy images from model outputs, then uses it for Best-of-N selection, SFT, and DPO.

  2. Energy-Efficient Federated Learning for Edge Real-Time Vision via Joint Data, Computation, and Communication Design

    cs.LG 2025-08 conditional novelty 5.0 of 10

    FedDPQ jointly optimizes data augmentation, pruning, quantization, and power control in federated learning to reduce edge-device energy consumption while maintaining accuracy.

  3. SD-Acc: Accelerating Stable Diffusion through Phase-aware Sampling and Hardware Co-Optimizations

    cs.AR 2025-07 conditional novelty 5.0 of 10

    Phase-aware sampling cuts Stable Diffusion's compute by roughly 2.4x to 5.7x with only small CLIP-score changes, and the accompanying FPGA accelerator turns this into 2.7x to 6.0x energy savings over an Nvidia V100 GPU.

  4. Towards Digital Twins for Optimal Radioembolization

    eess.IV 2025-08 unverdicted novelty 2.0 of 10

    A review proposing a liver radioembolization digital twin that combines CFD with physics-informed neural networks to plan microsphere delivery.

Pith tools