Fetching the paper…
Reading the bibliography…
We consider a distributed stochastic optimization problem that is solved by a decentralized network of agents with only local communication between neighboring agents.
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.
A. Nemirovskii and Yudin, Problem Complexity and Method Efficiency in Optimization . Wiley, 1983
1983
Earlier work this paper cites.
Y. Nesterov, “A method of solving a convex programming problem with convergence rate o ( 1 / k 2 ) o(1/k^{2}) ,” Soviet Mathematics Doklady , vol. 27, no. 2, pp. 372–376, 1983
1983
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.
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.
S. S. Ram, V. V. Veeravalli, and A. Nedic, “Distributed non-autonomous power control through distributed convex optimization,” in IEEE INFOCOM 2009 . IEEE, 2009, pp. 3001–3005
2009
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.
A. Nedic and A. Ozdaglar, “Distributed subgradient methods for multi-agent optimization,” IEEE Transactions on Automatic Control , vol. 54, no. 1, pp. 48–61, 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.
A. Wien, Iterative solution of large linear systems . Lecture Notes, TU Wien, 2011
2011
Earlier work this paper cites.
C.-C. Chang and C.-J. Lin, “Libsvm: a library for support vector machines,” ACM transactions on intelligent systems and technology (TIST) , vol. 2, no. 3, p. 27, 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.
S. Ghadimi and G. Lan, “Optimal stochastic approximation algorithms for strongly convex stochastic composite optimization, ii: Shrinking procedures and optimal algorithms,” SIAM Journal on Optimization , vol. 23, no. 4, pp. 2061–2089, 2013
2013
Earlier work this paper cites.
O. Devolder, F. Glineur, and Y. Nesterov, “First-order methods with inexact oracle: the strongly convex case,” CORE DP 2013/16 , 2013
2013
Earlier work this paper cites.
O. Devolder, F. Glineur, and Y. Nesterov, “First-order methods of smooth convex optimization with inexact oracle,” Mathematical Programming , vol. 146, no. 1-2, pp. 37–75, 2014
2014
Earlier work this paper cites.
W. Shi, Q. Ling, G. Wu, and W. Yin, “Extra: An exact first-order algorithm for decentralized consensus optimization,” SIAM Journal on Optimization , vol. 25, no. 2, pp. 944–966, 2015
2015
Earlier work this paper cites.
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
Earlier work this paper cites.
G. Qu and N. Li, “Accelerated distributed nesterov gradient descent,” 2016 54th Annual Allerton Conference on Communication, Control, and Computing , 2016
2016
Earlier work this paper cites.
P. Dvurechensky and A. Gasnikov, “Stochastic intermediate gradient method for convex problems with stochastic inexact oracle,” Journal of Optimization Theory and Applications , vol. 171, no. 1, pp. 121–145, 2016
2016
Earlier work this paper cites.
A. V. Gasnikov and P. E. Dvurechensky, “Stochastic intermediate gradient method for convex optimization problems,” Doklady Mathematics , vol. 93, no. 2, pp. 148–151, Mar 2016
2016
Cited alongside, same era.
2017
Cited alongside, same era.
——, “Fast convergence rates for distributed non-bayesian learning,” IEEE Transactions on Automatic Control , vol. 62, no. 11, pp. 5538–5553, 2017
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
2019
Later among the works it cites.
2019
Later among the works it cites.
D. Jakovetic, “A unification and generalization of exact distributed first order methods,” IEEE Transactions on Signal and Information Processing over Networks , pp. 31–46, 2019
2019
Later among the works it cites.
2019
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
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 International Conference on Machine Learning , 2017, pp. 3027–3036
2017
Cited alongside, same era.
X. Wu and J. Lu, “Fenchel dual gradient methods for distributed convex optimization over time-varying networks,” in 2017 IEEE 56th Annual Conference on Decision and Control (CDC) , 2017, pp. 2894–2899
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.
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) , 2018, pp. 6544–6549
2018
Cited alongside, same era.
P. E. Dvurechensky, A. V. Gasnikov, and A. A. Lagunovskaya, “Parallel algorithms and probability of large deviation for stochastic convex optimization problems,” Numerical Analysis and Applications , vol. 11, no. 1, pp. 33–37, 2018
2018
Cited alongside, same era.
Y. Zhang and L. Xiao, Communication-Efficient Distributed Optimization of Self-concordant Empirical Loss . Cham: Springer International Publishing, 2018, pp. 289–341
2018
Cited alongside, same era.
2018
Cited alongside, same era.
F. S. Stonyakin, D. Dvinskikh, P. Dvurechensky, A. Kroshnin, O. Kuznetsova, A. Agafonov, A. Gasnikov, A. Tyurin, C. A. Uribe, D. Pasechnyuk, and S. Artamonov, “Gradient methods for problems with inexact model of the objective,” in Mathematical Optimization Theory and Operations Research , M. Khachay, Y. Kochetov, and P. Pardalos, Eds. Cham: Springer International Publishing, 2019, pp. 97–114
2019
Later among the works it cites.
D. Kamzolov, P. Dvurechensky, and A. V. Gasnikov, “Universal intermediate gradient method for convex problems with inexact oracle,” Optimization Methods and Software , 2020. [Online]. Available: https://doi.org/10.1080/10556788.2019.1711079
2019
Later among the works it cites.
E. A. Vorontsova, A. V. Gasnikov, E. A. Gorbunov, and P. E. Dvurechenskii, “Accelerated gradient-free optimization methods with a non-euclidean proximal operator,” Automation and Remote Control , vol. 80, no. 8, pp. 1487–1501, 2019
2019
Later among the works it cites.
A. Ivanova, P. Dvurechensky, A. Gasnikov, and D. Kamzolov, “Composite optimization for the resource allocation problem,” Optimization Methods and Software , 2020. [Online]. Available: https://doi.org/10.1080/10556788.2020.1712599
2020
Later among the works it cites.
Y. Nesterov, A. Gasnikov, S. Guminov, and P. Dvurechensky, “Primal-dual accelerated gradient methods with small-dimensional relaxation oracle,” Optimization Methods and Software , pp. 1–28, 2020. [Online]. Available: https://doi.org/10.1080/10556788.2020.1731747
2020
Later among the works it cites.
2020
Later among the works it cites.
2020
Later among the works it cites.
2020
Later among the works it cites.
2020
Later among the works it cites.
C. A. Uribe, S. Lee, A. Gasnikov, and A. Nedić, “A dual approach for optimal algorithms in distributed optimization over networks,” Optimization Methods and Software , pp. 1–40, 2020
2020
Later among the works it cites.
2020
Later among the works it cites.
2020
Later among the works it cites.
A. Daneshmand, G. Scutari, P. Dvurechensky, and A. Gasnikov, “Newton method over networks is fast up to the statistical precision,” in Proceedings of the 38th International Conference on Machine Learning , vol. 139. PMLR, 2021, pp. 2398–2409
2021
Closest in time.
2021
Closest in time.
A. Agafonov, P. Dvurechensky, G. Scutari, A. Gasnikov, D. Kamzolov, A. Lukashevich, and A. Daneshmand, “An accelerated second-order method for distributed stochastic optimization,” in 2021 60th IEEE Conference on Decision and Control (CDC) , 2021
2021
Closest in time.
D. Dvinskikh and A. Gasnikov, “Decentralized and parallel primal and dual accelerated methods for stochastic convex programming problems,” Journal of Inverse and Ill-posed Problems , vol. 29, no. 3, pp. 385–405, 2021
2021
Closest in time.
F. Stonyakin, A. Tyurin, A. Gasnikov, P. Dvurechensky, A. Agafonov, D. Dvinskikh, M. Alkousa, D. Pasechnyuk, S. Artamonov, and V. Piskunova, “Inexact model: A framework for optimization and variational inequalities,” Optimization Methods and Software , 2021. [Online]. Available: https://doi.org/10.1080/10556788.2021.1924714
2021
Closest in time.
P. Dvurechensky, E. Gorbunov, and A. Gasnikov, “An accelerated directional derivative method for smooth stochastic convex optimization,” European Journal of Operational Research , vol. 290, no. 2, pp. 601 – 621, 2021
2021
Closest in time.
2021
Closest in time.