Mechanistic interpretability: a first paper on disentangling a convolutional neuron [R]
Summary
This paper introduces a technique to disentangle a single convolutional neuron in Inceptionv1 by analyzing Hadamard products, revealing clean monosemantic clusters (cars, cats, dogs) and also low-valued clusters (letters, faces) with distributed weights as evidence of gradient descent behavior.
Similar Articles
@TamazGadaev: day 10/n (series on fundamental texts for AI researchers - not specific papers so much as pieces that hand you a lens f…
Toy Models of Superposition by Elhage et al. explains why interpretability is hard: models represent more features than dimensions via superposition, leading to polysemantic neurons as compression. This paper spawned the sparse autoencoder research program.
Understanding neural networks through sparse circuits
OpenAI researchers present methods for training sparse neural networks that are easier to interpret by forcing most weights to zero, enabling the discovery of small, disentangled circuits that can explain model behavior while maintaining performance. This work aims to advance mechanistic interpretability as a complement to post-hoc analysis of dense networks and support AI safety goals.
A Geometric View for Understanding Concept Learning and Neuron Interpretation in Sparse Autoencoders
This paper proposes a unified geometric framework for understanding concept learning and neuron interpretation in sparse autoencoders, formalizing concepts as sets and defining detection, separation, and approximation. It provides error bounds, capacity constraints, and links to formal concept analysis, with experiments on synthetic data.
Deep Dreams Are Made of This: Visualizing Monosemantic Features in Diffusion Models
This paper introduces Latent Visualization by Optimization (LVO), a mechanistic interpretability technique that uses sparse autoencoders to visualize monosemantic features in diffusion models like Stable Diffusion 1.5.
Targeted Recovery of Weight-Space Mechanisms From Neural Networks
This paper introduces Targeted Parameter Decomposition (tPD), a method that selectively recovers interpretable weight-space mechanisms from neural networks for specific inputs, reducing compute requirements compared to full decomposition. It validates tPD on toy models and transformer language models, demonstrating faithful circuit recovery and surgical ablation with minimal side effects.