REVIEW 4 cited by
A Continuous Time Framework for Discrete Denoising 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
read the original abstract
We provide the first complete continuous time framework for denoising diffusion models of discrete data. This is achieved by formulating the forward noising process and corresponding reverse time generative process as Continuous Time Markov Chains (CTMCs). The model can be efficiently trained using a continuous time version of the ELBO. We simulate the high dimensional CTMC using techniques developed in chemical physics and exploit our continuous time framework to derive high performance samplers that we show can outperform discrete time methods for discrete data. The continuous time treatment also enables us to derive a novel theoretical result bounding the error between the generated sample distribution and the true data distribution.
Forward citations
Cited by 4 Pith papers
-
CANDI: Hybrid Discrete-Continuous Diffusion Models
CANDI combines masked and Gaussian corruption in one noising process, letting discrete diffusion models use continuous gradients for joint updates and guidance.
-
Debiasing Guidance for Discrete Diffusion with Sequential Monte Carlo
An SMC importance-sampling algorithm debiases discrete diffusion guidance, asymptotically sampling from the target tempered distribution p0(x0)p(ζ|x0)^α.
-
Discrete State Diffusion Models: A Sample Complexity Perspective
Claims the first Õ(ε⁻²) sample-complexity bound for discrete-state diffusion, but the zero-approximation-error, optimization-error, and hardness lemmas carrying the proof are internally broken.
-
Masked Diffusion Language Models with Frequency-Informed Training
Masked diffusion language models trained on 100M words match a hybrid GPT-BERT baseline on BabyLM tests, with a rare-word-focused masking variant.
Discussion (0). Continue with ORCID to comment.