no code implementations • 9 Nov 2023 • Lauren Watson, Zeno Kujawa, Rayna Andreeva, Hao-Tsung Yang, Tariq Elahi, Rik Sarkar
In pre-trained networks the approach is found to bring more efficiency in terms of accurate evaluation using small subsets.
no code implementations • 1 Jun 2022 • Lauren Watson, Rayna Andreeva, Hao-Tsung Yang, Rik Sarkar
The Shapley value has been proposed as a solution to many applications in machine learning, including for equitable valuation of data.
no code implementations • 14 Mar 2022 • Peyman Afshani, Mark De Berg, Kevin Buchin, Jie Gao, Maarten Loffler, Amir Nayyeri, Benjamin Raichel, Rik Sarkar, Haotian Wang, Hao-Tsung Yang
For the Euclidean version of the problem, for instance, combining our results with known results on Euclidean TSP, yields a PTAS for approximating an optimal cyclic solution, and it yields a $(2(1-1/k)+\varepsilon)$-approximation of the optimal unrestricted solution.
2 code implementations • 11 Feb 2022 • Benedek Rozemberczki, Lauren Watson, Péter Bayer, Hao-Tsung Yang, Olivér Kiss, Sebastian Nilsson, Rik Sarkar
Over the last few years, the Shapley value, a solution concept from cooperative game theory, has found numerous applications in machine learning.
no code implementations • 5 May 2020 • Peyman Afshani, Mark De Berg, Kevin Buchin, Jie Gao, Maarten Loffler, Amir Nayyeri, Benjamin Raichel, Rik Sarkar, Haotian Wang, Hao-Tsung Yang
The problem is NP-hard, as it has the traveling salesman problem as a special case (when $k=1$ and all sites have the same weight).