Skill Path: Unveiling Language Skills from Circuit Graphs
Not on the map. Why?
Abstract (arXiv)
Circuit graph discovery has emerged as a fundamental approach to elucidating the skill mechanistic of language models. Despite the output faithfulness of circuit graphs, they suffer from atomic ablation, which causes the loss of causal dependencies between connected components. In addition, their discovery process, designed to preserve output faithfulness, inadvertently captures extraneous effects other than an isolated target skill. To alleviate these challenges, we introduce skill paths, which offers a more refined and compact representation by isolating individual skills within a linear chain of components. To enable skill path extracting from circuit graphs, we propose a three-step framework, consisting of decomposition, pruning, and post-pruning causal mediation. In particular, we offer a complete linear decomposition of the transformer model which leads to a disentangled computation graph. After pruning, we further adopt causal analysis techniques, including counterfactuals and interventions, to extract the final skill paths from the circuit graph. To underscore the significance of skill paths, we investigate three generic language skills-Previous Token Skill, Induction Skill, and In-Context Learning Skill-using our framework. Experiments support two crucial properties of these skills, namely stratification and inclusiveness.
Key facts. Cited by 1 paper in the map (data through 7 Oct 2026). Builds on 16 of its 27 references that are in the map. First posted on arXiv 2 Oct 2024.
Builds on
16 of 27 references.
References · 16
- 2022Beyond the Imitation Game: Quantifying and extrapolating the capabilities of language modelscited by 1,970
- 2020Transformer Feed-Forward Layers Are Key-Value Memoriescited by 1,307
- 2022Interpretability in the Wild: a Circuit for Indirect Object Identification in GPT-2 smallcited by 1,130
- 2023Towards Automated Circuit Discovery for Mechanistic Interpretabilitycited by 700
- 2023How does GPT-2 compute greater-than?: Interpreting mathematical abilities in a pre-trained language modelcited by 199
- 2023Attribution Patching Outperforms Automated Circuit Discoverycited by 196
- 2024How to use and interpret activation patchingcited by 191
- 2024The Evolution of Statistical Induction Heads: In-Context Learning Markov Chainscited by 115
- 2023A Theory for Emergence of Complex Skills in Language Modelscited by 111
- 2023Tracr: Compiled Transformers as a Laboratory for Interpretabilitycited by 99
- 2024Knowledge Circuits in Pretrained Transformerscited by 60
- 2024Finding Transformer Circuits with Edge Pruningcited by 58
4 more
- 2024Identifying Semantic Induction Heads to Understand In-Context Learningcited by 46
- 2024Induction Heads as an Essential Mechanism for Pattern Matching in In-context Learningcited by 46
- 2024Missed Causes and Ambiguous Effects: Counterfactuals Pose Challenges for Interpreting Neural Networkscited by 21
- 2023Discovering Knowledge-Critical Subnetworks in Pretrained Language Modelscited by 16
Built on by
Citing papers per year: 2026: 1.
1 paper.