方法对比

	贝叶斯 LightGBM	梯度提升（Gradient Boosting）	LightGBM	随机森林
领域	机器学习	机器学习	机器学习	机器学习
方法族	Machine learning	Machine learning	Machine learning	Machine learning
起源年份	2017 (LightGBM); 2012 (Bayesian optimization)	2001	2017	2001
提出者	Ke et al. (LightGBM); Snoek et al. (Bayesian optimization)	Friedman, J. H.	Ke, G. et al. (Microsoft)	Breiman, L.
类型	Gradient boosting with Bayesian hyperparameter search	Ensemble (sequential boosting of decision trees)	Gradient boosting decision tree ensemble	Ensemble (bagging 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.	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.
别名	Bayesian-tuned LightGBM, LightGBM + Bayesian optimization, BayesOpt LightGBM, LightGBM with BayesOpt	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
相关	5	5	5	4
摘要	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.	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.