claim
active
claim:mechanistic-unfaithfulness-attacks-one-of-the-deepest-hopes-of-mech-interp-explanations-we-can-deeply-trustMechanistic unfaithfulness attacks one of the deepest hopes of mech interp: explanations we can deeply trust
Stakes of the problem.
Neighborhood — ranked by edge-count
Papers (1)
paper
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.
- Authors' prioritization.
- Graph-predicted indirect effects that do not exist in the underlying model.
- Takeaway of toy experiments.
- Interpretation of §3.
- Unfaithful CoTs are longer.
- Future work.
- Declares that traditional functional reasoning is ultimately arbitrary and groundless.
- Idea that decomposed components must causally reflect the model's computation; enforced by adversarial ablation in VPD.