Graphical einops: bridging tensor networks and computation graphs
Not on the map. Why?
Abstract (arXiv)
Architecture diagrams are ubiquitous in deep learning, but they are usually only representational: the tensor-program identities they suggest are still proved by prose and tensor-axis manipulation. We introduce a formal graphical calculus for the structural fragment of tensor programming underlying einops, making such diagrams proof-enabling. Our calculus represents tensor axes as nested graded tubes around a base type. The tube boundary recovers the undirected tensor-network view of axes, while the directed interior retains the operational reading of computation graphs. The key rewrite is grade-naturality: sliding spectacles over tubes. Standard equivariance proofs become short diagrammatic derivations. We additionally demonstrate how our rewrite system may be applied to convert attention masks into pre-processing operations, recovering efficient implementations of sparse attention blocks.
Key facts. No citing papers in the map yet (data through 7 Oct 2026). Builds on 17 of its 34 references that are in the map. First posted on arXiv 29 May 2026.
Builds on
17 of 34 references.
References · 17
- 2023Efficient Memory Management for Large Language Model Serving with PagedAttentioncited by 5,767
- 2022Self-Consistency Improves Chain of Thought Reasoning in Language Modelscited by 5,601
- 2022FlashAttention: Fast and Memory-Efficient Exact Attention with IO-Awarenesscited by 3,611
- 2023Tree of Thoughts: Deliberate Problem Solving with Large Language Modelscited by 3,155
- 2023FlashAttention-2: Faster Attention with Better Parallelism and Work Partitioningcited by 2,551
- 2023Efficient Streaming Language Models with Attention Sinkscited by 2,115
- 2020Big Bird: Transformers for Longer Sequencescited by 1,673
- 2022Fast Inference from Transformers via Speculative Decodingcited by 1,615
- 2019Generating Long Sequences with Sparse Transformerscited by 1,523
- 2023SGLang: Efficient Execution of Structured Language Model Programscited by 1,107
- 2019Transformer Dissection: A Unified Understanding of Transformer's Attention via the Lens of Kernelcited by 211
- 2022Transformer Language Models without Positional Encodings Still Learn Positional Informationcited by 148
5 more
- 2024Hydragen: High-Throughput LLM Inference with Shared Prefixescited by 71
- 2024FlashMask: Efficient and Rich Mask Extension of FlashAttentioncited by 18
- 2024Neural Circuit Diagrams: Robust Diagrams for the Communication, Implementation, and Analysis of Deep Learning Architecturescited by 8
- 2024An introduction to graphical tensor notation for mechanistic interpretabilitycited by 7
- 2025Tape Diagrams for Monoidal Monadscited by 1
Built on by
Not cited yet.