mlsanityData to 7 Oct 2026

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

arXiv 2204.11131 ↗First posted 23 Apr 2022cs.LG cs.AI cs.DBcited by 16

Not on the map. Why?

Abstract (arXiv)

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.

Key facts. Cited by 16 papers in the map (data through 7 Oct 2026). Builds on 30 of its 79 references that are in the map. First posted on arXiv 23 Apr 2022.

Builds on

30 of 79 references.

References · 30

  1. 2017A Unified Approach to Interpreting Model Predictionscited by 6,488
  2. 2016"Why Should I Trust You?": Explaining the Predictions of Any Classifiercited by 5,040
  3. 2017Fashion-MNIST: a Novel Image Dataset for Benchmarking Machine Learning Algorithmscited by 4,283
  4. 2017Axiomatic Attribution for Deep Networkscited by 3,350
  5. 2013Visualizing and Understanding Convolutional Networkscited by 2,278
  6. 2016Equality of Opportunity in Supervised Learningcited by 2,000
  7. 2017Understanding Black-box Predictions via Influence Functionscited by 1,714
  8. 2016Neural Architecture Search with Reinforcement Learningcited by 1,489
  9. 2017Learning Important Features Through Propagating Activation Differencescited by 1,454
  10. 2018A Survey Of Methods For Explaining Black Box Modelscited by 970
  11. 2019Data Shapley: Equitable Valuation of Data for Machine Learningcited by 617
  12. 2018Explaining Explanations: An Overview of Interpretability of Machine Learningcited by 508
18 more
  1. 2021Retiring Adult: New Datasets for Fair Machine Learningcited by 443
  2. 2017Snorkel: Rapid Training Data Creation with Weak Supervisioncited by 370
  3. 2019Towards Efficient Data Valuation Based on the Shapley Valuecited by 279
  4. 2018Horovod: fast and easy distributed deep learning in TensorFlowcited by 275
  5. 2020Explaining by Removing: A Unified Framework for Model Explanationcited by 218
  6. 2019Efficient Task-Specific Data Valuation for Nearest Neighbor Algorithmscited by 147
  7. 2019On the Accuracy of Influence Functions for Measuring Group Effectscited by 146
  8. 2019On Second-Order Group Influence Functions for Black-Box Predictionscited by 78
  9. 2015MLlib: Machine Learning in Apache Sparkcited by 55
  10. 2020Nearest Neighbor Classifiers over Incomplete Information: From Certain Answers to Certain Predictionscited by 20
  11. 2020A Tensor Compiler for Unified Machine Learning Prediction Servingcited by 19
  12. 2020Towards Scalable Dataframe Systemscited by 17
  13. 2021Distributed Learning Systems with First-order Methodscited by 17
  14. 2020Complaint-driven Training Data Debugging for Query 2.0cited by 16
  15. 2018Finding Influential Training Samples for Gradient Boosted Decision Treescited by 15
  16. 2021BAGUA: Scaling up Distributed Learning with System Relaxationscited by 13
  17. 2019Cloudy with high chance of DBMS: A 10-year prediction for Enterprise-Grade MLcited by 6
  18. 2019Data Science through the looking glass and what we found therecited by 5

Built on by

Cited by year

Citing papers per year: 2022: 4; 2023: 7; 2024: 5.

16 papers.

Sort:

By area: