Benchmarking state-of-the-art gradient boosting algorithms for classification

Piotr Florek, Adam Zagdański
5/26/2023
cs.LG

No confident code implementation found for this paper. 3 possible matches can be shown below.

Abstract

This work explores the use of gradient boosting in the context of classification. Four popular implementations, including original GBM algorithm and selected state-of-the-art gradient boosting frameworks (i.e. XGBoost, LightGBM and CatBoost), have been thoroughly compared on several publicly available real-world datasets of sufficient diversity. In the study, special emphasis was placed on hyperparameter optimization, specifically comparing two tuning strategies, i.e. randomized search and Bayesian optimization using the Tree-stuctured Parzen Estimator. The performance of considered methods was investigated in terms of common classification accuracy metrics as well as runtime and tuning time. Additionally, obtained results have been validated using appropriate statistical testing. An attempt was made to indicate a gradient boosting variant showing the right balance between effectiveness, reliability and ease of use.

View on arXivView PDF

Code Implementations

No confident code match yet

We couldn't find an author-owned or strongly-evidenced community implementation for this paper. 3 weaker matches are hidden by default — verify before relying on them.

No code implementations found yet.

Know of an implementation? Let us know in the comments below!

Similar Papers

Cite this paper

@article{florek2023benchmarking,
  title  = {Benchmarking state-of-the-art gradient boosting algorithms for classification},
  author = {Piotr Florek and Adam Zagdański},
  year   = {2023},
  eprint = {2305.17094},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2305.17094v1}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2305.17094.svg)](https://codeofpaper.com/paper/2305.17094)

Discussion