{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,12]],"date-time":"2026-03-12T14:20:41Z","timestamp":1773325241018,"version":"3.50.1"},"publisher-location":"Singapore","reference-count":21,"publisher":"Springer Nature Singapore","isbn-type":[{"value":"9789819570713","type":"print"},{"value":"9789819570720","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-95-7072-0_13","type":"book-chapter","created":{"date-parts":[[2026,3,12]],"date-time":"2026-03-12T00:07:31Z","timestamp":1773274051000},"page":"198-209","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Evolutionary Weight Pruning: A PSO-Based Approach"],"prefix":"10.1007","author":[{"given":"Nian","family":"Wei","sequence":"first","affiliation":[]},{"given":"Rongzuo","family":"Guo","sequence":"additional","affiliation":[]},{"given":"Jun","family":"Huang","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2026,4,1]]},"reference":[{"key":"13_CR1","unstructured":"LeCun, Y., Denker, J.S., Solla, S.A.: Optimal brain damage. In: Advances in Neural Information Processing Systems (NIPS) (1990)"},{"key":"13_CR2","unstructured":"Kennedy, J., Eberhart, R.: Particle swarm optimization. In: Proc. IEEE Int. Conf. Neural Networks (1995)"},{"key":"13_CR3","unstructured":"Frankle, J., Carbin, M.: The lottery ticket hypothesis: Finding sparse, trainable neural networks. arXiv preprint arXiv:1803.03635 (2018)"},{"key":"13_CR4","unstructured":"Gale, T., Elsen, E., Hooker, S.: The state of sparsity in deep neural networks. arXiv preprint arXiv:1902.09574 (2019)"},{"key":"13_CR5","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":"13_CR6","unstructured":"Li, H., Kadav, A., Durdanovic, I., Samet, H., Graf, H.P.: Pruning filters for efficient convnets. arXiv preprint arXiv:1608.08710 (2016)"},{"key":"13_CR7","unstructured":"Denton, E.L., Zaremba, W., Bruna, J., LeCun, Y., Fergus, R.: Exploiting linear structure within convolutional networks for efficient evaluation (2014)"},{"key":"13_CR8","doi-asserted-by":"crossref","unstructured":"Wen, W., Xu, C., Wu, C., Wang, Y., Chen, Y., Li, H.: Coordinating filters for faster deep neural networks, pp. 658\u2013666 (2017)","DOI":"10.1109\/ICCV.2017.78"},{"key":"13_CR9","unstructured":"Wang, C., Grosse, R., Fidler, S., Zhang, G.: Eigendamage: Structured pruning in the Kronecker-factored eigenbasis. In: Int. Conf. Machine Learning (ICML), pp. 6566\u20136575 (2019)"},{"key":"13_CR10","unstructured":"Wang, H., Qin, C., Zhang, Y., Fu, Y.: Neural pruning via growing regularization. arXiv preprint arXiv:2012.09243 (2020)"},{"key":"13_CR11","doi-asserted-by":"publisher","first-page":"171924","DOI":"10.1109\/ACCESS.2020.3024992","volume":"8","author":"SA Aketi","year":"2020","unstructured":"Aketi, S.A., Roy, S., Raghunathan, A., Roy, K.: Gradual channel pruning while training using feature relevance scores for convolutional neural networks. IEEE Access 8, 171924\u2013171932 (2020)","journal-title":"IEEE Access"},{"issue":"7","key":"13_CR12","doi-asserted-by":"publisher","DOI":"10.1371\/journal.pone.0130140","volume":"10","author":"S Bach","year":"2015","unstructured":"Bach, S., Binder, A., Montavon, G., Klauschen, F., Muller, K.R., Samek, W.: On pixel-wise explanations for non-linear classifier decisions by layer-wise relevance propagation. PLoS ONE 10(7), e0130140 (2015)","journal-title":"PLoS ONE"},{"key":"13_CR13","doi-asserted-by":"crossref","unstructured":"Chen, S., Sun, W., Huang, L.: WHC: weighted hybrid criterion for filter pruning on convolutional neural networks. In: Proc. IEEE ICASSP, pp. \u2013 (2023)","DOI":"10.1109\/ICASSP49357.2023.10094874"},{"key":"13_CR14","unstructured":"Chen, W., Wilson, J., Tyree, S., Weinberger, K., Chen, Y.: Compressing neural networks with the hashing trick. In: Int. Conf. Machine Learning (2015)"},{"key":"13_CR15","unstructured":"Chmiel, B., Ben-Uria, L., Shkolnik, M., Hoffer, E., Banner, R., Soudry, D.: Neural gradients are near-lognormal: Improved quantized and sparse training. arXiv preprint arXiv:2006.08173 (2020)"},{"key":"13_CR16","unstructured":"Dai, B., Zhu, C., Guo, B., Wipf, D.: Compressing neural networks using the variational information bottleneck. In: Int. Conf. Machine Learning (2018)"},{"key":"13_CR17","unstructured":"Gomez, A.N., Zhang, I., Kamalakara, S.R., Madaan, D., Swersky, K., Gal, Y., Hinton, G.E.: Learning sparse networks using targeted dropout. arXiv preprint arXiv:1905.13678 (2019)"},{"key":"13_CR18","unstructured":"Hoefler, T., Alistarh, D., Ben-Nun, T., Dryden, N., Peste, A.: Sparsity in deep learning: Pruning and growth for efficient inference and training in neural networks. J. Mach. Learn. Res. 22(241) (2021)"},{"key":"13_CR19","doi-asserted-by":"crossref","unstructured":"Lin, M., Ji, R., Zhang, Y., Zhang, B., Wu, Y., Tian, Y.: Channel pruning via automatic structure search. arXiv preprint arXiv:2001 (2020)","DOI":"10.24963\/ijcai.2020\/94"},{"key":"13_CR20","doi-asserted-by":"crossref","unstructured":"Wang, Z., Li, C.: Channel pruning via lookahead search guided reinforcement learning. In: Proc. IEEE\/CVF Winter Conf. Applications of Computer Vision (2022)","DOI":"10.1109\/WACV51458.2022.00357"},{"key":"13_CR21","doi-asserted-by":"crossref","unstructured":"Clerc, M., Kennedy, J.: The particle swarm: Explosion, stability, and convergence in a multidimensional complex space. IEEE Trans. Evol. Comput. (2002)","DOI":"10.1109\/4235.985692"}],"container-title":["Lecture Notes in Computer Science","PRICAI 2025: Trends in Artificial Intelligence"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-981-95-7072-0_13","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,12]],"date-time":"2026-03-12T00:07:33Z","timestamp":1773274053000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-981-95-7072-0_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026]]},"ISBN":["9789819570713","9789819570720"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-981-95-7072-0_13","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 April 2026","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"PRICAI","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Pacific Rim International Conference on Artificial Intelligence","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Wellington","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"New Zealand","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":"17 November 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21 November 2025","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"22","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"pricai2025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.pricai.org\/2025\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}