ScholarGate
助手

方法对比

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

鲁棒LightGBM×梯度提升(Gradient Boosting)×LightGBM×
领域机器学习机器学习机器学习
方法族Machine learningMachine learningMachine learning
起源年份2017 (LightGBM); robust variants widely adopted 2018–present20012017
提出者Ke, G. et al. (LightGBM); robust objectives adapted from Friedman, J. H.Friedman, J. H.Ke, G. et al. (Microsoft)
类型Ensemble (gradient boosted decision trees with robust loss)Ensemble (sequential boosting of decision trees)Gradient boosting decision tree ensemble
开创性文献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 ↗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 ↗
别名Robust LGBM, LightGBM with Huber loss, outlier-resistant gradient boosting, robust gradient boosted treesGradient Boosting (GBM), GBM, gradient boosted trees, gradient boosting machineLightGBM, Light Gradient Boosting Machine, lgbm, leaf-wise gradient boosting
相关655
摘要Robust LightGBM is a gradient boosting framework that pairs Microsoft's highly efficient LightGBM engine with outlier-resistant loss functions — most commonly Huber, quantile, or mean absolute error — so that predictions are not unduly distorted by extreme or erroneous observations. It retains LightGBM's speed and leaf-wise tree growth while providing resistance to heavy-tailed noise in the target variable.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方法对比: Robust LightGBM · Gradient Boosting · LightGBM. 于 2026-06-18 检索自 https://scholargate.app/zh/compare