{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,2]],"date-time":"2025-08-02T16:32:49Z","timestamp":1754152369671,"version":"3.41.2"},"reference-count":22,"publisher":"IEEE","license":[{"start":{"date-parts":[[2025,6,23]],"date-time":"2025-06-23T00:00:00Z","timestamp":1750636800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2025,6,23]],"date-time":"2025-06-23T00:00:00Z","timestamp":1750636800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["2201536,2430236"],"award-info":[{"award-number":["2201536,2430236"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100000780","name":"European Union","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100000780","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100010390","name":"Saint Louis University","doi-asserted-by":"publisher","id":[{"id":"10.13039\/100010390","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2025,6,23]]},"DOI":"10.1109\/netsoft64993.2025.11080578","type":"proceedings-article","created":{"date-parts":[[2025,7,21]],"date-time":"2025-07-21T18:02:32Z","timestamp":1753120952000},"page":"189-193","source":"Crossref","is-referenced-by-count":0,"title":["Optimizing Model Pruning in Decentralized Learning Networks with DFL-Trim"],"prefix":"10.1109","author":[{"given":"Andrea","family":"Pinto","sequence":"first","affiliation":[{"name":"Saint Louis University,Department of Computer Science,USA"}]},{"given":"Alessandro","family":"Masci","sequence":"additional","affiliation":[{"name":"Saint Louis University,Department of Computer Science,USA"}]},{"given":"Alessio","family":"Sacco","sequence":"additional","affiliation":[{"name":"Politecnico di Torino,Department of Control and Computer Engineering,Italy"}]},{"given":"Guido","family":"Marchetto","sequence":"additional","affiliation":[{"name":"Politecnico di Torino,Department of Control and Computer Engineering,Italy"}]},{"given":"Flavio","family":"Esposito","sequence":"additional","affiliation":[{"name":"Saint Louis University,Department of Computer Science,USA"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/COMST.2021.3075439"},{"journal-title":"Communication-efficient learning of deep networks from decentralized data","year":"2023","author":"McMahan","key":"ref2"},{"key":"ref3","article-title":"Decentralized gradient methods: does topology matter?","volume-title":"International Conference on Artificial Intelligence and Statistics","author":"Neglia","year":"2020"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1145\/3297858.3304009"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/TNSM.2024.3516472"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.3390\/s22093317"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/COMST.2024.3430368"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/OJCOMS.2024.3484228"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2024.3447085"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/tnnls.2022.3166101"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v36i6.20555"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM58522.2023.00146"},{"key":"ref13","first-page":"5336","article-title":"Can decentralized algorithms outperform centralized algorithms? a case study for decentralized parallel stochastic gradient descent","volume-title":"Proceedings of the 31st International Conference on Neural Information Processing Systems, NIPS\u201917","author":"Lian","year":"2017"},{"journal-title":"Omniquant: Omnidirectionally calibrated quantization for large language models","year":"2024","author":"Shao","key":"ref14"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/TNNLS.2017.2774288"},{"key":"ref16","article-title":"Comparing biases for minimal network construction with back-propagation","volume-title":"Advances in Neural Information Processing Systems","volume":"1","author":"Hanson","year":"1988"},{"journal-title":"Deep compression: Compressing deep neural networks with pruning, trained quantization and huffman coding","year":"2016","author":"Han","key":"ref17"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR42600.2020.00159"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/ICCV.2017.541"},{"journal-title":"Rethinking the value of network pruning","year":"2019","author":"Liu","key":"ref20"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-22496-7_5"},{"key":"ref22","first-page":"219","article-title":"Lessons learned from the chameleon testbed","volume-title":"USENIX Annual Technical Conference (ATC \u201920)","author":"Keahey"}],"event":{"name":"2025 IEEE 11th International Conference on Network Softwarization (NetSoft)","start":{"date-parts":[[2025,6,23]]},"location":"Budapest, Hungary","end":{"date-parts":[[2025,6,27]]}},"container-title":["2025 IEEE 11th International Conference on Network Softwarization (NetSoft)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx8\/11080530\/11080531\/11080578.pdf?arnumber=11080578","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,22]],"date-time":"2025-07-22T04:49:16Z","timestamp":1753159756000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/11080578\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,6,23]]},"references-count":22,"URL":"https:\/\/doi.org\/10.1109\/netsoft64993.2025.11080578","relation":{},"subject":[],"published":{"date-parts":[[2025,6,23]]}}}