From point to probabilistic gradient boosting for claim frequency and severity prediction

<?xml version="1.0" encoding="UTF-8"?><modsCollection xmlns="http://www.loc.gov/mods/v3" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.loc.gov/mods/v3 http://www.loc.gov/standards/mods/v3/mods-3-8.xsd">
<mods version="3.8">
<titleInfo>
<title>From point to probabilistic gradient boosting for claim frequency and severity prediction</title>
</titleInfo>
<name type="personal" xmlns:xlink="http://www.w3.org/1999/xlink" xlink:href="MAPA20260002415">
<namePart>Côté, Marie-Pier</namePart>
<nameIdentifier>MAPA20260002415</nameIdentifier>
</name>
<typeOfResource>text</typeOfResource>
<genre authority="marcgt">periodical</genre>
<originInfo>
<place>
<placeTerm type="code" authority="marccountry">che</placeTerm>
</place>
<dateIssued encoding="marc">2026</dateIssued>
<issuance>serial</issuance>
</originInfo>
<language>
<languageTerm type="code" authority="iso639-2b">eng</languageTerm>
</language>
<physicalDescription>
<form authority="marcform">print</form>
</physicalDescription>
<abstract displayLabel="Summary">Gradient boosting for decision tree algorithms are increasingly used in actuarial applications as they show superior predictive performance over traditional generalised linear models. Many enhancements to the first gradient boosting machine algorithm exist. We present in a unified notation, and contrast, all the existing point and probabilistic gradient boosting for decision tree algorithms: GBM, XGBoost, DART, LightGBM, CatBoost, EGBM, PGBM, XGBoostLSS, cyclic GBM, and NGBoost. In this comprehensive numerical study, we compare their performance on five publicly available datasets for claim frequency and severity, of various sizes and comprising different numbers of (high cardinality) categorical variables. We explain how varying exposure-to-risk can be handled with boosting in frequency models. We compare the algorithms on the basis of computational efficiency, predictive performance, and model adequacy. LightGBM and XGBoostLSS win in terms of computational efficiency. CatBoost sometimes improves predictive performance, especially in the presence of high cardinality categorical variables, common in actuarial science. The fully interpretable EGBM achieves competitive predictive performance compared to the black box algorithms considered. We find that there is no trade-off between model adequacy and predictive accuracy: both are achievable simultaneously</abstract>
<note type="statement of responsibility">Dominik Chevalier and Marie-Pier Côté</note>
<subject xmlns:xlink="http://www.w3.org/1999/xlink" xlink:href="MAPA20080579258">
<topic>Cálculo actuarial</topic>
</subject>
<subject xmlns:xlink="http://www.w3.org/1999/xlink" xlink:href="MAPA20080570651">
<topic>Siniestralidad</topic>
</subject>
<subject xmlns:xlink="http://www.w3.org/1999/xlink" xlink:href="MAPA20080592042">
<topic>Modelos matemáticos</topic>
</subject>
<subject xmlns:xlink="http://www.w3.org/1999/xlink" xlink:href="MAPA20080564322">
<topic>Tarificación</topic>
</subject>
<subject xmlns:xlink="http://www.w3.org/1999/xlink" xlink:href="MAPA20080611613">
<topic>Modelos probabílisticos</topic>
</subject>
<classification authority="">6</classification>
<relatedItem type="host">
<titleInfo>
<title>European Actuarial Journal</title>
</titleInfo>
<originInfo>
<publisher>Cham, Switzerland  : Springer Nature Switzerland AG,  2021-2022</publisher>
</originInfo>
<identifier type="local">MAP20220007085</identifier>
<part>
<text>15/12/2025 Volume 15 Issue 3 - December 2025 , 46 p.</text>
</part>
</relatedItem>
<recordInfo>
<recordContentSource authority="marcorg">MAP</recordContentSource>
<recordCreationDate encoding="marc">260225</recordCreationDate>
<recordChangeDate encoding="iso8601">20260310165937.0</recordChangeDate>
<recordIdentifier source="MAP">MAP20260006222</recordIdentifier>
<languageOfCataloging>
<languageTerm type="code" authority="iso639-2b">spa</languageTerm>
</languageOfCataloging>
</recordInfo>
</mods>
</modsCollection>