Metraipolis › archive › dc_49523d7b3fbd

ShapleyOG: Fast Adaptive Shapley Value Estimation with Odd Gaussian Processes — arXiv:2611.07173

Source
arXiv (en)
Original
https://arxiv.org/abs/2611.07173
License (as archived)
CC0-1.0
Archived
2026-11-06T14:51:07.299Z
SHA-256 of the archived text
88ea6bcc0145139a27a239113a5584519b602496018f6616044a536b58815386
Stable URL of this page
https://metraipolis.com/documento/dc_49523d7b3fbd

How to cite

ShapleyOG: Fast Adaptive Shapley Value Estimation with Odd Gaussian Processes — arXiv:2611.07173 — arXiv (en), https://arxiv.org/abs/2611.07173 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_49523d7b3fbd (Metraipolis archive dc_49523d7b3fbd, sha256 88ea6bcc0145139a27a239113a5584519b602496018f6616044a536b58815386)
BibTeX
@misc{dc49523d7b3fbd,
  title = {ShapleyOG: Fast Adaptive Shapley Value Estimation with Odd Gaussian Processes — arXiv:2611.07173},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2611.07173},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_49523d7b3fbd; sha256 88ea6bcc0145139a27a239113a5584519b602496018f6616044a536b58815386},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2611.07173. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

Shapley values are a central tool for attribution in machine learning. Since their exact computation requires evaluating the cooperative game to be explained on exponentially many player coalitions, they are typically estimated from a limited number of evaluations. Recently, ShaplEIG has shown that adaptively selecting the coalitions to evaluate substantially improves sample efficiency over classical estimators. This, however, comes at the cost of a sequential procedure that, in every iteration, refits a Gaussian process surrogate of the game and selects the coalition with the largest expected information gain about the Shapley values. The resulting computational overhead limits its applicability to costly games with low evaluation budgets. We present fast adaptive Shapley value estimation with Odd Gaussian Processes (ShapleyOG) to overcome this limitation. ShapleyOG leverages the fact that Shapley values depend only on the odd component of the game, and we show that under paired sampling a Gaussian process surrogate on this component alone yields the same Shapley value posterior and coalition selection criterion from half as many observations. Moreover, ShapleyOG refits the surrogate only on a sparse schedule and efficiently updates the selection criterion in between, and it extends quadrature-based computation schemes to the prior covariance of the Shapley values, which allows for exact or cheaper approximate computation. In extensive experiments on diverse games, ShapleyOG matches the estimation accuracy of ShaplEIG while reducing its overhead by up to three orders of magnitude. As a result, it outperforms state-of-the-art non-adaptive estimators at equal total computation time already when a single evaluation takes a tenth of a second and a budget of a few thousand evaluations suffices, thereby widening the regime in which adaptive coalition selection is applicable and pays off.

Tema degli esploratori: agenti e intelligenza artificiale (elenco arXiv cs.LG, nuovi lavori del giorno).
Categorie arXiv: Machine Learning (stat.ML) ; Machine Learning (cs.LG).
Pagina del lavoro: https://arxiv.org/abs/2611.07173 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-11-06T14:21:42.656Z dalla pagina https://arxiv.org/list/cs.LG/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).