paper-with-me

Papers

Low-Degree Multicalibration

2022-03-02 · Parikshit Gopalan, Michael P. Kim, Mihir Singhal, Shengjia Zhao

Introduced as a notion of algorithmic fairness, multicalibration has proved to be a powerful and versatile concept with implications far beyond its original intent. This stringent notion -- that predictions be well-calibrated across a rich class of intersecting subpopulations -- provides its strong guarantees at a cost: the computational and sample complexity of learning multicalibrated predictors are high, and grow exponentially with the number of class labels. In contrast, the relaxed notion of multiaccuracy can be achieved more efficiently, yet many of the most desirable properties of multicalibration cannot be guaranteed assuming multiaccuracy alone. This tension raises a key question: Can we learn predictors with multicalibration-style guarantees at a cost commensurate with multiaccuracy? In this work, we define and initiate the study of Low-Degree Multicalibration. Low-Degree Multicalibration defines a hierarchy of increasingly-powerful multi-group fairness notions that spans multiaccuracy and the original formulation of multicalibration at the extremes. Our main technical contribution demonstrates that key properties of multicalibration, related to fairness and accuracy, actually manifest as low-degree properties. Importantly, we show that low-degree multicalibration can be significantly more efficient than full multicalibration. In the multi-class setting, the sample complexity to achieve low-degree multicalibration improves exponentially (in the number of classes) over full multicalibration. Our work presents compelling evidence that low-degree multicalibration represents a sweet spot, pairing computational and sample efficiency with strong fairness and accuracy guarantees.

📄 PDF Abstract BibTeX arXiv:2203.01255

Code (0)

등록된 구현이 없습니다.

Tasks

Fairness

Similar Papers 제목 키워드 기반

An Exploration of Multicalibration Uniform Convergence Bounds

2022-02-09 · Harrison Rosenberg, Robi Bhattacharjee, Kassem Fawaz, Somesh Jha

Recent works have investigated the sample complexity necessary for fair machine learning. The most advanced of such sample complexity bounds are developed by analyzing multicalibration uniform convergence for a given pre…

BIG-bench Machine LearningFairness

When is Multicalibration Post-Processing Necessary?

2024-06-10 · Dutch Hansen, Siddartha Devic, Preetum Nakkiran, Vatsal Sharan

Calibration is a well-studied property of predictors which guarantees meaningful uncertainty estimates. Multicalibration is a related notion -- originating in algorithmic fairness -- which requires predictors to be simul…

Fairness

Sample Complexity of Uniform Convergence for Multicalibration

2020-05-04 · NeurIPS 2020 12 · Eliran Shabat, Lee Cohen, Yishay Mansour

There is a growing interest in societal concerns in machine learning systems, especially in fairness. Multicalibration gives a comprehensive methodology to address group fairness. In this work, we address the multicalibr…

Fairness

Auditability and the Landscape of Distance to Multicalibration

2025-09-21 · Nathan Derhake, Siddartha Devic, Dutch Hansen, Kuan Liu 외 arxiv

Calibration is a critical property for establishing the trustworthiness of predictors that provide uncertainty estimates. Multicalibration is a strengthening of calibration which requires that predictors be calibrated on…

A Unifying Perspective on Multi-Calibration: Game Dynamics for Multi-Objective Learning

2023-02-21 · NeurIPS 2023 11

We provide a unifying framework for the design and analysis of multicalibrated predictors. By placing the multicalibration problem in the general setting of multi-objective learning -- where learning guarantees must hold…

Fairness