Fetching the paper…
Reading the bibliography…
Motivated by the need for distributed learning and optimization algorithms with low communication cost, we study communication efficient algorithms for distributed mean estimation.
Universal codeword sets and representations of the integers
Peter Elias · 1975
Earlier work this paper cites.
The jackknife estimate of variance
Bradley Efron and Charles Stein · 1981
Earlier work this paper cites.
The performance of universal encoding
R Krichevsky and V Trofimov · 1981
Earlier work this paper cites.
Least squares quantization in PCM
Stuart Lloyd · 1982
Earlier work this paper cites.
Communication complexity of convex optimization
John N Tsitsiklis and Zhi-Quan Luo · 1987
Earlier work this paper cites.
An elementary proof of a theorem of johnson and lindenstrauss
Sanjoy Dasgupta and Anupam Gupta · 2003
Earlier work this paper cites.
Information theory, inference and learning algorithms
David JC MacKay · 2003
Earlier work this paper cites.
Approximate nearest neighbors and the fast Johnson-Lindenstrauss transform
Nir Ailon and Bernard Chazelle · 2006
Earlier work this paper cites.
Distributed training strategies for the structured perceptron
Ryan McDonald, Keith Hall, and Gideon Mann · 2010
Earlier work this paper cites.
Distributed learning, communication complexity and privacy
Maria-Florina Balcan, Avrim Blum, Shai Fine, and Yishay Mansour · 2012
Cited alongside, same era.
Large scale distributed deep networks
Jeffrey Dean, Greg Corrado, Rajat Monga, Kai Chen, Matthieu Devin, Mark Mao, Andrew Senior, Paul Tucker, Ke Yang, Quoc V Le, et al · 2012
Cited alongside, same era.
Hadamard matrices and their applications
Kathy J Horadam · 2012
Cited alongside, same era.
Yuchen Zhang, John Duchi, Michael I Jordan, and Martin J Wainwright · 2013
Cited alongside, same era.
On communication cost of distributed statistical estimation and dimensionality
Ankit Garg, Tengyu Ma, and Huy L. Nguyen · 2014
Cited alongside, same era.
Parallel training of deep neural networks with natural gradient and parameter averaging
QSGD: Randomized quantization for communication-optimal stochastic gradient descent
Dan Alistarh, Jerry Li, Ryota Tomioka, and Milan Vojnovic · 2016
Closest in time.
Practical secure aggregation for federated learning on user-held data
Keith Bonawitz, Vladimir Ivanov, Ben Kreuter, Antonio Marcedone, H Brendan McMahan, Sarvar Patel, Daniel Ramage, Aaron Segal, and Karn Seth · 2016
Closest in time.
Communication lower bounds for statistical estimation problems via a distributed data processing inequality
Mark Braverman, Ankit Garg, Tengyu Ma, Huy L. Nguyen, and David P. Woodruff · 2016
Closest in time.
Communication-optimal distributed clustering
Jiecao Chen, He Sun, David Woodruff, and Qin Zhang · 2016
Closest in time.
Federated learning: Strategies for improving communication efficiency
Jakub Konečnỳ, H Brendan McMahan, Felix X Yu, Peter Richtárik, Ananda Theertha Suresh, and Dave Bacon · 2016
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Daniel Povey, Xiaohui Zhang, and Sanjeev Khudanpur · 2014
Cited alongside, same era.
Communication complexity of distributed convex learning and optimization
Yossi Arjevani and Ohad Shamir · 2015
Cited alongside, same era.
Universal compression of power-law distributions
Moein Falahatgar, Ashkan Jafarpour, Alon Orlitsky, Venkatadheeraj Pichapati, and Ananda Theertha Suresh · 2015
Cited alongside, same era.
Closest in time.
Randomized distributed mean estimation: Accuracy vs communication
Jakub Konečnỳ and Peter Richtárik · 2016
Closest in time.
Federated learning of deep networks using model averaging
H. Brendan McMahan, Eider Moore, Daniel Ramage, and Blaise Aguera y Arcas · 2016
Closest in time.
Orthogonal random features
Felix X Yu, Ananda Theertha Suresh, Krzysztof Choromanski, Daniel Holtmann-Rice, and Sanjiv Kumar · 2016
Closest in time.