An Information-Theoretic Quantification of Discrimination with Exempt Features
Sanghamitra Dutta, Praveen Venkatesh, Piotr Mardziel, Anupam Datta, Pulkit Grover
Abstract
The needs of a business (e.g., hiring) may require the use of certain features that are critical in a way that any discrimination arising due to them should be exempted. In this work, we propose a novel information-theoretic decomposition of the total discrimination (in a counterfactual sense) into a non-exempt component, which quantifies the part of the discrimination that cannot be accounted for by the critical features, and an exempt component, which quantifies the remaining discrimination. Our decomposition enables selective removal of the non-exempt component if desired. We arrive at this decomposition through examples and counterexamples that enable us to first obtain a set of desirable properties that any measure of non-exempt discrimination should satisfy. We then demonstrate that our proposed quantification of non-exempt discrimination satisfies all of them. This decomposition leverages a body of work from information theory called Partial Information Decomposition (PID). We also obtain an impossibility result showing that no observational measure of non-exempt discrimination can satisfy all of the desired properties, which leads us to relax our goals and examine alternative observational measures that satisfy only some of these properties. We then perform a case study using one observational measure to show how one might train a model allowing for exemption of discrimination due to critical features.
Ask about this paper
Your agent reads all of it.
Lune indexed this paper to the last equation, along with the top-tier papers that cite it. Ask a question and the answer quotes them.
Cited by top-tier papers9
- Quantifying & Modeling Multimodal Interactions: An Information Decomposition FrameworkPaul Pu Liang, Yun Cheng, Xiang Fan, Chun Kai Ling et al.NeurIPS 2023 · 120 citations
- Causal Feature Selection for Algorithmic FairnessSainyam Galhotra, Karthikeyan Shanmugam, Prasanna Sattigeri, Kush R. VarshneySIGMOD 2022 · 29 citations
- Gaussian Partial Information Decomposition: Bias Correction and Application to High-dimensional DataPraveen Venkatesh, Corbett Bennett, Sam Gale, Tamina K. Ramirez et al.NeurIPS 2023 · 28 citations
- Algorithmic Decision Making with Conditional FairnessRenzhe Xu, Peng Cui, Kun Kuang, Bo Li et al.KDD 2020 · 26 citations
- Causal Context Connects Counterfactual Fairness to Robust Prediction and Group FairnessJacy Reese Anthis, Victor VeitchNeurIPS 2023 · 26 citations
Builds on2
- Algorithmic Transparency via Quantitative Input Influence: Theory and Experiments with Learning SystemsAnupam Datta, Shayak Sen, Yair ZickS&P 2016 · 774 citations
- Use Privacy in Data-Driven Systems: Theory and Experiments with Machine Learnt ProgramsAnupam Datta, Matthew Fredrikson, Gihyuk Ko, Piotr Mardziel et al.CCS 2017 · 63 citations
Related papers
- Learning Fair Naive Bayes Classifiers by Discovering and Eliminating Discrimination PatternsYooJung Choi, Golnoosh Farnadi, Behrouz Babaki, Guy Van den BroeckAAAI 2020 · 31 citations
- Reconciling Predictive and Statistical Parity: A Causal ApproachDrago Plecko, Elias BareinboimAAAI 2024 · 6 citations
- Partial Information Decomposition via Normalizing Flows in Latent Gaussian DistributionsWenyuan Zhao, Adithya Balachandran, Chao Tian, Paul Pu LiangNeurIPS 2025 · 5 citations
- Certifying Fairness of Probabilistic CircuitsNikil Roashan Selvam, Guy Van den Broeck, YooJung ChoiAAAI 2023 · 8 citations
- Information-Theoretic Testing and Debugging of Fairness Defects in Deep Neural NetworksVerya Monjezi, Ashutosh Trivedi, Gang Tan, Saeid Tizpaz-NiariICSE 2023 · 47 citations
