{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,13]],"date-time":"2026-03-13T04:42:09Z","timestamp":1773376929242,"version":"3.50.1"},"reference-count":21,"publisher":"IEEE","license":[{"start":{"date-parts":[[2025,6,22]],"date-time":"2025-06-22T00:00:00Z","timestamp":1750550400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2025,6,22]],"date-time":"2025-06-22T00:00:00Z","timestamp":1750550400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2025,6,22]]},"DOI":"10.1109\/isit63088.2025.11195435","type":"proceedings-article","created":{"date-parts":[[2025,10,20]],"date-time":"2025-10-20T17:48:08Z","timestamp":1760982488000},"page":"1-6","source":"Crossref","is-referenced-by-count":2,"title":["Optimal Communication-Computation Trade-Off in Hierarchical Gradient Coding"],"prefix":"10.1109","author":[{"given":"Ali","family":"Gholami","sequence":"first","affiliation":[{"name":"Technische Universit&#x00E4;t Berlin,Berlin,Germany,10587"}]},{"given":"Tayyebeh","family":"Jahani-Nezhad","sequence":"additional","affiliation":[{"name":"Technische Universit&#x00E4;t Berlin,Berlin,Germany,10587"}]},{"given":"Kai","family":"Wan","sequence":"additional","affiliation":[{"name":"Huazhong University of Science and Technology,China"}]},{"given":"Giuseppe","family":"Caire","sequence":"additional","affiliation":[{"name":"Technische Universit&#x00E4;t Berlin,Berlin,Germany,10587"}]}],"member":"263","reference":[{"key":"ref1","article-title":"Large scale distributed deep networks","volume":"25","author":"Dean","year":"2012","journal-title":"Advances in neural information processing systems"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1145\/2488388.2488393"},{"key":"ref3","article-title":"Communication efficient distributed machine learning with the parameter server","volume":"27","author":"Li","year":"2014","journal-title":"Advances in Neural Information Processing Systems"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1145\/3377454"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1145\/2408776.2408794"},{"key":"ref6","article-title":"Ma-chine learning with adversaries: Byzantine tolerant gradient descent","volume":"30","author":"Blanchard","year":"2017","journal-title":"Advances in neural information processing systems"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1145\/3154503"},{"key":"ref8","first-page":"3368","article-title":"Gradient coding: Avoiding stragglers in distributed learning","volume-title":"International Conference on Machine Learning","author":"Tandon","year":"2017"},{"key":"ref9","first-page":"5610","article-title":"Communication-computation efficient gradient coding","volume-title":"International Conference on Machine Learning","author":"Ye","year":"2018"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/JSAIT.2021.3085676"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2021.3127910"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2021.3107432"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT44484.2020.9174077"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT54713.2023.10206782"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2019.8849431"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/ICC42927.2021.9500717"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2021.3109097"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/ICC51166.2024.10622617"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2024.3418901"},{"issue":"4","key":"ref20","volume-title":"Error control coding","volume":"2","author":"Lin","year":"2001"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT63088.2025.11195435"}],"event":{"name":"2025 IEEE International Symposium on Information Theory (ISIT)","location":"Ann Arbor, MI, USA","start":{"date-parts":[[2025,6,22]]},"end":{"date-parts":[[2025,6,27]]}},"container-title":["2025 IEEE International Symposium on Information Theory (ISIT)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx8\/11195206\/11195207\/11195435.pdf?arnumber=11195435","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,12]],"date-time":"2026-03-12T20:29:23Z","timestamp":1773347363000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/11195435\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,6,22]]},"references-count":21,"URL":"https:\/\/doi.org\/10.1109\/isit63088.2025.11195435","relation":{},"subject":[],"published":{"date-parts":[[2025,6,22]]}}}