Methoden vergleichen

	Bayesian LightGBM	Bayesian XGBoost	Gradient Boosting	LightGBM	Random Forest
Fachgebiet	Maschinelles Lernen	Maschinelles Lernen	Maschinelles Lernen	Maschinelles Lernen	Maschinelles Lernen
Familie	Machine learning	Machine learning	Machine learning	Machine learning	Machine learning
Entstehungsjahr	2017 (LightGBM); 2012 (Bayesian optimization)	2012–2016	2001	2017	2001
Urheber	Ke et al. (LightGBM); Snoek et al. (Bayesian optimization)	Chen, T. & Guestrin, C. (XGBoost); Snoek, J. et al. (Bayesian Optimization)	Friedman, J. H.	Ke, G. et al. (Microsoft)	Breiman, L.
Typ	Gradient boosting with Bayesian hyperparameter search	Ensemble (gradient boosted trees with Bayesian hyperparameter search)	Ensemble (sequential boosting of decision trees)	Gradient boosting decision tree ensemble	Ensemble (bagging of decision trees)
Wegweisende Quelle	Ke, G., Meng, Q., Finley, T., Wang, T., Chen, W., Ma, W., Ye, Q., & Liu, T.-Y. (2017). LightGBM: A highly efficient gradient boosting decision tree. In Advances in Neural Information Processing Systems, 30, 3146–3154.	Chen, T. & Guestrin, C. (2016). XGBoost: A Scalable Tree Boosting System. Proceedings of the 22nd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, 785–794.	Friedman, J. H. (2001). Greedy Function Approximation: A Gradient Boosting Machine. Annals of Statistics, 29(5), 1189–1232.	Ke, G., Meng, Q., Finley, T., Wang, T., Chen, W., Ma, W., Ye, Q. & Liu, T.-Y. (2017). LightGBM: A Highly Efficient Gradient Boosting Decision Tree. Advances in Neural Information Processing Systems (NeurIPS) 30, 3146–3154.	Breiman, L. (2001). Random Forests. Machine Learning, 45, 5–32.
Aliasnamen	Bayesian-tuned LightGBM, LightGBM + Bayesian optimization, BayesOpt LightGBM, LightGBM with BayesOpt	Bayesian XGBoost, XGBoost with Bayesian Optimization, BayesOpt-XGBoost, Bayes-tuned XGBoost	Gradient Boosting (GBM), GBM, gradient boosted trees, gradient boosting machine	LightGBM, Light Gradient Boosting Machine, lgbm, leaf-wise gradient boosting	Rastgele Orman (Random Forest), rastgele orman, random decision forest, bagged tree ensemble
Verwandt	5	4	5	5	4
Zusammenfassung	Bayesian LightGBM combines LightGBM — a highly efficient histogram-based gradient boosting framework — with Bayesian hyperparameter optimization. Instead of exhaustive grid search or random search, a probabilistic surrogate model guides the search for optimal hyperparameters, dramatically reducing the number of costly model evaluations needed to reach strong predictive performance.	Bayesian XGBoost combines the predictive power of Extreme Gradient Boosting with Bayesian optimization for hyperparameter tuning. Instead of grid or random search, a probabilistic surrogate model guides the search for optimal learning rate, tree depth, and regularization parameters, achieving near-peak performance with far fewer evaluations than exhaustive search approaches.	Gradient Boosting is an ensemble learning method, formalised by Jerome H. Friedman in 2001, that combines a sequence of weak learners — typically shallow decision trees — so that each new tree is fitted to minimise the residual errors of the trees before it. It is the core algorithm behind popular implementations such as XGBoost, LightGBM and CatBoost.	LightGBM is Microsoft's gradient boosting decision tree implementation, introduced by Ke and colleagues in 2017, that grows trees leaf-wise and bins features into histograms for speed. On large datasets it is much faster than XGBoost while retaining strong predictive accuracy.	Random Forest is an ensemble learning method, introduced by Leo Breiman in 2001, that grows many decision trees on bootstrap samples of the data and combines their votes to produce strong classification and regression. By pooling many slightly different trees, it produces more accurate and more stable predictions than any single tree.