Class weights per library
| Library | Parameter |
|---|---|
| scikit-learn linear models, SVM, trees, forests | class_weight="balanced" (or "balanced_subsample" for forests), or a dict |
| HistGradientBoosting | class_weight="balanced" (>= 1.2) or sample_weight in fit |
| LightGBM | scale_pos_weight=neg/pos or is_unbalance=True (not both); class_weight in the sklearn API |
| XGBoost | scale_pos_weight=neg/pos; max_delta_step=1 can stabilise extreme cases |
| CatBoost | auto_class_weights="Balanced" / "SqrtBalanced", class_weights, or scale_pos_weight (one only) |
| Any estimator | sample_weight array in fit |
balanced weights each class by n / (n_classes * n_class). Square-root weighting is a milder compromise.
imbalanced-learn samplers
from imblearn.pipeline import Pipeline
from imblearn.under_sampling import RandomUnderSampler, TomekLinks, EditedNearestNeighbours, NearMiss
from imblearn.over_sampling import RandomOverSampler, SMOTE, BorderlineSMOTE, ADASYN, SMOTENC, SMOTEN
from imblearn.combine import SMOTETomek, SMOTEENN
pipe = Pipeline([("prep", prep), ("sampler", SMOTE(k_neighbors=5, random_state=0)), ("model", clf)])sampling_strategyas a float = desired minority/majority ratio after resampling; it must be larger than the current ratio for undersampling, or it raises.SMOTENChandles mixed numeric + categorical features (categorical_features=[...]);SMOTENall-categorical.- SMOTE needs numeric, scaled features (it interpolates); put it after the preprocessing step.
- Samplers in an imblearn
Pipelinerun only duringfit: validation folds are never resampled.
When resampling helps (and when it does not)
| Model | Usually |
|---|---|
| Gradient boosting | unweighted or weighted training + threshold beats SMOTE; undersampling for speed only |
| Random forest | class_weight="balanced_subsample" or balanced bagging (BalancedRandomForestClassifier) |
| Logistic regression / linear SVM | weights ≈ random oversampling; SMOTE occasionally better on dense numerics |
| k-NN | SMOTE / cleaning methods can help decision boundaries |
| Neural nets | weights or focal loss; oversampling per batch |
Always compare on identical folds with the decision metric.
Experiment template
from sklearn.model_selection import RepeatedStratifiedKFold, cross_val_score
cv = RepeatedStratifiedKFold(n_splits=5, n_repeats=3, random_state=0)
variants = {
"none": Pipeline([("prep", prep), ("model", base())]),
"weights": Pipeline([("prep", prep), ("model", base(class_weight="balanced"))]),
"under_0.2": Pipeline([("prep", prep), ("s", RandomUnderSampler(sampling_strategy=0.2, random_state=0)), ("model", base())]),
"smote": Pipeline([("prep", prep), ("s", SMOTE(random_state=0)), ("model", base())]),
}
for name, p in variants.items():
s = cross_val_score(p, X, y, cv=cv, scoring="average_precision")
print(f"{name:<10} {s.mean():.4f} ± {s.std():.4f}")Leakage reminder
Resampling before the train/test split (or before CV) puts synthetic neighbours of test rows into training
and inflates scores. target-leakage-detector's code_leak_lint.py flags it (LK002).
Undersampling for speed
With millions of negatives, keep all positives and a random 5-20% of negatives: training is much faster and ranking quality barely changes. Record the sampling rate and prior-correct probabilities afterwards.
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.