Zyphra proposes hierarchical attention ZHA, achieving sub-quadratic complexity sparse attention
Zyphra proposes hierarchical attention ZHA, which selects relevant tokens for each query by constructing and searching a compressed tree of the KV cache, achieving sub-quadratic complexity under an appropriate top-p threshold. ZHA only requires KL distillation with a few billion tokens to adapt an existing pretrained model, adding only 81,920 trainable parameters on Qwen3.6-35B-A3B; on RULER-13 256K, the wide tree reaches 96.2% and the deep tree 93.3%, on LongBench v2 the deep tree reaches 63.4%, higher than dense attention's 58.0%, and on SWE-bench Verified it is comparable to the dense baseline. Its GPU performance model predicts it is faster than dense attention at about 48K tokens and faster than MSA at about 480K tokens, with roughly 32–35x speedup relative to dense attention at a ten-million-token context.

Zyphra proposes hierarchical attention ZHA, which selects relevant tokens for each query by constructing and searching a compressed tree of the KV cache, achieving sub-quadratic complexity under an appropriate top-p threshold. ZHA only requires KL distillation with a few billion tokens to adapt an existing pretrained model, adding only 81,920 trainable parameters on Qwen3.6-35B-A3B; on RULER-13 256K, the wide tree reaches 96.2% and the deep tree 93.3%, on LongBench v2 the deep tree reaches 63.4%
Matched fieldsBody


