Skip to content
← Back to research index

abstract indexed · arXiv 2607.25852 · updated 2026-10-18

AngelSpec: Towards Real-World High Performance Inference with Speculative Decoding

First page of AngelSpec: Towards Real-World High Performance Inference with Speculative Decoding
From the original paper · arXiv 2607.25852Page 1. Select the image to read the PDF.

Replaces one universal speculative drafter with two specialized drafters, MTP for chat and block diffusion for code and mathematics, plus adaptive batched verification. It requires training both drafters for Hy3 target models and a custom server with a profiled verification-cost model. Benefits depend on trained drafters and control of the serving loop, which excludes third-party APIs and unsupported open models.

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.

  1. 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.
  2. 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.
  3. Run the baseline and the proposed change on identical inputs. Keep other settings fixed and repeat paired runs to expose variation.
  4. 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
watch
research area
speculative decoding
technical change
Hybrid MTP and block-diffusion speculative decoding
published
2026-07-28

The reported gains require custom drafter training and serving control beyond the reader's single-GPU and third-party API setup.

Central equations

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

After cold start, training switches to the end-to-end TV objective(Li et al., 2026) based on the expected accepted draft length, where αi,k=α⁡(pi,k,qi,k):

ℒe2e=1−1|ℐ|​D​∑i∈ℐ∑m=0D−1∏k=0mαi,k,

equation (9) · §2 Multi-Token Prediction · loss function

Motivated by their complementary roles, we formulate target conditioning as a shared-and-specialized decomposition. The FC branch ct establishes a common semantic basis by modeling cross-layer feature interactions, while ft(i) provides a depth-dependent refinement that preserves the target-layer preferences of draft layer i. The resulting conditioning representation is

gt(i)=RMSNorm⁡(ct+ft(i)),

equation (12) · §3 DFly: Scalable and AR-Aware Parallel Drafting · proposed method

At server startup, D-cut profiles the end-to-end speculative-step latency C⁡(B,ρ) for each supported (B,ρ) pair, including drafting, selection, packing, and target verification. At runtime, it chooses

ρ⋆=arg⁡maxρ∈ℛ⁡U⁡(B,ρ)C⁡(B,ρ).

equation (24) · §4 Real-World Deployment: D-cut · metric

equations from arXiv HTML · fetched 2026-09-14

Claims and evidence

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

  1. claim 01Paperraft inference
    Read the brief interpretation

    Replaces one universal speculative drafter with two specialized drafters, MTP for chat and block diffusion for code and mathematics, plus adaptive batched verification. It requires training both drafters for Hy3 target models and a custom server with a profiled verification-cost model. Benefits depend on trained drafters and control of the serving loop, which excludes third-party APIs and unsupported open models.

    This is a Paperraft inference. It is not pinned to a verified PDF passage.

    Inspect the source
  2. claim 02Paperraft inference

    Reports 1.98-2.40x speedup over autoregressive decoding and 10.5-11.8% higher throughput than DFlash on the Hy3 series.

    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.

Discuss this paper

Question a claim, compare interpretations, or share what happened when you tried the method.

Join the conversation on GitHub. Use this paper's arXiv ID in the title when starting a discussion.

arXiv 2607.25852

Comments are public and separate from Paperraft's research brief. When sharing a result, include the model, hardware, baseline and a link to your work.