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

Point-in-Time Correctness

Reference for target-leakage-detector · 84 lines

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

Every feature for a row with prediction time t must be computed from data known at t: event time <= t and the data had arrived (processing time) by t.

As-of joins in pandas

python
import pandas as pd

snap = snapshots.sort_values("score_ts")          # one row per (customer_id, score_ts)
plan_hist = plan_changes.sort_values("valid_from")  # one row per change (customer_id, valid_from, plan)

out = pd.merge_asof(snap, plan_hist, left_on="score_ts", right_on="valid_from", by="customer_id",
                    direction="backward", allow_exact_matches=False)   # strictly before score_ts

allow_exact_matches=False excludes changes stamped exactly at the scoring time (often written by the same process that produces the outcome).

As-of joins in SQL (SCD type 2)

sql
SELECT s.customer_id, s.score_date, p.plan
FROM snapshots s
JOIN plan_history p
  ON p.customer_id = s.customer_id
 AND p.valid_from <= s.score_date
 AND (p.valid_to IS NULL OR p.valid_to > s.score_date);

Aggregates strictly before t

sql
SELECT s.customer_id, s.score_date,
       COUNT(e.*)                                       AS events_30d,
       MAX(e.ts)                                        AS last_event_ts
FROM snapshots s
LEFT JOIN events e
  ON e.customer_id = s.customer_id
 AND e.ts <  s.score_date
 AND e.ts >= s.score_date - INTERVAL '30 days'
GROUP BY s.customer_id, s.score_date;

pandas for event-level rows:

python
df = df.sort_values(["card_id", "ts"])
df["amount_mean_prior"] = df.groupby("card_id")["amount"].transform(lambda s: s.shift().expanding().mean())

Event time vs processing time

TermMeaning
Event timewhen the thing happened (txn_ts)
Processing / ingestion timewhen the record became available (loaded_at)
Prediction timewhen the model scores

A feature is available at prediction time only if loaded_at <= prediction_time. Batch pipelines that land yesterday's data at 06:00 mean a 02:00 score sees data up to the day before yesterday. Train with the same lag: filter on loaded_at when it exists, or shift windows by the typical latency.

Label latency for target-derived features

Features built from past labels (customer's previous chargebacks, merchant fraud rate) may use only labels known at t. A chargeback filed 60 days after a transaction is not known on day 10. Use the label's known_at timestamp, not the event's timestamp.

Snapshot tables

The most robust design: store daily/weekly snapshots of feature values as they were computed in production (feature_value, entity_id, as_of_ts). Training then reads the same values the model would have seen. Feature stores (Feast, Tecton, Databricks, SageMaker) implement point-in-time joins over such logs; see feature-store-schema-designer.

Checks

CheckHow
No future datesfor each datetime feature, share of rows where value > prediction time = 0
Snapshot replayrecompute features for a past date from raw logs and compare with what production logged
Latency respectedloaded_at <= prediction_time for all joined rows
Label-derived featuresbuilt from labels with known_at <= prediction_time
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).

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.