Algorithmic Fairness From The Lens Of Causality And Information Theory

Published on ● Video Link: https://www.youtube.com/watch?v=ctHOhmy_8pg



Category:
Guide
Duration: 37:11
625 views
9


Sanghamitra Dutta (JP Morgan AI Research)
https://simons.berkeley.edu/talks/algorithmic-fairness-lens-causality-and-information-theory
Algorithmic Aspects of Causal Inference

When it comes to resolving legal disputes or even informing policies and interventions, only identifying bias/disparity in a model's decision is insufficient. We really need to dig deeper and understand how it arose. E.g., disparities in hiring that can be explained by an occupational necessity (code-writing skills for software engineering) may be exempt by law, but the disparity arising due to an aptitude test may not be (Ref: Griggs v. Duke Power `71). This leads us to a question that bridges the fields of fairness, explainability, and law: How can we identify and explain the sources of disparity in ML models, e.g., did the disparity entirely arise due to the critical occupational necessities? In this talk, I propose a systematic measure of "non-exempt disparity," i.e., the bias which cannot be explained by the occupational necessities. To arrive at a measure for the non-exempt disparity, I adopt a rigorous axiomatic approach that brings together concepts in information theory (in particular, an emerging body of work called Partial Information Decomposition) with causality. In the second part of the talk, I will also discuss another recent work: the quantification of accuracy-fairness trade-offs using another tool from information theory, namely Chernoff Information. Based on interest, I can spend more time on either the first or the second work.




Other Videos By Simons Institute for the Theory of Computing


2022-03-28The Limits Of Regularized Learning In Games
2022-03-25Kernel Methods For Causal Inference
2022-03-25New Approaches To Learning Nonparametric (Latent) Causal Graphical Models
2022-03-25Collaborative Causal Discovery With Atomic Interventions
2022-03-25Simple Yet Efficient Estimators For Network Causal Inference...
2022-03-25Active Invariant Causal Prediction: Experiment Selection Through Stability
2022-03-25Challenges For Causal Inference On Digital Platforms
2022-03-24The Approximate Implication Problem For Probabilistic Graphical Models
2022-03-24Opportunities for the Application of Quantitative Models in a Fully Integrated Healthcare System
2022-03-24Orthogonal Statistical Learning
2022-03-24Algorithmic Fairness From The Lens Of Causality And Information Theory
2022-03-24Multicalibration, Universal Adaptability and Causality
2022-03-24Decision-Making Under Miscalibration
2022-03-23A Multi-Group Approach To Algorithmic Fairness
2022-03-23Causalsim: Trace-Driven Simulation For Network Protocols
2022-03-23Stability Of Causal Identification From The Perspective Of Condition Numbers
2022-03-23Confounding-Robust Policy Evaluation In Infinite-Horizon Reinforcement Learning
2022-03-23Identifying Mixtures Of Bayesian Network Distributions
2022-03-23Identifying Mixture Models
2022-03-22Efficient Distance Estimation And Causal Inference For Discrete Models
2022-03-22Parameter Estimation For Undirected Graphical Models With Hard Constraints



Tags:
Simons Institute
theoretical computer science
UC Berkeley
Computer Science
Theory of Computation
Theory of Computing
Algorithmic Aspects of Causal Inference
Sanghamitra Dutta