{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,19]],"date-time":"2026-08-19T09:24:40Z","timestamp":1787131480143,"version":"build-2736575974"},"publisher-location":"Cham","reference-count":43,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783032083234","type":"print"},{"value":"9783032083241","type":"electronic"}],"license":[{"start":{"date-parts":[[2025,10,16]],"date-time":"2025-10-16T00:00:00Z","timestamp":1760572800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2025,10,16]],"date-time":"2025-10-16T00:00:00Z","timestamp":1760572800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2026]]},"abstract":"Abstract<\/jats:title>\n \n In Explainable AI (XAI), Shapley values are a popular model-agnostic framework for explaining predictions made by complex machine learning models. The computation of Shapley values requires estimating non-trivial\n contribution functions<\/jats:italic>\n representing predictions with only a subset of the features present. As the number of these terms grows exponentially with the number of features, computational costs escalate rapidly, creating a pressing need for efficient and accurate approximation methods. For tabular data, the framework is considered the state-of-the-art model-agnostic approximation framework. approximates the Shapley values using a weighted sample of the contribution functions for different feature subsets. We propose a novel modification of which replaces the stochastic weights with deterministic ones to reduce the variance of the resulting Shapley value approximations. This may also be combined with our simple, yet effective modification to the variant implemented in the popular Python library . Additionally, we provide an overview of established methods. Numerical experiments demonstrate that our methods can reduce the required number of contribution function evaluations by\n \n \n $$5\\%$$<\/jats:tex-math>\n \n \n 5<\/mml:mn>\n %<\/mml:mo>\n <\/mml:mrow>\n <\/mml:math>\n <\/jats:alternatives>\n <\/jats:inline-formula>\n to\n \n \n $$50\\%$$<\/jats:tex-math>\n \n \n 50<\/mml:mn>\n %<\/mml:mo>\n <\/mml:mrow>\n <\/mml:math>\n <\/jats:alternatives>\n <\/jats:inline-formula>\n while preserving the same accuracy of the approximated Shapley values \u2013 essentially reducing the running time by up to\n \n \n $$50\\%$$<\/jats:tex-math>\n \n \n 50<\/mml:mn>\n %<\/mml:mo>\n <\/mml:mrow>\n <\/mml:math>\n <\/jats:alternatives>\n <\/jats:inline-formula>\n . These computational advancements push the boundaries of the feature dimensionality and number of predictions that can be accurately explained with Shapley values within a feasible runtime.\n <\/jats:p>","DOI":"10.1007\/978-3-032-08324-1_9","type":"book-chapter","created":{"date-parts":[[2025,10,15]],"date-time":"2025-10-15T08:48:31Z","timestamp":1760518111000},"page":"194-218","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Improving the\u00a0Weighting Strategy in\u00a0KernelSHAP"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0009-0006-9360-6993","authenticated-orcid":false,"given":"Lars Henry Berge","family":"Olsen","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3908-5155","authenticated-orcid":false,"given":"Martin","family":"Jullum","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2025,10,16]]},"reference":[{"key":"9_CR1","doi-asserted-by":"publisher","DOI":"10.1016\/j.artint.2021.103502","volume":"298","author":"K Aas","year":"2021","unstructured":"Aas, K., Jullum, M., L\u00f8land, A.: Explaining individual predictions when features are dependent: more accurate approximations to Shapley values. Artif. Intell. 298, 103502 (2021)","journal-title":"Artif. Intell."},{"key":"9_CR2","doi-asserted-by":"publisher","first-page":"52138","DOI":"10.1109\/ACCESS.2018.2870052","volume":"6","author":"A Adadi","year":"2018","unstructured":"Adadi, A., Berrada, M.: Peeking inside the black-box: a survey on explainable artificial intelligence (xai). IEEE Access 6, 52138\u201352160 (2018)","journal-title":"IEEE Access"},{"key":"9_CR3","unstructured":"Ancona, M., Oztireli, C., Gross, M.: Explaining deep neural networks with a polynomial time algorithm for Shapley value approximation. In: ICML, pp. 272\u2013281. PMLR (2019)"},{"key":"9_CR4","first-page":"25818","volume":"35","author":"A Bifet","year":"2022","unstructured":"Bifet, A., Read, J., Xu, C., et al.: Linear tree Shap. Adv. Neural. Inf. Process. Syst. 35, 25818\u201325828 (2022)","journal-title":"Adv. Neural. Inf. Process. Syst."},{"key":"9_CR5","doi-asserted-by":"publisher","first-page":"180","DOI":"10.1016\/j.cor.2017.01.019","volume":"82","author":"J Castro","year":"2017","unstructured":"Castro, J., G\u00f3mez, D., Molina, E., Tejada, J.: Improving polynomial estimation of the Shapley value by stratified random sampling with optimum allocation. Comput. Oper. Res. 82, 180\u2013188 (2017)","journal-title":"Comput. Oper. Res."},{"key":"9_CR6","doi-asserted-by":"crossref","unstructured":"Charnes, A., Golany, B., Keane, M., Rousseau, J.: Extremal principle solutions of games in characteristic function form: core, Chebychev and Shapley value generalizations. In: Econometrics of planning and efficiency, pp. 123\u2013133. Springer (1988)","DOI":"10.1007\/978-94-009-3677-5_7"},{"key":"9_CR7","doi-asserted-by":"crossref","unstructured":"Chen, H., Covert, I.C., Lundberg, S.M., Lee, S.I.: Algorithms to estimate Shapley value feature attributions. arXiv preprint arXiv:2207.07605 (2022)","DOI":"10.1038\/s42256-023-00657-x"},{"issue":"6","key":"9_CR8","doi-asserted-by":"publisher","first-page":"590","DOI":"10.1038\/s42256-023-00657-x","volume":"5","author":"H Chen","year":"2023","unstructured":"Chen, H., Covert, I.C., Lundberg, S.M., Lee, S.I.: Algorithms to estimate Shapley value feature attributions. Nature Mach. Intell. 5(6), 590\u2013601 (2023)","journal-title":"Nature Mach. Intell."},{"key":"9_CR9","unstructured":"Chen, H., Janizek, J.D., Lundberg, S., Lee, S.I.: True to the model or true to the data? arXiv preprint arXiv:2006.16234 (2020)"},{"key":"9_CR10","unstructured":"Chen, T., He, T., Benesty, M., Khotilovich, V., Tang, Y., Cho, H., et\u00a0al.: XGBoost: extreme gradient boosting. R package version 0.4-2 1(4), 1\u20134 (2015)"},{"key":"9_CR11","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"66","DOI":"10.1007\/978-3-642-04747-3_8","volume-title":"Discovery Science","author":"P Cortez","year":"2009","unstructured":"Cortez, P., Teixeira, J., Cerdeira, A., Almeida, F., Matos, T., Reis, J.: Using data mining for wine quality assessment. In: Gama, J., Costa, V.S., Jorge, A.M., Brazdil, P.B. (eds.) DS 2009. LNCS (LNAI), vol. 5808, pp. 66\u201379. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-04747-3_8"},{"key":"9_CR12","unstructured":"Covert, I., Lee, S.I.: Improving kernelshap: practical Shapley value estimation using linear regression. In: International Conference on Artificial Intelligence and Statistics, pp. 3457\u20133465. PMLR (2021)"},{"issue":"209","key":"9_CR13","first-page":"1","volume":"22","author":"I Covert","year":"2021","unstructured":"Covert, I., Lundberg, S., Lee, S.I.: Explaining by removing: a unified framework for model explanation. J. Mach. Learn. Res. 22(209), 1\u201390 (2021)","journal-title":"J. Mach. Learn. Res."},{"key":"9_CR14","unstructured":"Covert, I., Lundberg, S.M., Lee, S.I.: Understanding global feature contributions with additive importance measures. In: Advances in Neural Information Processing Systems, vol. 33 (2020)"},{"issue":"2","key":"9_CR15","doi-asserted-by":"publisher","first-page":"257","DOI":"10.1287\/moor.19.2.257","volume":"19","author":"X Deng","year":"1994","unstructured":"Deng, X., Papadimitriou, C.H.: On the complexity of cooperative solution concepts. Math. Oper. Res. 19(2), 257\u2013266 (1994)","journal-title":"Math. Oper. Res."},{"key":"9_CR16","doi-asserted-by":"publisher","first-page":"249","DOI":"10.1007\/BF01258278","volume":"21","author":"U Faigle","year":"1992","unstructured":"Faigle, U., Kern, W.: The Shapley value for cooperative games under precedence constraints. Internat. J. Game Theory 21, 249\u2013266 (1992)","journal-title":"Internat. J. Game Theory"},{"issue":"3","key":"9_CR17","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1016\/0166-218X(92)90177-C","volume":"39","author":"P Flajolet","year":"1992","unstructured":"Flajolet, P., Gardy, D., Thimonier, L.: Birthday paradox, coupon collectors, caching algorithms and self-organizing search. Discret. Appl. Math. 39(3), 207\u2013229 (1992)","journal-title":"Discret. Appl. Math."},{"key":"9_CR18","unstructured":"Fumagalli, F., Muschalik, M., Kolpaczki, P., H\u00fcllermeier, E., Hammer, B.: KernelSHAP-IQ: weighted least square optimization for Shapley interactions. In: Proceedings of the 41st International Conference on Machine Learning, vol. 235, pp. 14308\u201314342. PMLR (2024)"},{"key":"9_CR19","unstructured":"Ghorbani, A., Zou, J.: Data Shapley: equitable valuation of data for machine learning. In: International Conference on Machine Learning, pp. 2242\u20132251. PMLR (2019)"},{"key":"9_CR20","doi-asserted-by":"crossref","unstructured":"Goldwasser, J., Hooker, G.: Stabilizing estimates of Shapley values with control variates. In: World Conference on XAI pp. 416\u2013439. Springer (2024)","DOI":"10.1007\/978-3-031-63797-1_21"},{"key":"9_CR21","unstructured":"Ill\u00e9s, F., Ker\u00e9nyi, P.: Estimation of the Shapley value by ergodic sampling. arXiv preprint arXiv:1906.05224 (2019)"},{"key":"9_CR22","unstructured":"Jullum, M., Olsen, L.H.B., Lachmann, J., Redelmeier, A.: shapr: explaining machine learning models with conditional Shapley values in R and Python. arXiv preprint arXiv:2504.01842 (2025)"},{"key":"9_CR23","doi-asserted-by":"crossref","unstructured":"Kolpaczki, P., Bengs, V., Muschalik, M., H\u00fcllermeier, E.: Approximating the Shapley value without marginal contributions. In: Proceedings of the AAAI Conference on Artificial Intelligence, vol.\u00a038, pp. 13246\u201313255 (2024)","DOI":"10.1609\/aaai.v38i12.29225"},{"key":"9_CR24","unstructured":"Kroese, D.P., Taimre, T., Botev, Z.I.: Handbook of Monte Carlo methods. John Wiley & Sons (2013)"},{"issue":"1","key":"9_CR25","doi-asserted-by":"publisher","first-page":"56","DOI":"10.1038\/s42256-019-0138-9","volume":"2","author":"S Lundberg","year":"2020","unstructured":"Lundberg, S., et al.: From local explanations to global understanding with explainable AI for trees. Nature Mach. Intell. 2(1), 56\u201367 (2020)","journal-title":"Nature Mach. Intell."},{"key":"9_CR26","unstructured":"Lundberg, S.M., Lee, S.I.: A unified approach to interpreting model predictions. In: Advances in Neural Information Processing Systems, pp. 4765\u20134774 (2017)"},{"key":"9_CR27","unstructured":"Lundberg, S.M., Lee, S.I.: Shap (2024), https:\/\/pypi.org\/project\/shap\/, python package version 0.46.0"},{"key":"9_CR28","unstructured":"Maleki, S.: Addressing the computational issues of the Shapley value with applications in the smart grid. Ph.D. thesis, University of Southampton (2015)"},{"issue":"43","key":"9_CR29","first-page":"1","volume":"23","author":"R Mitchell","year":"2022","unstructured":"Mitchell, R., Cooper, J., Frank, E., Holmes, G.: Sampling permutations for Shapley value estimation. J. Mach. Learn. Res. 23(43), 1\u201346 (2022)","journal-title":"J. Mach. Learn. Res."},{"key":"9_CR30","unstructured":"Molnar, C.: Interpretable Machine Learning. 2 edn. (2022). https:\/\/christophm.github.io\/interpretable-ml-book"},{"key":"9_CR31","unstructured":"Molnar, C.: Interpreting Machine Learning Models With SHAP. 1 edn. (2023). https:\/\/christophmolnar.com\/books\/shap\/"},{"key":"9_CR32","doi-asserted-by":"crossref","unstructured":"Okhrati, R., Lipani, A.: A multilinear sampling algorithm to estimate Shapley values. In: 2020 25th International Conference on Pattern Recognition (ICPR), pp. 7992\u20137999. IEEE (2021)","DOI":"10.1109\/ICPR48806.2021.9412511"},{"key":"9_CR33","unstructured":"Olsen, L.H.B.: Precision of individual Shapley value explanations. arXiv preprint arXiv:2312.03485 (2023)"},{"issue":"213","key":"9_CR34","first-page":"1","volume":"23","author":"LHB Olsen","year":"2022","unstructured":"Olsen, L.H.B., Glad, I.K., Jullum, M., Aas, K.: Using Shapley values and variational autoencoders to explain predictive models with dependent mixed features. J. Mach. Learn. Res. 23(213), 1\u201351 (2022)","journal-title":"J. Mach. Learn. Res."},{"key":"9_CR35","doi-asserted-by":"crossref","unstructured":"Olsen, L.H.B., Glad, I.K., Jullum, M., Aas, K.: A comparative study of methods for estimating model-agnostic Shapley value explanations. Data Mining Knowl. Discov. 1\u201348 (2024)","DOI":"10.1007\/s10618-024-01016-z"},{"key":"9_CR36","doi-asserted-by":"crossref","unstructured":"Redelmeier, A., Jullum, M., Aas, K.: Explaining predictive models with mixed features using Shapley values and conditional inference trees. In: ICross-Domain Conference for Machine Learning and Knowledge Extraction, pp. 117\u2013137 (2020)","DOI":"10.1007\/978-3-030-57321-8_7"},{"issue":"28","key":"9_CR37","first-page":"307","volume":"2","author":"LS Shapley","year":"1953","unstructured":"Shapley, L.S.: A value for n-person games. Contrib. Theory Games 2(28), 307\u2013317 (1953)","journal-title":"Contrib. Theory Games"},{"key":"9_CR38","first-page":"1","volume":"11","author":"E Strumbelj","year":"2010","unstructured":"Strumbelj, E., Kononenko, I.: An efficient explanation of individual classifications using game theory. J. Mach. Learn. Res. 11, 1\u201318 (2010)","journal-title":"J. Mach. Learn. Res."},{"issue":"3","key":"9_CR39","doi-asserted-by":"publisher","first-page":"647","DOI":"10.1007\/s10115-013-0679-x","volume":"41","author":"E Strumbelj","year":"2014","unstructured":"Strumbelj, E., Kononenko, I.: Explaining prediction models and individual predictions with feature contributions. Knowl. Inf. Syst. 41(3), 647\u2013665 (2014)","journal-title":"Knowl. Inf. Syst."},{"key":"9_CR40","unstructured":"Wang, R., Wang, X., Inouye, D.I.: Shapley explanation networks. In: ICLR (2020)"},{"key":"9_CR41","unstructured":"Williamson, B., Feng, J.: Efficient nonparametric statistical inference on population feature importance using Shapley values. In: ICML, pp. 10282\u201310291. PMLR (2020)"},{"issue":"1","key":"9_CR42","doi-asserted-by":"publisher","first-page":"1","DOI":"10.18637\/jss.v077.i01","volume":"77","author":"M Wright","year":"2017","unstructured":"Wright, M., Ziegler, A.: ranger: a fast implementation of random forests for high dimensional data in C++ and R. J. Stat. Softw. 77(1), 1\u201317 (2017)","journal-title":"J. Stat. Softw."},{"key":"9_CR43","unstructured":"Yang, J.: Fast treeshap: accelerating Shap value computation for trees. arXiv preprint arXiv:2109.09847 (2021)"}],"container-title":["Communications in Computer and Information Science","Explainable Artificial Intelligence"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-032-08324-1_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,8,19]],"date-time":"2026-08-19T08:30:06Z","timestamp":1787128206000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-08324-1_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,10,16]]},"ISBN":["9783032083234","9783032083241"],"references-count":43,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-08324-1_9","relation":{},"ISSN":["1865-0929","1865-0937"],"issn-type":[{"value":"1865-0929","type":"print"},{"value":"1865-0937","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,10,16]]},"assertion":[{"value":"16 October 2025","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"xAI","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"World Conference on Explainable Artificial Intelligence","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Istanbul","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"T\u00fcrkiye","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2025","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"9 July 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11 July 2025","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"3","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"xai2025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/xaiworldconference.com\/2025\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}