Search Results for author:
Found 4 papers, 0 papers with code
Accurate estimation of feature importance faithfulness for tree models
In this paper, we consider a perturbation-based metric of predictive faithfulness of feature rankings (or attributions) that we call PGI squared.
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.
Planar Reachability Under Single Vertex or Edge Failures
In this paper we present an efficient reachability oracle under single-edge or single-vertex failures for planar directed graphs.
Data Structures and Algorithms
