Mastering Gradient Boosting Algorithms
Chapter 1: Gradient Boosting Foundations Revisited
Ensemble Methods: A Recap
Decision Trees as Base Learners
The Additive Modeling Framework
Gradient Descent Fundamentals
Introducing the Gradient Boosting Machine (GBM)
Chapter 2: The Gradient Boosting Algorithm in Depth
Functional Gradient Descent
Deriving the Generic GBM Algorithm
Common Loss Functions for Regression
Common Loss Functions for Classification
The Role of Shrinkage (Learning Rate)
Subsampling Techniques (Stochastic Gradient Boosting)
Implementing GBM with Scikit-learn
Practice: Building a Basic GBM Model
Chapter 3: Regularization in Gradient Boosting
Overfitting Challenges in Boosting
Tree Constraints: Depth, Nodes, and Splits
Shrinkage as Implicit Regularization
Subsampling (Stochastic Gradient Boosting)
Regularized Objective Functions (L1/L2)
Early Stopping Strategies
Hands-on Practical: Applying Regularization
Chapter 4: XGBoost: Extreme Gradient Boosting
Motivation and Enhancements over GBM
The Regularized Learning Objective
Split Finding Algorithm: Exact Greedy
Split Finding Algorithm: Approximate Greedy
Sparsity-Aware Split Finding
System Optimizations: Cache Awareness and Parallelism
XGBoost API: Parameters and Configuration
Hands-on Practical: Implementing XGBoost
Chapter 5: LightGBM: Light Gradient Boosting Machine
Motivation: Addressing XGBoost's Limitations
Gradient-based One-Side Sampling (GOSS)
Exclusive Feature Bundling (EFB)
Histogram-Based Split Finding
Leaf-Wise Tree Growth
Optimized Categorical Feature Handling
LightGBM API: Parameters and Configuration
Hands-on Practical: Implementing LightGBM
Chapter 6: CatBoost: Gradient Boosting on Decision Trees
Motivation: Challenges with Categorical Data
Ordered Target Statistics (Ordered TS)
Addressing Prediction Shift: Ordered Boosting
Handling Feature Combinations
Oblivious Trees
GPU Training Acceleration
CatBoost API: Parameters and Configuration
Hands-on Practical: Implementing CatBoost
Chapter 7: Advanced Topics and Customization
Model Interpretability with SHAP
TreeSHAP for Gradient Boosting Models
Global vs. Local Explanations
Probability Calibration for Classification
Implementing Custom Loss Functions
Implementing Custom Evaluation Metrics
Handling Imbalanced Datasets with Boosting
Practice: Custom Objectives and SHAP
Chapter 8: Hyperparameter Optimization Strategies
The Importance of Hyperparameter Tuning
Identifying Critical Hyperparameters
Systematic Tuning: Grid Search and Randomized Search
Advanced Tuning: Bayesian Optimization
Hyperparameter Optimization Frameworks (Optuna, Hyperopt)
Tuning Strategy: From Coarse to Fine
Cross-Validation Strategies for Tuning
Hands-on Practical: Advanced Tuning with Optuna
Chapter 9: Gradient Boosting for Specialized Tasks
Learning to Rank with Gradient Boosting
Ranking Objective Functions (Pairwise, Listwise)
Survival Analysis with Gradient Boosting
Survival Objective Functions (Cox PH)
Quantile Regression with Gradient Boosting
Quantile Loss Function Implementation
Multi-Output Gradient Boosting
Practice: Implementing Ranking with XGBoost
Split Finding Algorithm: Approximate Greedy
Was this section helpful?
- XGBoost: A Scalable Tree Boosting System, Tianqi Chen, Carlos Guestrin, 2016 Proceedings of the 22nd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (ACM) DOI: 10.1145/2939672.2939785 - Introduces and details the approximate greedy algorithm, including the histogram-based strategy and discussions on global and local variants for split finding.
- Tree Methods, XGBoost Contributors, 2024 - Explains the
histtree method, which implements the approximate greedy algorithm using histograms, and discusses parameters influencing binning. - LightGBM: A Highly Efficient Gradient Boosting Decision Tree, Guolin Ke, Qi Meng, Thomas Finley, Taifeng Wang, Wei Chen, Weidong Ma, Qiwei Ye, and Tie-Yan Liu, 2017 Advances in Neural Information Processing Systems (NIPS) 30 (Curran Associates, Inc.) - Presents another widely used gradient boosting framework that heavily relies on optimized histogram-based algorithms for efficient split finding, providing complementary insights into the technique.