LangFlow: Continuous Diffusion Rivals Discrete in Language Modeling

• URL: http://arxiv.org/abs/2604.11748v3
• Date: Wed, 15 Apr 2026 16:15:30 GMT
• Title: LangFlow: Continuous Diffusion Rivals Discrete in Language Modeling
• Abstract summary: Continuous diffusion language models (DLMs) lag behind discrete counterparts due to sparse data space and underexplored design space.<n>LangFlow connects embedding-space DLMs to Flow Matching via Bregman divergence.<n>LangFlow rivals top discrete DLMs on both the perplexity (PPL) and the generative perplexity (Gen. PPL)<n>It even exceeds autoregressive baselines in zero-shot transfer on 4 out of 7 benchmarks.
• Score: 39.014850192441656
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Continuous diffusion has been the foundation of high-fidelity, controllable, and few-step generation of many data modalities such as images. However, in language modeling, prior continuous diffusion language models (DLMs) lag behind discrete counterparts due to the sparse data space and the underexplored design space. In this work, we close this gap with LangFlow, the first continuous DLM to rival discrete diffusion, by connecting embedding-space DLMs to Flow Matching via Bregman divergence, alongside three key innovations: (1) we derive a novel ODE-based NLL bound for principled evaluation of continuous flow-based language models; (2) we propose an information-uniform principle for setting the noise schedule, which motivates a learnable noise scheduler based on a Gumbel distribution; and (3) we revise prior training protocols by incorporating self-conditioning, as we find it improves both likelihood and sample quality of embedding-space DLMs with effects substantially different from discrete diffusion. Putting everything together, LangFlow rivals top discrete DLMs on both the perplexity (PPL) and the generative perplexity (Gen. PPL), reaching a PPL of 30.0 on LM1B and 24.6 on OpenWebText. It even exceeds autoregressive baselines in zero-shot transfer on 4 out of 7 benchmarks. LangFlow provides the first clear evidence that continuous diffusion is a promising paradigm for language modeling. Homepage: https://github.com/nealchen2003/LangFlow

Related papers

• AURORA-LM: Autoencoding Unified Representation for Continuous-Latent Diffusion Language Modeling [60.04959047453115]
  AURORA-LM is a continuous-latent language model that separates the construction of a decodable text representation from the modeling of its distribution.<n>AURORA-LM achieves the strongest performance among evaluated continuous and diffusion-based language models on OpenWebText free generation and XSum summarization.
  arXiv  Detail & Related papers  (2026-08-03T17:59:50Z)
• DiLaDiff: Distilled Latent-Augmented Diffusion for Language Modeling [51.39835770694148]
  Diffusion language models intrinsically fail to capture correlations between decoded tokens.<n>We propose DiLaDiff, a variant of masked diffusion language models with three components.
  arXiv  Detail & Related papers  (2026-05-22T13:15:59Z)
• Continuous Diffusion Scales Competitively with Discrete Diffusion for Language [48.290726603587444]
  We construct RePlaid as a likelihood-based continuous diffusion language model (DLM)<n>We show that RePlaid exhibits a compute gap of only $20times$ compared to autoregressive models.<n>We also offer theoretical insights to understand the advantage of likelihood-based training.
  arXiv  Detail & Related papers  (2026-05-18T15:15:24Z)
• ELF: Embedded Language Flows [76.80499600969769]
  We show that continuous language models can be made effective with minimal adaptation to the discrete domain.<n>We propose Embedded Language Flows (ELF), a class of diffusion models in continuous embedding space.<n>ELF substantially outperforms leading discrete and continuous DLMs, achieving better generation quality with fewer sampling steps.
  arXiv  Detail & Related papers  (2026-05-11T17:59:29Z)
• One-step Language Modeling via Continuous Denoising [36.18484491074519]
  We show that language models leveraging flow-based continuous denoising can outperform discrete diffusion in both quality and speed.<n>Our work calls into question the widely held hypothesis that discrete diffusion processes are necessary for generative modeling over discrete modalities.
  arXiv  Detail & Related papers  (2026-02-18T19:23:07Z)
• Streaming-dLLM: Accelerating Diffusion LLMs via Suffix Pruning and Dynamic Decoding [36.74241893088594]
  Diffusion Large Language Models (dLLMs) offer a compelling paradigm for natural language generation.<n>Recent works have accelerated inference via KV cache reuse or decoding, but overlook the intrinsic inefficiencies within the block-wise diffusion process.<n>We propose Streaming-dLLM, a training-free framework that streamlines inference across both spatial and temporal dimensions.
  arXiv  Detail & Related papers  (2026-01-25T17:36:04Z)
• Sequential Diffusion Language Models [110.06562906987052]
  Diffusion language models (DLMs) have strong theoretical efficiency but are limited by fixed-length decoding and incompatibility with key-value caches.<n>We introduce Next Sequence Prediction (NSP), which unifies next-token and next-block prediction.<n>We propose Sequential Diffusion Language Model (SDLM), which can retrofit pre-trained autoregressive language models (ALMs) at minimal cost.
  arXiv  Detail & Related papers  (2025-09-28T17:59:15Z)
• Discrete Diffusion Models for Language Generation [0.0]
  This thesis investigates the feasibility and performance of discrete diffusion models for natural language generation.<n>We use Bits Per Token (BPT), Negative Log-Likelihood (NLL), Perplexity (PPL), and Batch Processing Speed to assess generative performance.<n>The AR model outperforms in compression with a lower mean BPT of 4.59, but D3PM achieves higher processing speed, reaching up to 3.97 batches per sec.
  arXiv  Detail & Related papers  (2025-07-02T23:43:02Z)
• Discrete Diffusion in Large Language and Multimodal Models: A Survey [61.86669998363359]
  We provide a systematic survey of Discrete Diffusion Language Models (dLLMs) and Discrete Diffusion Multimodal Language Models (dMLLMs)<n>Unlike autoregressive (AR) models, dLLMs and dMLLMs adopt a multi-token, parallel decoding paradigm using full attention and a denoising-based generation strategy.<n>We trace the historical development of dLLMs and dMLLMs, formalize the underlying mathematical frameworks, list commonly-used modeling methods, and categorize representative models.
  arXiv  Detail & Related papers  (2025-06-16T17:59:08Z)
• DLM-One: Diffusion Language Models for One-Step Sequence Generation [63.43422118066493]
  DLM-One is a score-distillation-based framework for one-step sequence generation with continuous diffusion language models.<n>We investigate whether DLM-One can achieve substantial gains in sampling efficiency for language modeling.
  arXiv  Detail & Related papers  (2025-05-30T22:42:23Z)
• A Cheaper and Better Diffusion Language Model with Soft-Masked Noise [62.719656543880596]
  Masked-Diffuse LM is a novel diffusion model for language modeling, inspired by linguistic features in languages. Specifically, we design a linguistic-informed forward process which adds corruptions to the text through strategically soft-masking to better noise the textual data. We demonstrate that our Masked-Diffuse LM can achieve better generation quality than the state-of-the-art diffusion models with better efficiency.
  arXiv  Detail & Related papers  (2023-04-10T17:58:42Z)
• DiffusionBERT: Improving Generative Masked Language Models with Diffusion Models [81.84866217721361]
  DiffusionBERT is a new generative masked language model based on discrete diffusion models. We propose a new noise schedule for the forward diffusion process that controls the degree of noise added at each step. Experiments on unconditional text generation demonstrate that DiffusionBERT achieves significant improvement over existing diffusion models for text.
  arXiv  Detail & Related papers  (2022-11-28T03:25:49Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.