Fetching the paper…
Reading the bibliography…
We consider the problem of decentralized consensus optimization, where the sum of $n$ smooth and strongly convex functions are minimized over $n$ distributed agents that form a connected network.
J. N. Tsitsiklis, “Problems in decentralized decision making and computation.,” tech. rep., MASSACHUSETTS INST OF TECH CAMBRIDGE LAB FOR INFORMATION AND DECISION SYSTEMS, 1984
1984
Earlier work this paper cites.
J. Tsitsiklis, D. Bertsekas, and M. Athans, “Distributed asynchronous deterministic and stochastic gradient optimization algorithms,” IEEE transactions on automatic control
1986
Earlier work this paper cites.
S. Yuksel and T. Basar, “Quantization and coding for decentralized lti systems,” in Decision and Control, 2003. Proceedings. 42nd IEEE Conference on
2003
Earlier work this paper cites.
M. Rabbat and R. Nowak, “Distributed optimization in sensor networks,” in Proceedings of the 3rd international symposium on Information processing in sensor networks
2004
Earlier work this paper cites.
M. G. Rabbat and R. D. Nowak, “Quantized incremental algorithms for distributed optimization,” IEEE Journal on Selected Areas in Communications
2005
Earlier work this paper cites.
A. Kashyap, T. Basar, and R. Srikant, “Quantized consensus,” 2006 IEEE International Symposium on Information Theory
2006
Earlier work this paper cites.
R. Olfati-Saber, J. A. Fax, and R. M. Murray, “Consensus and cooperation in networked multi-agent systems,” Proceedings of the IEEE
2007
Earlier work this paper cites.
W. Ren, R. W. Beard, and E. M. Atkins, “Information consensus in multivehicle cooperative control,” IEEE Control Systems
2007
Earlier work this paper cites.
T. C. Aysal, M. Coates, and M. Rabbat, “Distributed average consensus using probabilistic quantization,” in Statistical Signal Processing, 2007. SSP’07. IEEE/SP 14th Workshop on
2007
Earlier work this paper cites.
A. Nedic, A. Olshevsky, A. Ozdaglar, and J. N. Tsitsiklis, “Distributed subgradient methods and quantization effects,” in Decision and Control, 2008. CDC 2008. 47th IEEE Conference on
2008
Earlier work this paper cites.
A. Nedic, A. Olshevsky, A. Ozdaglar, and J. N. Tsitsiklis, “On distributed averaging algorithms and quantization effects,” IEEE Transactions on Automatic Control
2009
Earlier work this paper cites.
A. Ribeiro, “Ergodic stochastic optimization algorithms for wireless communication and networking,” IEEE Transactions on Signal Processing
2010
Earlier work this paper cites.
S. S. Ram, A. Nedić, and V. V. Veeravalli, “Distributed stochastic subgradient projection algorithms for convex optimization,” Journal of optimization theory and applications
2010
Earlier work this paper cites.
S. Boyd, N. Parikh, E. Chu, B. Peleato, J. Eckstein, et al
2011
Cited alongside, same era.
M. Chowdhury, M. Zaharia, J. Ma, M. I. Jordan, and I. Stoica, “Managing data transfers in computer clusters with orchestra,” ACM SIGCOMM Computer Communication Review
2011
Cited alongside, same era.
K. I. Tsianos, S. Lawlor, and M. G. Rabbat, “Consensus-based distributed optimization: Practical issues and applications in large-scale machine learning,” in Communication, Control, and Computing, 2012 50th Annual Allerton Conference on
2012
Cited alongside, same era.
J. C. Duchi, A. Agarwal, and M. J. Wainwright, “Dual averaging for distributed optimization: Convergence analysis and network scaling,” IEEE Transactions on Automatic control
2012
Cited alongside, same era.
K. I. Tsianos, S. Lawlor, and M. G. Rabbat, “Push-sum distributed dual averaging for convex optimization,” in Decision and Control (CDC), 2012 IEEE 51st Annual Conference on
M. El Chamie, J. Liu, and T. Başar, “Design and analysis of distributed averaging with quantized communication,” IEEE Transactions on Automatic Control
2016
Later among the works it cites.
2016
Later among the works it cites.
K. Lee, M. Lam, R. Pedarsani, D. Papailiopoulos, and K. Ramchandran, “Speeding up distributed machine learning using codes,” in Information Theory (ISIT), 2016 IEEE International Symposium on
2016
Later among the works it cites.
2016
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
2012
Cited alongside, same era.
Y. Cao, W. Yu, W. Ren, and G. Chen, “An overview of recent progress in the study of distributed multi-agent coordination,” IEEE Transactions on Industrial informatics
2013
Cited alongside, same era.
E. Wei, A. Ozdaglar, and A. Jadbabaie, “A distributed Newton method for network utility maximization–I: Algorithm,” IEEE Transactions on Automatic Control
2013
Cited alongside, same era.
F. Yan, S. Sundaram, S. Vishwanathan, and Y. Qi, “Distributed autonomous online learning: Regrets and intrinsic privacy-preserving properties,” IEEE Transactions on Knowledge and Data Engineering
2013
Cited alongside, same era.
D. Jakovetić, J. Xavier, and J. M. Moura, “Fast distributed gradient methods,” IEEE Transactions on Automatic Control
2014
Cited alongside, same era.
W. Shi, Q. Ling, K. Yuan, G. Wu, and W. Yin, “On the linear convergence of the admm in decentralized consensus optimization,” IEEE Trans. Signal Processing
2014
Cited alongside, same era.
F. Seide, H. Fu, J. Droppo, G. Li, and D. Yu, “1-bit stochastic gradient descent and its application to data-parallel distributed training of speech DNNs,” in Fifteenth Annual Conference of the International Speech Communication Association
2014
Cited alongside, same era.
E. Gravelle and S. Martínez, “Quantized distributed load balancing with capacity constraints,” in Decision and Control (CDC), 2014 IEEE 53rd Annual Conference on
2014
Cited alongside, same era.
A. Mokhtari, Q. Ling, and A. Ribeiro, “Network Newton distributed optimization methods,” IEEE Transactions on Signal Processing
2017
Later among the works it cites.
M. Eisen, A. Mokhtari, and A. Ribeiro, “Decentralized quasi-newton methods,” IEEE Transactions on Signal Processing
2017
Later among the works it cites.
D. Alistarh, D. Grubic, J. Li, R. Tomioka, and M. Vojnovic, “QSGD: Communication-efficient SGD via gradient quantization and encoding,” in Advances in Neural Information Processing Systems
2017
Later among the works it cites.
Y. H. Ezzeldin, M. Karmoose, and C. Fragouli, “Communication vs distributed computation: an alternative trade-off curve,” in Information Theory Workshop (ITW), 2017 IEEE
2017
Later among the works it cites.
D. Dheeru and E. Karra Taniskidou, “UCI machine learning repository,” 2017
2017
Later among the works it cites.
A. Reisizadeh, A. Mokhtari, H. Hassani, and R. Pedarsani, “Quantized decentralized consensus optimization,” in 2018 IEEE Conference on Decision and Control (CDC)
2018
Closest in time.
S. Prakash, A. Reisizadeh, R. Pedarsani, and S. Avestimehr, “Coded computing for distributed graph analytics,” in 2018 IEEE International Symposium on Information Theory (ISIT)
2018
Closest in time.
2018
Closest in time.
C.-S. Lee, N. Michelusi, and G. Scutari, “Finite rate quantized distributed optimization with geometric convergence,” in 2018 52nd Asilomar Conference on Signals, Systems, and Computers
2018
Closest in time.