1. Guardrail rules around the model
def decide(txn, model):
# Hard policy first: never delegated to a model.
if txn.card_id in BLOCKLIST or txn.country in SANCTIONED:
return "decline", "policy:blocklist"
if txn.amount > HARD_LIMIT[txn.card_tier]:
return "review", "policy:limit"
p = model.predict_proba(features(txn))[0, 1]
if p >= T_DECLINE:
return "decline", f"model:{p:.3f}"
if p >= T_REVIEW:
return "review", f"model:{p:.3f}"
return "approve", f"model:{p:.3f}"Log the reason string for every decision: it becomes the audit trail and tells you which layer acted.
2. Eligibility filter before scoring
Score only rows the model was trained for. Rules route the rest:
if customer.tenure_days < 30:
return cold_start_rule(customer) # model has no history features yet
return model_score(customer)3. Model score inside a business rule
Stakeholders keep the rule shape they trust; the model supplies a better signal:
CASE WHEN churn_score >= 0.6 AND monthly_value >= 50 THEN 'call'
WHEN churn_score >= 0.6 THEN 'email'
ELSE 'none' END AS retention_action4. Rules for cold start, ML when data exists
New users, products or merchants lack the history a model needs. Use popularity or segment rules until a volume threshold, then switch to the model, ideally with a blended score during the transition:
w = min(1.0, n_interactions / 20)
score = w * model_score + (1 - w) * rule_score5. ML proposes rules, humans approve
- Fit a shallow tree (
rule_learner.py) or mine high-lift segments from SHAP interaction values. - Analysts review candidate rules for sense, fairness and stability.
- Approved rules enter the rule engine with an owner and an expiry date.
Good for regulated domains, and for adversarial attacks where analysts need a rule within hours.
6. Human overrides as labels
Let analysts override decisions with a reason code. Overrides:
- fix individual errors now;
- become high-value labels (disagreements with the model);
- reveal rules the model has not learned.
Monitor override rates per analyst and per segment; a rising rate is an early drift signal.
7. Champion/challenger
traffic -> hash(entity_id) % 100
0..89 -> champion (current rules) -> act
90..99 -> challenger (model + guardrails) -> act
all -> both scored and logged (shadow) -> compare offlineHash on a stable entity ID so each entity always sees one policy. Compare outcomes per arm with a pre-registered metric and duration.
8. Score bands with human review in the middle
p < 0.05 auto-approve
0.05 <= p < 0.6 human review (capacity-bound: top-K by p)
p >= 0.6 auto-decline (with reason codes)Tune the band edges from capacity and error costs; measure precision in each band.
Choosing a pattern
| Need | Pattern |
|---|---|
| Legal or safety constraint | 1 |
| Population the model does not cover | 2, 4 |
| Stakeholders need rule-shaped decisions | 3, 8 |
| Fast response to new attack patterns | 5 |
| Build trust and collect labels | 6, 7 |
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.