5
$\begingroup$

The xgboost package and the algorithm behind it are often mentioned in data science competitions. The method is called extreme gradient boosting. I would like to learn how it differs from typical gradient boosting, but I can not find a rigorous reference for its theoretical basis on the Web. What is the right reference for xgboost?

$\endgroup$
3
  • $\begingroup$ Please consider accepting the answer referring to the xgboost paper, since it is the authoritative source for xgboost information. $\endgroup$
    – Sycorax
    Commented Feb 2, 2018 at 20:06
  • $\begingroup$ @Sycorax you mean the newer answer? $\endgroup$
    – Richi W
    Commented Feb 10, 2018 at 10:44
  • $\begingroup$ That's the one. $\endgroup$
    – Sycorax
    Commented Feb 10, 2018 at 15:40

2 Answers 2

5
$\begingroup$

Source: Tianqi Chen's Quora answer

Both xgboost and gbm follows the principle of gradient boosting. There are however, the difference in modeling details. Specifically, xgboost used a more regularized model formalization to control over-fitting, which gives it better performance.

We have updated a comprehensive tutorial on introduction to the model, which you might want to take a look at. Introduction to Boosted Trees

The name xgboost, though, actually refers to the engineering goal to push the limit of computations resources for boosted tree algorithms. Which is the reason why many people use xgboost. For model, it might be more suitable to be called as regularized gradient boosting.

$\endgroup$
3
  • $\begingroup$ Right .. this sees to be it .. I though he had written a paper about it but the regularization seems to be the key ... at least I understaood that ;) Thanks! $\endgroup$
    – Richi W
    Commented Oct 21, 2015 at 10:39
  • $\begingroup$ @Richard Glad that it helped. Those docs are really good, atleast for understanding the concept and code up some basic examples. $\endgroup$
    – Dawny33
    Commented Oct 21, 2015 at 10:41
  • 1
    $\begingroup$ @Richard Actually we do have a paper: jmlr.org/proceedings/papers/v42/chen14.pdf $\endgroup$
    – Tong He
    Commented Dec 15, 2015 at 23:28
7
$\begingroup$

There is now an arXiv article XGBoost: A Scalable Tree Boosting System that describes the algorithm. At the time of the original question and answer this had not yet been posted.

$\endgroup$

Your Answer

By clicking “Post Your Answer”, you agree to our terms of service and acknowledge you have read our privacy policy.

Not the answer you're looking for? Browse other questions tagged or ask your own question.