Model reference · open weights

Ling-3.0-tiny-UBTree

LLMs inclusionAI Text gen 1 build Open weights 0 dl/mo

Ling-3.0-tiny-UBTree is an open-weight language model from inclusionAI. Ling-3.0-tiny-UBTree (BF16) weighs 366 MB; the smallest configuration that runs it is RTX 3060 12 GB.

For self-hosting, compare this build's requirements below with the GPU you plan to rent.

  • Ling-3.0-tiny-UBTree is a speculative decoding draft model created by inclusionAI to accelerate the Ling-3.0-tiny target model.
  • It uses a five-layer DFlash backbone and a bigram selector to propose candidate continuations for verification.
  • The model has 183M parameters, supports a context length of 131072 tokens, and is licensed under the MIT license.

Summary of the inclusionAI/Ling-3.0-tiny-UBTree model card, 2026-10-22

What it is

Released byinclusionAI
Released2026-10-21
Parameters183M
VRAM366 MB for the weights

What it runs on

Memory and cards for Ling-3.0-tiny-UBTree (BF16)

366 MBweights, file size
41 MBcache per 1K tokens
653 MBruntime overhead, at least
131,072 tokenscontext max
CardRequests at onceContext maxMemory
8K each32K each
RTX 3060 12 GB317all 128K11.6 GB
RTX 4060 Ti 16 GB4210all 128K15.4 GB
RTX 3090 24 GB6616all 128K23.4 GB
RTX 4090 24 GB6616all 128K23.4 GB
RTX 5090 32 GB8922all 128K31.0 GB
L40S 48 GB12731all 128K44.0 GB
A100 80 GB22957all 128K78.2 GB
H100 80 GB21754all 128K78.1 GB
RTX PRO 6000 Blackwell 96 GB26466all 128K93.8 GB
DGX Spark (GB10) 128 GB unified30476all 128K107 GB
H200 141 GB39598all 128K138 GB
B200 180 GB509127all 128K176 GB
Memory needed at each load
Requests at once8K tokens each32K tokens each
11.4 GB2.4 GB
52.7 GB7.7 GB
83.7 GB11.8 GB
166.4 GB22.5 GB
3211.8 GB44.0 GB
6422.5 GB86.9 GB

One card, with vLLM's small-card settings.

From the model card

What inclusionAI says about Ling-3.0-tiny-UBTree

Read the model card

Paper · Target model

Ling3-Tiny-UBTree-B16 is a UBTree speculative-decoding draft model for inclusionAI/Ling-3.0-tiny. It combines a five-layer DFlash backbone with a learned bigram selector to propose multiple candidate continuations for target-model verification.

SGLang integration — stay tuned! Our UBTree adaptation for Ling3 has not yet been released to the open-source SGLang community. Public installation instructions and serving recipes will be added here when it becomes available.

This checkpoint is used alongside the matching target model; it cannot serve as a standalone text-generation model.

How UBTree works

UBTree pipeline

UBTree pairs a unigram proposer with a bigram selector:

  1. A DFlash backbone proposes candidate tokens for future positions in parallel.
  2. The selector scores transitions between adjacent candidates in parallel.
  3. Tree construction retains promising branches within a verification budget.
  4. The target verifies the tree and commits the accepted continuation.

The paper also introduces tree-native training with renormalized KL supervision on high-temperature target traces, encouraging plausible alternative branches. See the paper for the method and experiments.

Model specifications

ItemValue
Target modelinclusionAI/Ling-3.0-tiny
Draft architectureLing3UBTreeModel
Draft backbone5 full-attention Transformer layers
Parameters stored in this checkpoint183,127,326 (183.1M)
Weight dtypeBF16
Hidden size1,536
Attention heads / KV heads16 / 16
Target auxiliary feature layers (zero-based)4, 8, 12, 16, 22
Draft block size16 (anchor-inclusive runtime convention)
Candidate top-k64 per draft position
Default verification tree budget64 non-root nodes + 1 anchor
TrainingDFlash warm start, then joint backbone + UBTree selector training

The parameter count covers tensors distributed in this repository. The draft shares token embeddings and the language-model head with the target; these shared weights are not included here. B16 denotes the draft block size, not the verification tree's node budget.

Serving with SGLang

UBTree support for Ling3 in SGLang is coming soon. We will share installation instructions and serving examples once the integration is publicly available. Stay tuned!

Benchmark results

All methods use block size 16, TP1, concurrency 1, BF16, and greedy no-thinking decoding. UBTree uses a 49-node tree.

Each cell shows acceptance length / E2E speedup over target-only AR.

DatasetUBTreeDFlashDSpark
GSM8K9.53 / 3.055×6.57 / 2.665×7.53 / 2.718×
MATH-5009.86 / 3.518×5.74 / 2.643×6.96 / 2.826×
AIME 20258.44 / 3.152×4.76 / 2.261×5.37 / 2.263×
HumanEval10.04 / 3.411×6.39 / 2.770×7.59 / 2.914×
MBPP9.35 / 3.062×5.87 / 2.473×7.16 / 2.678×
LiveCodeBench7.46 / 2.794×4.11 / 1.948×4.84 / 2.030×

AL and throughput use three-round medians; the matched AR baseline uses one round.

Citation

If you use UBTree in your work, please cite:

@article{liang2026ubtree,
  title   = {UBTree: Parallel Tree Drafting via Unigram and Bigram Models for Speculative Decoding},
  author  = {Liang, Chumeng and Wang, Linxuan and Peng, Xinyu and Liu, Huabin and Chen, Yuxin and Liu, Ge and Lin, Guang and Song, Qifan and Li, Jianguo},
  journal = {arXiv preprint arXiv:2609.39972},
  year    = {2026},
  url     = {https://arxiv.org/abs/2609.39972}
}

License

The model weights are released under the MIT License. The pipeline figure is from Liang et al., Figure 2, reproduced without modification under CC BY 4.0.

Quoted from the model card on Hugging Face. The full card is behind the Hugging Face link above.

© 2026 AxForge · EU-hosted AI infrastructure Pricing Docs Trust Privacy Terms