claim
active
claim:vpd-achieves-a-better-sparsity-reconstruction-tradeoff-than-transcodersVPD achieves a better sparsity-reconstruction tradeoff than transcoders.
Quantitative advantage claimed for VPD over a prior activation-decomposition method.
Source paper
extracted_from(2026) · Bushnaq, Lucius · Braun, Dan · Clive-Griffin, Oliver · Bussmann, Bart +4
Neighborhood — ranked by edge-count
Concepts (1)
concept
- The balance between how sparse and how faithful a decomposition is; VPD achieves a better tradeoff than transcoders.
Methods (1)
method
- TranscoderscitesDecomposition method for activations; VPD is compared against transcoders in sparsity-reconstruction tradeoff.
Related by similarity (8)
cosine ≥ 0.65 · no typed edgeEntities in the same semantic neighborhood but without a typed relation to this one — candidates for new edges or unrecognized duplicates.
- Empirical result demonstrating VPD's efficiency advantage in parameter decomposition.
- Assertion about the qualitative advantages of VPD's rank-one decomposition.
- Positioning of VPD as advancing the paradigm of explaining computation in the model's terms.
- Core proposition of the paper: a substrate-level critique of existing interpretability methods.
- The VPD-based edit has similarly low off-target effects as uninterpretable fine-tuning methodsfinding0.755Performance comparison showing subcomponent editing is comparable to fine-tuning in preserving off-target behavior.
- Applied capability claim: VPD enables surgical changes to model behaviour at the parameter level.
- Key quote connecting path redundancy to interferometric information encoding.
- The ability to make precise edits demonstrates that VPD identifies real computational machineryclaim0.745Claim that editing success validates VPD's decomposition.