@rohanpaul_ai: This paper makes long-context attention cheaper and faster by letting each token use only the query heads it needs. Rea…
Summary
The paper introduces Grouped Query Experts, which improves long-context attention by routing each token to only a few query-head experts on top of grouped-query attention, achieving 1.7-1.8x faster prefill while matching accuracy.
View Cached Full Text
Cached at: 06/28/26, 12:00 PM
This paper makes long-context attention cheaper and faster by letting each token use only the query heads it needs.
Reached about 1.7 to 1.8 times faster prefill when context length became large.
Standard attention makes every token run through every attention head, even when some heads are not useful for that token.
The paper’s idea, called Grouped Query Experts, keeps the normal key and value cache from grouped-query attention but routes each token to only a few query-head experts.
Grouped Query Experts sits on top of grouped-query attention, the trick many long-context models already use to reduce key-value cache cost.
This is like giving the model many possible attention patterns, while making each token pay for only the small set that seems useful.
The authors trained 250M-parameter models on 30B tokens and compared the method with a normal grouped-query attention baseline.
The best version matched the baseline’s average accuracy, 56.04 versus 55.86, while using 9 of 16 query-attention computations.
shows that attention can be made sparse inside grouped-query attention without hurting quality, but only when the router gets a strong learning signal and one shared head stays always on.
Link – arxiv. org/abs/2606.20945
Title: “Grouped Query Experts: Mixture-of-Experts on GQA Self-Attention”
Similar Articles
Grouped Query Experts: Mixture-of-Experts on GQA Self-Attention
Grouped Query Experts (GQE) improves Transformer efficiency by applying a mixture-of-experts layer on top of grouped-query attention, selectively activating query heads per token while keeping key-value cache benefits, matching baseline accuracy with half the query-head compute at 250M parameter scale.
@rohanpaul_ai: New Alibaba + Nanjing Univ paper claims million-token prefill can be sped up 9.36X (compared against FlashAttention-2) …
A new paper from Alibaba and Nanjing University introduces RTPurbo, a method that speeds up million-token prefill by up to 9.36x compared to FlashAttention-2 by selectively applying full attention only where needed, without retraining the model.
Attention Expansion: Enhancing Keyphrase Extraction from Long Documents with Attention-Augmented Contextualized Embeddings
This paper proposes an attention expansion mechanism to enhance keyphrase extraction from long documents by augmenting PLM token representations with out-of-context information, achieving consistent improvements over state-of-the-art models without requiring full-document attention or expensive LLM inference.
@NousResearch: Today we release Lighthouse Attention, a selection-based hierarchical attention for long-context pre-training that deli…
NousResearch releases Lighthouse Attention, a selection-based hierarchical attention that achieves 1.4-1.7x wall-clock speedup at 98K context and ~17x faster forward/backward pass than standard attention at 512K context on a single B200, validated on 530M-parameter Llama-3 models across 50B tokens.
Subquadratic AI introduces SubQ-1.1-Small, a new model using Smart Sparse Attention
Subquadratic AI introduces SubQ-1.1-Small, a model leveraging Smart Sparse Attention to achieve near-perfect long-context retrieval up to 12M tokens with up to 1,000x attention compute reduction. It balances long-context optimization with strong general reasoning, outperforming baselines on benchmarks like NIAH and RULER.