{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,27]],"date-time":"2025-11-27T20:58:28Z","timestamp":1764277108070,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":12,"publisher":"ACM","license":[{"start":{"date-parts":[[2021,11,26]],"date-time":"2021-11-26T00:00:00Z","timestamp":1637884800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2021,11,26]]},"DOI":"10.1145\/3503823.3503826","type":"proceedings-article","created":{"date-parts":[[2022,2,22]],"date-time":"2022-02-22T22:15:51Z","timestamp":1645568151000},"page":"12-17","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":4,"title":["Feed Forward Neural Network Sparsificationwith Dynamic Pruning"],"prefix":"10.1145","author":[{"given":"Andreas","family":"Chouliaras","sequence":"first","affiliation":[{"name":"Electrical and Computer Engineering dept., University of Thessaly, Greece"}]},{"given":"Evangelia","family":"Fragkou","sequence":"additional","affiliation":[{"name":"Electrical and Computer Engineering dept., University of Thessaly, Greece"}]},{"given":"Dimitrios","family":"Katsaros","sequence":"additional","affiliation":[{"name":"Electrical and Computer Engineering dept., University of Thessaly, Greece"}]}],"member":"320","published-online":{"date-parts":[[2022,2,22]]},"reference":[{"key":"e_1_3_2_1_1_1","first-page":"2369","article-title":"Variable learning rate based modification in backpropagation algorithm (MBPA) of artificial neural network for data classification","volume":"28","author":"Abbas Q.","year":"2016","unstructured":"Q. Abbas , F. Ahmad , and M. Imran . 2016 . Variable learning rate based modification in backpropagation algorithm (MBPA) of artificial neural network for data classification . Science International 28 , 3 (2016), 2369 \u2013 2380 . Q. Abbas, F. Ahmad, and M. Imran. 2016. Variable learning rate based modification in backpropagation algorithm (MBPA) of artificial neural network for data classification. Science International 28, 3 (2016), 2369\u20132380.","journal-title":"Science International"},{"key":"e_1_3_2_1_2_1","unstructured":"X. Dai H. Yin and N.\u00a0K. Jha. 2018. NeST: A neural network synthesis tool based on a grow-and-prune paradigm. Available at: https:\/\/arxiv.org\/abs\/1711.02017.  X. Dai H. Yin and N.\u00a0K. Jha. 2018. NeST: A neural network synthesis tool based on a grow-and-prune paradigm. Available at: https:\/\/arxiv.org\/abs\/1711.02017."},{"volume-title":"Proceedings of the International Conference on Learning Representations (ICLR).","author":"Frankle J.","key":"e_1_3_2_1_3_1","unstructured":"J. Frankle and M. Carbin . 2019. The Lottery Ticket hypothesis: Finding sparse, trainable neural networks . In Proceedings of the International Conference on Learning Representations (ICLR). J. Frankle and M. Carbin. 2019. The Lottery Ticket hypothesis: Finding sparse, trainable neural networks. In Proceedings of the International Conference on Learning Representations (ICLR)."},{"key":"e_1_3_2_1_4_1","volume-title":"Proceedings of the International Conference on Learning Representations (ICLR).","author":"Han S.","year":"2016","unstructured":"S. Han , H. Mao , and W.\u00a0 J. Dally . 2016 . Deep compression: Compressing deep neural networks with pruning, trained quantization and Huffman coding . In Proceedings of the International Conference on Learning Representations (ICLR). S. Han, H. Mao, and W.\u00a0J. Dally. 2016. Deep compression: Compressing deep neural networks with pruning, trained quantization and Huffman coding. In Proceedings of the International Conference on Learning Representations (ICLR)."},{"key":"e_1_3_2_1_5_1","unstructured":"T. Hoefler D. Alistarh T. Ben-Nun N. Dryden and A. Peste. 2021. Sparsity in deep learning: Pruning and growh for efficient inference and training in neural networks. Available at https:\/\/arxiv.org\/abs\/2102.00554.  T. Hoefler D. Alistarh T. Ben-Nun N. Dryden and A. Peste. 2021. Sparsity in deep learning: Pruning and growh for efficient inference and training in neural networks. Available at https:\/\/arxiv.org\/abs\/2102.00554."},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1016\/0893-6080(88)90003-2"},{"volume-title":"Proceedings of the International Conference on Learning Representations (ICLR).","author":"Mei J.","key":"e_1_3_2_1_7_1","unstructured":"J. Mei , Y. Li , X. Lian , X. Jin , L. Yang , A. Yuille , and J. Yang . 2020. AtomNAS: Fine-grained end-to-end neural architecture search . In Proceedings of the International Conference on Learning Representations (ICLR). J. Mei, Y. Li, X. Lian, X. Jin, L. Yang, A. Yuille, and J. Yang. 2020. AtomNAS: Fine-grained end-to-end neural architecture search. In Proceedings of the International Conference on Learning Representations (ICLR)."},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"crossref","unstructured":"D. Mocanu E. Mocanu P. Stone P. Nguyen M. Gibescu and A. Liotta. 2018. Scalable training of artificial neural networks with adaptive sparse connectivity inspired by network science. Nature Communications 9(2018).  D. Mocanu E. Mocanu P. Stone P. Nguyen M. Gibescu and A. Liotta. 2018. Scalable training of artificial neural networks with adaptive sparse connectivity inspired by network science. Nature Communications 9(2018).","DOI":"10.1038\/s41467-018-04316-3"},{"volume-title":"Proceedings of the International Conference on Learning Representations (ICLR).","author":"Reddy J.","key":"e_1_3_2_1_9_1","unstructured":"S.\u00a0 J. Reddy , S. Kale , and S. Kumar . 2019. On the convergence of Adam and beyond . In Proceedings of the International Conference on Learning Representations (ICLR). S.\u00a0J. Reddy, S. Kale, and S. Kumar. 2019. On the convergence of Adam and beyond. In Proceedings of the International Conference on Learning Representations (ICLR)."},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/3447582"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.5555\/2627435.2670313"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2018.2883613"}],"event":{"name":"PCI 2021: 25th Pan-Hellenic Conference on Informatics","acronym":"PCI 2021","location":"Volos Greece"},"container-title":["25th Pan-Hellenic Conference on Informatics"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3503823.3503826","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3503823.3503826","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T19:02:19Z","timestamp":1750186939000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3503823.3503826"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,11,26]]},"references-count":12,"alternative-id":["10.1145\/3503823.3503826","10.1145\/3503823"],"URL":"https:\/\/doi.org\/10.1145\/3503823.3503826","relation":{},"subject":[],"published":{"date-parts":[[2021,11,26]]},"assertion":[{"value":"2022-02-22","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}