-
Reproducible XGBoost: seeds, pinned versions, and a validation protocol you can defend
A reproducible training run and a trustworthy validation score are related, but they are not the same guarantee.
-
Squeezing more out of XGBoost: feature engineering, custom objectives, and constraints
Once learning rate, depth, regularization, subsampling, and early stopping are sensible, another search rarely creates a step-change. The next gains usually come from changing one of three things:
-
Debugging a boosted model: learning curves, tree dumps, and plots that explain a prediction
A boosted-tree model can post an attractive validation score while still being wrong for the reasons that matter: leakage, an unrepresentative split, a brittle interaction, or one small segment carryi
-
XGBoost pitfalls: the mistakes that quietly wreck a boosted model
A boosted-tree model can look healthy while being wrong in ways ordinary metrics do not expose. It may overfit after the useful trees were built, leak the test set into tuning, scramble columns at inf
-
XGBoost in production: GPU training, out-of-core data, model persistence, and fast inference
Productionizing gradient-boosted trees is not one decision. It is a chain of decisions about compute, memory, serialization, and request handling:
-
Learning to rank with XGBoost: pairwise and listwise objectives for search and recommendations
Ranking systems do not predict items in isolation. They choose an order inside a query, session, user slate, or recommendation list.
-
Rolling windows and lag features: time series into supervised learning without leaking the future
A time series becomes a supervised-learning table when each row represents a prediction decision:
-
XGBoost vs LightGBM vs CatBoost: an honest benchmark on the same data and the same budget
Under the same 20-second CPU tuning budget, CatBoost produced the best test AUC with its first configuration , despite taking roughly 11 times longer to fit than the winning XGBoost trial. XGBoost del