Pith. sign in

REVIEW 2 cited by

Truncated Diffusion Probabilistic Models and Diffusion-based Adversarial Auto-Encoders

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 2202.09671 v4 pith:NVGKXTXR submitted 2022-02-19 stat.ML cs.LG

classification stat.MLcs.LG
keywords datadiffusionreversedistributionmodelsnoisestepsadversarial
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

Employing a forward diffusion chain to gradually map the data to a noise distribution, diffusion-based generative models learn how to generate the data by inferring a reverse diffusion chain. However, this approach is slow and costly because it needs many forward and reverse steps. We propose a faster and cheaper approach that adds noise not until the data become pure random noise, but until they reach a hidden noisy data distribution that we can confidently learn. Then, we use fewer reverse steps to generate data by starting from this hidden distribution that is made similar to the noisy data. We reveal that the proposed model can be cast as an adversarial auto-encoder empowered by both the diffusion process and a learnable implicit prior. Experimental results show even with a significantly smaller number of reverse diffusion steps, the proposed truncated diffusion probabilistic models can provide consistent improvements over the non-truncated ones in terms of performance in both unconditional and text-guided image generations.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 2 Pith papers

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

  1. Ditto: Accelerating Diffusion Model via Temporal Value Similarity

    cs.AR 2025-01 conditional novelty 6.0 of 10

    Diffusion model inference can be accelerated by computing only the small differences between adjacent time steps, with reduced bit-width and zero-skipping, at moderate accuracy loss.

  2. Efficient Difficulty-Aware Dynamic Routing for Diffusion-Based Real-World Image Super-Resolution

    cs.CV 2026-07 reject novelty 4.0 of 10

    DDR-SR routes each real-world low-resolution image to one of two diffusion experts based on a high-frequency-loss difficulty score, using a low-compression VAE for hard images and a high-compression VAE for easy image...

Pith tools