Pith. sign in

Data Debugging with Shapley Importance over End-to-End Machine Learning Pipelines

1 Pith paper cite this work. Polarity classification is still indexing.

1 Pith paper citing it
abstract

Developing modern machine learning (ML) applications is data-centric, of which one fundamental challenge is to understand the influence of data quality to ML training -- "Which training examples are 'guilty' in making the trained ML model predictions inaccurate or unfair?" Modeling data influence for ML training has attracted intensive interest over the last decade, and one popular framework is to compute the Shapley value of each training example with respect to utilities such as validation accuracy and fairness of the trained ML model. Unfortunately, despite recent intensive interest and research, existing methods only consider a single ML model "in isolation" and do not consider an end-to-end ML pipeline that consists of data transformations, feature extractors, and ML training. We present DataScope (ease.ml/datascope), the first system that efficiently computes Shapley values of training examples over an end-to-end ML pipeline, and illustrate its applications in data debugging for ML training. To this end, we first develop a novel algorithmic framework that computes Shapley value over a specific family of ML pipelines that we call canonical pipelines: a positive relational algebra query followed by a K-nearest-neighbor (KNN) classifier. We show that, for many subfamilies of canonical pipelines, computing Shapley value is in PTIME, contrasting the exponential complexity of computing Shapley value in general. We then put this to practice -- given an sklearn pipeline, we approximate it with a canonical pipeline to use as a proxy. We conduct extensive experiments illustrating different use cases and utilities. Our results show that DataScope is up to four orders of magnitude faster over state-of-the-art Monte Carlo-based methods, while being comparably, and often even more, effective in data debugging.

citation-role summary

background 1

citation-polarity summary

fields

cs.IR 1

years

2025 1

verdicts

REJECT 1

roles

background 1

polarities

background 1

representative citing papers

Shapley Value-driven Data Pruning for Recommender Systems

cs.IR · 2025-05-28 · reject · novelty 4.0

SVV prunes recommender training interactions by their estimated Shapley value contribution to autoencoder loss reduction, reporting modest accuracy gains on four datasets but resting on a faulty value-function derivation.

citing papers explorer

Showing 1 of 1 citing paper.

  • Shapley Value-driven Data Pruning for Recommender Systems cs.IR · 2025-05-28 · reject · none · ref 28 · internal anchor

    SVV prunes recommender training interactions by their estimated Shapley value contribution to autoencoder loss reduction, reporting modest accuracy gains on four datasets but resting on a faulty value-function derivation.