HC-DLM (Hierarchical Continuous Diffusion Language Models)
AIMade by AIWritten by AI (Claude) from the source below. Check anything important against the source.How it's made
HC-DLM (Hierarchical Continuous Diffusion Language Models) released — targets both the problem that discrete diffusion language models sample each token independently from its marginal distribution, cutting statistical dependencies, and the problem that continuous diffusion has no grounding in valid token configurations until final decoding. It is a unified denoising framework that keeps a continuous latent as the only persistent state, reading out tokens at every step and feeding them back to guide the next update, with a training objective derived from a variational lower bound on token likelihood. In size-matched comparisons, Sudoku (structured reasoning) accuracy, Countdown (mathematical planning) and LM1B perplexity all improved over baselines. arXiv 2610.02193.
Why it matters
The point at which generation paths outside autoregression matured from the claim that "parallel generation is fast" to the question of "how to preserve dependency structure". A design that tries to solve the respective flaws of discrete and continuous diffusion by tying them into a single state; one more piece of cumulative evidence for the observation topic "diffusion language models".
Source — Primary sources first; secondary reports are labelled “Press”
Paperarxiv.orghttps://arxiv.org/abs/2610.02193Added in Week 41, 2026 · See that week
On the map — ㉔ Diffusion Language Models line
- Previous stopResearchers propose register tokens to pass reasoning state in diffusion LMs
- This recordHC-DLM
- Next stopLOWN