Compară metode

	XGBoost bayesian	LightGBM	XGBoost
Domeniu	Învățare automată	Învățare automată	Învățare automată
Familie	Machine learning	Machine learning	Machine learning
Anul apariției	2012–2016	2017	2016
Autorul original	Chen, T. & Guestrin, C. (XGBoost); Snoek, J. et al. (Bayesian Optimization)	Ke, G. et al. (Microsoft)	Chen, T. & Guestrin, C.
Tip	Ensemble (gradient boosted trees with Bayesian hyperparameter search)	Gradient boosting decision tree ensemble	Ensemble (gradient-boosted decision trees)
Sursa seminală	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.	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.	Chen, T. & Guestrin, C. (2016). XGBoost: A Scalable Tree Boosting System. Proceedings of the 22nd ACM SIGKDD, 785–794.
Denumiri alternative	Bayesian XGBoost, XGBoost with Bayesian Optimization, BayesOpt-XGBoost, Bayes-tuned XGBoost	LightGBM, Light Gradient Boosting Machine, lgbm, leaf-wise gradient boosting	XGBoost, extreme gradient boosting, scalable tree boosting
Înrudite	4	5	5
Rezumat	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.	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.	XGBoost (Extreme Gradient Boosting) is a scalable tree-boosting algorithm introduced by Tianqi Chen and Carlos Guestrin in 2016. It builds a strong predictor by adding decision trees one at a time, each correcting the errors left by the trees before it, and is a powerful prediction method widely used in competitions.