XGBoost: A Scalable Tree Boosting System
Tianqi Chen and Carlos Guestrin submitted XGBoost: A Scalable Tree Boosting System to arXiv on March 9, 2016. The paper describes XGBoost as a scalable end-to-end tree boosting system and presents a sparsity-aware algorithm, a weighted quantile sketch for approximate tree learning, and systems techniques for scaling beyond billions of examples.
Historical classification
This verified record belongs to LINEAiGE's artificial-intelligence history layer beginning in 1956.
Why it matters
A documented machine-learning systems milestone for scalable gradient tree boosting, with the paper describing algorithmic and systems techniques designed for sparse and very large datasets.
People, organizations & technologies
PEOPLE
Tianqi Chen, Carlos Guestrin
ORGANIZATIONS
University of Washington
TECHNOLOGIES
XGBoost, Tree boosting
Evidence & verification
STATE
verified
CONFIDENCE
high
LAST VERIFIED
2026-09-11T06:04:52+08:00
Title, authors, March 9 2016 initial arXiv submission date, and the recorded technical description are supported by the original arXiv record. The ACM KDD proceedings independently corroborate the authors, paper title, University of Washington affiliation, and later August 13 2016 proceedings publication. This candidate records only the arXiv paper-submission milestone and does not treat the conference publication date as a system-birth date.
Sources
XGBoost: A Scalable Tree Boosting System
arXiv
PUBLISHED
2016-03-09
XGBoost: A Scalable Tree Boosting System
Association for Computing Machinery
PUBLISHED
2016-08-13
Trace the chronology
Record identity
LINEAiGE IDxgboost-2016