Skip to content
← Back to research index

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

SANTA++: Sampling Attention through Representative Keys

First page of SANTA++: Sampling Attention through Representative Keys
From the original paper · arXiv 2609.35629Page 1. Select the image to read the PDF.

SANTA++ replaces full dense attention over the KV cache with a training-free importance-sampled estimator that scores one representative key per team, samples a fixed budget of teams, and computes exact attention only within them. It costs an unbiased-estimation variance tradeoff: accuracy drops to 85%-91% of baseline on RULER, and realized speedup depends on the custom kernel rather than stock FlashAttention. It can fail on workloads where relevant tokens scatter across many teams or where the sampling budget is set too low, and gains beyond 32K contexts or on models other than the tested one are unvalidated.

For solo builders

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

Profiling shows attention computation is a bottleneck in your self-hosted service.

What you would change

Check the supported GPU, tensor shapes, and precision, then replace only the relevant kernel.

Try the idea on your product

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

Check the supported GPU, tensor shapes, and precision, then replace only the relevant kernel.

Compare against

The existing kernel inside the same complete serving pipeline.

  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

Numerical differences, end-to-end latency, throughput, and memory at realistic shapes.

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
attention and kernels
technical change
Stochastic representative-key attention sampling
published
2026-09-28

The method is training-free, open-source, and directly reduces KV reads and attention latency on a single GPU, but the quality variance and kernel dependency require validation on the reader's specific long-context workload before production adoption.

About the technical core

Equations have not been fetched yet.

When reading the methods, identify the rule, algorithm, or evaluation protocol that produces the claimed change. An equation is useful here only if it explains that mechanism.

Inspect the original paper

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

    SANTA++ replaces full dense attention over the KV cache with a training-free importance-sampled estimator that scores one representative key per team, samples a fixed budget of teams, and computes exact attention only within them. It costs an unbiased-estimation variance tradeoff: accuracy drops to 85%-91% of baseline on RULER, and realized speedup depends on the custom kernel rather than stock FlashAttention. It can fail on workloads where relevant tokens scatter across many teams or where the sampling budget is set too low, and gains beyond 32K contexts or on models other than the tested one are unvalidated.

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

    Inspect the source
  2. claim 02Paperraft inference

    With 32-64 sampled teams, SANTA++ reads 16%-22% of dense attention's KV entries while retaining 94%-99% of baseline scores on LongBench v2 and HELMET RAG (85%-91% on RULER) with Qwen2.5-7B-Instruct at 32K context, and its kernel delivers a 1.69x attention speedup over FlashAttention at 32K with 31 teams.

    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 attention and kernels.

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

What to inspect

Which tensor shapes, precision settings, and hardware support the reported kernel result?

Plan a fair comparison

Can you compare against the existing implementation on the same inputs, checking numerical error and end-to-end time?

Questions for adoption

Are the gains limited to a microbenchmark, or do they appear in the complete model 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 2609.35629

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.