A robust estimator of mutual information for deep learning interpretability
Not on the map. Why?
Abstract (arXiv)
We develop the use of mutual information (MI), a well-established metric in information theory, to interpret the inner workings of deep learning models. To accurately estimate MI from a finite number of samples, we present GMM-MI (pronounced ``Jimmie"), an algorithm based on Gaussian mixture models that can be applied to both discrete and continuous settings. GMM-MI is computationally efficient, robust to the choice of hyperparameters and provides the uncertainty on the MI estimate due to the finite sample size. We extensively validate GMM-MI on toy data for which the ground truth MI is known, comparing its performance against established mutual information estimators. We then demonstrate the use of our MI estimator in the context of representation learning, working with synthetic data and physical datasets describing highly non-linear processes. We train deep learning models to encode high-dimensional data within a meaningful compressed (latent) representation, and use GMM-MI to quantify both the level of disentanglement between the latent variables, and their association with relevant physical quantities, thus unlocking the interpretability of the latent representation. We make GMM-MI publicly available.
Key facts. Cited by 4 papers in the map (data through 14 Oct 2026). Builds on 37 of its 178 references that are in the map. First posted on arXiv 31 Oct 2022.
Builds on
37 of 178 references.
References · 37
- 2018Representation Learning with Contrastive Predictive Codingcited by 7,777
- 2016Grad-CAM: Visual Explanations from Deep Networks via Gradient-based Localizationcited by 6,733
- 2017A Unified Approach to Interpreting Model Predictionscited by 6,555
- 2016"Why Should I Trust You?": Explaining the Predictions of Any Classifiercited by 5,070
- 2015Learning Deep Features for Discriminative Localizationcited by 2,436
- 2013Deep Inside Convolutional Networks: Visualising Image Classification Models and Saliency Mapscited by 2,371
- 2013Visualizing and Understanding Convolutional Networkscited by 2,290
- 2015Variational Inference with Normalizing Flowscited by 2,170
- 2017Learning Important Features Through Propagating Activation Differencescited by 1,458
- 2018Learning deep representations by mutual information estimation and maximizationcited by 1,273
- 2014NICE: Non-linear Independent Components Estimationcited by 1,058
- 2018Challenging Common Assumptions in the Unsupervised Learning of Disentangled Representationscited by 941
25 more
- 2017Grad-CAM++: Improved Visual Explanations for Deep Convolutional Networkscited by 939
- 2016Deep Variational Information Bottleneckcited by 930
- 2016InfoGAN: Interpretable Representation Learning by Information Maximizing Generative Adversarial Netscited by 860
- 2015Deep Learning and the Information Bottleneck Principlecited by 802
- 2018MINE: Mutual Information Neural Estimationcited by 683
- 2018Disentangling by Factorisingcited by 616
- 2019On Variational Bounds of Mutual Informationcited by 559
- 2015The Variational Fair Autoencodercited by 223
- 2019Understanding the Limitations of Variational Mutual Information Estimatorscited by 140
- 2017Fader Networks: Manipulating Images by Sliding Attributescited by 118
- 2021Interpretable Deep Learning: Interpretation, Interpretability, Trustworthiness, and Beyondcited by 118
- 2018Invariant Representations without Adversarial Trainingcited by 112
- 2018Variational Discriminator Bottleneck: Improving Imitation Learning, Inverse RL, and GANs by Constraining Information Flowcited by 105
- 2017Nonlinear Information Bottleneckcited by 71
- 2015A Review of Feature Selection Methods Based on Mutual Informationcited by 67
- 2018Disentangling Factors of Variation with Cycle-Consistent Variational Auto-Encoderscited by 49
- 2014Efficient Estimation of Mutual Information for Strongly Dependent Variablescited by 46
- 2020A Survey of Deep Learning for Scientific Discoverycited by 36
- 2017Learning Independent Features with Adversarial Nets for Non-linear ICAcited by 33
- 2019Persistent Homology of Complex Networks for Dynamic State Detectioncited by 14
- 2020Effective Sample Size, Dimensionality, and Generalization in Covariate Shift Adaptationcited by 13
- 2020Machines Learn to Infer Stellar Parameters Just by Looking at a Large Number of Spectracited by 6
- 2016Filling the gaps: Gaussian mixture models from noisy, truncated or incomplete samplescited by 5
- 2022Discovering the building blocks of dark matter halo density profiles with neural networkscited by 5
- 2015Quantifying information transfer and mediation along causal pathways in complex systemscited by 4
Built on by
Citing papers per year: 2023: 2; 2024: 0; 2025: 1; 2026: 1.
4 papers.
- 2023Explaining dark matter halo density profiles with neural networkscited by 4
- 2023A representation learning approach to probe for dynamical dark energy in matter power spectracited by 1
- 2025LambdaCDM and early dark energy in latent space: a data-driven parametrization of the CMB temperature power spectrumcited by 1
- 2026Non-Stationarity Breaks Permutation Surrogates in Multi-Agent Reinforcement Learning: Diagnosis and Remediescited by 0
- 2026Non-Stationarity Breaks Permutation Surrogates in Multi-Agent Reinforcement Learning: Diagnosis and Remedies26 Apr 2026
- 2025LambdaCDM and early dark energy in latent space: a data-driven parametrization of the CMB temperature power spectrum13 Feb 2025
- 2023A representation learning approach to probe for dynamical dark energy in matter power spectra16 Oct 2023
- 2023Explaining dark matter halo density profiles with neural networks4 May 2023