vix.ing · top · new · best · stats · spec

Simple and near-optimal algorithms for hidden stratification and multi-group learning

2021/12/22 by Tosh, Christopher, Hsu, Daniel · 2 citations
#FOS: Computer and information sciences #Machine Learning (cs.LG) #Machine Learning (stat.ML)

paper · doi:10.48550/arxiv.2112.12181

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. This paper studies the structure of solutions to the multi-group learning problem, and provides simple and near-optimal algorithms for the learning problem.

Cited by

Related