{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,29]],"date-time":"2026-10-29T16:10:03Z","timestamp":1793290203054,"version":"4.5.0"},"reference-count":29,"publisher":"IEEE","license":[{"start":{"date-parts":[[2019,5,1]],"date-time":"2019-05-01T00:00:00Z","timestamp":1556668800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2019,5,1]],"date-time":"2019-05-01T00:00:00Z","timestamp":1556668800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2019,5,1]],"date-time":"2019-05-01T00:00:00Z","timestamp":1556668800000},"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,5]]},"DOI":"10.1109\/icassp.2019.8683121","type":"proceedings-article","created":{"date-parts":[[2019,4,17]],"date-time":"2019-04-17T20:01:56Z","timestamp":1555531316000},"page":"8167-8171","source":"Crossref","is-referenced-by-count":15,"title":["Byzantine-resilient Distributed Large-scale Matrix Completion"],"prefix":"10.1109","author":[{"given":"Feng","family":"Lin","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Qing","family":"Ling","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Zhiwei","family":"Xiong","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1007\/s12532-012-0044-1"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1016\/j.comnet.2014.11.008"},{"key":"ref12","article-title":"Federated optimization: Distributed optimization beyond the datacenter","author":"konecny","year":"2015"},{"key":"ref13","article-title":"Federated learning: Strategies for improving communication efficiency","author":"konecny","year":"2016"},{"key":"ref14","article-title":"Federated multi-task learning","author":"smith","year":"2017","journal-title":"Proceedings of NIPS"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1145\/357172.357176"},{"key":"ref16","author":"lynch","year":"1996","journal-title":"Distributed Algorithms"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1145\/3154503"},{"key":"ref18","article-title":"Generalized Byzantine-tolerant SGD","author":"xie","year":"2018"},{"key":"ref19","article-title":"Zeno: Byzantine-suspicious stochastic gradient descent","author":"xie","year":"2018"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1007\/BF01588313"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/SAM.2010.5606732"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1007\/s10479-008-0352-z"},{"key":"ref3","article-title":"Recognizing emotions from abstract paintings using non-linear matrix completion","author":"alamedapineda","year":"2016","journal-title":"proceedings of CVPR"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1137\/080738970"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1007\/s10957-014-0586-7"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/ICC.2016.7510871"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1145\/2020408.2020426"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1007\/s10208-011-9084-6"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2004.52"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1145\/2668133"},{"key":"ref1","article-title":"Top-N recommender system via matrix completion","author":"kang","year":"2016","journal-title":"Proceedings of AAAI"},{"key":"ref20","article-title":"Byzantine-robust distributed learning: Towards optimal statistical rates","author":"yin","year":"2018"},{"key":"ref22","article-title":"Machine learning with adversaries: Byzantine tolerant gradient descent","author":"blanchard","year":"2017","journal-title":"Proceedings of NIPS"},{"key":"ref21","article-title":"Phocas: Dimensional Byzantine-resilient stochastic gradient descent","author":"xie","year":"2018"},{"key":"ref24","article-title":"Asynchronous Byzantine machine learning (the case of SGD)","author":"damaskinos","year":"2018"},{"key":"ref23","article-title":"The Netflix prize","author":"bennett","year":"2007","journal-title":"Proc of KD-DCup"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.3150\/11-BEJ390"},{"key":"ref25","article-title":"Defending against saddle point attack in Byzantine-robust distributed learning","author":"yin","year":"2018"}],"event":{"name":"ICASSP 2019 - 2019 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP)","location":"Brighton, United Kingdom","start":{"date-parts":[[2019,5,12]]},"end":{"date-parts":[[2019,5,17]]}},"container-title":["ICASSP 2019 - 2019 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/8671773\/8682151\/08683121.pdf?arnumber=8683121","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,7,15]],"date-time":"2022-07-15T03:21:12Z","timestamp":1657855272000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8683121\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,5]]},"references-count":29,"URL":"https:\/\/doi.org\/10.1109\/icassp.2019.8683121","relation":{},"subject":[],"published":{"date-parts":[[2019,5]]}}}