LDLMIn construction

Meshchaninov et al. · May 2026Diffusion language model

Attention over both streams

Pinned implementation and paper LDLM @ e18c42a, not yet public · arXiv:2605.07933v1 · OpenWebText · 1024 · checkpoint, tokenizer and saved statistics not verified · How to read

Training Generation

Q[B, 12, T, 64]K[B, 12, 2T, 64]V[B, 12, 2T, 64]Query–key products Scale, softcap

50\tanh(S/50\sqrt{64})

Softmax over keys

A=\operatorname{softmax}(F)

A[B, 12, T, 2T]Weighted value sum O[B, 12, T, 64]

Latent decoder › 6 decoder blocks › Perceiver attention › Attention over both streams

Query–key products

no parameters

Score every key of both streams for every query.

{\htmlData{light=similarity}{S}}={\htmlData{light=queries}{{\htmlClass{vl-stream-q}{Q}}}}{\htmlData{light=keys}{{\htmlClass{vl-stream-k}{K^{\mathsf T}}}}}

in: $Q$ [B batch, 12 heads, T positions, 64 head features] $K$ [B batch, 12 heads, 2T positions, 64 head features]
out: $S$ [B batch, 12 heads, T queries, 2T keys]

Sources1

Direct evidence

Both streams are normalized; queries come from one stream, keys and values from both, concatenated along positions; queries and keys are normalized per head; attention runs over all positions with softcap; the heads are merged and projected.

The implementation, pinned at revision e18c42acdfb7, not yet public