Anyone willing to give an intuitive summary of what they did mathwise? The math in the paper is super ugly to churn through.
Last author here (I also did the DDIM paper, https://arxiv.org/abs/2010.02502 ). I know this is going to be very tricky math-wise (and in the paper we just wrote the most general thing to make reviewers happy), so I tried to explain the idea more easily under the blog post ( https://lumalabs.ai/news/inductive-moment-matching ). If you look at how a single step of the DDIM sampler interacts with the target timestep, i…
Beyond Diffusion: Inductive Moment Matching
31–33 of 33 posts
Re: Beyond Diffusion: Inductive Moment Matching
#32Earlier quoted context omitted.
I don’t know which text diffusion models you’re talking about, the latest and greatest is this one: https://arxiv.org/abs/2502.09992 and it’s extremely slow – couple of orders of magnitude slower than a regular LLM, mainly because it does not support KV caching, and requires many full sequence processing steps per token.
I’m not familiar with that paper but it would probably be best to compare speeds with an unoptimized transformer decoder. The Vaswani paper came out 8 years ago so implementations will be pretty highly optimized at this point. On the other hand if there was a theoretical reason why text diffusion models could never be faster than autoregressive transformers it would be notable.
Re: Beyond Diffusion: Inductive Moment Matching
#33Earlier quoted context omitted.
So like intuitive photographic memory?
More like "Oh i remember what you roughly want, i rememeber basic steps of reaching it just not details, lets generate the details" vs. "learning x steps from noise to image". You make the way of reaching your target faster.