Fetching the paper…
Reading the bibliography…
We introduce a primal-dual stochastic gradient oracle method for distributed convex optimization problems over networks.
1901
Earlier work this paper cites.
M. H. DeGroot, “Reaching a consensus,” Journal of the American Statistical Association , vol. 69, no. 345, pp. 118–121, 1974
1974
Earlier work this paper cites.
V. Borkar and P. P. Varaiya, “Asymptotic agreement in distributed estimation,” IEEE Transactions on Automatic Control , vol. 27, no. 3, pp. 650–655, 1982
1982
Earlier work this paper cites.
J. N. Tsitsiklis and M. Athans, “Convergence and asymptotic agreement in distributed decision problems,” IEEE Transactions on Automatic Control , vol. 29, no. 1, pp. 42–50, 1984
1984
Earlier work this paper cites.
M. Rabbat and R. Nowak, “Decentralized source localization and tracking wireless sensor networks,” in Proceedings of the IEEE International Conference on Acoustics, Speech, and Signal Processing , vol. 3, 2004, pp. 921–924
2004
Earlier work this paper cites.
2004
Earlier work this paper cites.
L. Xiao and S. Boyd, “Optimal scaling of a gradient method for distributed resource allocation,” Journal of Optimization Theory and Applications , vol. 129, no. 3, pp. 469–488, 2006
2006
Earlier work this paper cites.
2008
Earlier work this paper cites.
A. Nedić, A. Olshevsky, A. Ozdaglar, and J. N. Tsitsiklis, “On distributed averaging algorithms and quantization effects,” IEEE Transactions on Automatic Control , vol. 54, no. 11, pp. 2506–2517, 2009
2009
Earlier work this paper cites.
L. Bottou, “Large-scale machine learning with stochastic gradient descent,” in Proceedings of COMPSTAT’2010 . Springer, 2010, pp. 177–186
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 , vol. 147, no. 3, pp. 516–545, 2010
2010
Earlier work this paper cites.
S. Boyd, N. Parikh, E. Chu, B. Peleato, and J. Eckstein, “Distributed optimization and statistical learning via the alternating direction method of multipliers,” Foundations and Trends® in Machine Learning , vol. 3, no. 1, pp. 1–122, 2011
2011
Earlier work this paper cites.
T. Kraska, A. Talwalkar, J. C. Duchi, R. Griffith, M. J. Franklin, and M. I. Jordan, “Mlbase: A distributed machine-learning system.” in CIDR , vol. 1, 2013, pp. 2–1
2013
Earlier work this paper cites.
R. T. Rockafellar, Convex analysis . Princeton university press, 2015
2015
Cited alongside, same era.
M. Abadi, A. Agarwal, P. Barham, E. Brevdo, Z. Chen, C. Citro, G. S. Corrado, A. Davis, J. Dean, M. Devin et al. , “Tensorflow: Large-scale machine learning on heterogeneous distributed systems.” in Conf. on Language Resources and Evaluation (LREC’08) , 2016, pp. 3243–3249
2016
Cited alongside, same era.
2016
Cited alongside, same era.
A. Chernov, P. Dvurechensky, and A. Gasnikov, “Fast primal-dual gradient method for strongly convex minimization problems with linear constraints,” in Discrete Optimization and Operations Research: 9th International Conference, DOOR 2016, Vladivostok, Russia, September 19-23, 2016, Proceedings , Y. Kochetov, M. Khachay, V. Beresnev, E. Nurminski, and P. Pardalos, Eds. Springer International Publishing, 2016, pp. 391–403
2018
Later among the works it cites.
D. Jakovetic, D. Bajovic, A. K. Sahu, and S. Kar, “Convergence rates for distributed stochastic optimization over random networks,” in 2018 IEEE Conference on Decision and Control (CDC) , 2018, pp. 4238–4245
2018
Later among the works it cites.
K. Scaman, F. Bach, S. Bubeck, L. Massoulié, and Y. T. Lee, “Optimal algorithms for non-smooth distributed optimization in networks,” in Advances in Neural Information Processing Systems , 2018, pp. 2745–2754
2018
Later among the works it cites.
M. Maros and J. Jaldén, “PANDA: A Dual Linearly Converging Method for Distributed Optimization Over Time-Varying Undirected Graphs,” in 2018 IEEE Conference on Decision and Control (CDC) , 2018, pp. 6520–6525
2018
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
2016
Cited alongside, same era.
M. Cuturi and G. Peyré, “A smoothed dual approach for variational wasserstein problems,” SIAM J. on Imaging Sciences , vol. 9, no. 1, pp. 320–343, 2016
2016
Cited alongside, same era.
2017
Cited alongside, same era.
A. Nedić, A. Olshevsky, and W. Shi, “Achieving geometric convergence for distributed optimization over time-varying graphs,” SIAM Journal on Optimization , vol. 27, no. 4, pp. 2597–2633, 2017
2017
Cited alongside, same era.
A. Nedić, A. Olshevsky, and C. A. Uribe, “Fast convergence rates for distributed non-Bayesian
2017
Cited alongside, same era.
K. Scaman, F. Bach, S. Bubeck, Y. T. Lee, and L. Massoulié, “Optimal algorithms for smooth and strongly convex distributed optimization in networks,” in Proc. of the 34th International Conference on Machine Learning , 2017, pp. 3027–3036
2017
Cited alongside, same era.
G. Lan, S. Lee, and Y. Zhou, “Communication-efficient algorithms for decentralized and stochastic optimization,” Mathematical Programming , pp. 1–48, 2017
2017
Cited alongside, same era.
W. Li, M. Assaad, and P. Duhamel, “Distributed stochastic optimization in networks with low informational exchange,” in 2017 55th Annual Allerton Conference on Communication, Control, and Computing (Allerton) . IEEE, 2017, pp. 1160–1167
2017
Cited alongside, same era.
A. S. Anikin, A. V. Gasnikov, P. E. Dvurechensky, A. I. Tyurin, and A. V. Chernov, “Dual approaches to the minimization of strongly convex functionals with a simple structure under affine constraints,” Computational Mathematics and Mathematical Physics , vol. 57, no. 8, pp. 1262–1276, 2017
2017
Cited alongside, same era.
2018
Later among the works it cites.
2018
Later among the works it cites.
C. A. Uribe, D. Dvinskikh, P. Dvurechensky, A. Gasnikov, and A. Nedić, “Distributed Computation of Wasserstein Barycenters Over Networks,” in 2018 IEEE Conference on Decision and Control (CDC) , Dec 2018, pp. 6544–6549
2018
Later among the works it cites.
2018
Later among the works it cites.
P. Dvurechenskii, D. Dvinskikh, A. Gasnikov, C. Uribe, and A. Nedich, “Decentralize and randomize: Faster algorithm for wasserstein barycenters,” in Advances in Neural Information Processing Systems , 2018, pp. 10 760–10 770
2018
Later among the works it cites.
2019
Closest in time.
2019
Closest in time.
S. V. Guminov, Y. E. Nesterov, P. E. Dvurechensky, and A. V. Gasnikov, “Accelerated primal-dual gradient descent with linesearch for convex, nonconvex, and nonsmooth optimization problems,” Doklady Mathematics , vol. 99, no. 2, pp. 125–128, 2019
2019
Closest in time.