Skip to content
Last Dictionary

parameter decomposition

nounAlso: attribution-based parameter decomposition, APD, stochastic parameter decomposition, SPD

In plain wordsAn approach that tries to understand a neural network by splitting its weights — rather than its internal activity — into many simple pieces, each responsible for one mechanism.

  1. A family of interpretability methods that decompose a network's parameters, rather than its activationsactivation, n.: The numbers a neural network computes inside itself as it processes an input — a reading of which of its artificial neurons are firing, and how strongly, at that moment., into parameter-space components, often constrained to low rank, that add up to the original weights; the decomposition favors components that are individually simple and of which only a handful are needed for any one input. The aim is to identify the network's mechanisms directly, avoiding problems of activation-based dictionary learningdictionary learning, n.: A method that learns a large vocabulary of basic patterns so that any piece of data can be described using just a few of them. In AI interpretability it builds a dictionary of a model's own concepts. such as reconstruction error, feature splittingfeature splitting, n.: What happens when a concept-finding tool is given more room: a broad concept it found before breaks into several narrower ones, much as 'animal' might split into 'dog', 'cat' and 'bird'. and the difficulty of saying how features are computed. Attribution-based parameter decomposition (APD) selects for each input the components with the highest gradient attributions and penalizes how many are needed, framed as minimizing the description length of the network's mechanisms. Stochastic parameter decomposition (SPD) replaced these attributions with learned estimates of causal importance and random masking, making the method more scalable and less sensitive to hyperparameters. Early demonstrations were on toy modelstoy model, n.: A deliberately tiny, simplified AI model trained on an artificial task, small enough for researchers to understand completely and use to test ideas about how big models work., such as recovering mechanisms of superpositionsuperposition, n.: The way a neural network squeezes more concepts into its internal activity than it has neurons, by letting them overlap — a main reason its insides are hard to read. in small networks.

    Parameter decomposition split the toy model's weights into one rank-one component per stored feature.

Origin

Introduced by Dan Braun, Lucius Bushnaq, Stefan Heimersheim, Jake Mendel and Lee Sharkey in 'Interpretability in Parameter Space: Minimizing Mechanistic Description Length with Attribution-based Parameter Decomposition' (January 2025); Lucius Bushnaq, Dan Braun and Lee Sharkey followed with 'Stochastic Parameter Decomposition' (June 2025).

Related

See also
  • dictionary learningdictionary learning, n.: A method that learns a large vocabulary of basic patterns so that any piece of data can be described using just a few of them. In AI interpretability it builds a dictionary of a model's own concepts.
  • sparse autoencodersparse autoencoder, n.: A small add-on network trained to break an AI model's tangled internal signals into a much larger set of simpler pieces, most of which can be labeled with an understandable concept.
  • superpositionsuperposition, n.: The way a neural network squeezes more concepts into its internal activity than it has neurons, by letting them overlap — a main reason its insides are hard to read.
  • toy modeltoy model, n.: A deliberately tiny, simplified AI model trained on an artificial task, small enough for researchers to understand completely and use to test ideas about how big models work.
  • mechanistic interpretabilitymechanistic interpretability, n.: A branch of AI research that tries to reverse-engineer a neural network — working out, piece by piece, which internal parts represent which concepts and how they combine to produce behavior.
  • minimum description lengthminimum description length, n.: The principle that the best explanation of some data is the one that lets you write the data down most briefly, counting both the rule and its exceptions. Good theories compress.

Sources

  1. Braun, D., Bushnaq, L., Heimersheim, S., Mendel, J. & Sharkey, L. (2025). Interpretability in Parameter Space: Minimizing Mechanistic Description Length with Attribution-based Parameter Decomposition. arXiv:2501.14926. arxiv.org/abs/2501.14926
  2. Bushnaq, L., Braun, D. & Sharkey, L. (2025). Stochastic Parameter Decomposition. arXiv:2506.20790. arxiv.org/abs/2506.20790