Piotr Wygocki

most citedImproved Feature Importance Computations for Tree Models: Shapley vs. Banzhaf

1 citations · 1 across the 3 of their papers we have counts for

collaborators

3 papers

cs.LG2021★ 1 cited

Improved Feature Importance Computations for Tree Models: Shapley vs. Banzhaf

Adam Karczmarz, Anish Mukherjee, Piotr Sankowski +1

Shapley values are one of the main tools used to explain predictions of tree ensemble models. The main alternative to Shapley values are Banzhaf values that have not been understoo…

cs.CG2017

Improved approximate near neighbor search without false negatives for $l_{2}$

Piotr Wygocki

We present a new algorithm for the $c$ --approximate nearest neighbor search without false negatives for $l_{2}^{d}$ . We enhance the dimension reduction method presented in \cite{wygos_…

cs.CG2017

Approximate nearest neighbors search without false negatives for $l_{2}$ for $c > lo g lo g n$

Piotr Sankowski, Piotr Wygocki

In this paper, we report progress on answering the open problem presented by Pagh~[14], who considered the nearest neighbor search without false negatives for the Hamming distance.…

Improved Feature Importance Computations for Tree Models: Shapley vs. Banzhaf

Improved approximate near neighbor search without false negatives for l2​

Approximate nearest neighbors search without false negatives for l2​ for c>loglogn​

Improved approximate near neighbor search without false negatives for $l_{2}$

Approximate nearest neighbors search without false negatives for $l_{2}$ for $c > lo g lo g n$