paper-with-me

Papers

Weight-based Decomposition: A Case for Bilinear MLPs

2024-06-06 · Michael T. Pearce, Thomas Dooms, Alice Rigg

Gated Linear Units (GLUs) have become a common building block in modern foundation models. Bilinear layers drop the non-linearity in the "gate" but still have comparable performance to other GLUs. An attractive quality of bilinear layers is that they can be fully expressed in terms of a third-order tensor and linear operations. Leveraging this, we develop a method to decompose the bilinear tensor into a set of sparsely interacting eigenvectors that show promising interpretability properties in preliminary experiments for shallow image classifiers (MNIST) and small language models (Tiny Stories). Since the decomposition is fully equivalent to the model's original computations, bilinear layers may be an interpretability-friendly architecture that helps connect features to the model weights. Application of our method may not be limited to pretrained bilinear models since we find that language models such as TinyLlama-1.1B can be finetuned into bilinear variants.

📄 PDF Abstract BibTeX arXiv:2406.03947

Code (1)

tdooms/bilinear-decomposition 공식 구현 jax

Methods 이 논문이 사용한 방법론

SET Dynamic Sparse Training method where weight mask is updated randomly periodically

Similar Papers 제목 키워드 기반

Bilinear MLPs enable weight-based mechanistic interpretability

2024-10-10 · Michael T. Pearce, Thomas Dooms, Alice Rigg, Jose M. Oramas 외

A mechanistic understanding of how MLPs do computation in deep neural networks remains elusive. Current interpretability work can extract features from hidden activations over an input dataset but generally cannot explai…

image-classificationImage ClassificationLanguage ModelingLanguage Modelling+1

Mechanistic Insights into Grokking from the Embedding Layer

2025-05-21 · H. V. AlquBoj, Hilal AlQuabeh, Velibor Bojkovic, Munachiso Nwadike 외

Grokking, a delayed generalization in neural networks after perfect training performance, has been observed in Transformers and MLPs, but the components driving it remain underexplored. We show that embeddings are centra…

Gated MLPs as Symmetry-Broken Rank-1 Bilinear Attention

2026-06-20 · Nathan Breslow arxiv

We show that the conventional gated MLP can be viewed as a rank-1 approximation to a bilinear attention mechanism with two distinct factors corresponding to the query and the key. We further show that moving the nonlinea…

Bilinear Convolution Decomposition for Causal RL Interpretability

2024-12-01 · Narmeen Oozeer, Sinem Erisken, Alice Rigg

Efforts to interpret reinforcement learning (RL) models often rely on high-level techniques such as attribution or probing, which provide only correlational insights and coarse causal control. This work proposes replacin…

reinforcement-learningReinforcement LearningReinforcement Learning (RL)

A technical note on bilinear layers for interpretability

2023-05-05 · Lee Sharkey

The ability of neural networks to represent more features than neurons makes interpreting them challenging. This phenomenon, known as superposition, has spurred efforts to find architectures that are more interpretable t…