Statistical Drift Detection Methods
Statistical drift detection compares a current data sample with a trusted reference sample to find meaningful distribution changes. It turns those comparisons into signals that help you investigate data pipelines, changing populations, and model risk.
itArtificial intelligence and machine learning | OpenSkills.info
Course pathWalk it in order
Look it upDip in anytime
Go furtherLeaves this page
Intro
Statistical Drift Detection Methods
Statistical drift detection compares a reference distribution with a current distribution and asks whether their difference is larger than expected from sampling variation. In a machine learning system, the reference may be training, validation, or a known-good production window. The current sample is usually a recent batch or rolling window.
The comparison produces a statistic such as a distance, divergence, or test statistic. A decision rule then maps that statistic to an alert. The detector does not explain the cause, prove that a model has degraded, or prescribe retraining. It identifies evidence that the observed data no longer resembles the chosen baseline under the method's assumptions.
The detection path
A useful detector has six connected parts:
- Scope identifies the features, predictions, labels, or residuals to compare.
- Reference fixes the baseline distribution and its business context.
- Window selects the current observations and controls detection delay.
- Method converts the two samples into a drift score.
- Decision rule combines a threshold with minimum sample and effect-size requirements.
- Response records evidence, investigates causes, and measures model or business impact.
The reference is part of the detector, not neutral background. A training baseline answers whether production resembles training. A recent-production baseline answers whether behavior has changed since a recent period. Seasonal systems may need matched baselines, such as comparing Mondays with prior Mondays, because a static baseline can turn an expected cycle into repeated alerts.
Continue the course
This section is part of the paid course.
See pricing to subscribe, or log in if you already have access.
Where this skill leads
Relevant careers
See how this topic contributes to broader role-level skill maps.
Sources
- https://docs.evidentlyai.com/metrics/explainer_drift
Supports
- Drift detection compares current and reference distributions, with method selection depending on data type and sample size
- https://docs.evidentlyai.com/metrics/customize_data_drift
Supports
- Evidently supports K-S, chi-square, Wasserstein, Jensen-Shannon, PSI, MMD, and other configurable methods with method-specific threshold directions
- https://www.itl.nist.gov/div898/handbook/prc/section1/prc13.htm
Supports
- Statistical tests use null hypotheses, significance levels, critical regions, and p-values under stated assumptions
- https://www.itl.nist.gov/div898/handbook/prc/section1/prc131.htm
Supports
- A p-value is evaluated under the null hypothesis and is not an effect size or a posterior probability of drift
- https://docs.scipy.org/doc/scipy/reference/generated/scipy.stats.ks_2samp.html
Supports
- The two-sample K-S test compares independent one-dimensional continuous samples through empirical distribution functions
- https://www.itl.nist.gov/div898/handbook/eda/section3/eda35g.htm
Supports
- K-S is based on the maximum empirical-CDF distance and is more sensitive near the distribution center than the tails
- https://itl.nist.gov/div898/software/dataplot/refman1/auxillar/chi2samp.htm
Supports
- A chi-square two-sample test compares shared-bin counts from two samples
- https://docs.scipy.org/doc/scipy/reference/generated/scipy.stats.chi2_contingency.html
Supports
- Asymptotic chi-square p-values can be inaccurate for small contingency-table counts
- https://docs.scipy.org/doc/scipy/reference/generated/scipy.spatial.distance.jensenshannon.html
Supports
- Jensen-Shannon distance is the square root of a symmetric divergence through the midpoint distribution
- https://docs.scipy.org/doc/scipy/reference/generated/scipy.stats.wasserstein_distance.html
Supports
- Wasserstein-1 measures one-dimensional optimal transport cost and equals the area between the two CDFs
- https://www.jmlr.org/beta/papers/v13/gretton12a.html
Supports
- MMD compares distributions through mean embeddings in a reproducing kernel Hilbert space
- https://docs.evidentlyai.com/metrics/explainer_drift
Supports
- Classifier-based drift detection trains a model to distinguish current from reference observations and calibrates held-out discrimination against chance
- https://proceedings.mlr.press/v119/hinder20a.html
Supports
- Rolling and adaptive references change which temporal differences are detectable
- https://epubs.siam.org/doi/10.1137/1.9781611972771.42
Supports
- ADWIN adapts its window and provides false-positive and false-negative guarantees for changing streams
- https://riverml.xyz/latest/api/drift/ADWIN/
Supports
- River implements incremental ADWIN, KSWIN, and Page-Hinkley drift detectors
- https://nannyml.readthedocs.io/en/stable/how_it_works/univariate_drift_detection.html
Supports
- NannyML documents K-S, Jensen-Shannon, Wasserstein, Hellinger, and chi-square methods for univariate drift
- https://github.com/kelvins/awesome-mlops
Supports
- Awesome MLOps curates Evidently, NannyML, WhyLogs, Arize, Fiddler, Aporia, and related monitoring projects
- https://github.com/sindresorhus/awesome
Supports
- The Awesome master list is the discovery starting point for topic-specific curated lists
- https://docs.seldon.ai/alibi-detect/cd/methods/offline/overview
Supports
- Alibi Detect provides offline multivariate drift methods including MMD and classifier-based detectors
- https://whylogs.readthedocs.io/en/latest/
Supports
- whylogs creates mergeable statistical profiles for data logging and monitoring
- https://royalsocietypublishing.org/doi/10.1098/rspl.1899.0059
Supports
- Pearson introduced the chi-square goodness-of-fit statistic in 1900
- https://www.itl.nist.gov/div898/handbook/prc/section2/prc212.htm
Supports
- Kolmogorov's 1933 work and Smirnov's extension established the historical K-S foundation
- https://projecteuclid.org/journals/annals-of-mathematical-statistics/volume-22/issue-1/On-Information-and-Sufficiency/10.1214/aoms/1177729694.full
Supports
- Kullback and Leibler defined directed information divergence in 1951
- https://academic.oup.com/biomet/article/41/1-2/100/456463
Supports
- Page introduced a cumulative sequential inspection scheme in 1954
- https://ieeexplore.ieee.org/document/61115
Supports
- Lin introduced Jensen-Shannon divergence in 1991
- https://www.jstor.org/stable/2346101
Supports
- Benjamini and Hochberg formalized false-discovery-rate control in 1995
- https://www.researchgate.net/publication/245999704_Learning_with_Drift_Detection
Supports
- DDM was introduced in 2004 to monitor online classification error
- https://www.researchgate.net/publication/245999704_Early_Drift_Detection_Method
Supports
- EDDM was introduced in 2006 to improve detection of gradual drift using distances between errors
- https://www.evidentlyai.com/evidently-oss
Supports
- Evidently provides configurable open-source drift reports and a hosted monitoring workspace
- https://www.nannyml.com/
Supports
- NannyML connects drift diagnostics with estimated performance when ground truth is unavailable
- https://arize.com/capabilities/
Supports
- Arize combines drift monitoring with feature slicing and root-cause analysis
- https://docs.fiddler.ai/observability/platform/data-drift-platform
Supports
- Fiddler provides data-drift charts and prediction-drift impact diagnostics
- https://docs.aporia.com/
Supports
- Aporia documents configurable monitoring for data drift, performance, and integrity
- https://proceedings.mlr.press/v119/hinder20a.html
Supports
- The timeline's 2012 MMD milestone and 2020 drift-theory milestone are documented in their primary proceedings
