The decomposition
For a fixed model and data distribution, as the training set size n grows:
- the training score falls (it is harder to fit more rows), approaching the best achievable score for this model class from above;
- the validation score rises towards the same limit from below;
- the gap (train - validation) is the variance part of the error; the distance from the common limit to the perfect score is bias plus irreducible noise.
So the curve answers three questions:
| Question | Read |
|---|---|
| Does more data help? | validation slope at the largest sizes, per doubling |
| How much can more data give at most? | headroom = training score - validation score at the largest size |
| Is the model capable enough? | the training score itself: if it is already low, the model cannot fit even what it sees |
Canonical shapes
HIGH VARIANCE, DATA-LIMITED HIGH VARIANCE, FLAT HIGH BIAS
score score score
1.0 |T T T T T 1.0 |T T T T T T |
| T T | |T T T
| v v | v v v v v v | T T T T
| v v | v | v v v v v v (both low, met)
| v v |v |v
+---------------- n (log) +---------------- n +---------------- nMetric conventions
- scikit-learn scorers are higher is better; losses appear as
neg_*(e.g.neg_root_mean_squared_erroraround -35 000).diagnose_curve.pyuses that convention by default; use--lower-betterfor curves stored as positive losses. - The default gap threshold is 0.02 x max(1, |score|): two points of AUC or accuracy, 2% of an RMSE. Set
--gap-thresholdfrom what matters for the product (e.g. 0.01 AUC for a mature fraud model). - For accuracy on imbalanced data the curve can look converged at the majority-class rate: use AUC, average precision or log loss.
Common misreadings
| Misreading | Reality |
|---|---|
| "Training is 1.0, so the model is great" | memorisation; only the validation curve matters, and the gap is variance |
| "The gap is closing, so we are fine" | if both curves meet at a low score, that is bias |
| "Validation went down at the largest size, we are overfitting" | more rows cannot cause overfitting; look for drift, label noise or non-random subsets |
| "One point higher at 2x, let's collect 10x" | power laws flatten; measure again after the next doubling |
| Reading a single fold | fold noise often exceeds the gain from doubling; use the mean and its standard error |
| Comparing curves from different splitters | grouped and random splits give different curves; keep the evaluation design fixed |
| Tuning hyperparameters on each subset without saying so | the curve then mixes data effect and tuning effect |
Learning curves for special data
- Time series:
TimeSeriesSplitwithshuffle=False: the smallest size is the earliest window, so the curve also contains time drift. A falling validation curve then can mean the older rows are less relevant; test a recency-weighted or a rolling-window model. - Grouped data (customers, patients): use the number of groups, not rows, as the size you plan to collect.
- Imbalanced targets: what helps is more positives; report the number of positives at each size.
anomaly-detection-model-builder
Build and evaluate anomaly detection for tabular, sensor and transaction data with few or no labels: define the anomaly type (point, contextual, collective), choose detectors (robust z-score/MAD and IQR rules, Mahalanobis with robust covariance, k-NN distance, LOF, Isolation Forest, one-class SVM, PCA reconstruction / autoencoders, forecasting residuals for time series), combine them by rank, explain each alert by its deviating features, set thresholds from an alert budget or the score distribution, and evaluate with precision@k, PR-AUC and recall on known incidents, or detector agreement when no labels exist. Includes pure-Python detectors (robust z, Mahalanobis, kNN, Isolation Forest, ensemble) and an evaluation script.
catboost-model-builder
Build CatBoost models that use its strengths correctly: raw categorical columns as cat_features (ordered target statistics, no manual encoding), text_features, Pool construction with NaN-safe categories, ordered boosting and has_time for temporal data, symmetric (oblivious) trees, overfitting detector with eval_set and use_best_model, losses for classification, regression (Quantile, Poisson, Tweedie) and ranking (YetiRank), class weights, monotone constraints, feature importance (PredictionValuesChange, LossFunctionChange) and SHAP values, GPU training and model export. Plans cat/text/numeric columns from a CSV and generates a runnable training script, and checks parameter sets for the conflicts CatBoost rejects (iterations vs n_estimators, Bayesian bootstrap with subsample, multiple class-weight options, depth > 16, use_best_model without eval_set).
categorical-encoding-selector
Choose and implement the right encoding for every categorical column given the model family and the data: one-hot (with infrequent-level grouping and handle_unknown), ordinal with an explicit order, cross-fitted target encoding (scikit-learn TargetEncoder, CatBoost ordered statistics, category_encoders inside CV), frequency/count encoding, feature hashing, native categorical support in LightGBM, HistGradientBoosting, XGBoost and CatBoost, prefix levels for codes (zip3, NAICS-2), and embeddings. Measures cardinality, rare-level share, unseen-level rate on a time-ordered holdout and target signal per column, emits the ColumnTransformer, and quantifies target-encoding leakage (in-sample vs out-of-fold vs holdout AUC).
classification-model-selector
Choose the right classification algorithm for tabular, text or mixed data and prove the choice with a fair bake-off: logistic regression (L2, L1, elastic net), linear SVM, naive Bayes, k-NN, RBF SVM, decision trees, random forest, extra trees, HistGradientBoosting, LightGBM, XGBoost, CatBoost, explainable boosting machines (EBM/GAM), points scorecards and MLPs, matched to data size, width, categorical and high-cardinality share, missingness, class imbalance, text, and constraints such as interpretability, monotonic constraints, calibrated probabilities, latency budgets and tiny deployable models. Ranks candidates with starting hyperparameters and cautions, then generates a bake-off script running every candidate on identical CV folds with per-fold metrics, fit time and prediction latency.
clustering-algorithm-selector
Choose the right clustering algorithm and check that clustering makes sense at all: cluster tendency (Hopkins statistic with a correlated-features caveat, nearest-neighbour isolation), then k-means / MiniBatchKMeans, Gaussian mixtures with BIC, agglomerative (Ward, average, complete, single) with dendrograms, DBSCAN, HDBSCAN, OPTICS, spectral clustering, BIRCH, mean shift, k-prototypes and k-modes for mixed or categorical data, and Gower distance, matched to data size, expected shapes, noise, varying density, known k, soft memberships, hierarchy and streaming. Covers preprocessing (scaling, encoding, dimensionality, distance metrics), validation (internal indices, bootstrap stability, external labels, business profiling) and assigning new points.
collaborative-filtering-implementer
Implement collaborative filtering recommenders that beat popularity: item-based kNN with cosine, Jaccard or asymmetric similarity, shrinkage, neighbourhood size, positive-only or mean-centred rating signals and 'because you liked X' explanations; implicit ALS with confidence weighting, BPR pairwise ranking and the closed-form EASE model in plain NumPy, tuned on a temporal validation split by recall@k and NDCG@k and refit on all data; plus user-kNN, explicit matrix factorisation, the implicit/LightFM libraries, hyperparameter ranges, cold-start fallbacks, scaling with sparse matrices and approximate nearest neighbours. Produces top-k lists in the format of the recommendation evaluator.