Disentangling Influence: Using Disentangled Representations to Audit Model Predictions
Not on the map. Why?
Abstract (arXiv)
Motivated by the need to audit complex and black box models, there has been extensive research on quantifying how data features influence model predictions. Feature influence can be direct (a direct influence on model outcomes) and indirect (model outcomes are influenced via proxy features). Feature influence can also be expressed in aggregate over the training or test data or locally with respect to a single point. Current research has typically focused on one of each of these dimensions. In this paper, we develop disentangled influence audits, a procedure to audit the indirect influence of features. Specifically, we show that disentangled representations provide a mechanism to identify proxy features in the dataset, while allowing an explicit computation of feature influence on either individual outcomes or aggregate-level outcomes. We show through both theory and experiments that disentangled influence audits can both detect proxy features and show, for each individual or in aggregate, which of these proxy features affects the classifier being audited the most. In this respect, our method is more powerful than existing methods for ascertaining feature influence.
Key facts. Cited by 11 papers in the map (data through 7 Oct 2026). First posted on arXiv 20 Jun 2019.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2021: 6; 2022: 2; 2023: 2; 2024: 1.
11 papers.
- 2021Learning Disentangled Representations in the Imaging Domaincited by 46
- 2021DISSECT: Disentangled Simultaneous Explanations via Concept Traversalscited by 37
- 2022Marrying Fairness and Explainability in Supervised Learningcited by 23
- 2021Honest-but-Curious Nets: Sensitive Attributes of Private Inputs Can Be Secretly Coded into the Classifiers' Outputscited by 18
- 2021Benchmarks, Algorithms, and Metrics for Hierarchical Disentanglementcited by 12
- 2023How Many and Which Training Points Would Need to be Removed to Flip this Prediction?cited by 10
- 2024Feature Responsiveness Scores: Model-Agnostic Explanations for Recoursecited by 8
- 2023Relabeling Minimal Training Subset to Flip a Predictioncited by 3
- 2021Fair Representation Learning using Interpolation Enabled Disentanglementcited by 1
- 2021Weakly Supervised Recovery of Semantic Attributescited by 0
- 2022Decomposing Counterfactual Explanations for Consequential Decision Makingcited by 0
- 2024Feature Responsiveness Scores: Model-Agnostic Explanations for Recourse29 Oct 2024
- 2023Relabeling Minimal Training Subset to Flip a Prediction22 May 2023
- 2023How Many and Which Training Points Would Need to be Removed to Flip this Prediction?4 Feb 2023
- 2022Decomposing Counterfactual Explanations for Consequential Decision Making3 Nov 2022
- 2022Marrying Fairness and Explainability in Supervised Learning6 Apr 2022
- 2021Learning Disentangled Representations in the Imaging Domain26 Aug 2021
- 2021Fair Representation Learning using Interpolation Enabled Disentanglement31 Jul 2021
- 2021DISSECT: Disentangled Simultaneous Explanations via Concept Traversals31 May 2021
- 2021Honest-but-Curious Nets: Sensitive Attributes of Private Inputs Can Be Secretly Coded into the Classifiers' Outputs25 May 2021
- 2021Weakly Supervised Recovery of Semantic Attributes22 Mar 2021
- 2021Benchmarks, Algorithms, and Metrics for Hierarchical Disentanglement9 Feb 2021