{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,23]],"date-time":"2025-05-23T04:49:12Z","timestamp":1747975752182,"version":"3.37.3"},"reference-count":23,"publisher":"IEEE","license":[{"start":{"date-parts":[[2022,11,1]],"date-time":"2022-11-01T00:00:00Z","timestamp":1667260800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2022,11,1]],"date-time":"2022-11-01T00:00:00Z","timestamp":1667260800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/501100002701","name":"Ministry of Education","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100002701","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100000923","name":"Australian Research Council","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100000923","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022,11,1]]},"DOI":"10.1109\/itw54588.2022.9965865","type":"proceedings-article","created":{"date-parts":[[2022,12,7]],"date-time":"2022-12-07T20:47:00Z","timestamp":1670446020000},"page":"600-605","source":"Crossref","is-referenced-by-count":3,"title":["A Learning-Based Approach to Approximate Coded Computation"],"prefix":"10.1109","author":[{"given":"Navneet","family":"Agrawal","sequence":"first","affiliation":[{"name":"Technische Universität,Berlin,Germany"}]},{"given":"Yuqin","family":"Qiu","sequence":"additional","affiliation":[{"name":"University of Melbourne,Department of Electrical and Electronic Engineering,Victoria,Australia"}]},{"given":"Matthias","family":"Frey","sequence":"additional","affiliation":[{"name":"Technische Universität,Berlin,Germany"}]},{"given":"Igor","family":"Bjelakovic","sequence":"additional","affiliation":[{"name":"Fraunhofer Heinrich Hertz Institute,Berlin,Germany"}]},{"given":"Setareh","family":"Maghsudi","sequence":"additional","affiliation":[{"name":"Fraunhofer Heinrich Hertz Institute,Berlin,Germany"}]},{"given":"Slawomir","family":"Stanczak","sequence":"additional","affiliation":[{"name":"Technische Universität,Berlin,Germany"}]},{"given":"Jingge","family":"Zhu","sequence":"additional","affiliation":[{"name":"University of Melbourne,Department of Electrical and Electronic Engineering,Victoria,Australia"}]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/JSAIT.2022.3190859"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/JSAIT.2021.3099811"},{"key":"ref12","first-page":"903","article-title":"Draco: Byzantine-resilient distributed training via redundant gradients","author":"chen","year":"2018","journal-title":"International Conference on Machine Learning"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2019.2952051"},{"article-title":"Learning a code: Machine learning for approximate non-linear coded computation","year":"2018","author":"kosaian","key":"ref14"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1145\/3341301.3359654"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/JSAIT.2020.2983165"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/VTC2022-Spring54318.2022.9860390"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2016.2549517"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1137\/09074721X"},{"key":"ref4","first-page":"1215","article-title":"Lagrange coded computing: Optimal design for resiliency, security, and privacy","author":"yu","year":"2019","journal-title":"International Conference on Artificial Intelligence and Statistics"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2019.2929328"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/ICASSP.2019.8682895"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/JSAIT.2021.3056377"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2021.3068165"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/ICASSP39728.2021.9413800"},{"key":"ref2","article-title":"Polynomial codes: an optimal design for high-dimensional coded matrix multiplication","volume":"30","author":"yu","year":"2017","journal-title":"Advances in neural information processing systems"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/MTAGS.2016.04"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/BigData.2018.8622139"},{"journal-title":"Sur l’approximation du determinant de Fredholm par les determinants des systèmes d’équations linéaires","year":"1938","author":"ostrowski","key":"ref20"},{"key":"ref22","article-title":"TensorFlow: Large-scale machine learning on heterogeneous systems","author":"abadi","year":"2015","journal-title":"software available from tensorflow org"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1016\/j.laa.2014.09.041"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611971163"}],"event":{"name":"2022 IEEE Information Theory Workshop (ITW)","start":{"date-parts":[[2022,11,1]]},"location":"Mumbai, India","end":{"date-parts":[[2022,11,9]]}},"container-title":["2022 IEEE Information Theory Workshop (ITW)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/9965754\/9965755\/09965865.pdf?arnumber=9965865","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,12,26]],"date-time":"2022-12-26T19:42:07Z","timestamp":1672083727000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9965865\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,11,1]]},"references-count":23,"URL":"https:\/\/doi.org\/10.1109\/itw54588.2022.9965865","relation":{},"subject":[],"published":{"date-parts":[[2022,11,1]]}}}