Pith. sign in

REVIEW 3 cited by

Automatically detecting data drift in machine learning classifiers

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2111.05672 v1 pith:VNJLZO4Y submitted 2021-11-10 cs.LG

classification cs.LG
keywords datadriftconfidenceapproachperformancestatisticalclassifiersdetecting
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

Classifiers and other statistics-based machine learning (ML) techniques generalize, or learn, based on various statistical properties of the training data. The assumption underlying statistical ML resulting in theoretical or empirical performance guarantees is that the distribution of the training data is representative of the production data distribution. This assumption often breaks; for instance, statistical distributions of the data may change. We term changes that affect ML performance `data drift' or `drift'. Many classification techniques compute a measure of confidence in their results. This measure might not reflect the actual ML performance. A famous example is the Panda picture that is correctly classified as such with a confidence of about 60\%, but when noise is added it is incorrectly classified as a Gibbon with a confidence of above 99\%. However, the work we report on here suggests that a classifier's measure of confidence can be used for the purpose of detecting data drift. We propose an approach based solely on classifier suggested labels and its confidence in them, for alerting on data distribution or feature space changes that are likely to cause data drift. Our approach identities degradation in model performance and does not require labeling of data in production which is often lacking or delayed. Our experiments with three different data sets and classifiers demonstrate the effectiveness of this approach in detecting data drift. This is especially encouraging as the classification itself may or may not be correct and no model input data is required. We further explore the statistical approach of sequential change-point tests to automatically determine the amount of data needed in order to identify drift while controlling the false positive rate (Type-1 error).

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 3 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Enhancing Deployment-Time Predictive Model Robustness for Code Analysis and Optimization

    cs.SE 2024-12 conditional novelty 6.0 of 10

    Prom detects deployment-time data drift in ML models for code analysis and optimization by combining weighted conformal prediction with ensemble voting, and shows that retraining on fewer than 5% of flagged samples re...

  2. Drift Happens: An Empirical Study of Neural Architecture Robustness to Temporal Distribution Shift

    cs.LG 2026-07 conditional novelty 5.0 of 10

    Architectures with stronger inductive biases attain higher in-distribution accuracy but degrade faster under temporal distribution shift, while frozen pretrained encoders trade accuracy for stability.

  3. Privacy Drift: Evolving Privacy Concerns in Incremental Learning

    cs.LG 2024-12 conditional novelty 4.0 of 10

    Privacy drift, the change in membership inference risk during incremental training, correlates strongly with training accuracy across centralized and federated settings.

Pith tools