CoWindow Attention: Full Causal Coverage Is a Collective Property
Summary
The paper explores CoWindow Attention (CoWA) and MassAlloc Attention (MALA) as optimized attention mechanisms for AI models, achieving substantial speedups in training and inference while reducing computational costs and maintaining performance.
View Cached Full Text
Cached at: 09/29/26, 04:10 AM
Paper page - CoWindow Attention: Full Causal Coverage Is a Collective Property
Source: https://huggingface.co/papers/2609.32704 Sharing two recent explorations in attention design from our team.
We started with two straightforward questions: Does every attention head need to repeatedly attend to the entire causal history? Once attention scores have been computed, do regions with very little contribution still need the full subsequent computation?
We explored two approaches:
**CoWindow Attention (CoWA): Let heads share the work of accessing history.**Heads share local context and divide distant context into complementary windows. Each head attends sparsely, while the heads collectively cover the full causal history. 📄arxiv.org/abs/2609.32704
**MassAlloc Attention (MALA): Let attention allocate its own compute.**MALA preserves full causal QK scoring, then uses attention’s own softmax statistics to reduce subsequent computation in low-contribution regions. 📄arxiv.org/abs/2609.32712
Both approaches support training forward and backward passes, as well as inference prefill and decoding. In attention-operator benchmarks at128K tokens on 8×H100 with TP=8, compared with FullAttn:
- **CoWA:****7.4×**forward,**8.6×backward, and3.0×**decoding speedups.
- **MALA:****2.2×**forward,**3.0×backward, and1.6×**decoding speedups.
We also conducted scaling experiments from0.6B to 14B, alongside separate continued-training experiments at32B. During 14B training with 32K context, CoWA and MALA reduced total training FLOPs by28.5%and23.1%, respectively, while maintaining performance comparable to FullAttn on the evaluated model capabilities.
From method design to kernel implementation to model training, our goal was to explore which attention computations can be eliminated—and how to turn those savings into practical gains in ML infrastructure.
Similar Articles
MassAlloc Attention: Let Attention Allocate Its Own Compute
The article introduces two attention mechanisms, CoWindow Attention and MassAlloc Attention, which optimize compute allocation in transformers, achieving significant speedups and reduced training FLOPs in benchmarks.
CoSA: Accelerating Long-Context Inference via Proxy-Kernel Co-Designed Sparse Attention
CoSA proposes a training-free sparse attention method that co-designs a kernel-aware proxy and an ordered-skipping kernel to accelerate long-context inference, achieving up to 4.93× attention speedup and 2.53× end-to-end TTFT reduction with negligible performance degradation.
ConSA: Controllable Sparsity in Hybrid Attention via Learnable Allocation
ConSA is a framework that learns optimal assignment between full attention and sliding-window attention under a user-specified sparsity target, using L0 regularization and augmented Lagrangian constraint. It demonstrates consistent gains over rule-based baselines on LLMs at 0.6B and 1.7B scales.
https://x.com/seclink/status/2072187033263784397
Hybrid Sliding Window Attention (Hybrid SWA) is a mixed attention mechanism in long-context language models that balances computational efficiency with full long-range dependencies. By alternating between local SWA layers and global attention layers, it significantly compresses KV cache while maintaining inference capability. This article details its design principles, application in models such as Gemma and Qwen, and best practices in open-source projects like vLLM and HuggingFace.
Rethinking the Role of Efficient Attention in Hybrid Architectures
This paper systematically analyzes the role of efficient attention modules in hybrid language model architectures, finding that different designs converge in long-context performance under sufficient training, and that long-range retrieval is primarily carried by full attention while efficient attention shapes the optimization trajectory, revealing a 'Large-Window Laziness' phenomenon.