arXiv Computation and Language By Chanhyuk Lee, Wonjung Kim, Patrick Pynadath, Jaehoon Yoo, Satoshi Hayakawa, Ruqi Zhang, Jinwoo Kim, Seunghoon Hong

Asynchronous Flow Map Language Models

Read the original on arXiv Computation and Language →

The paper introduces asynchronous flow map language models (aFMLMs), a new one‑step parallel language modeling approach that incorporates token prediction order via learned or prescribed asynchronous flows. These flows define a token‑wise time schedule controlling denoising progress, and the authors prove that such flows yield valid flow maps and develop distillation methods. Experiments on Sudoku solving and code generation for GSM8K math word problems show that aFMLMs achieve state‑of‑the‑art performance in one‑step generation.

Machine-generated by The Flow from the publisher's headline and feed description — not written or checked by a human. The full article lives at arXiv Computation and Language.

arXiv Machine Learning
Jun 29

Masked Language Flow Models

arXiv:2606. 27617v1 Announce Type: cross Abstract: Masked Diffusion Models (MDMs) promise fast, parallel language generation, but their reverse transition factorises across token positions -- an approximation that breaks down in the few-step sampling regime where parallel generation ought to provide the greatest efficiency gains.

By Iskander Azangulov, Kianoosh Ashouritaklimi, Leo Zhang, Simon Vary, Patrick Rebeschini
arXiv AI
Oct 21

Large Flow Language Models

arXiv:2610.28559v1 Announce Type: cross Abstract: Continuous flow language models offer a path to parallel generation with tools for control and acceleration unavailable to discrete diffusion, yet ef...

By Arnav Chavan, Chanhyuk Lee, Udbhav Bamba, Jaehoon Yoo, Seunghoon Hong, Aditi Raghunathan, Jinwoo Kim
arXiv AI
Oct 27

Learning When to Commit: Schedule Distillation for Fast Diffusion Language Models

The paper introduces dSpark, a schedule distillation framework that learns when to commit tokens in diffusion large language models to accelerate generation. By constructing unmasking schedules that prioritize revealing tokens which make other positions easier to predict, dSpark reduces uncertainty earlier in decoding. Experiments on mathematical reasoning and code generation tasks show significant speedups—10.12× on LLaDA‑8B‑Instruct and 5.12× on Dream‑7B‑Instruct—while preserving superior task performance.

By Aidar Myrzakhan, Zhiqiang Shen