← Back to papers
2022 ICML ICML 2022

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

🧭 Keyword Pioneer — multi-group learning
🐝 Cross-Pollinator — Artificial Intelligence, Machine Learning, Mathematics & Optimization

Authors

Christopher J Tosh , Daniel Hsu

Topics

Machine Learning > Core Methods > Classification Machine Learning > Optimization & Theory > Learning Theory Machine Learning > Application Areas > Fairness Machine Learning > Learning Types > Fairness

Keywords

agnostic learning subgroup fairness multi-group learning hidden stratification conditional risk near-optimal algorithm
Download PDF

Related papers

A Tree-based Model Averaging Approach for Personalized Treatment Effect Estimation from Heterogeneous Data Sources 2022
Generic Coreset for Scalable Learning of Monotonic Kernels: Logistic Regression, Sigmoid and more 2022
Active fairness auditing 2022
Toward Compositional Generalization in Object-Oriented World Modeling 2022
Robustness Verification for Contrastive Learning 2022