Wave-Attractor-Tree: A Hierarchical Binary Tree Reduction Architecture for Efficient Sequence Modeling
Not on the map. Why?
Abstract (arXiv)
Work introduces a hierarchical binary tree-based reduction that replaces standard self-attention. The core idea is to use a recursive Gated Linear Unit merge operation, achieving O(n) total merge operations O(log n) parallel depth O(n d^2) total work and O(n) space complexity. In these experiments, the model significantly outperforms standard Transformers in both convergence speed and accuracy on long-range structural dependencies, specifically where hierarchical inductive bias is critical.
Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 14 of its 18 references that are in the map. First posted on arXiv 28 Feb 2026.
Builds on
14 of 18 references.
References · 14
- 2017Attention Is All You Needcited by 60,361
- 2023Mamba: Linear-Time Sequence Modeling with Selective State Spacescited by 4,718
- 2020Longformer: The Long-Document Transformercited by 3,413
- 2021Efficiently Modeling Long Sequences with Structured State Spacescited by 2,465
- 2020GLU Variants Improve Transformercited by 1,804
- 2020Big Bird: Transformers for Longer Sequencescited by 1,684
- 2020Rethinking Attention with Performerscited by 1,601
- 2019Generating Long Sequences with Sparse Transformerscited by 1,546
- 2019Root Mean Square Layer Normalizationcited by 1,480
- 2020Linformer: Self-Attention with Linear Complexitycited by 1,474
- 2023RWKV: Reinventing RNNs for the Transformer Eracited by 827
- 2016Language Modeling with Gated Convolutional Networkscited by 702
2 more
Built on by
Not cited yet.