pith. sign in

arxiv: 2412.18596 · v1 · pith:7DKJHMWDnew · submitted 2024-12-24 · 💻 cs.CV

LatentCRF: Continuous CRF for Efficient Latent Diffusion

classification 💻 cs.CV
keywords latentcrfinferencelatentcontinuousdiffusiondiversityiterationsmodels
0
0 comments X
read the original abstract

Latent Diffusion Models (LDMs) produce high-quality, photo-realistic images, however, the latency incurred by multiple costly inference iterations can restrict their applicability. We introduce LatentCRF, a continuous Conditional Random Field (CRF) model, implemented as a neural network layer, that models the spatial and semantic relationships among the latent vectors in the LDM. By replacing some of the computationally-intensive LDM inference iterations with our lightweight LatentCRF, we achieve a superior balance between quality, speed and diversity. We increase inference efficiency by 33% with no loss in image quality or diversity compared to the full LDM. LatentCRF is an easy add-on, which does not require modifying the LDM.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 1 Pith paper

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

  1. Approximate Structured Diffusion for Sequence Labelling

    cs.CL 2026-06 unverdicted novelty 6.0

    Diffusion training lets a CRF condition on noisy entire label sequences, yielding 16.5% error reduction on POS-tagging via approximate inference.