English

Evaluating Model Performance Under Worst-case Subpopulations

Machine Learning 2025-12-09 v2 Computers and Society Machine Learning

Abstract

The performance of ML models degrades when the training population is different from that seen under operation. Towards assessing distributional robustness, we study the worst-case performance of a model over all subpopulations of a given size, defined with respect to core attributes Z. This notion of robustness can consider arbitrary (continuous) attributes Z, and automatically accounts for complex intersectionality in disadvantaged groups. We develop a scalable yet principled two-stage estimation procedure that can evaluate the robustness of state-of-the-art models. We prove that our procedure enjoys several finite-sample convergence guarantees, including dimension-free convergence. Instead of overly conservative notions based on Rademacher complexities, our evaluation error depends on the dimension of Z only through the out-of-sample error in estimating the performance conditional on Z. On real datasets, we demonstrate that our method certifies the robustness of a model and prevents deployment of unreliable models.

Keywords

Cite

@article{arxiv.2407.01316,
  title  = {Evaluating Model Performance Under Worst-case Subpopulations},
  author = {Mike Li and Daksh Mittal and Hongseok Namkoong and Shangzhou Xia},
  journal= {arXiv preprint arXiv:2407.01316},
  year   = {2025}
}

Comments

Earlier version appeared in the proceedings of Advances in Neural Information Processing Systems 34 (NeurIPS 2021): https://proceedings.neurips.cc/paper_files/paper/2021/file/908075ea2c025c335f4865f7db427062-Paper.pdf

R2 v1 2026-06-28T17:25:00.855Z