arXiv Machine Learning By Majid Mohammadi, Grigory Reznikov, Pavel Sinitcyn, Krikamol Muandet, Siu Lun Chau

QuadraSHAP: $\epsilon$-Exact Shapley Values for Product Games in Logarithmic Parallel Time

Read the original on arXiv Machine Learning →

QuadraSHAP is a method for computing ε-exact Shapley values in product games, where coalition values factor across players. It replaces the exponential coalition sum with a one-dimensional polynomial integral, using Gauss–Legendre quadrature to achieve exact values when ε = 0 and provides a computable error bound for ε > 0. The approach supports weighted sums of product games, enabling baseline and empirical interventional attribution for models such as log-link regression, Cox models, odds-scale classifiers, product-kernel machines, and tree-based models, and achieves logarithmic parallel time with efficient GPU evaluation even for hundreds of thousands of features.

Machine-generated by The Flow from the publisher's headline and feed description — not written or checked by a human. The full article lives at arXiv Machine Learning.

arXiv Machine Learning
Aug 10

Sub-Quadratic Bisimulation Metrics via Approximate Nearest Neighbors: Coverage-Augmented Guarantees and Computable Two-Sided Certificates

arXiv:2608. 06762v1 Announce Type: new Abstract: Bisimulation metrics quantify behavioral similarity in Markov decision processes, but their Wasserstein fixed-point operator updates every state pair and incurs quadratic pairwise work.

By Ibne Farabi Shihab, Joyanta Jyoti Mondal
arXiv Machine Learning
Aug 10

Multiscale Reward Hedging from Correct Demonstrations

arXiv:2608. 06825v1 Announce Type: new Abstract: Learning from correct demonstrations is harder than supervised learning when many answers are correct: after predicting, the learner sees one valid answer but not whether its own answer was valid, nor any reward.

By Pahan Dewasurendra