مقایسهٔ روش‌ها

	LightGBM بیزی	ایکس‌جی‌بوست بیزی (Bayesian XGBoost)	گرادیان بوستینگ (Gradient Boosting)
حوزه	یادگیری ماشین	یادگیری ماشین	یادگیری ماشین
خانواده	Machine learning	Machine learning	Machine learning
سال پیدایش	2017 (LightGBM); 2012 (Bayesian optimization)	2012–2016	2001
پدیدآور	Ke et al. (LightGBM); Snoek et al. (Bayesian optimization)	Chen, T. & Guestrin, C. (XGBoost); Snoek, J. et al. (Bayesian Optimization)	Friedman, J. H.
نوع	Gradient boosting with Bayesian hyperparameter search	Ensemble (gradient boosted trees with Bayesian hyperparameter search)	Ensemble (sequential boosting of decision trees)
منبع بنیادین	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.
نام‌های دیگر	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
مرتبط	5	4	5
خلاصه	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.