Token Time Continuous Diffusion for Language Modeling

Hugging Face Daily Papers Papers

Summary

Introduces Token Time Continuous Diffusion (TTCD), a new diffusion language model that operates in continuous space with per-token times, outperforming discrete models at high speedups in conditional generation and Sudoku solving.

In this paper we introduce token time continuous diffusion (TTCD), a new diffusion language model which (a) operates in continuous space, deterministically mapping Gaussian noise to a final token canvas with no further sampling, and crucially (b) incorporates a new notion of per-token times, with some tokens proceeding from noise to token at a faster rate than others. Continuous space modeling helps TTCD avoid the parallel sampling of multiple tokens, which is a key source of inaccuracy at high speedups for models that iterate purely in discrete space. The notion of per-token times helps TTCD to better model conditional generation, allows for more sure tokens to proceed at a faster rate, and allows for differentiated inter-token influences during refinement. TTCD outperforms discrete models at high speedups. We train a 160M parameter TTCD model on OpenWebText, and then self-distill it; we find that at high speedups we are comparable in unconditional generation quality, and outperform in conditional generation, several existing models of similar size trained, on the same data, and self-distilled. We achieve similar gains in Sudoku solving as well.
Original Article
View Cached Full Text

Cached at: 07/20/26, 09:41 AM

Paper page - Token Time Continuous Diffusion for Language Modeling

Source: https://huggingface.co/papers/2607.14106

Abstract

Inthispaperweintroducetokentimecontinuousdiffusion(TTCD),anewdiffusionlanguagemodelwhich(a)operatesincontinuousspace,deterministicallymappingGaussiannoisetoafinaltokencanvaswithnofurthersampling,andcrucially(b)incorporatesanewnotionofper-tokentimes,withsometokensproceedingfromnoisetotokenatafasterratethanothers.ContinuousspacemodelinghelpsTTCDavoidtheparallelsamplingofmultipletokens,whichisakeysourceofinaccuracyathighspeedupsformodelsthatiteratepurelyindiscretespace.Thenotionofper-tokentimeshelpsTTCDtobettermodelconditionalgeneration,allowsformoresuretokenstoproceedatafasterrate,andallowsfordifferentiatedinter-tokeninfluencesduringrefinement.TTCDoutperformsdiscretemodelsathighspeedups.Wetraina160MparameterTTCDmodelonOpenWebText,andthenself-distillit;wefindthatathighspeedupswearecomparableinunconditionalgenerationquality,andoutperforminconditionalgeneration,severalexistingmodelsofsimilarsizetrained,onthesamedata,andself-distilled.WeachievesimilargainsinSudokusolvingaswell.

View arXiv pageView PDFAdd to collection

Models citing this paper0

No model linking this paper

Cite arxiv.org/abs/2607.14106 in a model README.md to link it from this page.

Datasets citing this paper0

No dataset linking this paper

Cite arxiv.org/abs/2607.14106 in a dataset README.md to link it from this page.

Spaces citing this paper0

No Space linking this paper

Cite arxiv.org/abs/2607.14106 in a Space README.md to link it from this page.

Collections including this paper1

Similar Articles

LangFlow: Continuous Diffusion Rivals Discrete in Language Modeling

Hugging Face Daily Papers

LangFlow presents the first continuous diffusion language model that rivals discrete diffusion approaches, challenging the long-held belief that continuous diffusion is inferior for language modeling. The work introduces key ingredients like optimal Gumbel-based noise scheduling and demonstrates competitive perplexity and transfer learning performance compared to discrete diffusion baselines.

TextLDM: Language Modeling with Continuous Latent Diffusion

Hugging Face Daily Papers

This paper introduces TextLDM, a method that adapts visual latent diffusion transformers for language modeling by mapping discrete tokens to continuous latents. It demonstrates that this approach, enhanced by representation alignment, matches GPT-2 performance and unifies visual and text generation architectures.