Notation: k folds, per-fold difference d_i = score_A,i − score_B,i, mean d̄, sample variance s².
Corrected resampled t-test (Nadeau & Bengio 2003)
t = d̄ / sqrt( (1/k + n_test/n_train) · s² ), df = k − 1For k-fold CV, n_test/n_train = 1/(k − 1). The ordinary paired t-test uses s²/k and ignores that training
sets overlap across folds, so it rejects far too often (inflated type I error). For repeated k-fold
(r repeats): use all r·k differences with (1/(r·k) + n_test/n_train).
import numpy as np
from scipy import stats
d = a - b; k = len(d)
t = d.mean() / np.sqrt((1 / k + 1 / (k - 1)) * d.var(ddof=1))
p = 2 * stats.t.sf(abs(t), k - 1)5x2cv paired t-test (Dietterich 1998)
Five repetitions of 2-fold CV; statistic uses the first fold's difference over the averaged variance;
df = 5. Conservative and well-calibrated; available in mlxtend.evaluate.paired_ttest_5x2cv.
Wilcoxon signed-rank
Ranks |d_i|, sums ranks of positive differences. Exact distribution for small k. With 5 folds the smallest
possible two-sided p-value is 2/32 = 0.0625: it can never reach 0.05 with 5 folds. Use 10 folds or repeated
CV if you want this test. scipy.stats.wilcoxon(d).
Friedman test and post-hoc
For K models over k folds (or datasets): rank models within each fold, average ranks R_j.
χ²_F = 12k / (K(K+1)) · Σ (R_j − (K+1)/2)², df = K − 1Then post-hoc: Nemenyi (all pairs, critical difference q_α sqrt(K(K+1)/(6k))) or pairwise tests vs a control
with Holm correction (Demšar 2006). scipy.stats.friedmanchisquare, scikit-posthocs for Nemenyi.
Bayesian correlated t-test (Corani & Benavoli 2015; Benavoli et al. 2017)
Posterior of the mean difference μ is Student-t:
μ ~ t_{k−1}( d̄, (1/k + ρ/(1−ρ)) · s² ), ρ = n_test / (n_test + n_train) (= 1/k for k-fold)Note ρ/(1−ρ) = n_test/n_train, the same correction as Nadeau-Bengio. With a region of practical equivalence
[−r, r]: P(μ > r) = A better, P(|μ| <= r) = equivalent, P(μ < −r) = B better. Decide when one probability
exceeds e.g. 0.95. Implemented in compare_models.py; also in the baycomp package.
DeLong test for correlated ROC-AUCs
AUC = mean of placement values. For each positive i: V10_i = share of negatives it outranks (ties ½); for each negative j: V01_j = share of positives that outrank it. With S10, S01 the covariance matrices of these components across the two models:
Var(AUC_A − AUC_B) = (S10_AA + S10_BB − 2 S10_AB)/m + (S01_AA + S01_BB − 2 S01_AB)/n
z = (AUC_A − AUC_B) / sqrt(Var)paired_predictions.py uses the midrank (Sun & Xu 2014) form; it matches the brute-force definition to
machine precision on the fixture.
McNemar's test
Only discordant pairs matter: b = A right & B wrong, c = A wrong & B right.
- Exact: two-sided binomial test of b vs Binomial(b + c, 0.5) (use when b + c < ~50).
- Chi-square with continuity correction:
(|b − c| − 1)² / (b + c), df 1.statsmodels.stats.contingency_tables.mcnemar([[n00, b], [c, n11]], exact=True).
Paired bootstrap
Resample test rows with replacement (stratified by class for rare positives), compute both models' metric on the same resample, record the difference; 95% CI from the 2.5/97.5 percentiles. Works for any metric (PR-AUC, log loss, recall@K, MAE). 1,000-2,000 resamples are usually enough for a CI; more for small p-values.
Choosing among them
| Situation | Primary | Secondary |
|---|---|---|
| CV, 2 models | corrected t or Bayesian correlated t | Wilcoxon (with >= 10 folds) |
| CV, many models | Friedman + Holm vs best | average ranks plot |
| Holdout, ranking | DeLong | bootstrap of PR-AUC |
| Holdout, decisions | McNemar at the operating point | bootstrap of precision@K |
| Many datasets (benchmarks) | Wilcoxon / Friedman across datasets | Bayesian hierarchical test |
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.