Fetching the paper…
Reading the bibliography…
In this paper, we consider the problem of distributed online convex optimization, where a group of agents collaborate to track the global minimizers of a sum of time-varying objective functions in an online manner.
M. Zinkevich, “Online convex programming and generalized infinitesimal gradient ascent,” in Proceedings of the 20th International Conference on Machine Learning (ICML-03) , 2003, pp. 928–936
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 . ACM, 2004, pp. 20–27
2004
Earlier work this paper cites.
E. Hazan, A. Agarwal, and S. Kale, “Logarithmic regret algorithms for online convex optimization,” Machine Learning , vol. 69, no. 2-3, pp. 169–192, 2007
2007
Earlier work this paper cites.
A. Nedic and A. Ozdaglar, “Distributed subgradient methods for multi-agent optimization,” IEEE Transactions on Automatic Control , vol. 1, no. 54, pp. 48–61, 2009
2009
Earlier work this paper cites.
J. C. Duchi, A. Agarwal, and M. J. Wainwright, “Dual averaging for distributed optimization: Convergence analysis and network scaling,” IEEE Transactions on Automatic control , vol. 57, no. 3, pp. 592–606, 2011
2011
Earlier work this paper cites.
J. Duchi, E. Hazan, and Y. Singer, “Adaptive subgradient methods for online learning and stochastic optimization,” Journal of Machine Learning Research , vol. 12, no. Jul, pp. 2121–2159, 2011
2011
Earlier work this paper cites.
C.-K. Chiang, T. Yang, C.-J. Lee, M. Mahdavi, C.-J. Lu, R. Jin, and S. Zhu, “Online optimization with gradual variations,” in Conference on Learning Theory , 2012, pp. 6–1
2012
Earlier work this paper cites.
2012
Earlier work this paper cites.
D. Mateos-Nunez and J. Cortés, “Distributed online convex optimization over jointly connected digraphs,” IEEE Transactions on Network Science and Engineering , vol. 1, no. 1, pp. 23–37, 2014
2014
Earlier work this paper cites.
N. Chatzipanagiotis, D. Dentcheva, and M. M. Zavlanos, “An augmented lagrangian method for distributed optimization,” Mathematical Programming , vol. 152, no. 1-2, pp. 405–434, 2015
2015
Earlier work this paper cites.
N. Chatzipanagiotis and M. M. Zavlanos, “A distributed algorithm for convex constrained optimization under noise,” IEEE Transactions on Automatic Control , vol. 61, no. 9, pp. 2496–2511, 2015
2015
Earlier work this paper cites.
M. Akbari, B. Gharesifard, and T. Linder, “Distributed online convex optimization on time-varying directed graphs,” IEEE Transactions on Control of Network Systems , vol. 4, no. 3, pp. 417–428, 2015
2015
Earlier work this paper cites.
E. C. Hall and R. M. Willett, “Online convex optimization in dynamic environments,” IEEE Journal of Selected Topics in Signal Processing , vol. 9, no. 4, pp. 647–662, 2015
2015
Earlier work this paper cites.
O. Besbes, Y. Gur, and A. Zeevi, “Non-stationary stochastic optimization,” Operations research , vol. 63, no. 5, pp. 1227–1244, 2015
2015
Earlier work this paper cites.
A. Jadbabaie, A. Rakhlin, S. Shahrampour, and K. Sridharan, “Online optimization: Competing with dynamic comparators,” in Artificial Intelligence and Statistics , 2015, pp. 398–406
2015
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.
S. Hosseini, A. Chapman, and M. Mesbahi, “Online distributed convex optimization on dynamic networks,” IEEE Transactions on Automatic Control , vol. 61, no. 11, pp. 3545–3550, 2016
2016
Cited alongside, same era.
A. Mokhtari, S. Shahrampour, A. Jadbabaie, and A. Ribeiro, “Online optimization in dynamic environments: Improved regret rates for strongly convex problems,” in 2016 IEEE 55th Conference on Decision and Control (CDC) . IEEE, 2016, pp. 7195–7201
2016
Cited alongside, same era.
T. Yang, L. Zhang, R. Jin, and J. Yi, “Tracking slowly moving clairvoyant: Optimal dynamic regret of online learning with true and noisy gradient,” in International Conference on Machine Learning , 2016, pp. 449–457
2016
Cited alongside, same era.
N. Chen, J. Comden, Z. Liu, A. Gandhi, and A. Wierman, “Using predictions in online optimization: Looking forward with an eye on the past,” ACM SIGMETRICS Performance Evaluation Review , vol. 44, no. 1, pp. 193–206, 2016
2016
Cited alongside, same era.
S. Shahrampour and A. Jadbabaie, “Distributed online optimization in dynamic environments using mirror descent,” IEEE Transactions on Automatic Control , vol. 63, no. 3, pp. 714–725, 2018
2018
Later among the works it cites.
T. Tatarenko and M. Kamgarpour, “Minimizing regret in unconstrained online convex optimization,” in 2018 European Control Conference (ECC) . IEEE, 2018, pp. 143–148
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.
2019
Closest in time.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
2016
Cited alongside, same era.
S. Lee, N. Chatzipanagiotis, and M. M. Zavlanos, “A distributed augmented lagrangian method for model predictive control,” in 2017 IEEE 56th Annual Conference on Decision and Control (CDC) . IEEE, 2017, pp. 2888–2893
2017
Cited alongside, same era.
A. Nedić, A. Olshevsky, and C. A. Uribe, “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.
S. Lee and M. M. Zavlanos, “Approximate projection methods for decentralized optimization with functional constraints,” IEEE Transactions on Automatic Control , vol. 63, no. 10, pp. 3248–3260, 2017
2017
Cited alongside, same era.
——, “On the convergence of a distributed augmented lagrangian method for nonconvex optimization,” IEEE Transactions on Automatic Control , vol. 62, no. 9, pp. 4405–4420, 2017
2017
Cited alongside, same era.
2017
Cited alongside, same era.
D. Yuan, D. W. Ho, and G.-P. Jiang, “An adaptive primal-dual subgradient algorithm for online distributed constrained optimization,” IEEE transactions on cybernetics , vol. 48, no. 11, pp. 3045–3055, 2017
2017
Cited alongside, same era.
T. Chen, Q. Ling, and G. B. Giannakis, “An online convex optimization approach to proactive network resource allocation,” IEEE Transactions on Signal Processing , vol. 65, no. 24, pp. 6350–6364, 2017
2017
Cited alongside, same era.
2019
Closest in time.
K. Lu, G. Jing, and L. Wang, “Online distributed optimization with strongly pseudoconvex-sum cost functions,” IEEE Transactions on Automatic Control , 2019
2019
Closest in time.
2019
Closest in time.
2019
Closest in time.
2019
Closest in time.
R. Dixit, A. S. Bedi, R. Tripathi, and K. Rajawat, “Online learning with inexact proximal online gradient descent algorithms,” IEEE Transactions on Signal Processing , vol. 67, no. 5, pp. 1338–1352, 2019
2019
Closest in time.
X. Yi, X. Li, L. Xie, and K. H. Johansson, “A distributed algorithm for online convex optimization with time-varying coupled inequality constraints,” in 2019 IEEE 58th Conference on Decision and Control (CDC) . IEEE, 2019, pp. 555–560
2019
Closest in time.
Y. Zhang, R. Ravier, M. M. Zavlanos, and V. Tarokh, “A distributed online convex optimization algorithm with improved dynamic regret,” in 58th IEEE Conference on Decision and Control , Nice, France, December 2019
2019
Closest in time.
R. Ravier, A. Calderbank, and V. Tarokh, “Prediction in online convex optimization for parametrizable objective functions,” in 58th IEEE Conference on Decision and Control , Nice, France, December 2019
2019
Closest in time.
A. Ajalloeian, A. Simonetto, and E. Dall’Anese, “Inexact online proximal-gradient method for time-varying convex optimization,” in 2020 American Control Conference (ACC) . IEEE, 2020, pp. 2850–2857
2020
Closest in time.
S. Pu and A. Nedić, “Distributed stochastic gradient tracking methods,” Mathematical Programming , pp. 1–49, 2020
2020
Closest in time.