Skip to content
Preprint

Finding Usable Weight Mechanisms with Tiled SVD

Aug 2026 · 0 citations · 5 references
Computer Science

TL;DR

This work proposes extracting mechanism mounts directly from linear sites by column-tiled SVD: each mount is a triple read as trigger, write, and strength, and evaluates mounts with a pre-registered suite judged on full-write energy lift rather than tile-local lift.

Abstract

The dominant approach to mechanistic interpretability trains proxy dictionaries such as sparse autoencoders and labels features from max-activating text. The best such atlases identify con- cepts, but that identity lives in the learned dictionary rather than in the network weights them- selves. We propose extracting mechanism mounts directly from linear sites by column-tiled SVD: each mount is a triple (v,u,{\sigma}) read as trigger, write, and strength. Identity is the weight rule. We evaluate mounts with a pre-registered suite judged on full-write energy lift rather than tile-local lift. On Gemma-2-2B with WikiText-2 (16,384-token subsample), all seven linear maps are scored: residual writes (mlp.down, attn.o) receive full A/B/C with steer after post-sublayer RMSNorm and pass 52/52 site-layers; other maps receive A/B only (mlp.gate/attn.q/attn.k/effective mlp.up/attn.v 26/26 each). Aggregate: 182/182 GO. We release library code, the corpus builder, the experiment entrypoint, and unit tests.

View source

Similar papers

Preprint Aug 2026

The Sparsity Whisperer

A family of difference-informed pruning methods built upon this principle are introduced, suggesting that preserving output differences is a broadly useful and composable signal for post-training LLM sparsification.

Linghao Kong, Inimai Subramanian, Micah Adler et al. · 0 citations
Jul 2026

PoLoRA: A Preconditioned Orthogonalized LoRA Optimizer

PoLoRA is introduced, a Preconditioned Orthogonalized LoRA optimizer built from three ingredients: a product-aware spectral update direction, curvature preconditioning derived from controlling the per-sample loss change, and a magnitude rule that controls the sizes of both the factor and merged updates.

Nikhil Ghosh, Tetiana Parshakova, Robert M. Gower · 1 citation
Jul 2026

Scaling Interpretable Transformers with Parity Bottleneck Layers

The ParityTransformer is introduced, a GPT-2-scale architecture whose intermediate representations are efficient and wide / sparse by design, and seen as a step toward training models whose internal representations are interpretable by design rather than recovered post hoc.

Andrew Mack, K. Tou, Mark C. Henry et al. · 0 citations
Preprint Aug 2026

F-WANDA: Fisher-Reweighted Post-Training Pruning for Sustainable Deployment of Large Language Models

F-WANDA is introduced, a drop-in modification of WANDA that reallocates the per-row keep budget across output neurons in proportion to the empirical Fisher information of the pre-activation, placing F-WANDA on the Pareto frontier of quality versus pruning cost for sustainable LLM compression.

Himanshu Mishra · 0 citations
Preprint Aug 2026

Giga-Embeddings: Mixture-of-Experts Encoders for High-Throughput Text Embeddings

This work introduces Giga-Embeddings, a family of text embedding models designed to combine strong retrieval quality with efficient serving, and trains the compact model using a dimension-agnostic objective that aligns teacher and student similarity distributions.

Egor Kolodin, Egor Krasnoperov, Evgeniy Kosarev et al. · 0 citations
#artificial intelligence Preprint Sep 2026

Equivariance Breaks the Learning Rate

Block normalization generally improves Adam and closes part of its gap to Muon across molecular force prediction on the rMD17 and MD22 datasets, QM9 molecular property prediction, and charged particle dynamics.

Andrei Manolache, Mathias Niepert · 0 citations

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.