Newshot

Assessing model calibration with boosting trees

Summary

arXiv:2606.08084v2 Announce Type: replace-cross 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 ac…

Original text(via arXiv stat.ML)

Mathematics > Statistics Theory

Title:Assessing model calibration with boosting trees

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.
Comments:38 pages
Subjects:Statistics Theory (math.ST) ; Applications (stat.AP); Machine Learning (stat.ML)
MSC classes:G2P05, 62G10, 91G05, 60E05
ACM classes:G.3
Cite as:arXiv:2606.08084 [math.ST]
(or arXiv:2606.08084v2 [math.ST] for this version)
https://doi.org/10.48550/arXiv.2606.08084 arXiv-issued DOI via DataCite

Submission history

Access Paper:

  • HTML (experimental)

Current browse context:

References & Citations

  • Google Scholar
  • Semantic Scholar

BibTeX formatted citation

Bookmark

Bibliographic and Citation Tools

Code, Data and Media Associated with this Article

Demos

Recommenders and Search Tools

arXivLabs: experimental projects with community collaborators

arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.

Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.

Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.

The text above was extracted automatically from the source page and may miss images, tables or code blocks. The original is authoritative.

Published by arXiv stat.ML
This site only summarises and aggregates; copyright stays with the original author. Headlines and summaries follow the source — where they differ, the original wins.
Read the original ↗