claim
active
claim:mechanistic-faithfulness-can-be-a-real-problem-even-in-very-simple-setupsMechanistic faithfulness can be a real problem even in very simple setups
Takeaway of toy experiments.
Neighborhood — ranked by edge-count
Papers (1)
paper
Findings (2)
finding
- Demonstrates unfaithfulness in a simple setup.
- Transcoders easily discover the ReLU(x)+ReLU(-x) solution by default on the absolute value problemassociated_withBaseline result before repetition.
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.
- Idea that decomposed components must causally reflect the model's computation; enforced by adversarial ablation in VPD.
- Open issue in discussion.
- Future work.
- Stakes of the problem.
- Interpretation of §3.
- Positive result with caveats.
- Graph-predicted indirect effects that do not exist in the underlying model.