{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,31]],"date-time":"2026-03-31T21:00:14Z","timestamp":1774990814986,"version":"3.50.1"},"reference-count":22,"publisher":"IEEE","license":[{"start":{"date-parts":[[2019,9,1]],"date-time":"2019-09-01T00:00:00Z","timestamp":1567296000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2019,9,1]],"date-time":"2019-09-01T00:00:00Z","timestamp":1567296000000},"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":[[2019,9]]},"DOI":"10.1109\/allerton.2019.8919691","type":"proceedings-article","created":{"date-parts":[[2019,12,6]],"date-time":"2019-12-06T04:23:39Z","timestamp":1575606219000},"page":"246-252","source":"Crossref","is-referenced-by-count":0,"title":["Distributed Black-Box optimization via Error Correcting Codes"],"prefix":"10.1109","author":[{"given":"Burak","family":"Bartan","sequence":"first","affiliation":[{"name":"Stanford University,Department of Electrical Engineering"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mert","family":"Pilanci","sequence":"additional","affiliation":[{"name":"Stanford University,Department of Electrical Engineering"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref10","first-page":"4406","article-title":"Polynomial codes: An optimal design for high-dimensional coded matrix multiplication","author":"yu","year":"2017","journal-title":"Proc Neural Info Proc Systems"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2018.8437563"},{"key":"ref12","article-title":"Evolution strategies as a scalable alternative to reinforcement learning","author":"salimans","year":"2017","journal-title":"arXiv preprint arXiv 703 03864"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511804441"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1145\/3128572.3140448"},{"key":"ref15","article-title":"Adam: A method for stochastic optimization","author":"kingma","year":"2014","journal-title":"arXiv preprint arXiv 1412 6980"},{"key":"ref16","article-title":"Very Deep Convolutional Networks for Large-Scale Image Recognition","author":"simonyan","year":"2014","journal-title":"arXiv preprint arXiv 1409 1556"},{"key":"ref17","author":"krizhevsky","year":"2009","journal-title":"Learning multiple layers of features from tiny images"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2015.2450722"},{"key":"ref19","first-page":"1842","article-title":"Iterative hessian sketch: Fast and accurate solution approximation for constrained least-squares","volume":"17","author":"pilanci","year":"2016","journal-title":"The Journal of Machine Learning Research"},{"key":"ref4","article-title":"Structured evolution with compact architectures for scalable policy optimization","author":"choromanski","year":"2018","journal-title":"arXiv preprint arXiv 1804 02671"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/SC.2010.12"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2017.2736066"},{"key":"ref5","doi-asserted-by":"crossref","first-page":"3051","DOI":"10.1109\/TIT.2009.2021379","article-title":"Channel polarization: A method for constructing capacity-achieving codes for symmetric binary-input memoryless channels","volume":"55","author":"afikan","year":"2009","journal-title":"IEEE Transactions on Information Theory"},{"key":"ref8","article-title":"Rateless codes for near-perfect load balancing in distributed matrix-vector multiplication","volume":"abs 1804 10331","author":"mallick","year":"2018","journal-title":"CoRR"},{"key":"ref7","article-title":"Block-diagonal and It codes for distributed computing with straggling seivers","author":"severinson","year":"2018","journal-title":"IEEE Transactions on Communications"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1145\/2408776.2408794"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9780898718768"},{"key":"ref9","article-title":"Polar coded distributed matrix multiplication","author":"battan","year":"2019","journal-title":"arXiv preprint arXiv 1901 04217"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1214\/16-AOS1472"},{"key":"ref22","author":"pilanci","year":"2016","journal-title":"Fast randomized algonthms for convex optimization and statistical estimation"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1137\/15M1021106"}],"event":{"name":"2019 57th Annual Allerton Conference on Communication, Control, and Computing (Allerton)","location":"Monticello, IL, USA","start":{"date-parts":[[2019,9,24]]},"end":{"date-parts":[[2019,9,27]]}},"container-title":["2019 57th Annual Allerton Conference on Communication, Control, and Computing (Allerton)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/8911248\/8919648\/08919691.pdf?arnumber=8919691","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,31]],"date-time":"2026-03-31T19:51:46Z","timestamp":1774986706000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8919691\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,9]]},"references-count":22,"URL":"https:\/\/doi.org\/10.1109\/allerton.2019.8919691","relation":{},"subject":[],"published":{"date-parts":[[2019,9]]}}}