单一来源
当前只有一个可用来源,尚未完成多源交叉核验Next-Concept建模:快速并行粗到精文本生成
Computer Science > Computation and Language
arXiv:2610.14162 (cs)
[Submitted on 9 Oct 2026]
Title: Next-Concept Modeling: Fast, Parallel Coarse-to-Fine Text Generation
View a PDF of the paper titled Next-Concept Modeling: Fast, Parallel Coarse-to-Fine Text Generation, by Hermann Kumbong and 8 other authors
View PDF HTML (experimental)
> Abstract: Diffusion language models (DLMs) offer parallel sampling for faster generation than autoregressive models, an increasingly important advantage as inference becomes a dominant computational workload. However, DLMs degrade quickly with fewer sampling steps, process the full sequence at every step, and require many passes over the dataset to reach good quality. We introduce Next-Concept Modeling (NCM), a two-stage, coarse-to-fine framework: a multiscale residual VQ-VAE encodes text into a hierarchy of discrete codes, and a transformer generates one level at a time, predicting all codes within a level in parallel. At matched parameter scales, NCM achieves better generative perplexity than the strongest DLM baseline on LM1B while running $21\times$ faster. On OpenWebText, NCM is competitive with the strongest DLM while running $10\times$ faster; on XSum, it matches the strongest DLM's ROUGE-L while being $31\times$ faster. On the reasoning task of Sudoku, NCM outperforms autoregressive and diffusion baselines across all difficulty levels, using fewer function evaluations. On the reasoning task of Sudoku, NCM outperforms autoregressive and diffusion baselines across all difficulty levels, using fewer function evaluations.
Subjects:
Computation and Language (cs.CL); Artificial Intelligence (cs.AI); Machine Learning (cs.LG)
Cite as: arXiv:2610.14162 [cs.CL]
(or arXiv:2610.14162v1 [cs.CL] for this version)
arXiv-issued DOI via DataCite
Submission history
From: Hermann Kumbong [view email] [v1] Fri, 9 Oct 2026 17:49:45 UTC (352 KB)
Full-text links:
Access Paper:
View a PDF of the paper titled Next-Concept Modeling: Fast, Parallel Coarse-to-Fine Text Generation, by Hermann Kumbong and 8 other authors
View PDF
· HTML (experimental)
· TeX Source
view license
Additional Features
· Audio Summary
Current browse context:
cs.CL
< prev
| next >
new | recent | 2026-10
Change to browse by:
cs cs.AI cs.LG
References & Citations
· Google Scholar
· Semantic Scholar
Loading...
BibTeX formatted citation
Data provided by:
Bookmark
Bibliographic Tools
Bibliographic and Citation Tools
Bibliographic Explorer Toggle
Bibliographic Explorer (What is the Explorer?)
Connected Papers Toggle
Connected Papers (What is Connected Papers?)
Litmaps Toggle
Litmaps (What is Litmaps?)
scite.ai Toggle
scite Smart Citations (What are Smart Citations?)
Code, Data, Media
Code, Data and Media Associated with this Article
alphaXiv Toggle
alphaXiv (What is alphaXiv?)
Links to Code Toggle
CatalyzeX Code Finder for Papers (What is CatalyzeX?)
DagsHub Toggle
DagsHub (What is DagsHub?)
GotitPub Toggle
Gotit.pub (Gotit.pub是什么?)
Huggingface 切换
Hugging Face (Hugging Face是什么?)
ScienceCast 切换
ScienceCast (ScienceCast是什么?)
演示
演示
Replicate 切换
Replicate (Replicate是什么?)
Spaces 切换
Hugging Face Spaces (Spaces是什么?)
Spaces 切换
TXYZ.AI (TXYZ.AI是什么?)
相关论文
推荐与搜索工具
链接至 Influence Flower
Influence Flower (Influence Flowers是什么?)
核心推荐开关
CORE Recommender (CORE是什么?)
· 机构
关于 arXivLabs
arXivLabs:与社区合作者共同开展的实验性项目
arXivLabs 是一个框架,允许合作者直接在我们的网站上开发和共享新的 arXiv 功能。
与 arXivLabs 合作的个人和组织都已拥抱并接受我们对开放、社区、卓越和用户数据隐私的价值观。arXiv 致力于这些价值观,并且只与遵守这些价值观的合作伙伴合作。
有一个能为 arXiv 社区增值的项目想法吗?了解更多关于 arXivLabs 的信息。
本文的哪些作者是背书人? | 禁用 MathJax (MathJax是什么?)
Evidence
来源与证据
当前仅有一个可用来源,尚未完成多源交叉核验。
- 发布时间
- 内容处理
- AI 翻译 / 摘要,需结合原文核对
相关资讯
AI 翻译、摘要和解读仅用于辅助判断;涉及重要决策时,请回到上方来源核实。