Fetching the paper…
Reading the bibliography…
In this paper, we propose a new method based on the Sliding Algorithm from Lan(2016, 2019) for the convex composite optimization problem that includes two terms: smooth one and non-smooth one.
Error feedback fixes signsgd and other gradient compression schemes
Karimireddy, S.P., Rebjock, Q., Stich, S.U., and Jaggi, M. (2019) · 1901
Earlier work this paper cites.
Dvinskikh, D. and Gasnikov, A. (2019) · 1904
Earlier work this paper cites.
Optimal decentralized distributed algorithms for stochastic convex optimization
Gorbunov, E., Dvinskikh, D., and Gasnikov, A. (2019) · 1911
Earlier work this paper cites.
Projected gradient method for decentralized optimization over time-varying networks
Rogozin, A. and Gasnikov, A. (2019) · 1911
Earlier work this paper cites.
Terngrad: Ternary gradients to reduce communication in distributed deep learning
Wen, W., Xu, C., Yan, F., Wu, C., Wang, Y., Chen, Y., and Li, H. (2017) · 1911
Earlier work this paper cites.
Problem complexity and method efficiency in optimization
Nemirovsky, A.S. and Yudin, D.B. (1983) · 1983
Earlier work this paper cites.
Parallel and distributed computation: numerical methods , volume 23
Bertsekas, D.P. and Tsitsiklis, J.N. (1989) · 1989
Earlier work this paper cites.
Introductory Lectures on Convex Optimization: a basic course
Nesterov, Y. (2004) · 2004
Earlier work this paper cites.
A survey of numerical methods for optimal control
Rao, A.V. (2009) · 2009
Earlier work this paper cites.
Libsvm: A library for support vector machines
Chang, C.C. and Lin, C.J. (2011) · 2011
Earlier work this paper cites.
Parametric estimation. finite sample theory
Spokoiny, V. et al. (2012) · 2012
Earlier work this paper cites.
Understanding machine learning: From theory to algorithms
Shalev-Shwartz, S. and Ben-David, S. (2014) · 2014
Cited alongside, same era.
Lectures on Modern Convex Optimization (Lecture Notes)
Ben-Tal, A. and Nemirovski, A. (2015) · 2015
Cited alongside, same era.
Optimal rates for zero-order convex optimization: The power of two function evaluations
Duchi, J.C., Jordan, M.I., Wainwright, M.J., and Wibisono, A. (2015) · 2015
Cited alongside, same era.
Geometric median and robust estimation in banach spaces
Minsker, S. et al. (2015) · 2015
Cited alongside, same era.
Geometric median in nearly linear time
Cohen, M.B., Lee, Y.T., Miller, G., Pachocki, J., and Sidford, A. (2016) · 2016
Cited alongside, same era.
Gradient sliding for composite optimization
Lan, G. (2016) · 2016
Cited alongside, same era.
An optimal algorithm for bandit and zero-order convex optimization with two-point feedback
Shamir, O. (2017) · 2017
Later among the works it cites.
Universal gradient descent
Gasnikov, A. (2018) · 2018
Later among the works it cites.
An accelerated method for derivative-free smooth stochastic convex optimization
Gorbunov, E., Dvurechensky, P., and Gasnikov, A. (2018) · 2018
Later among the works it cites.
Optimal algorithms for non-smooth distributed optimization in networks
Scaman, K., Bach, F., Bubeck, S., Massoulié, L., and Lee, Y.T. (2018) · 2018
Later among the works it cites.
Local sgd converges fast and communicates little
Stich, S.U. (2018) · 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…
QSGD: Communication-efficient SGD via gradient quantization and encoding
Alistarh, D., Grubic, D., Li, J., Tomioka, R., and Vojnovic, M. (2017) · 2017
Cited alongside, same era.
Communication-efficient algorithms for decentralized and stochastic optimization
Lan, G., Lee, S., and Zhou, Y. (2017) · 2017
Cited alongside, same era.
Random gradient-free minimization of convex functions
Nesterov, Y. and Spokoiny, V.G. (2017) · 2017
Cited alongside, same era.
Optimal algorithms for smooth and strongly convex distributed optimization in networks
Scaman, K., Bach, F., Bubeck, S., Lee, Y.T., and Massoulié, L. (2017) · 2017
Cited alongside, same era.
On primal and dual approaches for distributed stochastic convex optimization over networks
Dvinskikh, D., Gorbunov, E., Gasnikov, A., Dvurechensky, P., and Uribe, C.A. (2019) · 2019
Closest in time.
Lectures on Optimization Methods for Machine Learning
Lan, G. (2019) · 2019
Closest in time.
Derivative-free optimization methods
Larson, J., Menickelly, M., and Wild, S.M. (2019) · 2019
Closest in time.
Optimal convergence rates for convex distributed optimization in networks
Scaman, K., Bach, F., Bubeck, S., Lee, Y.T., and Massoulié, L. (2019) · 2019
Closest in time.
A dual approach for optimal algorithms in distributed optimization over networks
Uribe, C.A., Lee, S., Gasnikov, A., and Nedić, A. (2020) · 2020
Closest in time.