Learning with Multi-Group Guarantees for Clusterable Subpopulations

Authors: Jessica Dai, Nika Haghtalab, Eric Zhao
Primary area: learning theory
Keywords: multicalibration, fairness, clustering

Abstract:
A canonical desideratum for prediction problems is that performance guarantees should hold not just on average over the population, but also for meaningful subpopulations within the overall population. 
But what constitutes a meaningful subpopulation?
In this work, we take the perspective that relevant subpopulations should be defined with respect to the clusters that naturally emerge from the distribution of individuals for which predictions are being made. 
In this perspective, a population refers to a mixture model whose components constitute the relevant subpopulations.
We suggest two formalisms for capturing per-subgroup guarantees: first, by attributing each individual to the component from which they were most likely drawn, given their features; and second, by attributing each individual to all components in proportion to their relative likelihood of having been drawn from each component.
Using online calibration for Gaussian mixture models as a case study, we study a multi-objective algorithm that provides guarantees for each of these formalisms by handling all plausible underlying subpopulation structures simultaneously, and achieve a $O(T^{1/2})$ rate even when the subpopulations are not well-separated.
In comparison, the more natural _cluster-then-predict_ approach that first recovers the structure of the subpopulations and then makes predictions suffers from a $O(T^{2/3})$ rate and requires the subpopulations to be separable.
Along the way, we prove that providing per-subgroup calibration guarantees for underlying clusters can be easier than learning the clusters: separation between median subgroup features is required for the latter but not the former.

Decision: desk rejected
Reviewer scores: 0

Reviews and discussion:

Metareview: