claim
active
claim:polysemantic-neurons-are-a-major-challenge-for-the-circuits-agenda-because-n-meanings-in-one-neuron-times-m-in-another-creates-nxm-effective-connections-that-cannot-be-considered-individuallyPolysemantic neurons are a major challenge for the circuits agenda, because N meanings in one neuron times M in another creates NxM effective connections that cannot be considered individually.
Precise characterization of why polysemanticity poses a combinatorial obstacle to circuit analysis
Source paper
extracted_from(2020) · Chris Olah · Nick Cammarata · Ludwig Schubert · Gabriel Goh +2
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.
- We hypothesize that polysemantic neurons may be resolvable by unfolding networks or training to avoid polysemanticity.hypothesis0.829Forward-looking proposal for how the polysemanticity challenge to circuits research might be overcome
- Fundamental theoretical claim motivating DAS, attributed to Smolensky/Rumelhart/McClelland.
- Identified gap linking polysemanticity challenge to disentangled representations literature
- A neuron that responds to multiple unrelated inputs, posing a major challenge for circuit-level interpretation
- Counter-example disproving that architectural sparsity alone can prevent polysemanticity
- Interpretation of the cars-in-superposition circuit finding as an intentional representational strategy
- Sloman's critique of mainstream neural network theories.
- Claim from footnote 3, acknowledging neuron-level interpretability while arguing subcomponents are better.