Table of Contents
Fetching ...

Discretization-free Multicalibration through Loss Minimization over Tree Ensembles

Hongyi Henry Jin, Zijun Ding, Dung Daniel Ngo, Zhiwei Steven Wu

TL;DR

This work addressing multicalibration avoids output discretization by post-processing a base predictor with a square-loss ERM over a depth-two tree ensemble, implemented via LightGBM. It provides a theoretical multicalibration guarantee under a loss-saturation assumption and empirically validates the approach across diverse tabular, image, and text datasets, showing it often matches or exceeds discretization-based baselines even when evaluated with discretized metrics. The method offers a practical, plug-in fairness enhancement that leverages standard tree-ensemble tools, reducing the need to tune discretization granularity and improving robustness to downstream discretization. Overall, the discretization-free approach broadens the applicability of multicalibration in real-world decision-making pipelines while maintaining competitive predictive performance.

Abstract

In recent years, multicalibration has emerged as a desirable learning objective for ensuring that a predictor is calibrated across a rich collection of overlapping subpopulations. Existing approaches typically achieve multicalibration by discretizing the predictor's output space and iteratively adjusting its output values. However, this discretization approach departs from the standard empirical risk minimization (ERM) pipeline, introduces rounding error and additional sensitive hyperparameter, and may distort the predictor's outputs in ways that hinder downstream decision-making. In this work, we propose a discretization-free multicalibration method that directly optimizes an empirical risk objective over an ensemble of depth-two decision trees. Our ERM approach can be implemented using off-the-shelf tree ensemble learning methods such as LightGBM. Our algorithm provably achieves multicalibration, provided that the data distribution satisfies a technical condition we term as loss saturation. Across multiple datasets, our empirical evaluation shows that this condition is always met in practice. Our discretization-free algorithm consistently matches or outperforms existing multicalibration approaches--even when evaluated using a discretization-based multicalibration metric that shares its discretization granularity with the baselines.

Discretization-free Multicalibration through Loss Minimization over Tree Ensembles

TL;DR

This work addressing multicalibration avoids output discretization by post-processing a base predictor with a square-loss ERM over a depth-two tree ensemble, implemented via LightGBM. It provides a theoretical multicalibration guarantee under a loss-saturation assumption and empirically validates the approach across diverse tabular, image, and text datasets, showing it often matches or exceeds discretization-based baselines even when evaluated with discretized metrics. The method offers a practical, plug-in fairness enhancement that leverages standard tree-ensemble tools, reducing the need to tune discretization granularity and improving robustness to downstream discretization. Overall, the discretization-free approach broadens the applicability of multicalibration in real-world decision-making pipelines while maintaining competitive predictive performance.

Abstract

In recent years, multicalibration has emerged as a desirable learning objective for ensuring that a predictor is calibrated across a rich collection of overlapping subpopulations. Existing approaches typically achieve multicalibration by discretizing the predictor's output space and iteratively adjusting its output values. However, this discretization approach departs from the standard empirical risk minimization (ERM) pipeline, introduces rounding error and additional sensitive hyperparameter, and may distort the predictor's outputs in ways that hinder downstream decision-making. In this work, we propose a discretization-free multicalibration method that directly optimizes an empirical risk objective over an ensemble of depth-two decision trees. Our ERM approach can be implemented using off-the-shelf tree ensemble learning methods such as LightGBM. Our algorithm provably achieves multicalibration, provided that the data distribution satisfies a technical condition we term as loss saturation. Across multiple datasets, our empirical evaluation shows that this condition is always met in practice. Our discretization-free algorithm consistently matches or outperforms existing multicalibration approaches--even when evaluated using a discretization-based multicalibration metric that shares its discretization granularity with the baselines.

Paper Structure

This paper contains 42 sections, 11 theorems, 89 equations, 2 figures, 3 tables, 2 algorithms.

Key Result

Theorem 4.3

Let $f^{cal}$ be the predictor obtained by alg:mc-abstract, and $\tilde{f}_m^{cal}$ be its $m$-discretized version. If the discretization error of $\tilde{f}_m^{cal}$ is $\epsilon_{round}$, and the loss of $f^{cal}$ is $\epsilon_{loss}$-saturated with respect to $p_{\mathcal{G}}$ as in assp:loss-onc

Figures (2)

  • Figure 1: Illustration of the tree ensemble.
  • Figure 2: Multicalibration error on different datasets. The y-axis is the multicalibration error, and the x-axis is the size of range, which may not equal $m$, the size of the codomain, and the error band displays the standard deviation. The graph shows that, a predictor trained using our algorithm can be discretized arbitrarily, and its $m$-discretized version has matching or lower multicalibration error than the predictor calibrated with other multicalibration algorithm using that specific discretization.

Theorems & Definitions (23)

  • Definition 3.1: Squared loss
  • Definition 3.2: Multicalibration Error
  • Definition 4.1: Discretization Operation
  • Theorem 4.3: \ref{['alg:mc-abstract']} Yields Small Multicalibration Error Given \ref{['assp:loss-once']}
  • proof
  • Remark 4.4
  • Definition A.1: Discretization Operation
  • Definition E.1
  • Lemma E.2: Massart's Lemma
  • Lemma E.3: Talagrand's Contraction Lemma
  • ...and 13 more