A balanced statistical boosting approach for GAMLSS via new step lengths

Alexandra Daub (), Andreas Mayr, Boyao Zhang and Elisabeth Bergherr
Additional contact information
Alexandra Daub: University of Goettingen
Andreas Mayr: University of Marburg
Boyao Zhang: University of Goettingen
Elisabeth Bergherr: University of Goettingen

Computational Statistics, 2025, vol. 40, issue 8, No 24, 4773 pages

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.

Keywords: Gradient boosting; GAMLSS; Step length; Variable selection; High-dimensional data (search for similar items in EconPapers)
Date: 2025
References: Add references at CitEc
Citations:

Downloads: (external link)
http://link.springer.com/10.1007/s00180-025-01649-8 Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:compst:v:40:y:2025:i:8:d:10.1007_s00180-025-01649-8

Ordering information: This journal article can be ordered from
http://www.springer.com/statistics/journal/180/PS2

DOI: 10.1007/s00180-025-01649-8

Access Statistics for this article

Computational Statistics is currently edited by Wataru Sakamoto, Ricardo Cao and Jürgen Symanzik

More articles in Computational Statistics from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().