finding
active
finding:a-pair-of-query-and-key-subcomponents-distributed-across-attention-heads-performs-syntax-boundary-routingA pair of query and key subcomponents distributed across attention heads performs syntax-boundary routing
VPD recovers an attention algorithm for routing across syntactic boundaries, distributed across heads.
Source paper
extracted_fromNeighborhood — ranked by edge-count
Claims (1)
claim
- Claim supported by VPD's recovery of cross-head attention subcomponents, noted in footnote.
Communities (4)
community
- Spans attention head decomposition, benchmark awareness, and genomic pathogenicity prediction via neural models.
- Identifies distributed algorithms implemented across attention heads, with focus on causal masking limitations and emergent capabilities via activation manifold steering.
- Distributed attention head decompositionmembers_ofMechanistic interpretability approach decomposing attention heads into query/key subcomponents with distinct algorithmic roles
- Studies how query, key, and value components decompose into specialized subfunctions across heads, enabling routing and token prediction behaviors.
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.
- An attention algorithm recovered by VPD that routes information across syntactic boundaries.
- A pair of query and key subcomponents distributed across attention heads performs previous-token behaviorfinding0.831VPD recovers an attention algorithm for attending to the previous token, distributed across multiple heads.
- Attention computations distribute across heads via parameter subcomponents with interpretable rolesfinding0.798Mechanistic discovery about how attention mechanisms decompose into interpretable parameter components.
- Identification of algorithms implemented in attention layers, distributed across attention headsfinding0.784VPD successfully recovered interpretable attention algorithms (previous-token behavior, syntax-boundary routing) in weight space without requiring manual decomposition across heads.
- Mechanism by which attention heads detect injected perturbations and route information about them to the final token position
- Interesting special case of copying behavior related to tokenization artifacts; primitive precursor to induction heads
- Design hypothesis that coarse-grained task switching (at commands only) eliminates need for protection mechanisms while maintaining usability.
- Janus's interpretive model for how attention mechanisms enable deliberate information flow and selective routing.