PolySAE: Modeling Feature Interactions in Sparse Autoencoders via Polynomial Decoding
Not on the map. Why?
Abstract (arXiv)
Sparse autoencoders (SAEs) interpret neural network representations by decomposing activations into sparse combinations of dictionary atoms. However, SAEs assume features combine additively through linear reconstruction, an assumption that cannot capture compositional structure: linear models cannot distinguish whether ''Starbucks'' arises from the composition of ''star'' and ''coffee'' features or merely their co-occurrence. This forces SAEs to allocate monolithic features for compound concepts rather than decomposing them into interpretable constituents. We introduce PolySAE, which extends the SAE decoder with higher-order terms to model feature interactions while preserving the linear encoder essential for interpretability. Through low-rank tensor factorization on a shared projection subspace, PolySAE captures pairwise and triple feature interactions with small parameter overhead (3% on GPT2). Across four language models and three SAE variants, PolySAE achieves an average improvement of ~8% in probing F1 while maintaining comparable reconstruction error, and produces 2--10× larger Wasserstein distances between class-conditional feature distributions. Critically, learned interaction weights exhibit negligible correlation with co-occurrence frequency (r = 0.06 vs r = 0.82 for SAE feature covariance), suggesting that polynomial terms capture compositional structure largely independent of surface statistics. Finally, the learned interaction directions causally steer model outputs toward the corresponding compositional semantics.
Key facts. Cited by 3 papers in the map (data through 7 Oct 2026). Builds on 45 of its 82 references that are in the map. First posted on arXiv 1 Feb 2026.
Builds on
45 of 82 references.
References · 45
- 2022Locating and Editing Factual Associations in GPTcited by 2,609
- 2020The Pile: An 800GB Dataset of Diverse Text for Language Modelingcited by 2,346
- 2015Character-level Convolutional Networks for Text Classificationcited by 2,293
- 2017FiLM: Visual Reasoning with a General Conditioning Layercited by 2,286
- 2024Gemma 2: Improving Open Language Models at a Practical Sizecited by 1,928
- 2023Pythia: A Suite for Analyzing Large Language Models Across Training and Scalingcited by 1,734
- 2020GLU Variants Improve Transformercited by 1,724
- 2016Concrete Problems in AI Safetycited by 1,582
- 2023Sparse Autoencoders Find Highly Interpretable Features in Language Modelscited by 1,359
- 2016Understanding intermediate layers using linear classifier probescited by 1,279
- 2023Steering Llama 2 via Contrastive Activation Additioncited by 1,009
- 2022Toy Models of Superpositioncited by 928
33 more
- 2021Probing Classifiers: Promises, Shortcomings, and Advancescited by 831
- 2023The Geometry of Truth: Emergent Linear Structure in Large Language Model Representations of True/False Datasetscited by 673
- 2024Scaling and evaluating sparse autoencoderscited by 530
- 2024Mechanistic Interpretability for AI Safety -- A Reviewcited by 415
- 2019Bias in Bios: A Case Study of Semantic Representation Bias in a High-Stakes Settingcited by 346
- 2016A Learned Representation For Artistic Stylecited by 340
- 2021Unsolved Problems in ML Safetycited by 291
- 2024Jumping Ahead: Improving Reconstruction Fidelity with JumpReLU Sparse Autoencoderscited by 283
- 2024Not All Language Model Features Are One-Dimensionally Linearcited by 201
- 2025AxBench: Steering LLMs? Even Simple Baselines Outperform Sparse Autoencoderscited by 199
- 2024Transcoders Find Interpretable LLM Feature Circuitscited by 186
- 2024Improving Dictionary Learning with Gated Sparse Autoencoderscited by 171
- 2025Learning Multi-Level Features with Matryoshka Sparse Autoencoderscited by 136
- 2024BatchTopK Sparse Autoencoderscited by 126
- 2015Compact Bilinear Poolingcited by 97
- 2021Leveraging Sparse Linear Layers for Debuggable Deep Networkscited by 82
- 2025International AI Safety Reportcited by 64
- 2020Deep Polynomial Neural Networkscited by 63
- 2016Higher-Order Factorization Machinescited by 45
- 2024Recurrent Neural Networks Learn to Store and Generate Sequences using Non-Linear Representationscited by 45
- 2020Pi-nets: Deep Polynomial Neural Networkscited by 39
- 2015Simple, Efficient, and Neural Algorithms for Sparse Codingcited by 37
- 2024Bilinear MLPs enable weight-based mechanistic interpretabilitycited by 28
- 2021Augmenting Deep Classifiers with Polynomial Neural Networkscited by 21
- 2014Zero-bias autoencoders and the benefits of co-adapting featurescited by 15
- 2025Beyond Linear Probes: Dynamic Safety Monitoring for Language Modelscited by 14
- 2021CoPE: Conditional image generation using Polynomial Expansionscited by 12
- 2025Hadamard product in deep learning: Introduction, Advances and Challengescited by 9
- 2019Encrypted Speech Recognition using Deep Polynomial Networkscited by 8
- 2025Compositionality Unlocks Deep Interpretable Modelscited by 6
- 2021Poly-NL: Linear Complexity Non-local Layers with Polynomialscited by 5
- 2025Towards Interpretability Without Sacrifice: Faithful Dense Layer Decomposition with Mixture of Decoderscited by 5
- 2025Finding Manifolds With Bilinear Autoencoderscited by 5
Built on by
Citing papers per year: 2026: 3.
3 papers.
- 2026Size Doesn't Matter: Cosine-Scored Sparse Autoencoders13 Jun 2026
- 2026WriteSAE: Sparse Autoencoders for Recurrent State12 May 2026
- 2026fmxcoders: Factorized Masked Crosscoders for Cross-Layer Feature Discovery10 May 2026