{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,10]],"date-time":"2026-04-10T17:18:21Z","timestamp":1775841501694,"version":"3.50.1"},"reference-count":37,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"am","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"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":["NSF CAREER CCF-2236829"],"award-info":[{"award-number":["NSF CAREER CCF-2236829"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["ECCS-2037304"],"award-info":[{"award-number":["ECCS-2037304"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["DMS-2134248"],"award-info":[{"award-number":["DMS-2134248"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000183","name":"Army Research Office Early Career Award","doi-asserted-by":"publisher","award":["W911NF-21-1-0242"],"award-info":[{"award-number":["W911NF-21-1-0242"]}],"id":[{"id":"10.13039\/100000183","id-type":"DOI","asserted-by":"publisher"}]},{"name":"ACCESS\u2013AI Chip Center for Emerging Smart Systems sponsored by InnoHK Funding, Hong Kong, SAR"},{"name":"Precourt Pioneering Projects Seed Grant"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE J. Sel. Areas Inf. Theory"],"published-print":{"date-parts":[[2023]]},"DOI":"10.1109\/jsait.2023.3310931","type":"journal-article","created":{"date-parts":[[2023,9,4]],"date-time":"2023-09-04T18:27:24Z","timestamp":1693852044000},"page":"393-404","source":"Crossref","is-referenced-by-count":5,"title":["Randomized Polar Codes for Anytime Distributed Machine Learning"],"prefix":"10.1109","volume":"4","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-0079-8126","authenticated-orcid":false,"given":"Burak","family":"Bartan","sequence":"first","affiliation":[{"name":"Department of Electrical Engineering, Stanford University, Stanford, CA, USA"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0870-9992","authenticated-orcid":false,"given":"Mert","family":"Pilanci","sequence":"additional","affiliation":[{"name":"Department of Electrical Engineering, Stanford University, Stanford, CA, USA"}]}],"member":"263","reference":[{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1145\/3366700"},{"key":"ref35","first-page":"1097","article-title":"ImageNet classification with deep convolutional neural networks","author":"krizhevsky","year":"2012","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2022.3151434"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1137\/100810447"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2017.2723898"},{"key":"ref37","author":"didier","year":"2009","journal-title":"Efficient Erasure Decoding of Reed-Solomon Codes"},{"key":"ref14","first-page":"577","article-title":"Computation efficient coded linear transform","volume":"89","author":"wang","year":"2019","journal-title":"Proc 22nd Int Conf Artif Intell Statist"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1109\/CCNC.2010.5421749"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2009.5206848"},{"key":"ref30","first-page":"970","article-title":"Structured evolution with compact architectures for scalable policy optimization","volume":"80","author":"choromanski","year":"2018","journal-title":"Proc 35th Int Conf Mach Learn"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2019.8849235"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1142\/S1793536911000787"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/CloudNet55617.2022.9978858"},{"key":"ref32","first-page":"123","article-title":"Randomized algorithms for matrices and data","volume":"3","author":"mahoney","year":"2011","journal-title":"Foundations & Trends in Mach Learn"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2018.8437549"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2017.2736066"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/BigData.2018.8622139"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2019.2904055"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2018.2877391"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2021.3139009"},{"key":"ref24","first-page":"1","article-title":"A case for serverless machine learning","author":"carreira","year":"2018","journal-title":"Proc Workshop Syst ML Open Source Softw NeurIPS 2018"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/ICMLA.2017.0-166"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/CLOUD.2018.00049"},{"key":"ref25","author":"gupta","year":"2020","journal-title":"Utility-based resource allocation and pricing for serverless computing"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1145\/3410048.3410104"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/ALLERTON.2016.7852337"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/ISCA.2016.54"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/BigData50022.2020.9378289"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/INFOCOM.2019.8737391"},{"key":"ref29","article-title":"Evolution strategies as a scalable alternative to reinforcement learning","author":"salimans","year":"2017","journal-title":"arXiv 1703 03864"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2018.8437563"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2019.2929328"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT44484.2020.9174167"},{"key":"ref4","first-page":"49","article-title":"An analysis of time-dependent planning","author":"dean","year":"1988","journal-title":"Proc 7th AAAI Nat Conf Artif Intell"},{"key":"ref3","first-page":"4406","article-title":"Polynomial codes: An optimal design for high-dimensional coded matrix multiplication","author":"yu","year":"2017","journal-title":"Proc Adv Neural Inf Proc Syst (NeurIPS)"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2009.2021379"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/ALLERTON.2019.8919767"}],"container-title":["IEEE Journal on Selected Areas in Information Theory"],"original-title":[],"link":[{"URL":"https:\/\/ieeexplore.ieee.org\/ielam\/8700143\/10153947\/10239266-aam.pdf","content-type":"application\/pdf","content-version":"am","intended-application":"syndication"},{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/8700143\/10153947\/10239266.pdf?arnumber=10239266","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,2,14]],"date-time":"2024-02-14T00:15:25Z","timestamp":1707869725000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/10239266\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"references-count":37,"URL":"https:\/\/doi.org\/10.1109\/jsait.2023.3310931","relation":{},"ISSN":["2641-8770"],"issn-type":[{"value":"2641-8770","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023]]}}}