Skip to content
v0.1.3latest release121 skills4 categories6 sub-categories247 tested scripts397 reference docsContact us

Target Encoding and Leakage

Reference for categorical-encoding-selector · 91 lines

AI & Machine Learning / Classical Machine Learningv1.0.0Updated OCT 25 20264 references2 scripts

Why in-sample encoding leaks

A level seen once with y = 1 gets encoding 1.0; the model learns "encoding 1.0 -> positive". Every singleton level now predicts its own label perfectly in training and in any CV where the encoding was computed before splitting. In production a new row with that level has its own (unknown) label, so the signal disappears.

Even with many rows per level, including the row's own label biases the encoding toward it, and models (especially GBMs) amplify the bias.

Smoothing

text
enc(level) = (n · mean(level) + m · prior) / (n + m)
  • m = 0: raw mean (maximum leakage for small n).
  • Large m: everything collapses to the prior.
  • Choose m by CV, or use empirical Bayes: TargetEncoder(smooth="auto") sets the shrinkage per level from the ratio of within-level variance to between-level variance.

Smoothing reduces but does not remove leakage; cross-fitting removes it.

Cross-fitting (out-of-fold encoding)

text
for each fold k:
    fit the level -> mean mapping on rows not in fold k
    encode rows in fold k with it
final mapping for test/production = fit on all training rows

scikit-learn's TargetEncoder.fit_transform(X, y) does exactly this (cv=5 by default); calling fit(X, y).transform(X) instead does not cross-fit, so always use fit_transform on training data (a Pipeline does this automatically).

python
from sklearn.pipeline import make_pipeline
from sklearn.compose import ColumnTransformer
from sklearn.preprocessing import TargetEncoder
from sklearn.linear_model import LogisticRegression

prep = ColumnTransformer([("te", TargetEncoder(smooth="auto"), ["merchant", "zip3"])], remainder="passthrough")
model = make_pipeline(prep, LogisticRegression(max_iter=2000))
# cross_val_score(model, X, y, cv=...) refits the encoder inside every outer fold: honest evaluation.

Nested structure

Two levels of folds exist:

  • Outer CV (model evaluation): the encoder is refitted on each outer training fold.
  • Inner cross-fitting (inside fit_transform): produces leakage-free training features within that fold.

Fitting the encoder once on all data and then running CV leaks the evaluation folds' labels into training features: the CV score is optimistic.

Time-aware encoding

When rows are events in time, encode each row from earlier rows only (expanding mean per level), which is also how production works:

python
df = df.sort_values("ts")
g = df.groupby("merchant")["is_fraud"]
prior = df["is_fraud"].mean()
cum_sum = g.cumsum() - df["is_fraud"]          # exclude the current row
cum_n = g.cumcount()
m = 20
df["merchant_te_time"] = (cum_sum + m * prior) / (cum_n + m)

Strictly, use only labels that were known at the row's time (respect label delay).

Multiclass and regression targets

  • Multiclass: one column per class with P(class | level) (sklearn target_type="multiclass").
  • Regression: mean target per level; consider the median or a log-target mean for skewed targets.

Diagnosing leakage

  1. te_leakage_check.py: in-sample vs out-of-fold vs holdout single-feature AUC.
  2. Compare CV score with a time-ordered holdout score; a large gap with target-encoded features is a red flag.
  3. Importance check: a target-encoded high-cardinality column at the top of importance with a much weaker holdout effect.

Low-cardinality note

For a column with few levels and many rows per level, in-sample optimism is small. Out-of-fold encodings of pure-noise columns can even give AUC below 0.5 (leaving out a fold shifts each level's mean away from that fold's labels), so small gaps there are not alarming. The danger grows as rows per level fall below ~50.

More in Classical Machine Learning

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).

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.

counterfactual-explanation-generator

Generate counterfactual explanations and algorithmic recourse: the smallest realistic change to a row's features that changes the model's decision. Solves exact minimal-cost recourse for linear and logistic models (MAD-scaled L1 cost, immutable features, increase/decrease directions, bounds, integer and binary features, diverse alternatives, features every counterfactual must change, and a no-recourse finding when immutable features decide), generates DiCE counterfactuals for any scikit-learn model with constraints turned into permitted ranges and every result re-predicted, and validates counterfactuals from any method for constraint violations, implausible values, off-manifold rows, broken derived-feature relations and failure to flip the prediction.