{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,22]],"date-time":"2024-10-22T22:28:58Z","timestamp":1729636138287,"version":"3.28.0"},"reference-count":25,"publisher":"IEEE","license":[{"start":{"date-parts":[[2020,5,1]],"date-time":"2020-05-01T00:00:00Z","timestamp":1588291200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2020,5,1]],"date-time":"2020-05-01T00:00:00Z","timestamp":1588291200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2020,5,1]],"date-time":"2020-05-01T00:00:00Z","timestamp":1588291200000},"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":[[2020,5]]},"DOI":"10.1109\/icassp40776.2020.9054153","type":"proceedings-article","created":{"date-parts":[[2020,4,9]],"date-time":"2020-04-09T20:21:13Z","timestamp":1586463673000},"page":"5215-5219","source":"Crossref","is-referenced-by-count":9,"title":["Weighted Gradient Coding with Leverage Score Sampling"],"prefix":"10.1109","author":[{"given":"Neophytos","family":"Charalambides","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mert","family":"Pilanci","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alfred O.","family":"Hero","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/ITW44776.2019.8989328"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1145\/3366700"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2019.8849690"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2019.8849580"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2016.7541436"},{"key":"ref15","first-page":"861","article-title":"A statistical perspective on algorithmic leveraging","volume":"16","author":"ma","year":"2015","journal-title":"The Journal of Machine Learning Research"},{"article-title":"A practical guide to randomized matrix computations with matlab implementations","year":"2015","author":"wang","key":"ref16"},{"key":"ref17","first-page":"3475","article-title":"Fast approximation of matrix coherence and statistical leverage","volume":"13","author":"drineas","year":"2012","journal-title":"Journal of Machine Learning Research"},{"key":"ref18","first-page":"5672","article-title":"On fast leverage score sampling and optimal learning","author":"rudi","year":"2018","journal-title":"Advances in neural information processing systems"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1137\/080734029"},{"article-title":"Communicationcomputation efficient gradient coding","year":"2018","author":"ye","key":"ref4"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/DSW.2019.8755563"},{"article-title":"Gradient coding from cyclic MDS codes and expander graphs","year":"2017","author":"raviv","key":"ref6"},{"key":"ref5","doi-asserted-by":"crossref","DOI":"10.1109\/ISIT44484.2020.9174512","article-title":"Numerically stable binary gradient coding","author":"charalambides","year":"2020"},{"article-title":"Approximate gradient coding via sparse random graphs","year":"2017","author":"charles","key":"ref8"},{"article-title":"Gradient coding via the stochastic block model","year":"2018","author":"charles","key":"ref7"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2018.8437467"},{"article-title":"Erasurehead: Distributed gradient descent without delays using approximate gradient coding","year":"2019","author":"wang","key":"ref9"},{"key":"ref1","first-page":"3368","article-title":"Gradient coding: Avoiding stragglers in distributed learning","author":"tandon","year":"2017","journal-title":"International Conference on Machine Learning"},{"key":"ref20","article-title":"Fast Randomized Algorithms for Convex Optimization and Statistical Estimation","author":"pilanci","year":"2016","journal-title":"PhD thesis"},{"key":"ref22","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":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2015.2450722"},{"article-title":"Lecture notes on randomized linear algebra","year":"2016","author":"mahoney","key":"ref24"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1137\/15M1021106"},{"key":"ref25","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1561\/0400000060","article-title":"Sketching as a tool for numerical linear algebra","volume":"10","author":"woodruff","year":"2014","journal-title":"Foundations and Trends\ufffd in Theoretical Computer Science"}],"event":{"name":"ICASSP 2020 - 2020 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP)","start":{"date-parts":[[2020,5,4]]},"location":"Barcelona, Spain","end":{"date-parts":[[2020,5,8]]}},"container-title":["ICASSP 2020 - 2020 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/9040208\/9052899\/09054153.pdf?arnumber=9054153","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,9,29]],"date-time":"2023-09-29T19:29:42Z","timestamp":1696015782000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9054153\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,5]]},"references-count":25,"URL":"https:\/\/doi.org\/10.1109\/icassp40776.2020.9054153","relation":{},"subject":[],"published":{"date-parts":[[2020,5]]}}}