{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,26]],"date-time":"2026-03-26T14:35:12Z","timestamp":1774535712514,"version":"3.50.1"},"reference-count":23,"publisher":"IEEE","license":[{"start":{"date-parts":[[2020,6,1]],"date-time":"2020-06-01T00:00:00Z","timestamp":1590969600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2020,6,1]],"date-time":"2020-06-01T00:00:00Z","timestamp":1590969600000},"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,6]]},"DOI":"10.1109\/isit44484.2020.9174216","type":"proceedings-article","created":{"date-parts":[[2020,8,24]],"date-time":"2020-08-24T17:28:01Z","timestamp":1598290081000},"page":"2539-2544","source":"Crossref","is-referenced-by-count":12,"title":["Communication Efficient Distributed Approximate Newton Method"],"prefix":"10.1109","author":[{"given":"Avishek","family":"Ghosh","sequence":"first","affiliation":[{"name":"UC Berkeley,Department of Electrical Engineering and Computer Sciences"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Raj Kumar","family":"Maity","sequence":"additional","affiliation":[{"name":"UMass Amherst,College of Information and Computer Sciences"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Arya","family":"Mazumdar","sequence":"additional","affiliation":[{"name":"UMass Amherst,College of Information and Computer Sciences"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kannan","family":"Ramchandran","sequence":"additional","affiliation":[{"name":"UC Berkeley,Department of Electrical Engineering and Computer Sciences"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref10","first-page":"1000","article-title":"Communication-efficient distributed optimization using an approximate newton-type method","author":"shamir","year":"2014","journal-title":"International Conference on Machine Learning"},{"key":"ref11","first-page":"362","article-title":"Disco: Distributed optimization for self-concordant empirical loss","author":"zhang","year":"2015","journal-title":"International Conference on Machine Learning"},{"key":"ref12","first-page":"2332","article-title":"Giant: Globally improved approximate newton method for distributed optimization","author":"wang","year":"2018","journal-title":"Advances in neural information processing systems"},{"key":"ref13","article-title":"Dingo: Distributed Newton-type method for gradient-norm optimization","author":"crane","year":"2019","journal-title":"Advances in neural information processing systems"},{"key":"ref14","article-title":"Newton-mr: Newton’s method without smoothness or convexity","author":"roosta","year":"2018"},{"key":"ref15","article-title":"Aide: Fast and communication efficient distributed optimization","author":"reddi","year":"2016"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1145\/1961189.1961199"},{"key":"ref17","first-page":"3252","article-title":"Error feedback fixes signsgd and other gradient compression schemes","author":"karimireddy","year":"2019","journal-title":"International Conference on Machine Learning"},{"key":"ref18","article-title":"Oversketched newton: Fast convex optimization for serverless systems","author":"gupta","year":"2019"},{"key":"ref19","first-page":"1509","article-title":"Terngrad: Ternary gradients to reduce communication in distributed deep learning","author":"wen","year":"2017","journal-title":"Advances in neural information processing systems"},{"key":"ref4","article-title":"Communication-efficient stochastic gradient descent, with applications to neural networks","author":"alistarh","year":"2017"},{"key":"ref3","first-page":"9850","article-title":"Atomo: Communication-efficient learning via atomic sparsification","author":"wang","year":"2018","journal-title":"Advances in neural information processing systems"},{"key":"ref6","article-title":"Distributed learning with sublinear communication","author":"acharya","year":"2019"},{"key":"ref5","first-page":"5973","article-title":"The convergence of sparsified gradient methods","author":"alistarh","year":"2018","journal-title":"Advances in neural information processing systems"},{"key":"ref8","first-page":"1709","article-title":"Qsgd: Communication-efficient sgd via gradient quantization and encoding","author":"alistarh","year":"2017","journal-title":"Advances in neural information processing systems"},{"key":"ref7","article-title":"signsgd: Compressed optimisation for non-convex problems","author":"bernstein","year":"2018"},{"key":"ref2","first-page":"3329","article-title":"Distributed mean estimation with limited communication","volume":"70","author":"suresh","year":"0"},{"key":"ref1","article-title":"Federated learning: Strategies for improving communication efficiency","author":"kone?n?","year":"2016"},{"key":"ref9","article-title":"vqsgd: Vector quantized stochastic gradient descent","author":"gandikota","year":"2019"},{"key":"ref20","article-title":"Communication-efficient distributed sgd with sketching","author":"ivkin","year":"2019"},{"key":"ref22","article-title":"signsgd with majority vote is communication efficient and byzantine fault tolerant","author":"bernstein","year":"2018"},{"key":"ref21","first-page":"4447","article-title":"Sparsified sgd with memory","author":"stich","year":"2018","journal-title":"Advances in neural information processing systems"},{"key":"ref23","article-title":"Communication-efficient and byzantine-robust distributed learning","author":"ghosh","year":"2019"}],"event":{"name":"2020 IEEE International Symposium on Information Theory (ISIT)","location":"Los Angeles, CA, USA","start":{"date-parts":[[2020,6,21]]},"end":{"date-parts":[[2020,6,26]]}},"container-title":["2020 IEEE International Symposium on Information Theory (ISIT)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/9166581\/9173928\/09174216.pdf?arnumber=9174216","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,12]],"date-time":"2026-03-12T20:34:44Z","timestamp":1773347684000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9174216\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,6]]},"references-count":23,"URL":"https:\/\/doi.org\/10.1109\/isit44484.2020.9174216","relation":{},"subject":[],"published":{"date-parts":[[2020,6]]}}}