Covered Information Disentanglement: Model Transparency via Unbiased Permutation Importance
Not on the map. Why?
Abstract (arXiv)
Model transparency is a prerequisite in many domains and an increasingly popular area in machine learning research. In the medical domain, for instance, unveiling the mechanisms behind a disease often has higher priority than the diagnostic itself since it might dictate or guide potential treatments and research directions. One of the most popular approaches to explain model global predictions is the permutation importance where the performance on permuted data is benchmarked against the baseline. However, this method and other related approaches will undervalue the importance of a feature in the presence of covariates since these cover part of its provided information. To address this issue, we propose Covered Information Disentanglement (CID), a method that considers all feature information overlap to correct the values provided by permutation importance. We further show how to compute CID efficiently when coupled with Markov random fields. We demonstrate its efficacy in adjusting permutation importance first on a controlled toy dataset and discuss its effect on real-world medical data.
Key facts. Cited by 2 papers in the map (data through 7 Oct 2026). Builds on 7 of its 35 references that are in the map. First posted on arXiv 18 Nov 2021.
Builds on
7 of 35 references.
References · 7
- 2017A Unified Approach to Interpreting Model Predictionscited by 6,488
- 2016"Why Should I Trust You?": Explaining the Predictions of Any Classifiercited by 5,040
- 2020Problems with Shapley-value-based explanations as feature importance measurescited by 198
- 2018Local Rule-Based Explanations of Black Box Decision Systemscited by 165
- 2016Programs as Black-Box Explanationscited by 5
- 2017The Partial Entropy Decomposition: Decomposing multivariate entropy and mutual information via pointwise common surprisalcited by 5
- 2019Graph Space Embeddingcited by 2
Built on by
Citing papers per year: 2024: 1; 2025: 0; 2026: 1.
2 papers.