Skip to content
← Back to research index

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

AsymSpec: Context-Asymmetric Speculative Decoding for Agentic LLMs

First page of AsymSpec: Context-Asymmetric Speculative Decoding for Agentic LLMs
From the original paper · arXiv 2608.26004Page 1. Select the image to read the PDF.

AsymSpec replaces the standard lossy choice between input compression and full-context inference by letting a lightweight drafter read the full input while the large verifier generates against a compressed view, fusing their logits with a contrastive delta-fusion and a divergence-aware acceptance gate. The cost is running two models (drafter plus verifier) with dual context representations and a non-standard decoding loop, which increases memory footprint and implementation complexity relative to plain compression or off-the-shelf speculative decoding served through third-party APIs. It can fail when the divergence gate misjudges draft reliability, collapsing acceptance rates and erasing the speedup, and the reported gains are on isolated capabilities and two benchmarks, so end-to-end agentic workloads with heavy tool-call branching may see smaller benefits.

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
test
research area
speculative decoding
technical change
Context-asymmetric speculative decoding
published
2026-08-26

The approach is implementable on a single 24 GB GPU with a small drafter plus verifier and directly targets the compression-versus-accuracy trade-off common in agentic pipelines, but its custom fusion and gating logic and its unvalidated behavior on the reader's specific workloads mean it warrants a controlled pilot rather than immediate production adoption.

Central equations

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

where ai,bi∈ℝ|𝒱| are the per-position logits. Subtracting bi from ai removes the drafter’s context-independent preferences, isolating the shift induced by the additional context. Upon draft rejection, δi is fused into the verifier’s distribution:

di′=arg⁡max⁡(ti+β​δi),

equation (2) · §3 Method · proposed method

When the full and compressed views diverge sharply, a fixed acceptance threshold γ usually over-rejects the drafts and wastes context-gain signals. We replace it with a threshold that relaxes proportionally to context divergence, instantiating the per-position divergence Di as the Jensen–Shannon divergence (JSD):

γeff​(i)=γ⋅exp⁡(−Di),Di=JSD(softmax(ai)∥softmax(bi)).

equation (3) · §3 Method · proposed method

We choose JSD specifically for its strict upper bound, which guarantees γeff∈[γ/2,γ] without clipping or introducing additional hyperparameters; the exponential form is the unique solution to a multiplicative-composition axiom (derivation in Appendix A). A large Di signals context-induced divergence (not capacity-induced)—these are the positions where the compressed verifier most likely under-scores useful full-context drafts, so relaxing acceptance there is appropriate. The drafted token di is accepted iff:

[softmax⁡(ti)]di>γeff​(i)⋅[softmax⁡(bi)]di.

equation (4) · §3 Method · proposed method

equations from arXiv HTML · fetched 2026-09-21

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

    AsymSpec replaces the standard lossy choice between input compression and full-context inference by letting a lightweight drafter read the full input while the large verifier generates against a compressed view, fusing their logits with a contrastive delta-fusion and a divergence-aware acceptance gate. The cost is running two models (drafter plus verifier) with dual context representations and a non-standard decoding loop, which increases memory footprint and implementation complexity relative to plain compression or off-the-shelf speculative decoding served through third-party APIs. It can fail when the divergence gate misjudges draft reliability, collapsing acceptance rates and erasing the speedup, and the reported gains are on isolated capabilities and two benchmarks, so end-to-end agentic workloads with heavy tool-call branching may see smaller benefits.

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

    Inspect the source
  2. claim 02Paperraft inference

    Reports 1.3-1.7x throughput speedups at 0.2-0.3x compute cost on isolated text capabilities, while retaining approximately 90% of full-context accuracy on average.

    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 2608.26004

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.