hypothesis
active
hypothesis:language-models-contain-interpretable-computational-structure-encoded-in-their-parameter-weights-not-irreducibly-impenetrable-complexity

Language models contain interpretable computational structure encoded in their parameter weights, not irreducibly impenetrable complexity

Core empirical hypothesis of the paper, supported by successful VPD decomposition yielding ~10,000 interpretable subcomponents across 24 weight matrices.

Source paper

extracted_from
cimcWhitepaper

Neighborhood — ranked by edge-count

Findings (2)

finding

Related by similarity (8)

cosine ≥ 0.65 · no typed edge

Entities in the same semantic neighborhood but without a typed relation to this one — candidates for new edges or unrecognized duplicates.