Search Results for author:
Found 3 papers, 0 papers with code
KernelSHAP-IQ: Weighted Least-Square Optimization for Shapley Interactions
As a result, we propose KernelSHAP-IQ, a direct extension of KernelSHAP for SII, and demonstrate state-of-the-art performance for feature interactions.
Approximating the Shapley Value without Marginal Contributions
The Shapley value, which is arguably the most popular approach for assigning a meaningful contribution value to players in a cooperative game, has recently been used intensively in explainable artificial intelligence.
Non-Stationary Dueling Bandits
We propose the $\mathrm{Beat\, the\, Winner\, Reset}$ algorithm and prove a bound on its expected binary weak regret in the stationary case, which tightens the bound of current state-of-art algorithms.
Cannot find the paper you are looking for? You can
Submit a new open access paper.
