December 2022 Optimization hierarchy for fair statistical decision problems
Anil Aswani, Matt Olfat
Author Affiliations +
Ann. Statist. 50(6): 3144-3173 (December 2022). DOI: 10.1214/22-AOS2217

Abstract

Data-driven decision making has drawn scrutiny from policy makers due to fears of potential discrimination, and a growing literature has begun to develop fair statistical techniques. However, these techniques are often specialized to one model context and based on ad hoc arguments, which makes it difficult to perform theoretical analysis. This paper develops an optimization hierarchy, which is a sequence of optimization problems with an increasing number of constraints, for fair statistical decision problems. Because our hierarchy is based on the framework of statistical decision problems, this means it provides a systematic approach for developing and studying fair versions of hypothesis testing, decision making, estimation, regression, and classification. We use the insight that qualitative definitions of fairness are equivalent to statistical independence between the output of a statistical technique and a random variable that measures attributes for which fairness is desired. We use this insight to construct an optimization hierarchy that lends itself to numerical computation, and we use tools from variational analysis and random set theory to prove that higher levels of this hierarchy lead to consistency in the sense that it asymptotically imposes this independence as a constraint in corresponding statistical decision problems. We demonstrate numerical effectiveness of our hierarchy using several data sets, and we use our hierarchy to fairly perform automated dosing of morphine.

Funding Statement

This material is based upon work supported by the NSF under Grant CMMI-1847666, and by the UC Berkeley Center for Long-Term Cybersecurity.

Citation

Download Citation

Anil Aswani. Matt Olfat. "Optimization hierarchy for fair statistical decision problems." Ann. Statist. 50 (6) 3144 - 3173, December 2022. https://doi.org/10.1214/22-AOS2217

Information

Received: 1 November 2019; Revised: 1 July 2022; Published: December 2022
First available in Project Euclid: 21 December 2022

MathSciNet: MR4524492
zbMATH: 07641121
Digital Object Identifier: 10.1214/22-AOS2217

Subjects:
Primary: 62C12 , 62F12
Secondary: 49J53 , 60D05

Keywords: fairness , independence , optimization , Statistical learning

Rights: Copyright © 2022 Institute of Mathematical Statistics

JOURNAL ARTICLE
30 PAGES

This article is only available to subscribers.
It is not available for individual sale.
+ SAVE TO MY LIBRARY

Vol.50 • No. 6 • December 2022
Back to Top