AI & ML
Assessing model calibration with boosting trees
arXiv stat.TH0 views
arXiv:2606.08084v2 Announce Type: replace Abstract: The main goal in regression modelling consists in approximating the conditional mean of a response given a set of features. A regression function is said to be strongly calibrated if the resulting mean estimates match the true conditional means for almost every set of features. Aiming for strong calibration seems not achievable in practice as one typically deals with finite samples of noisy observations. A weaker notion of calibration is auto-calibration, and it means that the conditional expectation of the response, given a mean estimate, matches this estimate. This notion is important, e.g., in insurance pricing as it ensures no cross-subsidization between different price cohorts. In this paper, we show that boosting trees can be used to test necessary conditions for strong calibration and auto-calibration, respectively. The practical relevance of our approach is supported by a numerical example, in which the proposed tests achieve high empirical power.
Source:https://arxiv.org/abs/2606.08084PreviousOn the Validity of Fisher Randomization Tests under the Weak NullNextNonparametric Regression on Fixed-Cardinality Subsets:Minimax Risk and Random-Design Effects
Related posts
Streaming Generative Video Compression with Embedding Alignment and In-Context Propagation
0arXiv eess.IV
Beyond Accuracy: Benchmarking Uncertainty Quantification in Retinal Disease Screening
0arXiv eess.IV
CiGS: Conduction in Gaussian Splats for Interior Temperature Field from Thermal Images
0arXiv cs.GR
Probing Physics in Motion Diffusion Models Against Their Own Estimate
0arXiv cs.GR
NIRJALA: Draining the Sea out of Gaussian Splatting with Three-Path Optics and Reversible Physics
0arXiv cs.GR
How Music LLMs Actually Work: From Tokens to Waves (MusicGen, DiT, and Building Your Own Engine)
0dev.to Machine Learning