Endre søk
RefereraExporteraLink to record
Permanent link

Direct link
Referera
Referensformat
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Annet format
Fler format
Språk
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Annet språk
Fler språk
Utmatningsformat
  • html
  • text
  • asciidoc
  • rtf
A tree-based varying coefficient model
Stockholms universitet, Naturvetenskapliga fakulteten, Matematiska institutionen.ORCID-id: 0009-0007-4248-6933
Stockholms universitet, Naturvetenskapliga fakulteten, Matematiska institutionen.ORCID-id: 0000-0001-7235-384x
2025 (engelsk)Inngår i: Computational Statistics, ISSN 0943-4062, E-ISSN 1613-9658, Vol. 40, s. 5105-5134Artikkel i tidsskrift (Fagfellevurdert) Published
Abstract [en]

The paper introduces a tree-based varying coefficient model (VCM) where the varying coefficients are modelled using the cyclic gradient boosting machine (CGBM) from Delong et al. (On cyclic gradient boosting machines, 2023). Modelling the coefficient functions using a CGBM allows for dimension-wise early stopping and feature importance scores. The dimension-wise early stopping not only reduces the risk of dimension-specific overfitting, but also reveals differences in model complexity across dimensions. The use of feature importance scores allows for simple feature selection and easy model interpretation. The model is evaluated on the same simulated and real data examples as those used in Richman and Wüthrich (Scand Actuar J 2023:71–95, 2023), and the results show that it produces results in terms of out of sample loss that are comparable to those of their neural network-based VCM called LocalGLMnet.

sted, utgiver, år, opplag, sider
2025. Vol. 40, s. 5105-5134
Emneord [en]
Generalised linear models, Multivariate gradient boosting, Feature selection, Interaction efects, Early stopping
HSV kategori
Identifikatorer
URN: urn:nbn:se:su:diva-226747DOI: 10.1007/s00180-025-01603-8ISI: 001412768400001Scopus ID: 2-s2.0-85217704687OAI: oai:DiVA.org:su-226747DiVA, id: diva2:1838775
Tilgjengelig fra: 2024-02-19 Laget: 2024-02-19 Sist oppdatert: 2026-03-19bibliografisk kontrollert
Inngår i avhandling
1. Tree-based machine learning methods with non-life insurance applications
Åpne denne publikasjonen i ny fane eller vindu >>Tree-based machine learning methods with non-life insurance applications
2024 (engelsk)Doktoravhandling, med artikler (Annet vitenskapelig)
Abstract [en]

Non-life insurance is a field which has been data-driven for a long time, with the statistical framework behind modern-day actuarial sciences laid out at the beginning of the 20th century. Problems regarding the estimation and prediction of risk are relevant to the insurance industry specifically, but also for society as a whole. The rise of machine learning methods has created a new set of tools that can be used to solve these problems. This thesis contains five individual papers, all of which are related to developing machine learning- or data-driven methods and algorithms that can be applied to, but are not limited to, non-life insurance applications.

Paper I takes an existing probabilistic model for claims reserving, the Collective Reserving Model (CRM), and replaces the linear modeling approach of the original paper with non-linear machine learning methods. The paper addresses issues in these applications and provides a framework for how to implement and evaluate machine learning models in a reserving setting. It also discusses how to implement early stopping methods given different levels of data granularity. The models are evaluated on a series of simulated data sets with promising results.

Paper II does not use a machine learning method per se but instead develops the CRM used in Paper I by adding the openness status of the claims to the dynamics and presents the CRM with Openness (CRMO), as a means to model the non-linear effects implied in Paper I. The paper presents how the model can be estimated using regression methods, and provides recursive formulas for the moments of the predicted reserve. The algorithm is evaluated in terms of accuracy on the same data set as in Paper I and shows results that are comparable to the machine learning implementations of the CRM model.

Paper III presents a new boosting algorithm called the Cyclic Gradient Boosting Machine (CGBM). The algorithm extends the classical gradient boosting machine to provide multi-dimensional function approximation. The paper shows how the CGBM can be used to estimate entire probability distributions rather than just the mean of the distribution. The paper also discusses potential problems with hyperparameter tuning in this higher-dimensional hyperparameter space and provides a dimension-wise early stopping method, which is proven useful to avoid overfitting. Numerical illustrations show accurate results on simulated and real data sets.

Paper IV is a paper that is not directly related to non-life insurance but rather to so-called decision trees used for classification and regression. The paper presents the trinary tree algorithm, which is a new way to handle missing input data for tree-based models, meant to provide a more regularized model than other suggested methods. The algorithm is benchmarked against standard methods for missing data-handling and shows promising results even for high rates of missing data.

Paper V presents a generalized linear model with non-linear effects induced by varying coefficients, with the varying coefficients estimated using the CGBM from Paper III. This is a special case of a varying coefficient model (VCM). The model that can handle highly non-linear effects while maintaining local interpretability. The paper also shows how tuning, feature selection, and evaluation of interaction effects can be simplified as compared to other VCMs. The model is evaluated on the same data set as in Paper III and shows promising results in terms of accuracy and interpretability.

sted, utgiver, år, opplag, sider
Stockholm: Department of Mathematics, Stockholm University, 2024. s. 65
HSV kategori
Forskningsprogram
matematisk statistik
Identifikatorer
urn:nbn:se:su:diva-226748 (URN)978-91-8014-677-7 (ISBN)978-91-8014-678-4 (ISBN)
Disputas
2024-04-12, hörsal 4, hus 2, Campus Albano, Greta Arwidssons väg 28, Stockholm, 13:00 (engelsk)
Opponent
Veileder
Tilgjengelig fra: 2024-03-20 Laget: 2024-02-19 Sist oppdatert: 2024-03-12bibliografisk kontrollert

Open Access i DiVA

Fulltekst mangler i DiVA

Andre lenker

Forlagets fulltekstScopus

Person

Zakrisson, HenningLindholm, Mathias

Søk i DiVA

Av forfatter/redaktør
Zakrisson, HenningLindholm, Mathias
Av organisasjonen
I samme tidsskrift
Computational Statistics

Søk utenfor DiVA

GoogleGoogle Scholar

doi
urn-nbn

Altmetric

doi
urn-nbn
Totalt: 140 treff
RefereraExporteraLink to record
Permanent link

Direct link
Referera
Referensformat
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Annet format
Fler format
Språk
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Annet språk
Fler språk
Utmatningsformat
  • html
  • text
  • asciidoc
  • rtf