A balanced statistical boosting approach for GAMLSS via new step lengths

Abstract Component-wise gradient boosting algorithms are popular for their intrinsic variable selection and implicit regularization, which can be especially beneficial for very flexible model classes. When estimating generalized additive models for location, scale and shape (GAMLSS) via a component-wise gradient boosting algorithm, an important part of the estimation procedure is to determine the relative complexity of the different submodels. Shrunk optimal step lengths have been suggested to replace small fixed step lengths for a non-cyclical boosting algorithm limited to a Gaussian response variable in order to achieve a similar degree of regularization in the submodels. In this article, we propose a new adaptive step length approach that accounts for the relative size of the fitted base-learners to ensure a natural balance between the different submodels. The new balanced boosting approach thus represents a computationally efficient and easily generalizable alternative to shrunk optimal step lengths. We implemented the balanced non-cyclical boosting algorithm for a Gaussian, a negative binomial as well as a Weibull distributed response variable and investigate the performance of the new approach in a simulation study, for count data of doctor’s visits as well as for survival data in an oncological trial. Both the simulation results and the applications show that the new approach yields similar results to shrunk optimal step lengths, especially with respect to the balance in the overall model. An improvement in the computational efficiency compared to numerically obtained shrunk optimal step lengths is especially evident for the Gaussian and negative binomial setting.

Authors

Institutions

Publication Details

Journal
Computational Statistics
Published
2025-06-16
DOI
https://doi.org/10.1007/s00180-025-01649-8
Citations
1
Primary Topic
Model Reduction and Neural Networks
Type
article
Field-Weighted Citation Impact
1.32

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

A balanced statistical boosting approach for GAMLSS via new step lengths

Boyao Zhang, Elisabeth Bergherr, Andreas Mayr, Alexandra Daub
1 citations
Computational Statistics
Model Reduction and Neural Networks
1.32
article

A balanced statistical boosting approach for GAMLSS via new step lengths

Boyao Zhang, Elisabeth Bergherr, Andreas Mayr, Alexandra Daub
article en
1 citations

Abstract

Abstract Component-wise gradient boosting algorithms are popular for their intrinsic variable selection and implicit regularization, which can be especially beneficial for very flexible model classes. When estimating generalized additive models for location, scale and shape (GAMLSS) via a component-wise gradient boosting algorithm, an important part of the estimation procedure is to determine the relative complexity of the different submodels. Shrunk optimal step lengths have been suggested to replace small fixed step lengths for a non-cyclical boosting algorithm limited to a Gaussian response variable in order to achieve a similar degree of regularization in the submodels. In this article, we propose a new adaptive step length approach that accounts for the relative size of the fitted base-learners to ensure a natural balance between the different submodels. The new balanced boosting approach thus represents a computationally efficient and easily generalizable alternative to shrunk optimal step lengths. We implemented the balanced non-cyclical boosting algorithm for a Gaussian, a negative binomial as well as a Weibull distributed response variable and investigate the performance of the new approach in a simulation study, for count data of doctor’s visits as well as for survival data in an oncological trial. Both the simulation results and the applications show that the new approach yields similar results to shrunk optimal step lengths, especially with respect to the balance in the overall model. An improvement in the computational efficiency compared to numerically obtained shrunk optimal step lengths is especially evident for the Gaussian and negative binomial setting.

Computational StatisticsVol. 40(8)
Philipps University of Marburg (DE), Zimmer Biomet (Netherlands) (NL), University of Göttingen (DE)
Deutsche Forschungsgemeinschaft, Volkswagen Foundation, Georg-August-Universität Göttingen
Openalex Percentile: Top 19%
Model Reduction and Neural Networks
1.32
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.