Wave-Attractor-Tree: A Hierarchical Binary Tree Reduction Architecture for Efficient Sequence Modeling
Machine Learning
2026-03-03 v1
Abstract
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.
Keywords
Cite
@article{arxiv.2603.00812,
title = {Wave-Attractor-Tree: A Hierarchical Binary Tree Reduction Architecture for Efficient Sequence Modeling},
author = {Igor Berezkin},
journal= {arXiv preprint arXiv:2603.00812},
year = {2026}
}
Comments
5 pages, 5 tables. Source code and benchmarks are available at [https://github.com/IgorBerezkin/WAT]