DeRDaVa: Deletion-Robust Data Valuation for Machine Learning

Authors

  • Xiao Tian National University of Singapore
  • Rachael Hwee Ling Sim National University of Singapore
  • Jue Fan National University of Singapore
  • Bryan Kian Hsiang Low National University of Singapore

DOI:

https://doi.org/10.1609/aaai.v38i14.29462

Keywords:

ML: Transparent, Interpretable, Explainable ML, GTEP: Cooperative Game Theory

Abstract

Data valuation is concerned with determining a fair valuation of data from data sources to compensate them or to identify training examples that are the most or least useful for predictions. With the rising interest in personal data ownership and data protection regulations, model owners will likely have to fulfil more data deletion requests. This raises issues that have not been addressed by existing works: Are the data valuation scores still fair with deletions? Must the scores be expensively recomputed? The answer is no. To avoid recomputations, we propose using our data valuation framework DeRDaVa upfront for valuing each data source's contribution to preserving robust model performance after anticipated data deletions. DeRDaVa can be efficiently approximated and will assign higher values to data that are more useful or less likely to be deleted. We further generalize DeRDaVa to Risk-DeRDaVa to cater to risk-averse/seeking model owners who are concerned with the worst/best-cases model utility. We also empirically demonstrate the practicality of our solutions.

Published

2024-03-24

How to Cite

Tian, X., Sim, R. H. L., Fan , J. ., & Low, B. K. H. (2024). DeRDaVa: Deletion-Robust Data Valuation for Machine Learning. Proceedings of the AAAI Conference on Artificial Intelligence, 38(14), 15373-15381. https://doi.org/10.1609/aaai.v38i14.29462

Issue

Section

AAAI Technical Track on Machine Learning V