From Token Lists to Graph Motifs: Weisfeiler-Lehman Analysis of Sparse Autoencoder Features
Researchers introduce a novel graph-based analysis method for sparse autoencoders (SAEs) in transformer models, using Weisfeiler-Lehman graph kernels to examine token co-occurrence patterns in SAE features. Applied to GPT-2 Small, this approach identifies structural motif families that traditional decoder weight analysis misses, revealing complementary insights into how neural networks organize semantic information.