concept
active
concept:strong-abstractionStrong τ-Abstraction
Notion where all interventions on algorithm A are allowed; gives equivalence between algorithm and DNN
Neighborhood — ranked by edge-count
Concepts (1)
concept
- Constructive AbstractionextendsType of abstraction map where node information is computed from non-overlapping neuron sets
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.
- A distinguished key used in α1 to identify an object's type as the starting point for lookup.
- Question prompting the use of Category for linear transformations.
- Combining α1 with τ (type) and β1 with σ (supertype) to model class-based OO with inheritance in the associative model.
- A framework the paper uses alongside feature geometry to deepen mechanistic understanding of LMs
- Programming technique to restructure a fine-grained Linda program for efficiency by replacing live data structures with passive ones and coarser-grain processes.
- Property of conscious representations: they do not contain information about the fact that they are representations at the level of the representation itself
- Interpretation of weaker PCA separation and lower ASR in smaller models
- Output of alignment map ϕ applied to DNN hidden states; basis for distributed causal abstraction