Paper

SAS: Simple Attention Sparsification via End-to-End Optimization of Context Ranking

Continuous log-space gates are injected into sparse attention, letting LM loss train the selector end-to-end instead of layer-wise attention distillation.

arXiv ↗Sep 11, 2026Code ↗Dataset ↗

  • llm
  • sparse attention
  • long-context
  • inference efficiency
Method diagram comparing gradient-blocked vs gradient-flowed attention selection architectures
Method diagram comparing gradient-blocked vs gradient-flowed attention selection architectures

What it is

End-to-end sparse attention training for pretrained LLMs by injecting selector scores into attention logits, avoiding distillation and improving context ranking under fixed budgets. Instead of distilling dense attention because Top-K blocks LM gradients, SAS keeps Top-K but adds continuous log-space gates inside attention softmax so the LM loss directly learns which context blocks matter under a budget.

Key results

  • At 1024 budget, +10.6 to +15.5 GPQA-Diamond vs SeerAttention-R
  • At 1024 budget, +6.0 to +7.7 MATH500 vs SeerAttention-R
  • On BFCL, improves by up to +3.5 and nearly recovers full attention at 4096

Directly optimizing context ranking with the LM objective is more effective than matching dense attention, especially when the attention budget is tight.

One useful ML email a week.

Worth your time, not all of your time.

We track new ML work across papers, code, and data, then keep only the pieces worth a closer look. Selected, not collected.

Papers.Data.Code

The Weekly ML Signal

Selected, not collected.

One useful ML email a week: the papers, repos and datasets worth your attention.

Worth your time, not all of your time.