REVIEW 2 cited by
An introduction to graphical tensor notation for mechanistic interpretability
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
read the original abstract
Graphical tensor notation is a simple way of denoting linear operations on tensors, originating from physics. Modern deep learning consists almost entirely of operations on or between tensors, so easily understanding tensor operations is quite important for understanding these systems. This is especially true when attempting to reverse-engineer the algorithms learned by a neural network in order to understand its behavior: a field known as mechanistic interpretability. It's often easy to get confused about which operations are happening between tensors and lose sight of the overall structure, but graphical tensor notation makes it easier to parse things at a glance and see interesting equivalences. The first half of this document introduces the notation and applies it to some decompositions (SVD, CP, Tucker, and tensor network decompositions), while the second half applies it to some existing some foundational approaches for mechanistically understanding language models, loosely following ``A Mathematical Framework for Transformer Circuits'', then constructing an example ``induction head'' circuit in graphical tensor notation.
Forward citations
Cited by 2 Pith papers
-
How to Write a Simulator for Quantum Circuits from Scratch: A Tutorial
A tutorial with pseudocode and a compact JavaScript simulator that shows how to simulate quantum circuits of 20+ qubits using qubit-wise multiplication and partial trace.
-
Very Basics of Tensors with Graphical Notations: Unfolding, Calculations, and Decompositions
A pedagogical review that explains tensor basics, reshaping, products, and decompositions through tensor network diagrams.
Discussion (0). Continue with ORCID to comment.