Search Results for author:
Found 4 papers, 0 papers with code
Improved Feature Importance Computations for Tree Models: Shapley vs. Banzhaf
Using the computational techniques developed for Shapley values we deliver an optimal $O(TL+n)$ time algorithm for computing Banzhaf values based explanations.
Decomposable Submodular Function Minimization via Maximum Flow
This paper bridges discrete and continuous optimization approaches for decomposable submodular function minimization, in both the standard and parametric settings.
Space Efficient Algorithms for Breadth-Depth Search
Continuing the recent trend, in this article we design several space-efficient algorithms for two well-known graph search methods.
A Novel Minimum Divergence Approach to Robust Speaker Identification
In this work, a novel solution to the speaker identification problem is proposed through minimization of statistical divergences between the probability distribution (g).
