CoWindow Attention: Full Causal Coverage Is a Collective Property

Jingze Shi, Zhangyang Peng, Xianduo Li, Yanlin Qi, Xiaotian Lin, Haoxian Chen, Liangdong Wang, Guang Liu and 1 others

The Hong Kong University of Science and Technology (Guangzhou) · Beijing Academy of Artificial Intelligence · Université Paris Cité

Published September 26, 2026 · on the feed September 29, 2026 · ▲ 66 · arXiv 2609.32704

The abstract

FullAttn repeatedly exposes the complete causal history to every attention head, creating substantial redundant computation and memory traffic even with IO-efficient dense kernels. We introduce CoWA, a structured attention architecture that distributes access to the causal history across KV heads. All heads share near-diagonal and prefix-sink windows, while complementary long-range windows partition the remaining history. Their union provides full causal coverage although each head attends sparsely to distant tokens. This position-defined attention pattern requires no learned router or indexer, is used consistently during training and inference, and aligns with KV-head tensor parallelism. A window-matched ablation at 8K isolates the effect of complementary long-range allocation: CoWA with 100% collective coverage reaches 89.73% accuracy, compared with 89.97% for FullAttn, while duplicated long-range windows perform substantially worse. Across a broader controlled associative-recall comparison with matched token budgets, CoWA closely tracks FullAttn as the context grows, whereas other sparse patterns lose a substantial fraction of the associations. In an attention-operator benchmark at 128K tokens with tensor parallelism, CoWA reduces forward and backward latency during training by 7.4x and 8.6x and decoding latency during inference by 3.0x over FullAttn. Its per-rank peak operator memory matches FullAttn during training and is 7.6x lower during decoding. Across scaling-law training from 0.6B to 14B parameters, CoWA closely tracks FullAttn in perplexity while reducing total training FLOPs. The resulting 14B models and 32B models from separate continued training achieve comparable knowledge, reasoning, and long-context retrieval scores to FullAttn. These results show that full causal coverage can be a collective property of the head ensemble rather than a duplicated property of every head.

The Brief

3:21

A short podcast summary of the paper. Written and voiced by AI.

Transcript

CoWindow Attention. Full Causal Coverage Is a Collective Property. By Jingze Shi and eight others, from the Hong Kong University of Science and Technology in Guangzhou, the Beijing Academy of Artificial Intelligence, and one other institution. Published on the twenty-sixth of September. Its code repository is worked out: about nine hundred source files, with a readme and a licence.

Full attention, which the abstract calls FullAttn, shows the complete causal history to every attention head, over and over again. Each head sees every earlier token. That repetition creates a large amount of redundant computation and memory traffic, and the abstract is careful to add that this holds even when the dense kernels doing the work are already IO-efficient. The waste is not in how the computation is carried out. It is in how much of it is duplicated across heads.

CoWA, short for CoWindow Attention, is a structured attention architecture that spreads access to the causal history across the KV heads instead of handing all of it to each one. The claim in the title is the heart of it. Full causal coverage does not have to be a property of every head individually. It can be a property of the heads taken together.

The layout is fixed by position. All heads share two windows: a near-diagonal window over the most recent tokens, and a prefix-sink window at the start of the sequence. The rest of the history is covered by long-range windows that are complementary, meaning they partition what remains among the heads. Put the heads side by side and their union covers the full causal past, even though any single head attends only sparsely to distant tokens. Because the pattern is defined by position, there is no learned router and no indexer. The same pattern is used in training and in inference, and it lines up with tensor parallelism over KV heads.

A window-matched ablation at eight thousand tokens isolates the complementary long-range allocation. With one hundred percent collective coverage, CoWA reaches eighty-nine point seven three percent accuracy, against eighty-nine point nine seven for FullAttn. Giving the heads duplicated long-range windows instead does substantially worse. In a broader associative-recall comparison with matched token budgets, CoWA closely tracks FullAttn as context grows, while other sparse patterns lose a substantial fraction of the associations.

Speed is measured on an attention-operator benchmark at one hundred and twenty-eight thousand tokens with tensor parallelism. In training, CoWA cuts forward latency by seven point four times and backward latency by eight point six times. Decoding latency in inference falls by three times. Peak operator memory per rank matches FullAttn in training and is seven point six times lower in decoding. Scaling-law training runs from zero point six billion to fourteen billion parameters, and CoWA tracks FullAttn in perplexity while spending fewer total training FLOPs. The resulting fourteen billion parameter models, along with thirty-two billion parameter models from separate continued training, score comparably to FullAttn on knowledge, reasoning, and long-context retrieval.

One picture holds the whole design. Dense attention gives every head a full view of the past. CoWA gives each head a shared view of the near and the very beginning, plus its own slice of everything between, and lets coverage emerge from the ensemble. The reported accuracy stays close to FullAttn while latency and decoding memory drop, which is the evidence offered that full coverage can be collective rather than duplicated.

Paper Quest · 7 chapters · about 41 min

Play this paper

Learn it by doing: make the calls the authors made, guess the result before you see it, and defend it in a viva graded on your own words. Chapter 1 is right here.

Chapter 1 🧩 · The problem

Every head reads everything. Faster kernels never questioned that.

You train a language model on very long inputs. Every attention head looks at every earlier token, again and again.

The road ahead

  1. 1 · The problem ~7 min With long inputs, every attention head rereads the whole history, so much of the attention work is the same reading done many times over.
  2. 2 · What came before ~3 min
  3. 3 · The key idea ~9 min Full causal coverage need not hold for each head; it can hold for the heads together, with shared recent and start windows and split older history.
  4. 4 · Choose your own research ~3 min
  5. 5 · Build the method ~8 min CoWA builds each head's visible keys from shared near and sink windows plus one long-range slice, and uses that one rule everywhere.
  6. 6 · The experiment ~6 min You’ll guess: At 128K tokens with tensor parallelism, how much faster was the training backward pass with CoWindow Attention (CoWA) than with full attention (FullAttn)?
  7. 7 · The viva ~5 min Three questions from the examiners, answered in your own words. Win it for the paper’s trophy.
Join free to play the whole quest ›

Free, with Google or an email address. Your stars and progress are kept.

KipQuest: the day’s AI research, as podcasts and quests. All papers Android app Privacy Contact Episodes are written and voiced by AI from each paper. Summaries can contain mistakes: the paper is the source.