Ping pong computation in superposition — LessWrong
lesswrong.com · 1,365 words · saved by 1 readers
Overview: This post builds on Circuits in Superposition 2, using the same terminology. …
x Ping pong computation in superposition — LessWrong Comp-In-Sup Interpretability (ML & AI) Superposition AI Frontpage 13 Ping pong computation in superposition by Alex Gibson 29th Dec 2025 4 min read 0 13 Overview: This post builds on Circuits in Superposition 2 , using the same terminology. I focus on the z = 1 case, meaning that exactly one circuit is active on each forward pass. This restriction simplifies the setting substantially and allows a construction with zero error, with T = D 2 d 2 , L + 2 layers, and width D ( 1 + 1 d + ⌈ log 2 D d ⌉ D ) . While the construction does not directly
saved by
related reading
- AlgZoo: uninterpreted models with fewer than 1,500 parameters — LessWronglesswrong.com
- Circuits in Superposition 2: Now with Less Wrong Math — LessWronglesswrong.com
- Toy Models of Superpositiontransformer-circuits.pub
- Computational Superposition in a Toy Model of the U-AND Problem — LessWronglesswrong.com
- Zoom In: An Introduction to Circuitsdistill.pub
- [2608.27540] Towards a mathematical theory of superpositionarxiv.org
- [2605.01192] Linear-Readout Floors and Threshold Recovery in Computation in Superpositionarxiv.org
- Toward A Mathematical Framework for Computation in Superposition — LessWronglesswrong.com
- Neural networks and deep learningneuralnetworksanddeeplearning.com
- Interpretability Dreamstransformer-circuits.pub
- Reverse Engineering a Neural Network's Clever Solution to Binary Addition - Casey Primozic's Homepagecprimozic.net
- Superposition, Memorization, and Double Descenttransformer-circuits.pub