Gradient Boosted Decision Trees
simonwardjones.co.uk
Gradient Boosted Decision Trees
1–8 of 8 posts
Re: Gradient Boosted Decision Trees
#2Re: Gradient Boosted Decision Trees
#3Re: Gradient Boosted Decision Trees
#4https://github.com/microsoft/LightGBM/blob/master/docs/Featu...
Re: Gradient Boosted Decision Trees
#5Why not also predict the error of the error prediction, and correct for that too? /s
Re: Gradient Boosted Decision Trees
#6Re: Gradient Boosted Decision Trees
#7Nice write-up! Any info under what circumstances gradient boosted trees behave better versus traditional random forests?
random forest is less prone to over fitting as each tree in the ensemble is independent, if the base tree doesn't over fit then a random Forest of them also will not over fit. Whereas trees in a boosted model are not independent, boosting trains a sequence of models where model n depends on the previous models.
This is a double edged sword: you can probably get better predictive accuracy with boosting if you have enough data & have controls to prevent over fitting. Whereas a random forest is much more idiot proof to over fitting but it will not perform as well as a boosted model trained but not overfit on a large dataset.
Re: Gradient Boosted Decision Trees
#8What other ML topics do you plan to cover, Simon?