Metraipolis › archive › dc_bd63fb723ff1

Rethinking Least-Core Computation in Contextual-Distractor Games — arXiv:2610.06087

Source
arXiv
Original
https://arxiv.org/abs/2610.06087
License (as archived)
CC0-1.0
Archived
2026-10-06T05:29:32.388Z
SHA-256 of the archived text
0443acba5c1b48c72eb06bc1827316317488decff914eac560d8e5e92033b93b
Stable URL of this page
https://metraipolis.com/documento/dc_bd63fb723ff1

How to cite

Rethinking Least-Core Computation in Contextual-Distractor Games — arXiv:2610.06087 — arXiv, https://arxiv.org/abs/2610.06087 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_bd63fb723ff1 (Metraipolis archive dc_bd63fb723ff1, sha256 0443acba5c1b48c72eb06bc1827316317488decff914eac560d8e5e92033b93b)
BibTeX
@misc{dcbd63fb723ff1,
  title = {Rethinking Least-Core Computation in Contextual-Distractor Games — arXiv:2610.06087},
  howpublished = {arXiv},
  url = {https://arxiv.org/abs/2610.06087},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_bd63fb723ff1; sha256 0443acba5c1b48c72eb06bc1827316317488decff914eac560d8e5e92033b93b},
  year = {2026}
}

Archived text

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

Game-theoretic attribution explains a model by assigning credit to its features or training examples. The least core has attracted interest as an alternative to Shapley-style averaging because it can expose players that cause substantial harm in rare, high-value contexts. However, least-core allocations are generally nonunique, and the choice of allocation can affect the resulting explanation. In this study, we investigate how payoff selection and coalition sampling affect least-core attribution. Our experiments show that selector choice matters for distinguishing useful and harmful contributions, and that sampling can degrade harmful-player identification across the tested selectors even when useful players remain well identified. These observations motivate efficient computation with all coalition constraints and a well-defined selector. We introduce entropic least core (ELC), a smooth approximation whose unique minimizer follows a continuous path along the temperature to the nucleolus, a classical refinement of the least core. Our experiments show that ELC approximates the nucleolus faster than an LP-based nucleolus solver while retaining small payoff errors, with further GPU acceleration at larger problem sizes. In the tested full-coalition contextual-distractor games, ELC matches the minimum-norm selector in identification accuracy and more accurately ranks distractors by harm.

Tema degli esploratori: economia dei servizi IA (elenco arXiv cs.GT, nuovi lavori del giorno).
Categorie arXiv: Machine Learning (cs.LG) ; Computer Science and Game Theory (cs.GT).
Pagina del lavoro: https://arxiv.org/abs/2610.06087 — 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-10-06T05:25:35.335Z dalla pagina https://arxiv.org/list/cs.GT/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).