Boost-R: Gradient Boosted Trees for Recurrence Data
Xiao Liu, Rong Pan

TL;DR
Boost-R introduces a novel gradient boosted tree method for modeling complex recurrent event data with static and dynamic features, providing a flexible, non-parametric approach that handles heterogeneity effectively.
Contribution
This paper presents the first gradient boosted additive-tree approach specifically designed for large-scale recurrent event data with mixed feature types.
Findings
Boost-R effectively models complex recurrent event processes.
The method handles heterogeneity and dynamic features.
Code and datasets are publicly available on GitHub.
Abstract
Recurrence data arise from multi-disciplinary domains spanning reliability, cyber security, healthcare, online retailing, etc. This paper investigates an additive-tree-based approach, known as Boost-R (Boosting for Recurrence Data), for recurrent event data with both static and dynamic features. Boost-R constructs an ensemble of gradient boosted additive trees to estimate the cumulative intensity function of the recurrent event process, where a new tree is added to the ensemble by minimizing the regularized L2 distance between the observed and predicted cumulative intensity. Unlike conventional regression trees, a time-dependent function is constructed by Boost-R on each tree leaf. The sum of these functions, from multiple trees, yields the ensemble estimator of the cumulative intensity. The divide-and-conquer nature of tree-based methods is appealing when hidden sub-populations exist…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsStatistical Methods and Inference · Bayesian Methods and Mixture Models · Bayesian Modeling and Causal Inference
