How Global Calibration Strengthens Multiaccuracy
Not on the map. Why?
Abstract (arXiv)
Multiaccuracy and multicalibration are multigroup fairness notions for prediction that have found numerous applications in learning and computational complexity. They can be achieved from a single learning primitive: weak agnostic learning. Here we investigate the power of multiaccuracy as a learning primitive, both with and without the additional assumption of calibration. We find that multiaccuracy in itself is rather weak, but that the addition of global calibration (this notion is called calibrated multiaccuracy) boosts its power substantially, enough to recover implications that were previously known only assuming the stronger notion of multicalibration. We give evidence that multiaccuracy might not be as powerful as standard weak agnostic learning, by showing that there is no way to post-process a multiaccurate predictor to get a weak learner, even assuming the best hypothesis has correlation 1/2. Rather, we show that it yields a restricted form of weak agnostic learning, which requires some concept in the class to have correlation greater than 1/2 with the labels. However, by also requiring the predictor to be calibrated, we recover not just weak, but strong agnostic learning. A similar picture emerges when we consider the derivation of hardcore measures from predictors satisfying multigroup fairness notions. On the one hand, while multiaccuracy only yields hardcore measures of density half the optimal, we show that (a weighted version of) calibrated multiaccuracy achieves optimal density. Our results yield new insights into the complementary roles played by multiaccuracy and calibration in each setting. They shed light on why multiaccuracy and global calibration, although not particularly powerful by themselves, together yield considerably stronger notions.
Key facts. Cited by 8 papers in the map (data through 14 Oct 2026). Builds on 17 of its 50 references that are in the map. First posted on arXiv 21 Apr 2025.
Builds on
17 of 50 references.
References · 17
- 2018Multiaccuracy: Black-Box Post-Processing for Fairness in Classificationcited by 222
- 2020Outcome Indistinguishabilitycited by 75
- 2021Omnipredictorscited by 74
- 2022Loss Minimization through the Lens of Outcome Indistinguishabilitycited by 62
- 2022A Unifying Theory of Distance from Calibrationcited by 53
- 2022Low-Degree Multicalibrationcited by 45
- 2023When Does Optimizing a Proper Loss Yield Calibration?cited by 36
- 2023Multicalibration as Boosting for Regressioncited by 33
- 2025Near-Optimal Algorithms for Omnipredictioncited by 33
- 2023Swap Agnostic Learning, or Characterizing Omniprediction via Multicalibrationcited by 31
- 2024When is Multicalibration Post-Processing Necessary?cited by 18
- 2023Complexity-Theoretic Implications of Multicalibrationcited by 16
5 more
- 2023From Pseudorandomness to Multi-Group Fairness and Backcited by 14
- 2021Multicalibrated Partitions for Importance Weightscited by 10
- 2024Characterizing the Distinguishability of Product Distributions through Multicalibrationcited by 4
- 2023Generative Models of Huge Objectscited by 2
- 2024The Sample Complexity of Smooth Boosting and the Tightness of the Hardcore Theoremcited by 2
Built on by
Citing papers per year: 2025: 5; 2026: 3.
8 papers.
- 2025Networked Information Aggregation via Machine Learningcited by 8
- 2025Generalized and Unified Equivalences between Hardness and Pseudoentropycited by 5
- 2025Efficient Swap Multicalibration of Elicitable Propertiescited by 5
- 2025Supersimulatorscited by 4
- 2026An Efficient Black-Box Reduction from Online Learning to Multicalibration, and a New Route to Phi-Regret Minimizationcited by 3
- 2026Robust Learning with Optimal Errorcited by 1
- 2025Auditability and the Landscape of Distance to Multicalibrationcited by 0
- 2026Defensive Boosting for Online Probabilistic Forecastingcited by 0
- 2026Defensive Boosting for Online Probabilistic Forecasting13 Aug 2026
- 2026An Efficient Black-Box Reduction from Online Learning to Multicalibration, and a New Route to Phi-Regret Minimization21 Apr 2026
- 2026Robust Learning with Optimal Error2 Apr 2026
- 2025Efficient Swap Multicalibration of Elicitable Properties7 Nov 2025
- 2025Supersimulators22 Sep 2025
- 2025Auditability and the Landscape of Distance to Multicalibration21 Sep 2025
- 2025Networked Information Aggregation via Machine Learning13 Jul 2025
- 2025Generalized and Unified Equivalences between Hardness and Pseudoentropy8 Jul 2025