Optimizing Data Shapley Interaction Calculation from O(2^n) to O(t n^2) for KNN models

Add code
Apr 02, 2023
Mohamed Karim Belaid, Dorra El Mekki, Maximilian Rabus, Eyke Hüllermeier
Figure 1 for Optimizing Data Shapley Interaction Calculation from O(2^n) to O(t n^2) for KNN models
Figure 2 for Optimizing Data Shapley Interaction Calculation from O(2^n) to O(t n^2) for KNN models
Figure 3 for Optimizing Data Shapley Interaction Calculation from O(2^n) to O(t n^2) for KNN models
Figure 4 for Optimizing Data Shapley Interaction Calculation from O(2^n) to O(t n^2) for KNN models

Share this with someone who'll enjoy it:

Twitter IconFacebook IconLinkedin IconWhatsapp IconMessenger Icon

With the rapid growth of data availability and usage, quantifying the added value of each training data point has become a crucial process in the field of artificial intelligence. The Shapley values have been recognized as an effective method for data valuation, enabling efficient training set summarization, acquisition, and outlier removal. In this paper, we introduce "STI-KNN", an innovative algorithm that calculates the exact pair-interaction Shapley values for KNN models in O(t n^2) time, which is a significant improvement over the O(2^n)$ time complexity of baseline methods. By using STI-KNN, we can efficiently and accurately evaluate the value of individual data points, leading to improved training outcomes and ultimately enhancing the effectiveness of artificial intelligence applications.

View paper onarxiv icon

Share this with someone who'll enjoy it:

Twitter IconFacebook IconLinkedin IconWhatsapp IconMessenger Icon