ScholarGate
助手

方法对比

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

正则化 LightGBM×XGBoost×
领域机器学习机器学习
方法族Machine learningMachine learning
起源年份20172016
提出者Ke, G. et al. (Microsoft Research)Chen, T. & Guestrin, C.
类型Regularized gradient boosting ensembleEnsemble (gradient-boosted 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. Advances in Neural Information Processing Systems, 30, 3146–3154. link ↗Chen, T. & Guestrin, C. (2016). XGBoost: A Scalable Tree Boosting System. Proceedings of the 22nd ACM SIGKDD, 785–794. DOI ↗
别名LightGBM with L1/L2 regularization, penalized LightGBM, LightGBM ridge/lasso, regularized LGBMXGBoost, extreme gradient boosting, scalable tree boosting
相关55
摘要Regularized LightGBM applies L1 (lasso) and L2 (ridge) penalty terms to the leaf weight objective of LightGBM — Microsoft's highly efficient gradient boosting framework — to control model complexity, reduce overfitting, and improve generalization on tabular classification and regression tasks with high-dimensional or noisy feature sets.XGBoost (Extreme Gradient Boosting) is a scalable tree-boosting algorithm introduced by Tianqi Chen and Carlos Guestrin in 2016. It builds a strong predictor by adding decision trees one at a time, each correcting the errors left by the trees before it, and is a powerful prediction method widely used in competitions.
ScholarGate数据集
  1. v1
  2. 2 来源
  3. PUBLISHED
  1. v1
  2. 1 来源
  3. PUBLISHED

前往搜索 下载幻灯片

ScholarGate方法对比: Regularized LightGBM · XGBoost. 于 2026-06-17 检索自 https://scholargate.app/zh/compare