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

Token cross-entropy

×

no parameters

How badly the logits predict the tokens the text was made of.

Lw=−1∣A∣∑(b,t)∈Alog⁡softmax⁡(Lb,t)Ib,t\mathcal L_{w}=-\frac{1}{\lvert A\rvert}\sum_{(b,t)\in A}\log\operatorname{softmax}(L_{b,t})_{I_{b,t}}
in
LL [B batch, T positions, 50259 vocabulary]II [B batch, T positions]
out
Lw\mathcal L_{w} [1 one value]
Explanation

AA is the set of valid positions, from the attention mask; with wrapped sequences that is every position, the beginning and end tokens included.

Its gradient stops at the token decoder’s input.

Sources3

Direct evidence

Reconstruction: Gaussian noise of fixed standard deviation is added to the latents, the latent decoder runs, the token decoder reads its output detached, and the cross-entropy against the token IDs is taken; the latent decoder’s output is also compared with the standardized features by a mean squared error.

The implementation, pinned at revision e18c42acdfb7, not yet public

Direct evidence

Cross-entropy and mean squared error are averaged over valid positions.

The implementation, pinned at revision e18c42acdfb7, not yet public

Direct evidence

Joint training: decoder noise of standard deviation 3; weights 1 for the three losses; the diffusion gradient into the encoder rises from 0.001 over 50,000 steps by a straight-through scaling; the token decoder’s input is detached; AdamW at 3·10⁻⁴ for 1,000,000 steps of 512 sequences, gradients clipped at norm 1.

The implementation, pinned at revision e18c42acdfb7, not yet public