GitHub Hot Board

GitHub Hot Board · 저장소 아카이브

HazyResearch/ncm

NCM: Next Concept Modeling (소개는 저장소 자체 문서에서 왔습니다.)

데이터 기준 October 25HazyResearch

최고 순위

#38

다크호스 · 아직 드러나지 않은 폭발 후보

1K

누적 스타

131

포크 수

2

최근 30일 기록 일수

등재 2일 · 최근 30일 +49 스타 · 일평균 +25연속 2일 등재

프로젝트 상태라이선스: MIT최근 push: October 14열린 이슈(PR 포함): 13

2026-10-25부터 수집. 미확인 = 아직 미수집

README에 뱃지를 붙여보세요 · HazyResearch/ncm[![README에 뱃지를 붙여보세요](https://git.vaiox.xyz/api/badge/HazyResearch/ncm.svg)](https://git.vaiox.xyz/ko/repo/HazyResearch/ncm)
<a href="https://git.vaiox.xyz/ko/repo/HazyResearch/ncm"><img src="https://git.vaiox.xyz/api/badge/HazyResearch/ncm.svg" alt="README에 뱃지를 붙여보세요" height="20"></a>

프로젝트 문서

NCM logo Next-Concept Modeling

Fast, Parallel Coarse-to-Fine Text Generation

Paper Hugging Face collection Blog post Scaling Intelligence blog post X thread MIT license

Next-Concept Modeling (NCM) is a two-stage framework for parallel text generation. A multiscale residual VQ tokenizer represents a sequence as a hierarchy of discrete codes, and a transformer predicts that hierarchy from coarse to fine. Positions within a level are generated in parallel, so generation requires one forward evaluation per level.

Comparison of autoregressive, diffusion, and next-concept generation

Highlights

Coarse-to-fine generation

NCM generates coarse to fine: each level predicts a longer sequence in parallel, and decoding every level shows a sample being refined from a rough sketch to the full output in a few steps.

TinyStories, XSum and WMT14 samples refined level by level

Quality at a fraction of the cost

NCM beats or matches strong diffusion baselines on different tasks & datasets while generating 9-31× faster.

Generation quality against wall-clock time on LM1B and XSum, and hard Sudoku accuracy by method

Released models

Weights and tokenized datasets are hosted in the NCM Hugging Face collection. Each released model consists of a frozen tokenizer and a next-concept generator.

TaskModelTokenizerGeneratorConfigData
XSum–tokenizer.ptgenerator.ptconfig.yamltest set
WMT14 De–En–tokenizer.ptgenerator.ptconfig.yamltest set
Sudokueasytokenizer.ptgenerator.ptconfig.yamltest boards
mediumtokenizer.ptgenerator.ptconfig.yaml
hardtokenizer.ptgenerator.ptconfig.yaml
LM1Bsmalltokenizer.ptgenerator.ptconfig.yamltokenized text
mediumgenerator.ptconfig.yaml
largegenerator.ptconfig.yaml
TinyStories–tokenizer.ptgenerator.ptconfig.yamltokenized text
OpenWebText–tokenizer.ptgenerator.ptconfig.yamltokenized text

Installation

git clone https://github.com/HazyResearch/ncm.git
cd ncm
pip install -r requirements.txt

Python 3.10 or newer and a CUDA-capable PyTorch installation are recommended.

Evaluation

Download the checkpoints and evaluation inputs:

hf download hazyresearch/ncm-checkpoints --local-dir artifacts
hf download hazyresearch/ncm-datasets --repo-type dataset --local-dir data

Then run:

python evaluate.py --config config/eval/<task>.yaml --checkpoint-dir artifacts/<task> --data-dir data/<task>
# <task> is one of xsum, wmt14, sudoku-easy, sudoku-medium or sudoku-hard

python evaluate.py --config config/eval/<dataset>.yaml --checkpoint-dir artifacts/<dataset>
# <dataset> is tinystories, owt or lm1b-<size> with <size> one of small, medium or large

This runs one generation shard per visible GPU, merges them, and prints ROUGE-1/2/L and generative perplexity for XSum; cased and lowercased sacreBLEU, chrF and length ratio for WMT14; solved, cell and valid-grid rates for Sudoku; and generative perplexity under GPT-2 large with unigram entropy, over 5 seeds of 256 unconditional samples, for TinyStories, OpenWebText and LM1B, the latter under the FLM scoring protocol. Add --cfg <scale> for classifier-free guidance on XSum and WMT14; the guided WMT14 row uses --cfg 1.0.

Repository layout

  • evaluate.py: evaluation entry point
  • scripts/: per-GPU generation shard and the merge that scores it
  • config/eval/: one config per released checkpoint, identical to the config.yaml shipped with it
  • models/, tokenization/: generator and tokenizer implementations

Citation

@misc{kumbong2026nextconcept,
      title={Next-Concept Modeling: Fast, Parallel Coarse-to-Fine Text Generation},
      author={Hermann Kumbong and Ishan S. Khare and Iddah Mlauzi and Andrew Woen and Charles Ding and E. Kelly Buchanan and Simran Arora and Azalia Mirhoseini and Christopher Ré},
      year={2026},
      eprint={2610.14162},
      archivePrefix={arXiv},
      primaryClass={cs.CL},
      url={https://arxiv.org/abs/2610.14162},
}

Released under the MIT license.

현재 순위

  • 38

    다크호스 · 아직 드러나지 않은 폭발 후보

    1K 스타 · 131 fork · 스타 / 일

    다크호스 →
  • 46

    라이브 마일스톤 · 돌파 중계

    997 스타 · 129 fork · 다음 라인까지

    마일스톤 →

최근 30일 추이

누적 스타 추이

순위 추이

같은 보드의 이웃 랭커 · 다크호스

← 랭킹으로