AI Paper Atlas

Research map / Architectures and efficiency / Attention and transformers

Long-context KV and memory attention

Speeds long-context LLM inference with hierarchical sparse attention and key-value memory designs.

88 accepted papers at ICML, NeurIPS, ICLR, CVPR and AAAI (2017–2026) · an approach in Attention and transformers, keyword cluster “kv · cache · long context”

State History Tried Checklist Preprints Who Export

Where it stands

Not enough benchmark data Fewer than four papers report the same benchmark, so there is no record to follow.

16 papers in 2023–24 and 39 in 2025–26 (at ICML, NeurIPS, ICLR, CVPR and AAAI); its share of the topic grew, from 2.7% to 3.3%.

How this is decided

A benchmark is tracked when at least four papers of this approach report their own method on the same dataset and metric in at least two different years. Its record is the best number reported up to 2024 compared with the best reported in 2025–26: still improving means at least 1% better, flat means at most 0.2% better with at least two papers from 2025–26 trying. Numbers on a different scale from the rest (a fraction among percentages) and far outliers are left out. Results come from different papers with different setups, so they are signals, not head-to-head comparisons. The share of papers is counted at ICML, NeurIPS, ICLR, CVPR and AAAI.

How it got here

2016: 0162017: 1172018: 7182019: 3192020: 12202021: 6212022: 4222023: 7232024: 9242025: 15252026: 2426

Most cited paper of each year

Earliest papers here

What has been tried

64 papers here report 721 measured changes (a component added, removed or swapped, compared with a baseline): helped 65%, no clear effect 8%, hurt 24%, mixed 3%. Papers mostly publish changes that helped, so "helped" is over-represented.

Ablations in recent papers

What was changedMeasured onResultEffectPaper
Move the gate from SDPA output to value projection400B tokens · Avg PPL5.761 -> 5.820HurtGated Attention for Large Language Models: Non-linearity, Sparsity, and Attention-Sink-Free (NeurIPS 2025 · 15 citations)
Replace low-rank attention approximation with deformable attentionARC-Easy, ARC-Challenge, OpenBookQA, PIQA · accuracyBaseline/Ours/Deformable: arc-easy 73.4/73.2/24.4; arc-challenge 45.6/47.3/21.4; openbookqa 32.2/32.6/23.0; piqa 79.4/79HurtLow-Rank Approximation for Sparse Attention in Multi-Modal LLMs (CVPR 2024 · 15 citations)
Add multiplicative attention alongside additive attentionEP and MI · accuracy and MSEHelpedArithmetic Feature Interaction Is Necessary for Deep Tabular Learning (AAAI 2024 · 13 citations)
add the first input adaptertabular benchmarks · task performanceHelpedTabM: Advancing tabular deep learning with parameter-efficient ensembling (ICLR 2025 · 5 citations)
Use page size 16 instead of page size 32LongBench tasks, especially tight cache budgets · F1 / Rouge-L / accuracyMixedArkVale: Efficient Generative LLM Inference with Recallable Key-Value Eviction (NeurIPS 2024 · 5 citations)
Permute the board tile orderTotal average vs UCT 1× · win rate75% -> 64%HurtFast and Knowledge-Free Deep Learning for General Game Playing (Student Abstract) (AAAI 2024 · 1 citation)
add conditional LoRA for compression tokens instead of default unconditional LoRAMetaICL, LaMP, and DailyDialog · accuracy (%) on MetaICL and LaMP; perplexity on DailyDialog69.4 -> 70.0; 66.3 -> 69.6; 83.9 -> 84.7; 82.6 -> 83.9; 6.01 -> 5.96; 6.42 -> 6.33HelpedCompressed Context Memory for Online Language Model Interaction (ICLR 2024 · 1 citation)
add random sparse attention selection to BaseConvPile validation, 162M–168M hybrids · log perplexity12.90 -> 12.13HelpedZoology: Measuring and Improving Recall in Efficient Language Models (ICLR 2024 · 1 citation)
use CodeHunter instead of CodeHunter(AST) without AST parsingNexgen · Top-1 accuracy89.21% -> 93.86%HelpedBERT-Based Code Learning for Exception Localization and Type Prediction (AAAI 2025 · 0 citations)
add Full Tree AttentionMT-Bench, temperature 0, Vicuna-7B · speedup3.10× -> 3.15×HelpedGumiho: A Hybrid Architecture to Prioritize Early Tokens in Speculative Decoding (ICML 2025 · 0 citations)
Replace softmax attention with non-causal linear attention57 real tabular datasets · Accuracy and runtimeHelpedTabFlex: Scaling Tabular Learning to Millions with Linear Attention (ICML 2025 · 0 citations)
Reduce the adaptive-head ratio to 0.1RULER-128K · AccuracyNo clear effectCateKV: On Sequential Consistency for Long-Context LLM Inference Acceleration (ICML 2025 · 0 citations)

What reviewers will expect

Datasets and baselines named in the 17 papers of this approach from 2025–2026 that have a full-text summary. Leaving out the common ones is a frequent review question.

Datasets

  • RedPajama · 2 of 17 papers

Baselines

  • XGBoost · 2 of 17 papers
  • CatBoost · 2 of 17 papers
  • LightGBM · 2 of 17 papers
  • SAINT · 2 of 17 papers
  • FTTransformer · 2 of 17 papers
  • StreamingLLM · 2 of 17 papers
  • SnapKV · 2 of 17 papers
  • DuoAttention · 2 of 17 papers

Recent preprints

Loading recent arXiv preprints…

    Who publishes on it

    Institutions on the most papers of this approach since 2023 (of 55 papers; from OpenAlex and the papers' affiliations).

    Use it

    Download BibTeX of 40 key papersOpen the topic in the interactive map

    Get alerts. Describe your idea in scime atlas and save it (free scime account): you get a weekly email when new preprints land close to it.

    Same keyword cluster

    Elsewhere in the topic

    Benchmark numbers, ablations and baseline numbers are extracted by AI from each paper's full text and can be wrong; the paper is the authority. Data: results index of 2026-11-02, citation counts from OpenAlex (2026-10-09).

    Get the next scime Dispatch and a monthly field update

    Free. We send a confirmation link first; every email has a one-click unsubscribe. Privacy