方法对比
并排查看您选择的方法；存在差异的行会高亮显示。
| 贝叶斯 LightGBM× | 梯度提升（Gradient Boosting）× | |
|---|---|---|
| 领域 | 机器学习 | 机器学习 |
| 方法族 | Machine learning | Machine learning |
| 起源年份≠ | 2017 (LightGBM); 2012 (Bayesian optimization) | 2001 |
| 提出者≠ | Ke et al. (LightGBM); Snoek et al. (Bayesian optimization) | Friedman, J. H. |
| 类型≠ | Gradient boosting 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. link ↗ | Friedman, J. H. (2001). Greedy Function Approximation: A Gradient Boosting Machine. Annals of Statistics, 29(5), 1189–1232. DOI ↗ |
| 别名 | Bayesian-tuned LightGBM, LightGBM + Bayesian optimization, BayesOpt LightGBM, LightGBM with BayesOpt | Gradient Boosting (GBM), GBM, gradient boosted trees, gradient boosting machine |
| 相关 | 5 | 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. | 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. |
| ScholarGate数据集 ↗ |
|
|