Deep Dive into scikit-learn's HistGradientBoosting Classifier..
summary
scikit-learn implements histogram GBDT that claims comparable accuracy and training time to XGBoost CatBoost and LightGBM on large problems by using histogram binning with 255 bins, Cython kernels and Cython + OpenMP parallelism; benchmarks on the Higgs dataset (reported 88 million rows and 28 features) run on 12 cores and show similar ROC and times (tens of seconds to minutes, ~85s for 100 rounds on a laptop). native missing-values support is implemented in the dev build and the approach works in practice.
AI-written summary · about
chapters (12)
- 0:00scikit-learn and boosting intro
- 4:00Histogram gradient boosting
- 8:58Building histograms for splits
- 12:35HistGradientBoosting in scikit-learn
- 16:54Parallelizing with OpenMP
- 17:15Key hyperparameters
- 20:48Early stopping and tree growth
- 22:17Benchmarking libraries
- 24:31Live demo: verbose mode
- 25:21Missing values and roadmap
- 26:10Install and use classifier
- 27:41Q&A: binning trade-offs
related talks
31mDo You Want To Build A Forest?
18mCompetitive Analysis of the Top Gradient...
38mCatBoost - the new generation of gradient boosting
01h 33mCrunching Your Data with CatBoost - the New Gradient Boosting Library
01h 28mMastering gradient boosting with CatBoost
39mPushing Cython to its Limits in Scikit-learn
37mUnlocking the Power of Gradient-Boosted Trees (using LightGBM)
40mGradient Boosting Machines (GBM): from Zero to Hero (with R and Python code)
