Cyclic Boosting -- an explainable supervised machine learning algorithm
Not on the map. Why?
Abstract (arXiv)
Supervised machine learning algorithms have seen spectacular advances and surpassed human level performance in a wide range of specific applications. However, using complex ensemble or deep learning algorithms typically results in black box models, where the path leading to individual predictions cannot be followed in detail. In order to address this issue, we propose the novel "Cyclic Boosting" machine learning algorithm, which allows to efficiently perform accurate regression and classification tasks while at the same time allowing a detailed understanding of how each individual prediction was made.
Key facts. Cited by 3 papers in the map (data through 7 Oct 2026). First posted on arXiv 9 Feb 2020.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2021: 1; 2022: 0; 2023: 1; 2024: 0; 2025: 1.
3 papers.
- 2021Sub-Setting Algorithm for Training Data Selection in Pattern Recognitioncited by 0
- 2023Explainable Boosting Machines with Sparsity -- Maintaining Explainability in High-Dimensional Settingscited by 0
- 2025Explainable Boosting Machine for Predicting Claim Severity and Frequency in Car Insurancecited by 0
- 2025Explainable Boosting Machine for Predicting Claim Severity and Frequency in Car Insurance27 Mar 2025
- 2023Explainable Boosting Machines with Sparsity -- Maintaining Explainability in High-Dimensional Settings13 Nov 2023
- 2021Sub-Setting Algorithm for Training Data Selection in Pattern Recognition13 Oct 2021