Compressed Computation is (probably) not Computation in Superposition

Jai Bhagat, Sara Molas-Medina, Giorgi Giglemiani, Stefan Heimersheim

Keywords: Foundational work

Other Keywords: superposition,computation in superposition

TL;DR: We show that the Compressed Computation model of Braun et al. (2025) is likely not a toy model of Computation in Superposition

Abstract: We study whether the Compressed Computation (CC) toy model (Braun et al., 2025) is an instance of computation in superposition. The CC model appears to compute 100 ReLU functions with just 50 neurons, achieving a better loss than expected from only representing 50 ReLU functions. We show that the model mixes inputs via its noisy residual stream, corresponding to an unintended mixing matrix in the labels. Splitting the training objective into the ReLU term and the mixing term, we find that performance gains scale with the magnitude of the mixing matrix and vanish when the matrix is removed. The learned neuron directions concentrate in the subspace associated with the top 50 eigenvalues of the mixing matrix, suggesting that the mixing term governs the solution. Finally, a semi-non-negative matrix factorization (SNMF) baseline derived solely from the mixing matrix reproduces the qualitative loss profile and improves on prior baselines, though it does not match the trained model. These results suggest CC is not a suitable toy model of computation in superposition.

Submission Number: 134