Sign inGet started
Paper · arXiv

Latent-Kernel Discrete Flow Maps for Few-Step Generation

Discrete diffusion and flow-matching models denoise a sequence over many steps, but to keep each step cheap, they factorize the transition across positions and decide every token independently. This makes few-step generation challenging for text when the target couples two positions, such as a subject and a verb that must agree. An independent update commits to them separately, and many function evaluations are spent repairing the mismatch. Existing few-step methods buy back the lost correlation by distilling or rectifying a slow teacher, and so inherit the teacher's quality ceiling. We ask instead whether a model can express correlated steps natively, and answer with Latent-Kernel Discre...

AuthorsMansoor Ahmed, Yue-Tsz Fan, Hemanth Venkateswara et al.
Primary categorycs.LG
Published29 July 2026
Last updated at source29 July 2026
cs.LG
Embed this entry
<iframe src="https://silytics.si/embed/item/f247131f-b1c2-400a-9001-4be30f032e73" width="420" height="190" style="border:0" loading="lazy" title="Silytics entry"></iframe>

Free, no tracking. More about feeds and embeds.

Silytics shows public metadata from arXiv and links to the original. Information may be incomplete or out of date. Last refreshed 17 October 2026. Licenses and terms of the original apply to the work itself. Not financial, legal or professional advice.