ScholarGate
Trợ lý

So sánh phương pháp

Xem các phương pháp đã chọn cạnh nhau; những hàng khác biệt được làm nổi bật.

Robust LightGBM×XGBoost×
Lĩnh vựcHọc máyHọc máy
HọMachine learningMachine learning
Năm ra đời2017 (LightGBM); robust variants widely adopted 2018–present2016
Người khởi xướngKe, G. et al. (LightGBM); robust objectives adapted from Friedman, J. H.Chen, T. & Guestrin, C.
LoạiEnsemble (gradient boosted decision trees with robust loss)Ensemble (gradient-boosted decision trees)
Công trình gốcKe, 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 ↗
Tên gọi khácRobust LGBM, LightGBM with Huber loss, outlier-resistant gradient boosting, robust gradient boosted treesXGBoost, extreme gradient boosting, scalable tree boosting
Liên quan65
Tóm tắtRobust 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.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.
ScholarGateBộ dữ liệu
  1. v1
  2. 2 Nguồn tài liệu
  3. PUBLISHED
  1. v1
  2. 1 Nguồn tài liệu
  3. PUBLISHED

Đến trang tìm kiếm Tải xuống bản trình chiếu

ScholarGateSo sánh phương pháp: Robust LightGBM · XGBoost. Truy cập ngày 2026-06-17 từ https://scholargate.app/vi/compare