The spine is the table of rows to score: entity + cutoff (+ label). Every feature is joined onto it. Getting the spine right is most of the leakage battle.
Snapshot spine (batch scoring)
-- one row per customer active on each Monday, with a 30-day label window
WITH dates AS (
SELECT d::date AS score_date
FROM generate_series('2024-01-01'::date, CURRENT_DATE - 30, INTERVAL '7 day') AS d
)
SELECT c.customer_id, d.score_date,
(EXISTS (SELECT 1 FROM cancellations x
WHERE x.customer_id = c.customer_id
AND x.cancel_date > d.score_date
AND x.cancel_date <= d.score_date + 30))::int AS churned_30d
FROM dates d
JOIN customers c
ON c.signup_date < d.score_date
AND (c.end_date IS NULL OR c.end_date > d.score_date);Rules:
- Eligibility at the cutoff: only entities you would actually score that day.
- Label windows must be fully observed (
score_date <= today − horizon). - Snapshot frequency equals scoring frequency (weekly scoring -> weekly snapshots).
Event-level spine (real-time scoring)
Each event is a row; its cutoff is its own timestamp. Features come from the entity's earlier events only;
the event itself is excluded (pit_features.py --event-level, gen_window_sql.py --event-level --id).
Labels are attached per event (fraud flag for the transaction).
Warm-up
A 90-day window is meaningless for a snapshot taken 10 days after the entity's first event, or 10 days after your event log starts. Options:
- Start snapshots after the log start + longest window.
- Keep young entities but add
tenure_days; counts will be naturally small. - Separate models for new vs established entities when behaviour differs strongly.
Snapshot frequency vs correlation
Weekly snapshots of the same customer are highly correlated:
- Cross-validate with
GroupKFold/StratifiedGroupKFoldon the entity, or by time. - Long-lived entities contribute many rows; consider weighting by 1 / snapshots_per_entity if the population of interest is entities rather than entity-weeks.
- Sample snapshots (one random date per entity per month) to cut size without losing diversity.
Negative sampling
For rare events (fraud, failures), keep all positive rows and sample negatives (e.g. 10%); record the
sampling rate and correct predicted probabilities: p = p_s / (p_s + (1 − p_s) / rate) where rate is the
negative sampling fraction. Evaluate on unsampled data.
Label alignment checklist
- Outcome window starts strictly after the cutoff (plus any gap for action time).
- Outcome window fully observed for every training row.
- Features end at the anchor (cutoff − latency).
- Entities that already had the outcome before the cutoff are excluded.
- Same spine logic is used to build the scoring table in production.
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.