{"date_published":"2021-04-01T00:00:00Z","oa":1,"ddc":["000"],"title":"NUQSGD: Provably communication-efficient data-parallel SGD via nonuniform quantization","author":[{"last_name":"Ramezani-Kebrya","full_name":"Ramezani-Kebrya, Ali","first_name":"Ali"},{"full_name":"Faghri, Fartash","last_name":"Faghri","first_name":"Fartash"},{"first_name":"Ilya","full_name":"Markov, Ilya","last_name":"Markov"},{"last_name":"Aksenov","full_name":"Aksenov, Vitalii","first_name":"Vitalii","id":"2980135A-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Dan-Adrian","orcid":"0000-0003-3650-940X","id":"4A899BFC-F248-11E8-B48F-1D18A9856A87","last_name":"Alistarh","full_name":"Alistarh, Dan-Adrian"},{"full_name":"Roy, Daniel M.","last_name":"Roy","first_name":"Daniel M."}],"has_accepted_license":"1","_id":"9571","status":"public","language":[{"iso":"eng"}],"file":[{"date_created":"2021-06-23T07:09:41Z","file_size":11237154,"file_name":"2021_JournalOfMachineLearningResearch_Ramezani-Kebrya.pdf","file_id":"9595","content_type":"application/pdf","success":1,"access_level":"open_access","date_updated":"2021-06-23T07:09:41Z","relation":"main_file","creator":"asandaue","checksum":"6428aa8bcb67768b6949c99b55d5281d"}],"quality_controlled":"1","date_updated":"2024-03-06T12:22:07Z","external_id":{"arxiv":["1908.06077"]},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","month":"04","intvolume":"        22","type":"journal_article","oa_version":"Published Version","article_type":"original","scopus_import":"1","publication_status":"published","issue":"114","publisher":"Journal of Machine Learning Research","publication_identifier":{"issn":["15324435"],"eissn":["15337928"]},"main_file_link":[{"url":"https://www.jmlr.org/papers/v22/20-255.html","open_access":"1"}],"volume":22,"page":"1−43","department":[{"_id":"DaAl"}],"year":"2021","abstract":[{"lang":"eng","text":"As the size and complexity of models and datasets grow, so does the need for communication-efficient variants of stochastic gradient descent that can be deployed to perform parallel model training. One popular communication-compression method for data-parallel SGD is QSGD (Alistarh et al., 2017), which quantizes and encodes gradients to reduce communication costs. The baseline variant of QSGD provides strong theoretical guarantees, however, for practical purposes, the authors proposed a heuristic variant which we call QSGDinf, which demonstrated impressive empirical gains for distributed training of large neural networks. In this paper, we build on this work to propose a new gradient quantization scheme, and show that it has both stronger theoretical guarantees than QSGD, and matches and exceeds the empirical performance of the QSGDinf heuristic and of other compression methods."}],"citation":{"short":"A. Ramezani-Kebrya, F. Faghri, I. Markov, V. Aksenov, D.-A. Alistarh, D.M. Roy, Journal of Machine Learning Research 22 (2021) 1−43.","ieee":"A. Ramezani-Kebrya, F. Faghri, I. Markov, V. Aksenov, D.-A. Alistarh, and D. M. Roy, “NUQSGD: Provably communication-efficient data-parallel SGD via nonuniform quantization,” <i>Journal of Machine Learning Research</i>, vol. 22, no. 114. Journal of Machine Learning Research, p. 1−43, 2021.","ama":"Ramezani-Kebrya A, Faghri F, Markov I, Aksenov V, Alistarh D-A, Roy DM. NUQSGD: Provably communication-efficient data-parallel SGD via nonuniform quantization. <i>Journal of Machine Learning Research</i>. 2021;22(114):1−43.","chicago":"Ramezani-Kebrya, Ali, Fartash Faghri, Ilya Markov, Vitalii Aksenov, Dan-Adrian Alistarh, and Daniel M. Roy. “NUQSGD: Provably Communication-Efficient Data-Parallel SGD via Nonuniform Quantization.” <i>Journal of Machine Learning Research</i>. Journal of Machine Learning Research, 2021.","apa":"Ramezani-Kebrya, A., Faghri, F., Markov, I., Aksenov, V., Alistarh, D.-A., &#38; Roy, D. M. (2021). NUQSGD: Provably communication-efficient data-parallel SGD via nonuniform quantization. <i>Journal of Machine Learning Research</i>. Journal of Machine Learning Research.","ista":"Ramezani-Kebrya A, Faghri F, Markov I, Aksenov V, Alistarh D-A, Roy DM. 2021. NUQSGD: Provably communication-efficient data-parallel SGD via nonuniform quantization. Journal of Machine Learning Research. 22(114), 1−43.","mla":"Ramezani-Kebrya, Ali, et al. “NUQSGD: Provably Communication-Efficient Data-Parallel SGD via Nonuniform Quantization.” <i>Journal of Machine Learning Research</i>, vol. 22, no. 114, Journal of Machine Learning Research, 2021, p. 1−43."},"date_created":"2021-06-20T22:01:33Z","publication":"Journal of Machine Learning Research","article_processing_charge":"No","file_date_updated":"2021-06-23T07:09:41Z","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png"},"day":"01"}