Fetching the paper…
Reading the bibliography…
In distributed optimization and machine learning, multiple nodes coordinate to solve large problems.
A. C.-C. Yao, “Some complexity questions related to distributive computing (preliminary report),” in Proceedings of the eleventh annual ACM symposium on Theory of computing . ACM, 1979, pp. 209–213
1979
Earlier work this paper cites.
J. N. Tsitsiklis and Z.-Q. Luo, “Communication complexity of convex optimization,” Journal of Complexity , vol. 3, no. 3, pp. 231–243, 1987
1987
Earlier work this paper cites.
D. P. Bertsekas and J. N. Tsitsiklis, Parallel and distributed computation: numerical methods . Prentice hall Englewood Cliffs, NJ, 1989, vol. 23
1989
Earlier work this paper cites.
D. P. Bertsekas, R. G. Gallager, and P. Humblet, Data networks . Prentice-Hall International New Jersey, 1992, vol. 2
1992
Earlier work this paper cites.
R. D. Yates, “A framework for uplink power control in cellular radio systems,” IEEE Journal on selected areas in communications , vol. 13, no. 7, pp. 1341–1347, 1995
1995
Earlier work this paper cites.
Y. LeCun, L. Bottou, Y. Bengio, P. Haffner et al. , “Gradient-based learning applied to document recognition,” Proceedings of the IEEE , vol. 86, no. 11, pp. 2278–2324, 1998
1998
Earlier work this paper cites.
I. F. Akyildiz, W. Su, Y. Sankarasubramaniam, and E. Cayirci, “Wireless sensor networks: A survey,” Computer networks , vol. 38, no. 4, pp. 393–422, 2002
2002
Earlier work this paper cites.
V. Conitzer and T. Sandholm, “Communication complexity as a lower bound for learning in games,” in Proceedings of the twenty-first international conference on Machine learning . ACM, 2004, p. 24
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 , vol. 23, no. 4, pp. 798–808, 2005
2005
Earlier work this paper cites.
A. Koubaa, M. Alves, and E. Tovar, “A comprehensive simulation study of slotted csma/ca for ieee 802.15. 4 wireless sensor networks,” in IEEE international workshop on factory communication systems . IEEE, 2006, pp. 183–192
2006
Earlier work this paper cites.
R. Roth, Introduction to coding theory . Cambridge University Press, 2006
2006
Earlier work this paper cites.
J. P. Hespanha, P. Naghshtabrizi, and Y. Xu, “A survey of recent results in networked control systems,” Proceedings of the IEEE , vol. 95, no. 1, pp. 138–162, 2007
2007
Earlier work this paper cites.
K. Koh, S.-J. Kim, and S. Boyd, “An interior-point method for large-scale l1-regularized logistic regression,” Journal of Machine learning research , vol. 8, no. Jul, pp. 1519–1555, 2007
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 . IEEE, 2008, pp. 4177–4184
2008
Earlier work this paper cites.
T. Cui, L. Chen, and S. H. Low, “A game-theoretic framework for medium access control,” IEEE Journal on Selected Areas in Communications , vol. 26, no. 7, 2008
2008
Earlier work this paper cites.
R. T. Rockafellar and R. J.-B. Wets, Variational analysis . Springer Science & Business Media, 2009, vol. 317
2009
Earlier work this paper cites.
S. Hart and Y. Mansour, “How long to equilibrium? the communication complexity of uncoupled equilibrium procedures,” Games and Economic Behavior , vol. 69, no. 1, pp. 107–126, 2010
2010
Earlier work this paper cites.
L. Chen, S. H. Low, and J. C. Doyle, “Random access game and medium access control design,” IEEE/ACM Transactions on Networking (TON) , vol. 18, no. 4, pp. 1303–1316, 2010
2010
Cited alongside, same era.
Y. Polyanskiy, H. V. Poor, and S. Verdú, “Channel coding rate in the finite blocklength regime,” IEEE Transactions on Information Theory , vol. 56, no. 5, pp. 2307–2359, 2010
2010
Cited alongside, same era.
C. Fischione, “Fast-lipschitz optimization with wireless sensor networks applications,” Automatic Control, IEEE Transactions on , vol. 56, no. 10, pp. 2319–2331, Oct 2011
2011
Cited alongside, same era.
A. El Gamal and Y.-H. Kim, Network information theory . Cambridge university press, 2011
2011
Cited alongside, same era.
M. F. Balcan, A. Blum, S. Fine, and Y. Mansour, “Distributed learning, communication complexity and privacy,” in Conference on Learning Theory , 2012, pp. 26–1
W. Wen, C. Xu, F. Yan, C. Wu, Y. Wang, Y. Chen, and H. Li, “Terngrad: Ternary gradients to reduce communication in distributed deep learning,” in Advances in neural information processing systems , 2017, pp. 1509–1519
2017
Later among the works it cites.
Y. Pu, M. N. Zeilinger, and C. N. Jones, “Quantization design for distributed optimization,” IEEE Transactions on Automatic Control , vol. 62, no. 5, pp. 2107–2120, 2017
2017
Later among the works it cites.
——, “Communication complexity of dual decomposition methods for distributed resource allocation optimization,” IEEE Journal of Selected Topics in Signal Processing , vol. 12, no. 4, pp. 717–732, Aug 2018
2018
Later among the works it cites.
J. Wu, W. Huang, J. Huang, and T. Zhang, “Error compensated quantized SGD and its applications to large-scale distributed optimization,” in Proceedings of the 35th International Conference on Machine Learning , ser. Proceedings of Machine Learning Research, J. Dy and A. Krause, Eds., vol. 80. Stockholmsmässan, Stockholm Sweden: PMLR, 10–15 Jul 2018, pp. 5325–5333
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
2012
Cited alongside, same era.
D. Anguita, A. Ghio, L. Oneto, X. Parra, and J. L. Reyes-Ortiz, “Human activity recognition on smartphones using a multiclass hardware-friendly support vector machine,” in International workshop on ambient assisted living . Springer, 2012, pp. 216–223
2012
Cited alongside, same era.
Y. Zhang, J. Duchi, M. I. Jordan, and M. J. Wainwright, “Information-theoretic lower bounds for distributed statistical estimation with communication constraints,” in Advances in Neural Information Processing Systems , 2013, pp. 2328–2336
2013
Cited alongside, same era.
Y. Nesterov, Introductory lectures on convex optimization: A basic course . Springer Science & Business Media, 2013, vol. 87
2013
Cited alongside, same era.
R. A. Horn, R. A. Horn, and C. R. Johnson, Matrix analysis 2nd Edition . Cambridge university press, 2013
2013
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
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 , vol. 62, no. 7, pp. 1750–1761, 2014
2014
Cited alongside, same era.
A. H. Sayed, “Diffusion adaptation over networks,” in Academic Press Library in Signal Processing . Elsevier, 2014, vol. 3, pp. 323–453
2014
Cited alongside, same era.
2018
Later among the works it cites.
M. Ye and E. Abbe, “Communication-computation efficient gradient coding,” in Proceedings of the 35th International Conference on Machine Learning , ser. Proceedings of Machine Learning Research, J. Dy and A. Krause, Eds., vol. 80. Stockholmsmässan, Stockholm Sweden: PMLR, 10–15 Jul 2018, pp. 5610–5619
2018
Later among the works it cites.
D. Alistarh, T. Hoefler, M. Johansson, N. Konstantinov, S. Khirirat, and C. Renggli, “The convergence of sparsified gradient methods,” in Advances in Neural Information Processing Systems , 2018, pp. 5977–5987
2018
Later among the works it cites.
2018
Later among the works it cites.
Y. Zhu and J. Lafferty, “Distributed nonparametric regression under communication constraints,” in Proceedings of the 35th International Conference on Machine Learning , ser. Proceedings of Machine Learning Research, J. Dy and A. Krause, Eds., vol. 80. Stockholmsmässan, Stockholm Sweden: PMLR, 10–15 Jul 2018, pp. 6009–6017
2018
Later among the works it cites.
M. I. Jordan, J. D. Lee, and Y. Yang, “Communication-efficient distributed statistical inference,” Journal of the American Statistical Association , no. just-accepted, 2018
2018
Later among the works it cites.
2018
Later among the works it cites.
2018
Later among the works it cites.
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 . IEEE, 2018, pp. 1876–1880
2018
Later among the works it cites.
2018
Later among the works it cites.
S. U. Stich, J.-B. Cordonnier, and M. Jaggi, “Sparsified SGD with memory,” in Advances in Neural Information Processing Systems 31 , S. Bengio, H. Wallach, H. Larochelle, K. Grauman, N. Cesa-Bianchi, and R. Garnett, Eds. Curran Associates, Inc., 2018, pp. 4447–4458
2018
Later among the works it cites.
G. Qu and N. Li, “Harnessing smoothness to accelerate distributed optimization,” IEEE Transactions on Control of Network Systems , vol. 5, no. 3, pp. 1245–1260, 2018
2018
Later among the works it cites.
2018
Later among the works it cites.
S. Magnússon, H. S. Ghadikolaei, and N. Li, “On maintaining linear convergence of distributed learning and optimization under limited communication,” in 2019 53nd Asilomar Conference on Signals, Systems, and Computers . IEEE, 2019, pp. 1876–1880, [Online]. Available: https://www.dropbox.com/s/ceqjsmwv28mdj1i/asilomar_paper.pdf?dl=0
2019
Closest in time.