Discrete Flow Maps

arXiv:2604.09784v1 Announce Type: cross Abstract: The sequential nature of autoregressive next-token prediction imposes a fundamental speed limit on large language models. While continuous flow models offer a path to parallel generation, they traditionally demand expensive iterative integration. Flow Maps bypass this bottleneck by compressing generative trajectories into single-step mappings, theoretically enabling the generation of full text sequences from noise in a single forward pass. However, standard formulations rely on Euclidean regression losses that are geometrically ill-suited for discrete data. In this work, we resolve this conflict with Discrete Flow Maps, a framework that reconciles trajectory compression with the geometry of the probability simplex. We recast standard flow map training for the discrete domain, aligning the training dynamics with the discrete nature of language. Empirically, this strict geometric alignment allows our method to surpass previous state-of-the-art results in discrete flow modeling.

Related

• Binary Flow Matching: Prediction-Loss Space Alignment for Robust Learning
• Truncated Rectified Flow Policy for Reinforcement Learning with One-Step Sampling
• Geometric Properties of the Voronoi Tessellation in Latent Semantic Manifolds of Large Language Models
• Differentiable free energy surface: a variational approach to directly observing rare events using generative deep-learning models

Source: arXiv cs.LG | 2026-04-14