পদ্ধতির তুলনা করুন

	বেয়েশিয়ান এক্সট্রিম গ্রেডিয়েন্ট বুস্টিং (Bayesian XGBoost)	গ্রেডিয়েন্ট বুস্টিং
ক্ষেত্র	যন্ত্র শিখন	যন্ত্র শিখন
পরিবার	Machine learning	Machine learning
উদ্ভবের বছর	2012–2016	2001
প্রবর্তক	Chen, T. & Guestrin, C. (XGBoost); Snoek, J. et al. (Bayesian Optimization)	Friedman, J. H.
ধরন	Ensemble (gradient boosted trees with Bayesian hyperparameter search)	Ensemble (sequential boosting of decision trees)
মৌলিক উৎস	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 XGBoost, XGBoost with Bayesian Optimization, BayesOpt-XGBoost, Bayes-tuned XGBoost	Gradient Boosting (GBM), GBM, gradient boosted trees, gradient boosting machine
সম্পর্কিত	4	5
সারসংক্ষেপ	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.