{"id":4831,"date":"2026-10-14T11:57:39","date_gmt":"2026-10-14T11:57:39","guid":{"rendered":"https:\/\/prwatech.in\/blog\/?p=4831"},"modified":"2026-10-15T15:27:40","modified_gmt":"2026-10-15T15:27:40","slug":"boosting-techniques-in-machine-learning","status":"publish","type":"post","link":"https:\/\/prwatech.in\/blog\/machine-learning\/machine-learning-modules\/boosting-techniques-in-machine-learning\/","title":{"rendered":"Boosting Techniques in Machine Learning"},"content":{"rendered":"

Boosting Techniques in Machine Learning<\/b><\/strong><\/h1>\n

If you ask experienced data scientists which algorithm family wins most competitions on tables of data, many of them give the same answer: boosting. Methods such as XGBoost, LightGBM and CatBoost sit behind a large share of fraud detection, credit scoring, click prediction and sales forecasting systems. They are rarely the most glamorous models, but they are often the most accurate ones on structured data.<\/p>\n

The idea behind boosting is simple and rather human. A single weak model, one that is only a little better than guessing, is not much use alone. But if you train a second model that concentrates on the mistakes of the first, and a third that concentrates on the mistakes that remain, and then combine them all, the group can become very accurate. Boosting is a way of turning many weak learners into one strong learner.<\/p>\n

This guide explains how boosting works, how it differs from bagging, and then covers the five best known techniques: AdaBoost, Gradient Boosting, XGBoost, LightGBM and CatBoost. You will see a small worked example you can follow by hand, and a complete Python program that compares all five on the same data. We finish with tuning advice, applications, common mistakes and a short FAQ.<\/p>\n

What is Boosting?<\/b><\/strong><\/h2>\n

Boosting is an ensemble<\/b><\/strong>\u00a0method, which means it combines several models into one. What makes it special is that the models are built in sequence<\/b><\/strong>. Each new model is trained to fix the errors left by the models before it. When it is time to predict, the models vote or add up their outputs, usually giving stronger models more say.<\/p>\n

The base models are usually very small decision trees, sometimes only a single split, called a stump. A stump alone is a poor predictor, which is exactly the point. Boosting steadily reduces bias<\/b><\/strong>, the error that comes from a model being too simple to capture the pattern.<\/p>\n

Bagging Versus Boosting<\/b><\/strong><\/h2>\n
\n\n\n\n\n\n\n\n\n\n\n
Bagging vs boosting<\/caption>\n
Point<\/th>\nBagging<\/th>\nBoosting<\/th>\n<\/tr>\n<\/thead>\n
Main goal<\/th>\nReduce variance<\/td>\nReduce bias, step by step<\/td>\n<\/tr>\n
How models are built<\/th>\nIndependently, in parallel<\/td>\nOne after another, each fixing the last<\/td>\n<\/tr>\n
Best base models<\/th>\nStrong, complex ones such as full trees<\/td>\nWeak, simple ones such as shallow trees<\/td>\n<\/tr>\n
Data for each model<\/th>\nRandom samples of the data<\/td>\nThe same data, re weighted or fitted to the errors<\/td>\n<\/tr>\n
Famous example<\/th>\nRandom forest<\/td>\nAdaBoost, XGBoost<\/td>\n<\/tr>\n
Risk<\/th>\nLittle<\/td>\nCan overfit if run too long on noisy data<\/td>\n<\/tr>\n<\/tbody>\n<\/table>\n<\/div>\n

 <\/p>\n

The Five Boosting Techniques at a Glance<\/b><\/strong><\/h2>\n
\n\n\n\n\n\n\n\n\n\n
Boosting techniques compared<\/caption>\n
Technique<\/th>\nCore idea<\/th>\nNotable strength<\/th>\n<\/tr>\n<\/thead>\n
AdaBoost<\/th>\nRe weights the training examples so later models focus on the ones that were wrong<\/td>\nSimple, the original boosting method<\/td>\n<\/tr>\n
Gradient Boosting<\/th>\nEach new tree is fitted to the errors, called residuals, of the current model<\/td>\nFlexible, works with many loss functions<\/td>\n<\/tr>\n
XGBoost<\/th>\nAn optimised gradient boosting with built in regularisation<\/td>\nStrong accuracy, handles missing values<\/td>\n<\/tr>\n
LightGBM<\/th>\nGradient boosting that grows trees leaf by leaf and bins the data into histograms<\/td>\nVery fast on large data<\/td>\n<\/tr>\n
CatBoost<\/th>\nGradient boosting designed to handle categorical columns directly<\/td>\nNeeds little preprocessing for categories<\/td>\n<\/tr>\n<\/tbody>\n<\/table>\n<\/div>\n

1. AdaBoost<\/b><\/strong><\/h3>\n

AdaBoost, short for adaptive boosting, was introduced in 1995 by Freund and Schapire. It starts by giving every training example the same weight. After each weak model is trained, the examples it got wrong are given more weight, and the ones it got right are given less. The next model is therefore pushed to concentrate on the hard cases.<\/p>\n

Here is the process in steps:<\/p>\n

    \n
  1. Give every example an equal weight.<\/li>\n
  2. Train a weak model, usually a stump, using the weights.<\/li>\n
  3. Measure its weighted error, the share of weight on examples it got wrong.<\/li>\n
  4. Give the model a say, called alpha, that grows as its error shrinks.<\/li>\n
  5. Increase the weights of the examples it got wrong, decrease the weights of the others, and rescale so the weights add up to one.<\/li>\n
  6. Repeat for the chosen number of rounds, then combine all the models using their say.<\/li>\n<\/ol>\n

    The say of each model and the final prediction for a two class problem are:<\/p>\n

    alpha_m = 0.5 * ln( (1 – error_m) \/ error_m )<\/p>\n

    F(x) = sign( alpha_1 * f_1(x) + alpha_2 * f_2(x) + … + alpha_M * f_M(x) )<\/p>\n

    Here f_m is the m th weak model and the output of each is plus one or minus one. The sign of the weighted sum is the final class.<\/p>\n

    :<\/p>\n

    \"Boosting<\/p>\n

    To see the effect, here is a short experiment on the breast cancer dataset. A single stump is compared with AdaBoost made of stumps.<\/p>\n

    from sklearn.datasets import load_breast_cancer<\/p>\n

    from sklearn.model_selection import train_test_split<\/p>\n

    from sklearn.tree import DecisionTreeClassifier<\/p>\n

    from sklearn.ensemble import AdaBoostClassifier<\/p>\n

     <\/p>\n

    X, y = load_breast_cancer(return_X_y=True)<\/p>\n

    X_train, X_test, y_train, y_test = train_test_split(X, y, test_size=0.25, random_state=0, stratify=y)<\/p>\n

     <\/p>\n

    stump = DecisionTreeClassifier(max_depth=1).fit(X_train, y_train)<\/p>\n

    print(“One stump:”, round(stump.score(X_test, y_test), 3))<\/p>\n

    for n in [10, 50, 100]:<\/p>\n

    ada = AdaBoostClassifier(n_estimators=n, random_state=0).fit(X_train, y_train)<\/p>\n

    print(n, “rounds:”, round(ada.score(X_test, y_test), 3))<\/p>\n

    A single stump scored 0.888 on the test set. AdaBoost with only 10 rounds reached 0.944. Notice that 100 rounds did not do better here, scoring 0.930. More rounds do not always help, which is why you should check performance on data the model has not seen.<\/p>\n

    One stump: 0.888<\/p>\n

    10 rounds: 0.944<\/p>\n

    50 rounds: 0.944<\/p>\n

    100 rounds: 0.93<\/p>\n

    2. Gradient Boosting<\/b><\/strong><\/h3>\n

    Gradient boosting takes a different route to the same destination. Instead of re weighting examples, each new tree is trained to predict the residuals<\/b><\/strong>, the gap between the current prediction and the true value. Adding that correction moves the model closer to the truth. A small multiplier called the learning rate controls how big each correction is.<\/p>\n

    A tiny example makes this concrete. Suppose we want to predict weight in kilograms for five people, ordered by height, and the true values are 50, 60, 70, 80 and 90.<\/p>\n

      \n
    • <\/b>Start with the average.<\/b><\/strong>Predict 70 for everyone. The residuals are minus 20, minus 10, 0, 10 and 20.<\/li>\n
    • <\/b>Fit a small tree to the residuals.<\/b><\/strong>A single split on height puts the two shortest people in one group, with an average residual of minus 15, and the three taller people in the other, with an average residual of plus 10.<\/li>\n
    • <\/b>Add a fraction of the correction.<\/b><\/strong>With a learning rate of 0.5, the first two people are now predicted at 62.5 and the other three at 75.<\/li>\n
    • <\/b>Check the improvement.<\/b><\/strong>The total squared error falls from 1,000 to 437.5.<\/li>\n<\/ul>\n

      The next tree is then fitted to the new residuals, and the process repeats. After enough rounds the predictions are close to the truth.<\/p>\n

      For large datasets, scikit learn recommends HistGradientBoostingClassifier, which is far faster than the classic GradientBoostingClassifier and handles missing values. For small datasets, the classic version is fine.<\/p>\n

      3. XGBoost<\/b><\/strong><\/h3>\n

      XGBoost, short for extreme gradient boosting, is a carefully engineered version of gradient boosting. Its key additions are regularisation, which penalises overly complex trees so they overfit less, built in handling of missing values, and an efficient implementation that uses all your processor cores. It is often much faster than older gradient boosting code, though how much depends on your data.<\/p>\n

      4. LightGBM<\/b><\/strong><\/h3>\n

      LightGBM, from Microsoft, makes boosting fast on big data. It groups feature values into histogram bins, and it grows each tree leaf wise<\/b><\/strong>, always splitting the leaf that reduces the error the most, instead of growing level by level. That gets accuracy quickly, but it can overfit on small datasets. If your data is small, limit the tree size with the num_leaves, max_depth and min_child_samples settings.<\/p>\n

      5. CatBoost<\/b><\/strong><\/h3>\n

      CatBoost, from Yandex, is built for data that has many categorical columns, such as city, product type or customer segment. It can take those columns directly, with no need to turn them into numbers by hand, and it uses a technique called ordered boosting to reduce a problem known as target leakage. It often gives good results with little tuning.<\/p>\n

      Comparing All Five on the Same Data<\/b><\/strong><\/h2>\n

      The page this guide replaces compared methods using different datasets, which makes the scores meaningless. Here is a fair comparison. Every model sees the same training and test split of the breast cancer dataset, and all use 100 trees and a learning rate of 0.1 where the setting applies. First install the libraries:<\/p>\n

      pip install scikit-learn xgboost lightgbm catboost<\/p>\n

      from sklearn.datasets import load_breast_cancer<\/p>\n

      from sklearn.model_selection import train_test_split<\/p>\n

      from sklearn.metrics import accuracy_score<\/p>\n

      from sklearn.ensemble import AdaBoostClassifier, GradientBoostingClassifier<\/p>\n

      from xgboost import XGBClassifier<\/p>\n

      from lightgbm import LGBMClassifier<\/p>\n

      from catboost import CatBoostClassifier<\/p>\n

       <\/p>\n

      X, y = load_breast_cancer(return_X_y=True)<\/p>\n

      X_train, X_test, y_train, y_test = train_test_split(<\/p>\n

      X, y, test_size=0.25, random_state=0, stratify=y<\/p>\n

      )<\/p>\n

       <\/p>\n

      models = {<\/p>\n

      “AdaBoost”: AdaBoostClassifier(n_estimators=100, random_state=0),<\/p>\n

      “Gradient Boosting”: GradientBoostingClassifier(n_estimators=100, learning_rate=0.1, random_state=0),<\/p>\n

      “XGBoost”: XGBClassifier(n_estimators=100, learning_rate=0.1, random_state=0),<\/p>\n

      “LightGBM”: LGBMClassifier(n_estimators=100, learning_rate=0.1, random_state=0, verbose=-1),<\/p>\n

      “CatBoost”: CatBoostClassifier(iterations=100, learning_rate=0.1, random_seed=0, verbose=0),<\/p>\n

      }<\/p>\n

       <\/p>\n

      for name, model in models.items():<\/p>\n

      model.fit(X_train, y_train)<\/p>\n

      accuracy = accuracy_score(y_test, model.predict(X_test))<\/p>\n

      print(f”{name}: {accuracy:.3f}”)<\/p>\n

      When I ran it, the output was:<\/p>\n

      AdaBoost: 0.930<\/p>\n

      Gradient Boosting: 0.958<\/p>\n

      XGBoost: 0.951<\/p>\n

      LightGBM: 0.944<\/p>\n

      CatBoost: 0.944<\/p>\n

      All five land within about three percentage points of each other. On a test set of 143 patients, a single patient changes the score by 0.7 points, so you should not declare a winner from this table. On real projects, use cross validation and compare on your own data. The practical lesson is that boosting methods are all strong, and the best one depends on your data.<\/p>\n

      Which Boosting Method Should You Use?<\/b><\/strong><\/h2>\n
      \n\n\n\n\n\n\n\n\n\n
      Which boosting method to try first<\/caption>\n
      Your situation<\/th>\nTry first<\/th>\n<\/tr>\n<\/thead>\n
      Learning the idea, small data<\/th>\nAdaBoost or classic Gradient Boosting<\/td>\n<\/tr>\n
      Tabular data with up to a few hundred thousand rows<\/th>\nXGBoost or HistGradientBoosting<\/td>\n<\/tr>\n
      Millions of rows, speed matters<\/th>\nLightGBM<\/td>\n<\/tr>\n
      Many categorical columns<\/th>\nCatBoost<\/td>\n<\/tr>\n
      You want a strong default with little tuning<\/th>\nCatBoost or HistGradientBoosting<\/td>\n<\/tr>\n<\/tbody>\n<\/table>\n<\/div>\n

      Tuning Boosting Models<\/b><\/strong><\/h2>\n
        \n
      • <\/b>Learning rate and number of trees go together. <\/b><\/strong>Smaller learning rates need more trees to reach the same fit, and usually generalise better. Scikit learn suggests a learning rate of 0.1 or lower, with enough trees that early stopping decides when to halt.<\/li>\n
      • <\/b>Use early stopping. <\/b><\/strong>Hold back some data and stop adding trees when the score on it stops improving.<\/li>\n
      • <\/b>Keep trees small. <\/b><\/strong>Shallow trees are the point of boosting. Deep trees overfit faster.<\/li>\n
      • <\/b>Subsample the rows. <\/b><\/strong>Training each tree on a fraction of the data, such as half, often improves accuracy when combined with a small learning rate.<\/li>\n
      • <\/b><\/b>Use the penalty settings in XGBoost, LightGBM and CatBoost to keep trees simple.<\/li>\n<\/ul>\n

        Applications of Boosting<\/b><\/strong><\/h2>\n
          \n
        • <\/b>Credit scoring and fraud detection. <\/b><\/strong>Boosted trees are common in banking.<\/li>\n
        • <\/b>Click and conversion prediction. <\/b><\/strong>Ranking ads and recommendations.<\/li>\n
        • <\/b>Demand and sales forecasting. <\/b><\/strong>Predicting numbers from tables of past data.<\/li>\n
        • <\/b>Customer churn and employee attrition. <\/b><\/strong>Finding who is likely to leave.<\/li>\n
        • <\/b>Search ranking. <\/b><\/strong>Many ranking systems use boosted trees.<\/li>\n
        • <\/b>Healthcare risk models. <\/b><\/strong>Predicting outcomes from patient measurements.<\/li>\n<\/ul>\n