Papers › A tree-based varying coefficient model

A tree-based varying coefficient model

11 Jan 2024arXiv:2401.05982archive 2025-07-28

Henning Zakrisson, Mathias Lindholm

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. (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\"uthrich (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.

PaperPDFCode

Code

henningzakrisson/local-glm-boost officialmentioned in papermentioned on GitHub report

Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.

Code Syntology ran Syntology

Not run by Syntology. Nothing on this page verifies that the listed code works.

Tasks

Feature Importancefeature selectionmodel

Results from the paper archive 2025-07-28

No leaderboard rows for this paper in the archive.

Methods

Early StoppingFeature Selection

Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections