LightGBM: A Highly Efficient Gradient Boosting Decision Tree

Microsoft Research (United Kingdom) · Beijing Jiaotong University · +1 more institution

Abstract

Gradient Boosting Decision Tree (GBDT) is a popular machine learning algorithm, and has quite a few effective implementations such as XGBoost and pGBRT. Although many engineering optimizations have been adopted in these implementations, the efficiency and scalability are still unsatisfactory when the feature dimension is high and data size is large. A major reason is that for each feature, they need to scan all the data instances to estimate the information gain of all possible split points, which is very time consuming. To tackle this problem, we propose two novel techniques: Gradient-based One-Side Sampling (GOSS) and Exclusive Feature Bundling (EFB). With GOSS, we exclude a significant proportion of data…

Citation impact

9,485
total citations
FWCI
263.75
Percentile
100%
References
24
Citations per year

Authors

8

Topics & keywords

Keywords
  • Decision tree
  • Gradient boosting
  • Boosting (machine learning)
  • Computer science
  • Artificial intelligence
  • Alternating decision tree
  • Machine learning
  • Incremental decision tree
UN Sustainable Development Goals
  • Peace, Justice and strong institutions
No related works found for this paper.