mlsanityData to 7 Oct 2026

IBCircuit: Towards Holistic Circuit Discovery with Information Bottleneck

arXiv 2602.22581 ↗First posted 26 Feb 2026cs.LGcited by 3

Not on the map. Why?

Abstract (arXiv)

Circuit discovery has recently attracted attention as a potential research direction to explain the non-trivial behaviors of language models. It aims to find the computational subgraphs, also known as circuits, within the model that are responsible for solving specific tasks. However, most existing studies overlook the holistic nature of these circuits and require designing specific corrupted activations for different tasks, which is inaccurate and inefficient. In this work, we propose an end-to-end approach based on the principle of Information Bottleneck, called IBCircuit, to identify informative circuits holistically. IBCircuit is an optimization framework for holistic circuit discovery and can be applied to any given task without tediously corrupted activation design. In both the Indirect Object Identification (IOI) and Greater-Than tasks, IBCircuit identifies more faithful and minimal circuits in terms of critical node components and edge components compared to recent related work.

Key facts. Cited by 3 papers in the map (data through 7 Oct 2026). Builds on 30 of its 40 references that are in the map. First posted on arXiv 26 Feb 2026.

Builds on

30 of 40 references.

References · 30

  1. 2017Attention Is All You Needcited by 59,932
  2. 2022Locating and Editing Factual Associations in GPTcited by 2,609
  3. 2022Interpretability in the Wild: a Circuit for Indirect Object Identification in GPT-2 smallcited by 1,130
  4. 2022In-context Learning and Induction Headscited by 930
  5. 2016Deep Variational Information Bottleneckcited by 915
  6. 2023Progress measures for grokking via mechanistic interpretabilitycited by 822
  7. 2023Towards Automated Circuit Discovery for Mechanistic Interpretabilitycited by 700
  8. 2024Sparse Feature Circuits: Discovering and Editing Interpretable Causal Graphs in Language Modelscited by 412
  9. 2021Causal Abstractions of Neural Networkscited by 401
  10. 2017Emergence of Invariance and Disentanglement in Deep Representationscited by 213
  11. 2023How does GPT-2 compute greater-than?: Interpreting mathematical abilities in a pre-trained language modelcited by 199
  12. 2023Localizing Model Behavior with Path Patchingcited by 182
18 more
  1. 2020Graph Information Bottleneckcited by 168
  2. 2024Have Faith in Faithfulness: Going Beyond Circuit Overlap When Finding Model Mechanismscited by 144
  3. 2016Information Dropout: Learning Optimal Representations Through Noisy Computationcited by 131
  4. 2021Causal Analysis of Syntactic Agreement Mechanisms in Neural Language Modelscited by 127
  5. 2020Graph Information Bottleneck for Subgraph Recognitioncited by 119
  6. 2020Restricting the Flow: Information Bottlenecks for Attributioncited by 110
  7. 2023Interpretability at Scale: Identifying Causal Mechanisms in Alpacacited by 102
  8. 2020Unsupervised Speech Decomposition via Triple Information Bottleneckcited by 87
  9. 2019Significance-aware Information Bottleneck for Domain Adaptive Semantic Segmentationcited by 74
  10. 2021Low-Complexity Probing via Finding Subnetworkscited by 63
  11. 2021Improving Subgraph Recognition with Variational Graph Information Bottleneckcited by 45
  12. 2024TimeX++: Learning Time-Series Explanations with Information Bottleneckcited by 32
  13. 2021Recognizing Predictive Substructures with Subgraph Information Bottleneckcited by 28
  14. 2025G-Refer: Graph Retrieval-Augmented Large Language Model for Explainable Recommendationcited by 26
  15. 2023Identifying and Adapting Transformer-Components Responsible for Gender Bias in an English Language Modelcited by 22
  16. 2021Drop-Bottleneck: Learning Discrete Compressed Representation for Noise-Robust Explorationcited by 15
  17. 2024Path-based Explanation for Knowledge Graph Completioncited by 11
  18. 2025Large Language-Geometry Model: When LLM meets Equivariancecited by 10

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2026: 3.

3 papers.