ScholarGate
助手

方法对比

并排查看您选择的方法;存在差异的行会高亮显示。

贝叶斯XGBoost×梯度提升(Gradient Boosting)×LightGBM×
领域机器学习机器学习机器学习
方法族Machine learningMachine learningMachine learning
起源年份2012–201620012017
提出者Chen, T. & Guestrin, C. (XGBoost); Snoek, J. et al. (Bayesian Optimization)Friedman, J. H.Ke, G. et al. (Microsoft)
类型Ensemble (gradient boosted trees with Bayesian hyperparameter search)Ensemble (sequential boosting of decision trees)Gradient boosting decision tree ensemble
开创性文献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. DOI ↗Friedman, J. H. (2001). Greedy Function Approximation: A Gradient Boosting Machine. Annals of Statistics, 29(5), 1189–1232. DOI ↗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. link ↗
别名Bayesian XGBoost, XGBoost with Bayesian Optimization, BayesOpt-XGBoost, Bayes-tuned XGBoostGradient Boosting (GBM), GBM, gradient boosted trees, gradient boosting machineLightGBM, Light Gradient Boosting Machine, lgbm, leaf-wise gradient boosting
相关455
摘要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.
ScholarGate数据集
  1. v1
  2. 2 来源
  3. PUBLISHED
  1. v1
  2. 1 来源
  3. PUBLISHED
  1. v1
  2. 1 来源
  3. PUBLISHED

前往搜索 下载幻灯片

ScholarGate方法对比: Bayesian XGBoost · Gradient Boosting · LightGBM. 于 2026-06-18 检索自 https://scholargate.app/zh/compare