XGBoost
XGBoost is an open-source software library for efficient, scalable gradient-boosted decision-tree algorithms.
Machine Learning for Tabular Data: XGBoost, Deep Learning, and AI
A predictive model trained using XGBoost's gradient-boosted decision-tree algorithms.
- How it is used
- Applies gradient-boosted trees as a strong baseline for tabular classification and regression prediction.
- How deep it goes
- Explains APIs, parallel training, split algorithms, missing-value routing, growth policies, GPU use, and tree-structure extraction.
- Examples
- Uses Airbnb New York classification and Tokyo price regression, plus histogram-split timing and exported tree paths.
- What you can do after
- Apply it via the Scikit-learn API to train, cross-validate, evaluate, accelerate, and inspect tabular prediction models.
Read how Machine Learning for Tabular Data: XGBoost, Deep Learning, and AI explains XGBoost →
Ensemble Methods for Machine Learning
XGBoost is an open-source machine-learning library implementing scalable gradient-boosted decision-tree algorithms.
- How it is used
- Applies tree-based Newton boosting to scalable classification, regression, ranking, and custom-loss tasks.
- How deep it goes
- Explains regularized tree learning and tuning, while deferring block-based system-design details.
- Examples
- Uses multiclass document retrieval, pseudo-Huber regression, and bike-rental prediction with randomized hyperparameter search.
- What you can do after
- Apply it via XGBClassifier or XGBRegressor with randomized cross-validation, regularization, and evaluation-based early stopping.
Read how Ensemble Methods for Machine Learning explains XGBoost →
Grokking Machine Learning
An open-source software library that implements optimized gradient-boosted decision trees for machine-learning tasks.
- How it is used
- Deploys boosted decision-tree ensembles for regression and classification tasks.
- How deep it goes
- Explains residual fitting, similarity scores, split selection, pruning, learning rates, predictions, and a Python configuration.
- Examples
- Uses app engagement by age, residual tables, tree diagrams, pruning comparisons, prediction plots, and an XGBRegressor listing.
- What you can do after
- Apply XGBoost via the xgboost package and inspect how successive trees reduce residual errors.
Machine Learning Platform Engineering
An XGBoost model is a gradient-boosted decision-tree model trained using the XGBoost algorithm.
- How it is used
- Supports production-oriented model comparison by tracking XGBoost datasets, parameters, metrics, models, and artifacts with MLflow.
- How deep it goes
- Demonstrates DMatrix construction, binary objectives, hyperparameters, boosting rounds, predictions, and feature-importance plots.
- Examples
- Uses income-classifier train/test datasets, binary logistic and hinge objectives, prediction outputs, and importance plots.
- What you can do after
- Apply it via XGBoost and MLflow to train, inspect, and automatically record a binary classification model.
Read how Machine Learning Platform Engineering explains XGBoost →
Build AI Drug Discovery Pipelines
XGBoost is a gradient-boosting implementation designed for efficient and high-performing supervised learning.
- How it is used
- Applies sequential tree ensembles to supervised drug-discovery prediction, including small-molecule binding to an RNA target.
- How deep it goes
- Explains weak learners, sequential error correction, and loss-guided updates, but stops before implementation details.
- Examples
- Uses RNA-target compound binding, a drug-discovery scientist analogy, and feature importance measured by gain, coverage, and frequency.
- What you can do after
- Evaluate/understand how sequential weak learners reduce boosting bias while preserving ensemble generalization.
Read how Build AI Drug Discovery Pipelines explains XGBoost →
Delivering Machine Learning Projects: From design to deployment
XGBoost is an open-source implementation of gradient-boosted decision trees for efficient supervised learning.
- How it is used
- Deploys gradient-boosted trees for robust tabular modeling, baseline comparison, or denoising before explainable modeling.
- How deep it goes
- Explains practical strengths, interpretability costs, and data-type limitations without detailing boosting mechanics or implementation steps.
- Examples
- Uses XGBoost as a tabular-data model, a denoiser for simpler models, and a baseline for explainability costs.
- What you can do after
- Apply it to tabular prediction, benchmark explainable alternatives, or filter noise before simpler modeling.
Read how Delivering Machine Learning Projects: From design to deployment explains XGBoost →
Financial AI in Practice
XGBoost is an open-source software library for gradient-boosted decision trees.
- How it is used
- Uses XGBoost as a baseline tree-based model within a manual WoE credit-scoring pipeline.
- How deep it goes
- Places XGBoost after WoE feature transformation but does not detail its training mechanics.
- Examples
- Applies XGBoost to WoE-coded features in a credit-default workflow with a 100,000-row, 919-column dataset.
- What you can do after
- Apply XGBoost as a baseline classifier on WoE-transformed credit features and evaluate it with cross-validation and confusion matrices.
Also covered in
- Graph Neural Networks in Action
- Cyber Threat Hunting
- Outlier Detection in Python
- Fight Fraud with Machine LearningIn early access (MEAP)
What to know first
- decision treeA decision tree is a tree-structured model or representation in which successive tests or choices lead through branches to outcomes, predictions, or actions.
- random forestA random forest is an ensemble learning model that aggregates predictions from multiple decision trees trained with randomized data samples, feature subsets, or both.
- overfittingOverfitting is a modeling condition in which a model adapts too closely to particular data, including its noise or idiosyncrasies, and consequently generalizes poorly to new data.
- classifierA classifier is a predictive model that assigns an input to one or more discrete classes or categories.
Related concepts
- gradient boostingimplements · Gradient boosting is an ensemble-learning technique that sequentially adds predictive models fitted to reduce a loss by following its gradient.
- decision treeuses · A decision tree is a tree-structured model or representation in which successive tests or choices lead through branches to outcomes, predictions, or actions.
- early stoppinguses · Early stopping is a technique that terminates an iterative process before its planned completion when a specified condition indicates that further work is unnecessary or unlikely to improve the objective.
- LightGBMcontrasts with · LightGBM is an open-source gradient-boosting framework for efficiently training tree-based machine-learning models.
- weighted quantile sketchuses · A weighted quantile sketch is an approximate algorithm for estimating quantiles or quantile-based split points while accounting for item weights.
Questions about XGBoost
What is XGBoost?
XGBoost is an open-source software library for efficient, scalable gradient-boosted decision-tree algorithms.
Which Manning books explain XGBoost?
Machine Learning for Tabular Data: XGBoost, Deep Learning, and AI, Ensemble Methods for Machine Learning, Grokking Machine Learning, Machine Learning Platform Engineering, Build AI Drug Discovery Pipelines, Delivering Machine Learning Projects: From design to deployment and Financial AI in Practice.
What should I know before learning XGBoost?
Manning books that teach XGBoost usually introduce decision tree, random forest, overfitting and classifier first.
What is the difference between XGBoost and LightGBM?
XGBoost is an open-source software library for efficient, scalable gradient-boosted decision-tree algorithms. LightGBM is an open-source gradient-boosting framework for efficiently training tree-based machine-learning models.
What is XGBoost also called?
XGBoost is also called Extreme Gradient Boosting.
These guides are generated from the text of Manning books by Manning's knowledge graph and link to the sections they draw on. The full books are available on liveBook and at manning.com.






