liveBook · Manning

Convergence analysis

As explained in Machine Learning System Design

An analysis of whether an iterative training procedure approaches stable or sufficiently low loss as iterations increase.

Convergence analysis checks whether an iterative training procedure approaches stable loss and improves on established baselines. In forecasting, it becomes relevant when experimenting with gradient boosting, not with simpler baseline models. section 9.4.1

A practical convergence check asks:

  • Does the model converge as iterations increase? section 9.4.1
  • Does it beat baseline quantile loss, mean absolute percentage error, and related metrics? section 9.4.1
  • Does the curve reveal underfitting or overfitting? section 9.4.1
  • After convergence is established, select a rough tree-count grid such as 500, 1,000, 2,000, 3,000, and 5,000 trees. section 9.4.1

Retail demand forecasting

A forecasting system uses six quantile losses and corresponding models for the 1.5th, 25th, 50th, 75th, 95th, and 99th quantiles. Compare each gradient-boosting model with constant baselines, inspect loss across iterations, and fix a sufficient number of trees for later experiments. section 9.4.1

How Machine Learning System Design covers it

How deep it goes
Examines step-wise loss curves, convergence, baseline performance, and underfitting or overfitting before selecting tree counts.
Examples
Uses six retail quantile models, constant baselines, loss curves, and a 500-to-5,000-tree comparison grid.
What you can do after
Evaluate iterative models and select a sufficient number of trees after confirming convergence and baseline improvement.
How it connects
Connects learning curves with gradient boosting, quantile loss, baseline metrics, underfitting, overfitting, and model complexity.

Related concepts

This explainer was generated by Manning's knowledge graph from the text of Machine Learning System Design. The section links point to the parts of the book it draws on.