Fast-DataShapley: Neural Modeling for Training Data Valuation
This addresses the need for fair and efficient data valuation in AI service platforms, but it is incremental as it builds on existing Shapley value methods with optimizations.
The paper tackles the problem of efficiently computing Shapley values for training data valuation, which is computationally expensive, by proposing Fast-DataShapley, a one-pass training method that avoids retraining for each test sample. The result shows performance improvements of over 2 times and training speed increases by two orders of magnitude on image datasets.
The value and copyright of training data are crucial in the artificial intelligence industry. Service platforms should protect data providers' legitimate rights and fairly reward them for their contributions. Shapley value, a potent tool for evaluating contributions, outperforms other methods in theory, but its computational overhead escalates exponentially with the number of data providers. Recent works based on Shapley values attempt to mitigate computation complexity by approximation algorithms. However, they need to retrain for each test sample, leading to intolerable costs. We propose Fast-DataShapley, a one-pass training method that leverages the weighted least squares characterization of the Shapley value to train a reusable explainer model with real-time reasoning speed. Given new test samples, no retraining is required to calculate the Shapley values of the training data. Additionally, we propose three methods with theoretical guarantees to reduce training overhead from two aspects: the approximate calculation of the utility function and the group calculation of the training data. We analyze time complexity to show the efficiency of our methods. The experimental evaluations on various image datasets demonstrate superior performance and efficiency compared to baselines. Specifically, the performance is improved to more than 2 times, and the explainer's training speed can be increased by two orders of magnitude.