Search Results for author:
Found 2 papers, 2 papers with code
Efficient Task-Specific Data Valuation for Nearest Neighbor Algorithms
The most surprising result is that for unweighted $K$NN classifiers and regressors, the Shapley value of all $N$ data points can be computed, exactly, in $O(N\log N)$ time -- an exponential improvement on computational complexity!
Towards Efficient Data Valuation Based on the Shapley Value
In this paper, we study the problem of data valuation by utilizing the Shapley value, a popular notion of value which originated in cooperative game theory.
Cannot find the paper you are looking for? You can
Submit a new open access paper.
