Research
On-device research index

arXiv research

A locally-built, LLM-digested index of recent arXiv papers in quant finance, geometry/topology, and statistical ML — keyword search served straight from SQLite on this machine.

168,657 papers · 148 categories

Trend · papers per month

1122 · Mar 202519922001200920172026
25 results for multicalibration

Unified approach for multicalibration in weakly supervised learning.

problem Existing multicalibration methods require clean input-label pairs, which are unavailable in weakly supervised learning.
method Developed estimators and post-hoc correction methods for multicalibration under weak supervision.
result Unified framework for estimating and correcting multicalibration under weak supervision with finite-sample guarantees.

The paper provides convergence guarantees for multicalibration gradient boosting.

problem Understanding the convergence properties of multicalibration gradient boosting.
method Computational guarantees for multicalibration gradient boosting algorithms, including adaptive variants.
result The magnitude of successive prediction updates decays at O(1/T)O(1/\sqrt{T}), leading to convergence in empirical multicalibration error.

New algorithm achieves faster multicalibration in online settings.

problem Achieving fair predictions in online settings with limited interaction.
method Generalized multicalibration to arbitrary bounded hypothesis classes and introduced swap multicalibration. Proposed an oracle-efficient algorithm achieving faster multicalibration error.
result Oracle-efficient algorithm achieves T1/(r+1)T^{1/(r+1)} r\ell_r-swap multicalibration error with high probability, improving on previous bounds.

Paper examines fairness of data augmentation methods, finding vanilla Mixup outperforms Fair Mixup.

problem Improving fairness in classification models with limited minority data.
method Uses multicalibration to rigorously evaluate and improve data augmentation methods for classification fairness.
result Vanilla Mixup outperforms Fair Mixup and baseline methods in fairness and accuracy, especially with small minority groups.

The paper introduces multicalibration to improve confidence scores in LLMs.

problem Improving the reliability and interpretability of confidence scores for LLMs.
method Forming groupings of prompt/completion pairs correlated with correctness, using clustering and self-annotation. Developing multicalibration algorithms to reduce overfitting.
result Our techniques yield confidence scores that significantly improve calibration and accuracy compared to existing methods.

We resolve the open problem of optimal sample complexity for multicalibration and deterministic predictors.

problem Optimal sample complexity for multicalibration and deterministic predictors
method Minimax-optimal multicalibration algorithm and generalization to OI predictors
result Minimax-optimal multicalibration algorithm and deterministic predictors with optimal sample complexity

Improved bounds for multicalibration and omniprediction in online and distributional settings.

problem Achieving efficient multicalibration and omniprediction in fairness and loss minimization.
method Proposed an efficient algorithm achieving improved rates for multicalibration and omniprediction.
result Achieved O(T13)O(T^{\frac{1}{3}}) 2\ell_{2}-swap multicalibration error for convex Lipschitz functions.

Study shows sample complexity for multicalibration is Θ(ε^-3) with polylogarithmic factors.

problem Minimizing Expected Calibration Error (ECE) for predictors with respect to a family of groups.
method Proved necessary and sufficient sample complexity of Θ(ε^-3) for multicalibration, using online-to-batch reduction and lower bounds.
result Sample complexity of multicalibration is Θ(ε^-3) with polylogarithmic factors, distinguishing it from marginal calibration.

Paper proves tight lower bounds for online multicalibration, separating it from marginal calibration.

problem Proving lower bounds for online multicalibration in relation to marginal calibration.
method Information-theoretic approach, constructing group families from orthonormal bases.
result Establishes tight lower bounds for online multicalibration, matching upper bounds up to logarithmic factors.

The paper shows how to use proxy attributes for fairness in machine learning models with missing sensitive group data.

problem Measuring and enforcing fairness in machine learning models with incomplete sensitive group data.
method Using proxy-sensitive attributes to derive upper bounds on multiaccuracy and multicalibration violations and adjust models to satisfy these fairness notions.
result Provable upper bounds on multiaccuracy and multicalibration violations can be derived using proxy-sensitive attributes in the absence of sensitive group data.

The paper introduces moment multicalibration for estimating uncertainty across subgroups.

problem Ensuring fairness and accurate uncertainty estimation in predictions across different subgroups.
method Develops a method for multicalibration of higher moments, enabling point predictions and interval estimation.
result Moment multicalibration allows for valid prediction intervals that are fair across various subgroups.

The paper proposes multicalibration to improve matching in graphs with imperfect predictors.

problem Finding the best matching in graphs with imperfect predictors.
method Introduces multicalibration as a fairness notion to ensure unbiasedness on protected sets of contexts.
result Constructing a multicalibrated predictor that outperforms standard optimal rules in matching algorithms.

New algorithm for online omniprediction with strong guarantees for continuous hypothesis classes.

problem Online adversarial learning with continuous hypothesis classes.
method Developed an oracle-efficient online multicalibration algorithm for infinite benchmark classes.
result First efficient online omnipredictor with strong guarantees for Lipschitz convex loss functions.

Framework for ensuring fairness in machine learning models across multiple groups.

problem Ensuring fairness in machine learning models across multiple groups.
method Introduces (s,G,α)(\mathbf{s},\mathcal{G}, α)-GMC for multi-dimensional mappings and constraint sets, proposing algorithms to achieve multicalibration.
result Demonstrates the effectiveness of the framework on various scenarios, including image segmentation, hierarchical classification, and text generation.

Efficiently generates models resistant to falsification.

problem Creating models that cannot be disproven by tests.
method Exploits connections between high-dimensional multicalibration and expected variational inequality problems to develop an efficient algorithm.
result First to efficiently produce online outcome indistinguishable generative models resistant to infinite classes of tests.

Unified framework for generalized Venn and Venn-Abers calibration for reliable prediction.

problem Asymptotic guarantees of popular distribution-free methods in model calibration.
method Unified framework extending Vovk's approach to generic loss functions, transforming predictors into set-valued predictions.
result Finite-sample set predictions shrink to a single conditionally calibrated prediction, capturing epistemic uncertainty.

As algorithms increasingly inform and influence decisions made about individuals, it becomes increasingly important to address concerns that these algorithms might be discriminatory. The output of an algorithm can be discriminatory for many reasons, most notably: (1) the data used to train the algorithm might be biased…

2017-11-22abs ↗pdf ↗

The paper addresses the difficulty of decision makers trusting AI-assisted predictions and proposes a method to improve confidence values.

problem Decision makers struggle to trust AI-assisted predictions based on confidence values.
method The paper investigates why decision makers have difficulties and proposes a method to construct more useful confidence values.
result Multicalibration with respect to the decision maker's confidence on her own predictions is a sufficient condition for alignment, leading to better decisions.

The study quantifies decision-making risks from suboptimal classifiers and proposes methods to reduce these risks.

problem Excess risk in decision-making from suboptimal probabilistic classifiers.
method Analytical expressions and upper/lower bounds for excess risk, calibration curve estimation, grouping loss estimator.
result Identifies regimes where recalibration alone or post-training is more effective.

Comparative learning combines realizable and agnostic settings for two hypothesis classes, reducing sample complexity.

problem Learning with two hypothesis classes in a more general setting than single hypothesis classes.
method Introduces comparative learning, defines mutual VC dimension and Littlestone dimension, and applies insights to multiaccuracy and multicalibration.
result Sample complexity of comparative learning is characterized by mutual VC dimension and Littlestone dimension.