Bole: Efficient Tree Speculation for Hybrid-Attention Language Models · Research brief

Request deep report Read original paper ↗View page data (JSON)Download research skill ↓Discuss this paper

For solo builders

A possible application for this research area. Paper-specific feasibility still needs a full-paper review.

Your self-hosted model spends too long generating answers token by token.

What you would change

Check whether a compatible draft model and serving integration exist before renting compute.

Try the idea on your product

A proposed first test. Set your budget and success criteria before running it.

Check whether a compatible draft model and serving integration exist before renting compute.

Compare against

The same target with speculation off, then your existing drafter if you have one.

Locate the paper's implementation and check its license, model support, data needs, and hardware requirements. Stop here if you cannot obtain the required artifacts.
Save a small set of representative product tasks and expected outcomes. Keep evaluation tasks out of any training or tuning, and choose quality and cost limits before running.
Run the baseline and the proposed change on identical inputs. Keep other settings fixed and repeat paired runs to expose variation.
Save per-task outputs, failures, timings, and all usage costs. Review regressions before expanding the test.

What to measure

Accepted draft length, tokens per second, tail latency, output quality, and total GPU cost.

When to keep it

Keep the change only if it meets your preselected quality and latency limits and improves the metric you care about after setup and operating costs. Otherwise retain the baseline. This is an exploration plan, not a validated recommendation.

Download test plan ↓

abstract indexedPaperraft next step

Do not allocate compute yet.

This page uses the abstract and public adoption signal only. Request the deep report before relying on its recommendation.

Abstract-level screening only. Risks and infrastructure may not have been evaluated. This recommendation is not a reproduced result.

minimum test setup: not reported
published evidence setup: not reported
source-linked claims: 0 of 2
exposure checks: 0 of 8

Why it was shortlisted

The technical change, research area, and reason it entered the archive.

recommendation: test
research area: speculative decoding
technical change: Tree speculation for hybrid-attention models
published: 2026-08-03

The gains are large and lossless but are realized only inside a specific serving engine on hybrid-attention architectures, so the reader should benchmark it on their own model and workload before committing to production.

Central equations

Original equations, typeset for reading. Paperraft explanations connect the mechanism, its aim, and the evidence.

Sequential tree execution of the gated delta rule produces

O = D_{P} ​ Q ​ S_{pre} + C ​ {(I + G)}^{- 1} ​ D_{β} ​ (V - D_{P} ​ K ​ S_{pre}) .

equation (2) · §IV Parallel Tree Verification for Recurrent Linear Attention · proposed method

The factors $G, C \in ℝ^{T \times T}$ describe propagation and readout interactions among proposal nodes. They are determined by the tree topology, $Q / K$ , and gates, and are independent of the value channel. Bole therefore partitions the $d_{v}$ columns into $N_{v} = ⌈ d_{v} / b_{v} ⌉$ sets $𝒥_{r}$ of at most $b_{v}$ columns. Let $X^{(r)} = X [:, 𝒥_{r}]$ for $X \in {S_{pre}, V, B_{0}, R, U, O}$ . Restricting Eq. (2) to one value tile gives

B_{0}^{(r)} = D_{P} ​ (Q ​ S_{pre}^{(r)}), R^{(r)} = D_{β} ​ (V^{(r)} - D_{P} ​ (K ​ S_{pre}^{(r)})),

U^{(r)} = \sum_{m = 0}^{d} {(- G)}^{m} ​ R^{(r)}, O^{(r)} = B_{0}^{(r)} + C ​ U^{(r)} .

equation (7) · §IV Parallel Tree Verification for Recurrent Linear Attention · proposed method

Factorized speculative states. Materializing $T$ candidate states has space complexity $Θ (T H d_{k} d_{v})$ . By Lemma 1, Bole retains only the node factors $P, K, U$ in addition to the single committed state, reducing the speculative-state storage complexity to

\underset{committed state}{\underset{⏟}{Θ (H ​ d_{k} ​ d_{v})}} + \underset{tree factors}{\underset{⏟}{Θ (T ​ H ​ (d_{k} + d_{v} + 1))}} .

equation (9) · §IV Parallel Tree Verification for Recurrent Linear Attention · complexity

equations from arXiv HTML · fetched 2026-09-16

Claims and evidence

A claim is source-linked only when the PDF page and matching excerpt are available.

claim 01Paperraft inference
Read the brief interpretation
It replaces branch-by-branch recurrent-state traversal in existing tree-speculation systems with a tree-structured closed-form linear-attention kernel that verifies all proposal nodes in parallel and materializes only the post-sampling selected state. The cost is a custom GPU kernel plus integration effort: the work is built into SGLang, so adoption is practical mainly for teams already serving hybrid-attention models through that stack, and the kernel-runtime co-design adds maintenance complexity. It can fail if the deployed models are full-attention only (the technique does not apply), if draft-model acceptance rates are low enough that tree speculation yields no gain, or if the claimed speedups do not transfer to GPU platforms or batch regimes outside those evaluated.
This is a Paperraft inference. It is not pinned to a verified PDF passage.
Inspect the source
claim 02Paperraft inference
Up to 4.72x the offline decode throughput of autoregressive decoding, up to 2.03x the strongest tree-speculative baseline, and up to 67.6%/49.9% TTFT/TPOT reduction under online agent workloads.
This is a Paperraft inference. It is not pinned to a verified PDF passage.
Inspect the source

Exposure map

Author findings, Paperraft interpretations, and the next check. Missing analysis never counts as evidence of safety.

quality

Still unknown

Which tasks improve, and which regress against the baseline?

compute and memory

Still unknown

What memory, hardware, and total compute does the complete method require?

latency

Still unknown

Are startup time, typical response time, and slow requests measured separately?

operations

Still unknown

What must be monitored, maintained, and rolled back?

software compatibility

Still unknown

Does the implementation support your model, runtime, and hardware?

security

Still unknown

What new data access, permissions, or trust boundaries does it introduce?

data and training

Still unknown

What data preparation or training is required, and is it included in the cost?

reproducibility

Still unknown

Are code, versions, inputs, and evaluation scripts available?

Continue the investigation

A reading guide for speculative decoding.

Editorial prompts, not findings from this paper or a validated test plan. Detailed analysis is still pending for the topics below.

What to inspect

How are proposals verified, and what happens after rejection? Check the assumptions behind any quality guarantee.

Plan a fair comparison

Can you compare the same target model with speculation off and on, including proposal and verification time?

Questions for adoption

Which draft model or prediction heads are needed, and how does acceptance change with the workload?

Read the paper with these questions

Inside the paper

Preview the first 3 pages of the original PDF. Click the stack to turn the page.

The downloadable skill includes SKILL.md and evidence.json, with recorded findings and unanswered checks. TRY-IT.md adds a product test plan and a blank results sheet.

A reading aid for your agent. Findings still need validation.

Page 1 of 3

Open this page in the PDF ↗

Provisional research brief updated 2026-10-18. Paperraft has not reproduced this experiment.

For solo builders

What you would change

Try the idea on your product

Compare against

What to measure

When to keep it

Do not allocate compute yet.

Why it was shortlisted

Central equations

Claims and evidence

Up to 4.72x the offline decode throughput of autoregressive decoding, up to 2.03x the strongest tree-speculative baseline, and up to 67.6%/49.9% TTFT/TPOT reduction under online agent workloads.

Exposure map

quality

compute and memory

latency

operations

software compatibility

security

data and training

reproducibility

Continue the investigation

What to inspect

Plan a fair comparison

Questions for adoption

Inside the paper

Discuss this paper