Comparison of Gradient Boosting Decision Tree Algorithms for CPU Performance

• Main Authors: Haithm Haithm, ALSHARI, Abdulrazak Yahya, Saleh, Alper, ODABAŞ
• Format: Article
• Language: English
• Published: Igdir University 2021
• Subjects: QA75 Electronic computers. Computer science
• Online Access: http://ir.unimas.my/id/eprint/35224/2/abstract%20comparison.pdf; http://ir.unimas.my/id/eprint/35224/; https://dergipark.org.tr/tr/pub/erciyesfen/issue/62093/880315

Gradient Boosting Decision Trees (GBDT) algorithms have been proven to be among the best algorithms in machine learning. XGBoost, the most popular GBDT algorithm, has won many competitions on websites like Kaggle. However, XGBoost is not the only GBDT algorithm with state-of-the-art performance. There are other GBDT algorithms that have more advantages than XGBoost and sometimes even more potent like LightGBM and CatBoost. This paper aims to compare the performance of CPU implementation of the top three gradient boosting algorithms. We start by explaining how the three algorithms work and the hyperparameters similarities between them. Then we use a variety of performance criteria to evaluate their performance. We divide the performance criteria into four: accuracy, speed, reliability, and ease of use. The performance of the three algorithms has been tested with five classification and regression problems. Our findings show that the LightGBM algorithm has the best performance of the three with a balanced combination of accuracy, speed, reliability, and ease of use, followed by XGBoost with the histogram method, and CatBoost came last with slow and inconsistent performance.