Structural Disentanglement in Bilinear MLPs via Architectural Inductive Bias
On the map: LLM safety and security → Machine unlearning
Abstract (arXiv)
Selective unlearning and long-horizon extrapolation remain fragile in modern neural networks, even when tasks have underlying algebraic structure. In this work, we argue that these failures arise not solely from optimization or unlearning algorithms, but from how models structure their internal representations during training. We explore if having explicit multiplicative interactions as an architectural inductive bias helps in structural disentanglement, through Bilinear MLPs. We show analytically that bilinear parameterizations possess a `non-mixing' property under gradient flow conditions, where functional components separate into orthogonal subspace representations. This provides a mathematical foundation for surgical model modification. We validate this hypothesis through a series of controlled experiments spanning modular arithmetic, cyclic reasoning, Lie group dynamics, and targeted unlearning benchmarks. Unlike pointwise nonlinear networks, multiplicative architectures are able to recover true operators aligned with the underlying algebraic structure. Our results suggest that model editability and generalization are constrained by representational structure, and that architectural inductive bias plays a central role in enabling reliable unlearning.
Key facts. No citing papers in the map yet (data through 7 Oct 2026). Placed in Machine unlearning, one of 12 directions in LLM safety and security. Builds on 25 of its 27 references that are in the map. First posted on arXiv 5 Feb 2026.
Builds on
25 of 27 references.
Closest ancestors · 6
Same direction, newest first
- 2024Unlearning as multi-task optimization: A normalized gradient difference approach with an adaptive learning rate29 Oct
- 2024Dissecting Fine-Tuning Unlearning in Large Language Models9 Oct
- 2024A Survey on Machine Unlearning: Techniques and New Emerged Privacy Risks10 Jun
- 2024nabla τ: Gradient-based and Task-Agnostic machine Unlearning21 Mar
- 2023Model Sparsity Can Simplify Machine Unlearning11 Apr
- 2022A Survey of Machine Unlearning6 Sep
Other references · 19
- 2016Overcoming catastrophic forgetting in neural networkscited by 4,718
- 2020GLU Variants Improve Transformercited by 1,724
- 2019Machine Unlearningcited by 1,020
- 2023Progress measures for grokking via mechanistic interpretabilitycited by 822
- 2013Exact solutions to the nonlinear dynamics of learning in deep linear neural networkscited by 748
- 2016Language Modeling with Gated Convolutional Networkscited by 688
- 2022Grokking: Generalization Beyond Overfitting on Small Algorithmic Datasetscited by 599
- 2014On the Number of Linear Regions of Deep Neural Networkscited by 378
- 2015Bilinear CNNs for Fine-grained Visual Recognitioncited by 228
- 2020How Neural Networks Extrapolate: From Feedforward to Graph Neural Networkscited by 218
- 2023What Algorithms can Transformers Learn? A Study in Length Generalizationcited by 198
- 2023Teaching Arithmetic to Small Transformerscited by 121
7 more
- 2021Federated Unlearning via Class-Discriminative Pruningcited by 108
- 2023Grokking modular arithmeticcited by 77
- 2020Deep Polynomial Neural Networkscited by 63
- 2018Mad Max: Affine Spline Insights into Deep Learningcited by 54
- 2018Universal Approximation with Quadratic Deep Networkscited by 29
- 2024Bilinear MLPs enable weight-based mechanistic interpretabilitycited by 28
- 2016Factorized Bilinear Models for Image Recognitioncited by 13
Built on by
Not cited yet.