Unverified
2026
Okada Non-Crossing Routing Attention
Replace dense token-to-token attention with a learned composition of adjacent routing operators whose connectivity is stored as a non-crossing labelled arc diagram. Canonicalize the composed routing program using the Okada relations, then execute only the surviving sparse token paths.
Paper: Diagrammatic Okada monoid and cellularity of the Okada algebra
arXiv:2609.01440