mlsanityData to 7 Oct 2026

Can Information Flows Suggest Targets for Interventions in Neural Circuits?

arXiv 2111.05299 ↗First posted 9 Nov 2021cs.IT cs.AI cs.LGcited by 6

Not on the map. Why?

Abstract (arXiv)

Motivated by neuroscientific and clinical applications, we empirically examine whether observational measures of information flow can suggest interventions. We do so by performing experiments on artificial neural networks in the context of fairness in machine learning, where the goal is to induce fairness in the system through interventions. Using our recently developed M-information flow framework, we measure the flow of information about the true label (responsible for accuracy, and hence desirable), and separately, the flow of information about a protected attribute (responsible for bias, and hence undesirable) on the edges of a trained neural network. We then compare the flow magnitudes against the effect of intervening on those edges by pruning. We show that pruning edges that carry larger information flows about the protected attribute reduces bias at the output to a greater extent. This demonstrates that M-information flow can meaningfully suggest targets for interventions, answering the title's question in the affirmative. We also evaluate bias-accuracy tradeoffs for different intervention strategies, to analyze how one might use estimates of desirable and undesirable information flows (here, accuracy and bias flows) to inform interventions that preserve the former while reducing the latter.

Key facts. Cited by 6 papers in the map (data through 7 Oct 2026). Builds on 23 of its 93 references that are in the map. First posted on arXiv 9 Nov 2021.

Builds on

23 of 93 references.

References · 23

  1. 2019PyTorch: An Imperative Style, High-Performance Deep Learning Librarycited by 20,160
  2. 2017Axiomatic Attribution for Deep Networkscited by 3,350
  3. 2018The Lottery Ticket Hypothesis: Finding Sparse, Trainable Neural Networkscited by 2,250
  4. 2016Equality of Opportunity in Supervised Learningcited by 2,000
  5. 2017Understanding Black-box Predictions via Influence Functionscited by 1,714
  6. 2018MINE: Mutual Information Neural Estimationcited by 680
  7. 2018A Reductions Approach to Fair Classificationcited by 585
  8. 2017Real Time Image Saliency for Black Box Classifierscited by 246
  9. 2020Evaluating and Aggregating Feature-based Model Explanationscited by 185
  10. 2019Inherent Tradeoffs in Learning Fair Representationscited by 144
  11. 2018Why Is My Classifier Discriminatory?cited by 143
  12. 2018Achieving Fairness through Adversarial Learning: an Application to Recidivism Predictioncited by 77
11 more
  1. 2019Recovering from Biased Data: Can Fairness Constraints Improve Accuracy?cited by 50
  2. 2019Repairing without Retraining: Avoiding Disparate Impact with Counterfactual Distributionscited by 48
  3. 2019CCMI : Classifier based Conditional Mutual Information Estimationcited by 37
  4. 2017Estimating Mutual Information for Discrete-Continuous Mixturescited by 34
  5. 2021Large-scale neural recordings call for new insights to link brain and behaviorcited by 28
  6. 2018Fairness in Supervised Learning: An Information Theoretic Approachcited by 17
  7. 2020Fairness Under Feature Exemptions: Counterfactual and Observational Measurescited by 15
  8. 2020To Split or Not to Split: The Impact of Disparate Treatment in Classificationcited by 14
  9. 2020C-MI-GAN : Estimation of Conditional Mutual Information using MinMax formulationcited by 10
  10. 2020FACT: A Diagnostic for Group Fairness Trade-offscited by 4
  11. 2019Information Flow in Computational Systemscited by 2

Built on by

Cited by year

Citing papers per year: 2022: 1; 2023: 2; 2024: 2; 2025: 1.

6 papers.