pith. sign in

arxiv: 2305.15696 · v1 · pith:EC2W6HIOnew · submitted 2023-05-25 · 💻 cs.LG

Detecting Dataset Drift and Non-IID Sampling via k-Nearest Neighbors

classification 💻 cs.LG
keywords datadetectdriftapproachcleanlabdatasetexamplesk-nearest
0
0 comments X
read the original abstract

We present a straightforward statistical test to detect certain violations of the assumption that the data are Independent and Identically Distributed (IID). The specific form of violation considered is common across real-world applications: whether the examples are ordered in the dataset such that almost adjacent examples tend to have more similar feature values (e.g. due to distributional drift, or attractive interactions between datapoints). Based on a k-Nearest Neighbors estimate, our approach can be used to audit any multivariate numeric data as well as other data types (image, text, audio, etc.) that can be numerically represented, perhaps with model embeddings. Compared with existing methods to detect drift or auto-correlation, our approach is both applicable to more types of data and also able to detect a wider variety of IID violations in practice. Code: https://github.com/cleanlab/cleanlab

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 1 Pith paper

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

  1. Reducing Class Bias In Data-Balanced Datasets Through Hardness-Based Resampling

    cs.LG 2025-04 unverdicted novelty 6.0

    Hardness-Based Resampling reduces class recall gaps in balanced datasets by up to 32% on CIFAR-10 and 16% on CIFAR-100 by prioritizing harder samples over random or frequency-based selection.