cs.LGApr 28, 2026

Measuring the Sensitivity of Classification Models with the Error Sensitivity Profile

Authors: Andrea Maurino

Organizations: Università degli studi di Milano Bicocca Dipartimento di Informatica, Sistemistica e Comunicazione Viale Sarca 336,20126 Milano, Italy

Abstract

The quality of training data is critical to the performance of machine learning models. In this paper, the Error Sensitivity Profile (ESP) is proposed. It quantifies the sensitivity of model performance to errors in a single feature or in multiple features. By leveraging ESP, data-cleaning efforts can be prioritized based on error types and features most likely to affect model performance. To support the computation of this metric, an integrated suite of tools, called \dirty, is created. We conduct an extensive experimental study on two widely used datasets using 14 classification models, revealing that performance degradation is not always predictable from simple correlations with the target variable.

Explore similar work

Jun 10, 2026cs.LG

DeMix: Debugging Training Data with Mixed Data Error Types by Investigating Influence Vectors

High-quality training data is essential for the success of machine learning models. However, real-world datasets often contain mixed types of errors arising from systematic flaws in data preparation pipelines, including label errors, feature errors, and spurious correlations. Effective debugging of training data requires both detecting erroneous samples and identifying their specific error types to enable targeted repair, yet existing data cleaning and attribution methods fail to adequately address this dual requirement. In this paper, we propose DeMix, a novel framework that simultaneously diagnoses erroneous samples and their error types. Our key insight is that different error types produce distinct patterns on model behavior. DeMix captures such error-specific patterns by influence vectors that characterize how each training sample affects model predictions across all validation samples. We formulate training data debugging as a multi-label classification problem where a classifier is developed to predict error types directly from influence vectors. We further introduce an intervention-based learning strategy that guides the classifier to capture invariant rationales specific to each error type, ensuring the learned classifier generalizes effectively. Empirical evaluations on 11 tasks across tabular data prediction, recommendation systems, and LLM alignment demonstrate that DeMix significantly outperforms state-of-the-art approaches, achieving a 22.61% improvement in data debugging F1-score and a 9.32% gain in task model performance after data repair. Code is available at: https://github.com/SJTU-DMTai/DeMix.
Jiale Deng, Yanyan Shen, Xiaogang Shi +1
Jul 28, 2026cs.AI

From Training to Deployment: Post-Hoc Causal Feature Identification via Sensitivity Ratios

Given a model that is already trained, which features does it rely on causally versus spuriously? Existing methods require access to the training procedure and cannot answer this post-hoc. We introduce the \textbf{Normalised Sensitivity Ratio~(NSR)}, a post-hoc, model-agnostic diagnostic for this question under a structured-shift regime: environments differ primarily in the mean of spurious features while the causal mechanism and causal marginals remain stable, as in multi-site clinical data or multi-batch genomics. Within this regime, causal features induce constant model sensitivity across environments while spurious features track shift. NSR formalises this as the squared coefficient of variation of per-environment sensitivity. Under a linear structural causal model (SCM) with K≥3K\ge3 non-degenerate environments, NSR achieves exact identification (Theorem~1). We fully characterise failure: weak shifts (O(ε4)O(\varepsilon^4) collapse), degenerate geometry, and proxy attenuation (O((1−α)4)O((1-α)^4)), giving practitioners quantitative criteria for assessing whether the regime holds. Finite-sample rates are Op(n−1)O_p(n^{-1}) under the null and Op(n−1/2)O_p(n^{-1/2}) under the alternative. Experiments confirm all theoretical predictions on synthetic data (area under the ROC curve [AUROC] =1.000= 1.000 under conditions satisfying the regime), show consistent rankings across five model families (Kendall τ≥0.529τ\ge0.529), and recover six of eight causal features on bike-sharing data (Precision@7 =0.75= 0.75) without modifying any trained model.
Athanasios Vlontzos, Giorgos Papanastasiou, Bernhard Kainz +1
Jul 22, 2026cs.LG

CURED: Creating, Understanding, and Repairing Errors Demonstrator

Detecting and cleaning errors in tabular data is a prerequisite for data intense software applications. Recent research at the intersection of Machine Learning (ML) and Database Management Systems (DBMS) highlights the potential of statistical learning algorithms for error detection and cleaning. This paper combines our recent work on ML-based data cleaning and error models in a unified demonstrator. The web application allows users to upload tabular data, perturb the data with realistic data dependent errors and use modern ML methods to clean and understand error mechanisms in data. Our demonstrator helps to bridge the gap between theoretical advancements and intuitive practical insights in the context of error models and data cleaning algorithms for tabular data. The demonstrator is available at https://cured.demo.calgo-lab.de/
Nicholas Chandler, Sebastian Jäger, Philipp Jung +1