License: Creative Commons Attribution 4.0 International license (CC BY 4.0)
When quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.ITCS.2023.41
URN: urn:nbn:de:0030-drops-175449
URL: http://dagstuhl.sunsite.rwth-aachen.de/volltexte/2023/17544/
Deng, Zhun ;
Dwork, Cynthia ;
Zhang, Linjun
HappyMap : A Generalized Multicalibration Method
Abstract
Multicalibration is a powerful and evolving concept originating in the field of algorithmic fairness. For a predictor f that estimates the outcome y given covariates x, and for a function class C, multi-calibration requires that the predictor f(x) and outcome y are indistinguishable under the class of auditors in C. Fairness is captured by incorporating demographic subgroups into the class of functions C. Recent work has shown that, by enriching the class C to incorporate appropriate propensity re-weighting functions, multi-calibration also yields target-independent learning, wherein a model trained on a source domain performs well on unseen, future, target domains {(approximately) captured by the re-weightings.}
Formally, multicalibration with respect to C bounds |?_{(x,y)∼D}[c(f(x),x)⋅(f(x)-y)]| for all c ∈ C. In this work, we view the term (f(x)-y) as just one specific mapping, and explore the power of an enriched class of mappings. We propose s-Happy Multicalibration, a generalization of multi-calibration, which yields a wide range of new applications, including a new fairness notion for uncertainty quantification, a novel technique for conformal prediction under covariate shift, and a different approach to analyzing missing data, while also yielding a unified understanding of several existing seemingly disparate algorithmic fairness notions and target-independent learning approaches.
We give a single HappyMap meta-algorithm that captures all these results, together with a sufficiency condition for its success.
BibTeX - Entry
@InProceedings{deng_et_al:LIPIcs.ITCS.2023.41,
author = {Deng, Zhun and Dwork, Cynthia and Zhang, Linjun},
title = {{HappyMap : A Generalized Multicalibration Method}},
booktitle = {14th Innovations in Theoretical Computer Science Conference (ITCS 2023)},
pages = {41:1--41:23},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-263-1},
ISSN = {1868-8969},
year = {2023},
volume = {251},
editor = {Tauman Kalai, Yael},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/opus/volltexte/2023/17544},
URN = {urn:nbn:de:0030-drops-175449},
doi = {10.4230/LIPIcs.ITCS.2023.41},
annote = {Keywords: algorithmic fairness, target-independent learning, transfer learning}
}
Keywords: |
|
algorithmic fairness, target-independent learning, transfer learning |
Collection: |
|
14th Innovations in Theoretical Computer Science Conference (ITCS 2023) |
Issue Date: |
|
2023 |
Date of publication: |
|
01.02.2023 |