liveBook · Manning

Gradient-based one-side sampling

As explained in Machine Learning for Tabular Data: XGBoost, Deep Learning, and AI

Gradient-based one-side sampling is a sampling algorithm that retains examples with the largest gradients and randomly samples examples with smaller gradients using corrective weights.

Gradient-based one-side sampling (GOSS) speeds gradient boosting by reducing the number of training examples processed. It preserves examples with the largest gradients, which carry stronger learning signals, while randomly sampling examples with smaller gradients and applying corrective weights. section 5.5.2

Use GOSS to balance training speed against predictive performance:

  • Reduce row-processing cost when datasets contain many training examples. section 5.5.2
  • Avoid excessive sampling, which can harm training and decrease predictive performance. section 5.5.2
  • Distinguish row sampling from column reduction: GOSS reduces examples, whereas EFB reduces feature dimensionality. section 5.5.2

How Machine Learning for Tabular Data: XGBoost, Deep Learning, and AI covers it

How deep it goes
Explains gradient-prioritized sampling and its accuracy trade-off without detailing the weighting procedure or implementation.
Examples
Contrasts retaining large-gradient examples with randomly sampling smaller-gradient examples.
What you can do after
Apply it through LightGBM to reduce processed training examples while monitoring predictive-performance effects.
How it connects
Connects gradient boosting with stochastic sampling, row reduction, LightGBM, and Exclusive Feature Bundling.

Also explained in

Compare how 2 books explain gradient-based one-side sampling →

Related concepts

This explainer was generated by Manning's knowledge graph from the text of Machine Learning for Tabular Data: XGBoost, Deep Learning, and AI. The section links point to the parts of the book it draws on.