Testing the Fairness-Accuracy Improvability of Algorithms
<|reference_start|>Testing the Fairness-Accuracy Improvability of Algorithms: Many organizations use algorithms that have a disparate impact, i.e., the benefits or harms of the algorithm fall disproportionately on certain social groups. Addressing an algorithm's disparate impact can be challenging, however, because it is often unclear whether it is possible to reduce this impact without sacrificing other objectives of the organization, such as accuracy or profit. Establishing the improvability of algorithms with respect to multiple criteria is of both conceptual and practical interest: in many settings, disparate impact that would otherwise be prohibited under US federal law is permissible if it is necessary to achieve a legitimate business interest. The question is how a policy-maker can formally substantiate, or refute, this "necessity" defense. In this paper, we provide an econometric framework for testing the hypothesis that it is possible to improve on the fairness of an algorithm without compromising on other pre-specified objectives. Our proposed test is simple to implement and can be applied under any exogenous constraint on the algorithm space. We establish the large-sample validity and consistency of our test, and illustrate its practical application by evaluating a healthcare algorithm originally considered by Obermeyer et al. (2019). In this application, we reject the null hypothesis that it is not possible to reduce the algorithm's disparate impact without compromising the accuracy of its predictions.<|reference_end|>
@article{auerbach2024testing,
    title={Testing the Fairness-Accuracy Improvability of Algorithms},
    author={Eric Auerbach, Annie Liang, Kyohei Okumura and Max Tabord-Meehan},
    journal={arXiv preprint arXiv:2405.04816},
    year={2024},
    archivePrefix={arXiv},
    eprint={2405.04816},
    primaryClass={econ.EM cs.DS stat.AP}
}