flâneur — a map of the web's best reading

Towards Scalable Parameter Decomposition

goodfire.ai · 1,892 words · saved by 1 readers

The most successful methods so far, like SAEs, have focused largely on the activations that flow through a model, rather than directly inspecting the weights that transform and guide the inputs into those flows. It's a bit like trying to understand a program by only looking at its runtime variables, but never its source code. Parameter decomposition offers a way to decompose a model’s parameters—the 'source code'—into components that reveal not only what the network computes, but how it computes it. Today, we're releasing a paper on Stochastic Parameter Decomposition (SPD), which removes key barriers to the scalability of prior methods.

Towards Scalable Parameter Decomposition Research Towards Scalable Parameter Decomposition Authors Lucius Bushnaq *† Dan Braun *† Lee Sharkey ‡ * Co-first Author † Goodfire – Work primarily carried out while at Apollo Research ‡ Goodfire Correspondence to lucius@goodfire.ai Blog post by Michael Byun Published June 27, 2025 Full Paper Read on arXiv → Like a game of Jenga, SPD finds parameter components that can be removed while keeping the model's behavior stable. "Jenga" by Sheila Sund, licensed under CC BY 2.0 . In 2013, researchers discovered that word2vec embeddings encoded analogies in the

Explore this link on the map →

related reading