Algorithms for multi-group learning

Abstract: Multi-group agnostic learning is a formal learning criterion that is concerned with the conditional risks of predictors within subgroups of a population. The criterion addresses recent practical concerns such as subgroup fairness and hidden stratification. I’ll talk about the structure of solutions to the multi-group learning problem, as well as some simple and near-optimal algorithms for the learning problem. This is based on joint work with Christopher Tosh.