Pith. sign in

REVIEW 2 cited by

Diffusion models as plug-and-play priors

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 2206.09012 v3 pith:F2HCGQSJ submitted 2022-06-17 cs.LG cs.CV

classification cs.LGcs.CV
keywords mathbfdiffusionmodelsauxiliaryconstraintdenoisingdifferentiableinference
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
abstract

We consider the problem of inferring high-dimensional data $\mathbf{x}$ in a model that consists of a prior $p(\mathbf{x})$ and an auxiliary differentiable constraint $c(\mathbf{x},\mathbf{y})$ on $x$ given some additional information $\mathbf{y}$. In this paper, the prior is an independently trained denoising diffusion generative model. The auxiliary constraint is expected to have a differentiable form, but can come from diverse sources. The possibility of such inference turns diffusion models into plug-and-play modules, thereby allowing a range of potential applications in adapting models to new domains and tasks, such as conditional generation or image segmentation. The structure of diffusion models allows us to perform approximate inference by iterating differentiation through the fixed denoising network enriched with different amounts of noise at each step. Considering many noised versions of $\mathbf{x}$ in evaluation of its fitness is a novel search mechanism that may lead to new algorithms for solving combinatorial optimization problems.

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. Fast T2T: Optimization Consistency Speeds Up Diffusion-Based Training-to-Testing Solving for Combinatorial Optimization

    cs.LG 2025-02 conditional novelty 6.0 of 10

    Fast T2T trains diffusion-based combinatorial optimization solvers to map any noise level directly to near-optimal solutions, enabling one-step inference and large speedups over step-by-step diffusion baselines.

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

Pith tools