{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,11]],"date-time":"2026-06-11T11:00:05Z","timestamp":1781175605008,"version":"3.54.1"},"publisher-location":"Singapore","reference-count":54,"publisher":"Springer Nature Singapore","isbn-type":[{"value":"9789819200702","type":"print"},{"value":"9789819200719","type":"electronic"}],"license":[{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2026]]},"DOI":"10.1007\/978-981-92-0071-9_2","type":"book-chapter","created":{"date-parts":[[2026,6,11]],"date-time":"2026-06-11T10:33:38Z","timestamp":1781174018000},"page":"17-32","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Shapley Pruning for Interpretable Neural Network Compression"],"prefix":"10.1007","author":[{"given":"Kamil","family":"Adamczewski","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Joanna","family":"Kaczmarek","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Yawei","family":"Li","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Michele","family":"Magno","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Luc","family":"van Gool","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2026,6,1]]},"reference":[{"key":"2_CR1","doi-asserted-by":"publisher","unstructured":"Analysing neural network topologies: a game theoretic approach. Proc. Comput. Sci. 126, 234\u2013243 (2018). https:\/\/doi.org\/10.1016\/j.procs.2018.07.257, Knowledge-Based and Intelligent Information & Engineering Systems: Proceedings of the 22nd International Conference, KES-2018, Belgrade, Serbia","DOI":"10.1016\/j.procs.2018.07.257"},{"key":"2_CR2","unstructured":"Adamczewski, K., Park, M.: Dirichlet pruning for neural network compression. In: The 24th International Conference on Artificial Intelligence and Statistics (AISTATS) (2021)"},{"key":"2_CR3","unstructured":"Adamczewski, K., Sakaridis, C., Patil, V., Van\u00a0Gool, L.: Lidar line selection with spatially-aware shapley value for cost-efficient depth completion. In: 6th Annual Conference on Robot Learning"},{"key":"2_CR4","unstructured":"et\u00a0al., D.: Resrep: Lossless cnn pruning via decoupling remembering and forgetting"},{"key":"2_CR5","unstructured":"Ancona, M., \u00d6ztireli, C., Gross, M.: Shapley value as principled metric for structured network pruning. arXiv preprint arXiv:2006.01795 (2020)"},{"issue":"3","key":"2_CR6","first-page":"32","volume":"13","author":"S Anwar","year":"2017","unstructured":"Anwar, S., Hwang, K., Sung, W.: Structured pruning of deep convolutional neural networks. ACM J. Emerging Technol. Comput. Syst. (JETC) 13(3), 32 (2017)","journal-title":"ACM J. Emerging Technol. Comput. Syst. (JETC)"},{"issue":"5","key":"2_CR7","doi-asserted-by":"publisher","first-page":"1726","DOI":"10.1016\/j.cor.2008.04.004","volume":"36","author":"J Castro","year":"2009","unstructured":"Castro, J., G\u00f3mez, D., Tejada, J.: Polynomial calculation of the shapley value based on sampling. Comput. Operat. Res. 36(5), 1726\u20131730 (2009)","journal-title":"Comput. Operat. Res."},{"key":"2_CR8","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 (1988)","DOI":"10.1007\/978-94-009-3677-5_7"},{"key":"2_CR9","unstructured":"Ghorbani, A., Zou, J.: Neuron shapley: Discovering the responsible neurons. arXiv preprint arXiv:2002.09815 (2020)"},{"key":"2_CR10","unstructured":"Han, S., Mao, H., Dally, W.J.: Deep compression: Compressing deep neural networks with pruning, trained quantization and huffman coding. arXiv preprint arXiv:1510.00149 (2015)"},{"key":"2_CR11","unstructured":"Hassibi, B., Stork, D.G.: Second order derivatives for network pruning: optimal brain surgeon. Adv. Neural Inform. Process. Syst., 164\u2013171 (1993)"},{"key":"2_CR12","doi-asserted-by":"crossref","unstructured":"He, K., Zhang, X., Ren, S., Sun, J.: Deep residual learning for image recognition. In: Proceedings of the IEEE conference on CVPR, pp. 770\u2013778 (2016)","DOI":"10.1109\/CVPR.2016.90"},{"key":"2_CR13","doi-asserted-by":"crossref","unstructured":"He, Y., Kang, G., Dong, X., Fu, Y., Yang, Y.: Soft filter pruning for accelerating deep convolutional neural networks. arXiv preprint arXiv:1808.06866 (2018)","DOI":"10.24963\/ijcai.2018\/309"},{"key":"2_CR14","doi-asserted-by":"crossref","unstructured":"He, Y., Liu, P., Wang, Z., Hu, Z., Yang, Y.: Filter pruning via geometric median for deep convolutional neural networks acceleration. In: Proceedings of the IEEE Conference on CVPR, pp. 4340\u20134349 (2019)","DOI":"10.1109\/CVPR.2019.00447"},{"key":"2_CR15","doi-asserted-by":"crossref","unstructured":"He, Y., Zhang, X., Sun, J.: Channel pruning for accelerating very deep neural networks. In: Proc. ICCV, pp. 1389\u20131397 (2017)","DOI":"10.1109\/ICCV.2017.155"},{"key":"2_CR16","doi-asserted-by":"crossref","unstructured":"Huang, G., Liu, Z., Van Der\u00a0Maaten, L., Weinberger, K.Q.: Densely connected convolutional networks. In: Proceedings of the IEEE Conference on CVPR, pp. 4700\u20134708 (2017)","DOI":"10.1109\/CVPR.2017.243"},{"key":"2_CR17","doi-asserted-by":"crossref","unstructured":"Huang, Z., Wang, N.: Data-driven sparse structure selection for deep neural networks. In: Proc. ECCV, pp. 304\u2013320 (2018)","DOI":"10.1007\/978-3-030-01270-0_19"},{"key":"2_CR18","doi-asserted-by":"crossref","unstructured":"Kang, M., Li, L., Li, B.: Fashapley: fast and approximated shapley based model pruning towards certifiably robust dnns. In: 2023 IEEE Conference on Secure and Trustworthy Machine Learning (SaTML), pp. 575\u2013592. IEEE (2023)","DOI":"10.1109\/SaTML54575.2023.00044"},{"key":"2_CR19","doi-asserted-by":"publisher","unstructured":"Lebedev, V., Lempitsky, V.: Fast convnets using group-wise brain damage. In: 2016 IEEE Conference on CVPR (CVPR) (Jun 2016). https:\/\/doi.org\/10.1109\/CVPR.2016.280","DOI":"10.1109\/CVPR.2016.280"},{"issue":"11","key":"2_CR20","doi-asserted-by":"publisher","first-page":"2278","DOI":"10.1109\/5.726791","volume":"86","author":"Y LeCun","year":"1998","unstructured":"LeCun, Y., Bottou, L., Bengio, Y., Haffner, P., et al.: Gradient-based learning applied to document recognition. Proc. IEEE 86(11), 2278\u20132324 (1998)","journal-title":"Proc. IEEE"},{"key":"2_CR21","unstructured":"LeCun, Y., Denker, J.S., Solla, S.A.: Optimal brain damage. Adv. Neural Inform. Process. Syst., 598\u2013605 (1990)"},{"key":"2_CR22","unstructured":"Leon, F.: Optimizing neural network topology using shapley value"},{"key":"2_CR23","unstructured":"Li, H., Kadav, A., Durdanovic, I., Samet, H., Graf, H.P.: Pruning filters for efficient convnets. arXiv preprint arXiv:1608.08710 (2016)"},{"key":"2_CR24","doi-asserted-by":"crossref","unstructured":"Li, Y., Adamczewski, K., Li, W., Gu, S., Timofte, R., Van\u00a0Gool, L.: Revisiting random channel pruning for neural network compression. In: Proceedings of the IEEE\/CVF Conference on CVPR, pp. 191\u2013201 (2022)","DOI":"10.1109\/CVPR52688.2022.00029"},{"key":"2_CR25","doi-asserted-by":"crossref","unstructured":"Li, Y., Gu, S., Mayer, C., Gool, L.V., Timofte, R.: Group sparsity: the hinge between filter pruning and decomposition for network compression. In: Proceedings of the IEEE\/CVF Conference on CVPR, pp. 8018\u20138027 (2020)","DOI":"10.1109\/CVPR42600.2020.00804"},{"key":"2_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"608","DOI":"10.1007\/978-3-030-58598-3_36","volume-title":"Computer Vision \u2013 ECCV 2020","author":"Y Li","year":"2020","unstructured":"Li, Y., Gu, S., Zhang, K., Van Gool, L., Timofte, R.: DHP: differentiable meta pruning via hypernetworks. In: Vedaldi, A., Bischof, H., Brox, T., Frahm, J.-M. (eds.) ECCV 2020. LNCS, vol. 12353, pp. 608\u2013624. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-58598-3_36"},{"key":"2_CR27","doi-asserted-by":"crossref","unstructured":"Li, Y., et al.: Exploiting kernel sparsity and entropy for interpretable cnn compression. In: Proceedings of the IEEE\/CVF Conference on CVPR, pp. 2800\u20132809 (2019)","DOI":"10.1109\/CVPR.2019.00291"},{"key":"2_CR28","doi-asserted-by":"crossref","unstructured":"Lin, M., et al.: Hrank: filter pruning using high-rank feature map. In: Proceedings of the IEEE\/CVF Conference on CVPR, pp. 1529\u20131538 (2020)","DOI":"10.1109\/CVPR42600.2020.00160"},{"key":"2_CR29","doi-asserted-by":"crossref","unstructured":"Lin, S., et al.: Towards optimal structured cnn pruning via generative adversarial learning. In: Proc. CVPR, pp. 2790\u20132799 (2019)","DOI":"10.1109\/CVPR.2019.00290"},{"issue":"5","key":"2_CR30","doi-asserted-by":"publisher","first-page":"5703","DOI":"10.1109\/TVT.2020.2983143","volume":"69","author":"Y Lin","year":"2020","unstructured":"Lin, Y., Tu, Y., Dou, Z.: An improved neural network pruning technology for automatic modulation classification in edge devices. IEEE Trans. Veh. Technol. 69(5), 5703\u20135706 (2020)","journal-title":"IEEE Trans. Veh. Technol."},{"issue":"4","key":"2_CR31","doi-asserted-by":"publisher","first-page":"319","DOI":"10.1002\/asmb.446","volume":"17","author":"S Lipovetsky","year":"2001","unstructured":"Lipovetsky, S., Conklin, M.: Analysis of regression in game theory approach. Appl. Stoch. Model. Bus. Ind. 17(4), 319\u2013330 (2001)","journal-title":"Appl. Stoch. Model. Bus. Ind."},{"key":"2_CR32","doi-asserted-by":"crossref","unstructured":"Liu, J., et al.: Discrimination-aware network pruning for deep model compression. IEEE Trans. Pattern Anal. Mach. Intell. (2021)","DOI":"10.1109\/TPAMI.2021.3066410"},{"key":"2_CR33","unstructured":"Louizos, C., Ullrich, K., Welling, M.: Bayesian compression for deep learning. Adv. Neural Inform. Process. Syst., 3288\u20133298 (2017)"},{"key":"2_CR34","unstructured":"Lundberg, S., Lee, S.I.: A unified approach to interpreting model predictions. arXiv preprint arXiv:1705.07874 (2017)"},{"key":"2_CR35","doi-asserted-by":"crossref","unstructured":"Luo, J.H., Wu, J.: Autopruner: an end-to-end trainable filter pruning method for efficient deep model inference. Pattern Recogn. 107461 (2020)","DOI":"10.1016\/j.patcog.2020.107461"},{"key":"2_CR36","doi-asserted-by":"crossref","unstructured":"Luo, J.H., Wu, J., Lin, W.: Thinet: a filter level pruning method for deep neural network compression. In: Proceedings of the IEEE International Conference on Computer Vision, pp. 5058\u20135066 (2017)","DOI":"10.1109\/ICCV.2017.541"},{"key":"2_CR37","doi-asserted-by":"publisher","first-page":"607","DOI":"10.1613\/jair.3806","volume":"46","author":"TP Michalak","year":"2013","unstructured":"Michalak, T.P., Aadithya, K.V., Szczepanski, P.L., Ravindran, B., Jennings, N.R.: Efficient computation of the shapley value for game-theoretic network centrality. J. Artifi. Intell. Res. 46, 607\u2013650 (2013)","journal-title":"J. Artifi. Intell. Res."},{"key":"2_CR38","doi-asserted-by":"crossref","unstructured":"Molchanov, P., Mallya, A., Tyree, S., Frosio, I., Kautz, J.: Importance estimation for neural network pruning. In: Proceedings of the IEEE\/CVF Conference on CVPR, pp. 11264\u201311272 (2019)","DOI":"10.1109\/CVPR.2019.01152"},{"key":"2_CR39","unstructured":"Molchanov, P., Tyree, S., Karras, T., Aila, T., Kautz, J.: Pruning convolutional neural networks for resource efficient transfer learning, 3 (2016). arXiv preprint arXiv:1611.06440"},{"key":"2_CR40","unstructured":"Neklyudov, K., Molchanov, D., Ashukha, A., Vetrov, D.P.: Structured bayesian pruning via log-normal multiplicative noise. Adv. Neural Inform. Process. Syst., 6775\u20136784 (2017)"},{"key":"2_CR41","unstructured":"Oh, C., Adamczewski, K., Park, M.: Radial and directional posteriors for bayesian neural networks. arXiv preprint arXiv:1902.02603 (2019)"},{"key":"2_CR42","unstructured":"Paszke, A., et al.: Automatic differentiation in pytorch (2017)"},{"key":"2_CR43","doi-asserted-by":"crossref","unstructured":"Selvaraju, R.R., Cogswell, M., Das, A., Vedantam, R., Parikh, D., Batra, D.: Grad-cam: visual explanations from deep networks via gradient-based localization. In: Proceedings of the IEEE International Conference on Computer Vision, pp. 618\u2013626 (2017)","DOI":"10.1109\/ICCV.2017.74"},{"key":"2_CR44","doi-asserted-by":"crossref","unstructured":"Shapley, L.S.: A value for n-person games. contributions to the Theory of Games (AM-28) 1(4), 169 (1953)","DOI":"10.1515\/9781400881970-018"},{"key":"2_CR45","unstructured":"Simonyan, K., Zisserman, A.: Very deep convolutional networks for large-scale image recognition. arXiv preprint arXiv:1409.1556 (2014)"},{"key":"2_CR46","doi-asserted-by":"crossref","unstructured":"Srinivas, S., Babu, R.V.: Data-free parameter pruning for deep neural networks. arXiv preprint arXiv:1507.06149 (2015)","DOI":"10.5244\/C.29.31"},{"issue":"3","key":"2_CR47","doi-asserted-by":"publisher","first-page":"647","DOI":"10.1007\/s10115-013-0679-x","volume":"41","author":"E \u0160trumbelj","year":"2014","unstructured":"\u0160trumbelj, 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":"2_CR48","unstructured":"Tang, R., Adhikari, A., Lin, J.: Flops as a direct optimization objective for learning sparse neural networks. arXiv preprint arXiv:1811.03060 (2018)"},{"key":"2_CR49","unstructured":"Theis, L., Korshunova, I., Tejani, A., Husz\u00e1r, F.: Faster gaze prediction with dense networks and fisher pruning. arXiv preprint arXiv:1801.05787 (2018)"},{"key":"2_CR50","unstructured":"Wen, W., Wu, C., Wang, Y., Chen, Y., Li, H.: Learning structured sparsity in deep neural networks. In: Advances in Neural Information Processing Systems, pp. 2074\u20132082 (2016)"},{"key":"2_CR51","doi-asserted-by":"crossref","unstructured":"Yu, R., et al.: Nisp: pruning networks using neuron importance score propagation. In: Proceedings of the IEEE Conference on CVPR, pp. 9194\u20139203 (2018)","DOI":"10.1109\/CVPR.2018.00958"},{"issue":"7","key":"2_CR52","doi-asserted-by":"publisher","first-page":"3142","DOI":"10.1109\/TIP.2017.2662206","volume":"26","author":"K Zhang","year":"2017","unstructured":"Zhang, K., Zuo, W., Chen, Y., Meng, D., Zhang, L.: Beyond a gaussian denoiser: residual learning of deep cnn for image denoising. IEEE Trans. Image Process. 26(7), 3142\u20133155 (2017)","journal-title":"IEEE Trans. Image Process."},{"key":"2_CR53","doi-asserted-by":"crossref","unstructured":"Zhao, C., Ni, B., Zhang, J., Zhao, Q., Zhang, W., Tian, Q.: Variational convolutional neural network pruning. In: Proc. CVPR, pp. 2780\u20132789 (2019)","DOI":"10.1109\/CVPR.2019.00289"},{"key":"2_CR54","unstructured":"Zhuang, Z., et al.: Discrimination-aware channel pruning for deep neural networks. Adv. Neural Inform. Process. Syst., 875\u2013886 (2018)"}],"container-title":["Lecture Notes in Computer Science","Intelligent Information and Database Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-981-92-0071-9_2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,6,11]],"date-time":"2026-06-11T10:33:59Z","timestamp":1781174039000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-981-92-0071-9_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026]]},"ISBN":["9789819200702","9789819200719"],"references-count":54,"URL":"https:\/\/doi.org\/10.1007\/978-981-92-0071-9_2","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026]]},"assertion":[{"value":"1 June 2026","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ACIIDS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Asian Conference on Intelligent Information and Database Systems","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Kaohsiung","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Taiwan","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2026","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"13 April 2026","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15 April 2026","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"aciids2026","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/aciids.pwr.edu.pl\/2026\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}