按年被提到
20162016 · 1 次2026
机器学习与深度学习›贝叶斯方法与 AutoML·arXiv:1603.02754 · cs.LG

XGBoost: A Scalable Tree Boosting System

Tianqi Chen, Carlos Guestrin · 2016
开始阅读 ↗PDFalphaXiv 讨论
被提及 · 2 人首次 2016-04-05 · 最近 2018-04-26
2不同的人
2活跃月份
2讨论串
56,851被引(OpenAlex)
arXiv 摘要(候选层不写导读)

Tree boosting is a highly effective and widely used machine learning method. In this paper, we describe a scalable end-to-end tree boosting system called XGBoost, which is used widely by data scientists to achieve state-of-the-art results on many machine learning challenges. We propose a novel sparsity-aware algorithm for sparse data and weighted quantile sketch for approximate tree learning. More importantly, we provide insights on cache access patterns, data compression and sharding to build a scalable tree boosting system. By combining these insights, XGBoost scales beyond billions of examples using far fewer resources than existing systems.

候选层:至少 2 个不同的人、在 2 个不同月份提到过,还没到主书架的 3 人 3 个月。没有做立场标注,所以只写“被提及”。

HN 书评

推荐在前,同类按时间 · 每篇最多保留 20 条,统计用全部提及
评论FreakLegion · 2018-04

“For optimizations, have a look at section 3 of the XGBoost paper: https://arxiv.org/pdf/1603.02754.pdf. LightGBM has similar features (e.g. binning: http://lightgbm.readthedocs.io/en/latest/Parameters.html#io-parameters). Scikit is shockingly slow, in comparison. Also bloated, but that's more a matter of 1) not having a "release" impl that ditches data o…”

Introduction to Decision Tree Learning原评论 ↗
被提交为 story · 1 次