Fetching the paper…
Reading the bibliography…
In this paper, we propose a distributed zeroth-order policy optimization method for Multi-Agent Reinforcement Learning (MARL).
R. J. Williams, “Simple statistical gradient-following algorithms for connectionist reinforcement learning,” Machine learning , vol. 8, no. 3-4, pp. 229–256, 1992
1992
Earlier work this paper cites.
V. R. Konda and J. N. Tsitsiklis, “Actor-critic algorithms,” in Advances in neural information processing systems , 2000, pp. 1008–1014
2000
Earlier work this paper cites.
A. D. Flaxman, A. T. Kalai, and H. B. McMahan, “Online convex optimization in the bandit setting: gradient descent without a gradient,” in Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms . Society for Industrial and Applied Mathematics, 2005, pp. 385–394
2005
Earlier work this paper cites.
Y. Nesterov, Introductory lectures on convex optimization: A basic course . Springer Science & Business Media, 2013, vol. 87
2013
Earlier work this paper cites.
J. C. Duchi, M. I. Jordan, M. J. Wainwright, and A. Wibisono, “Optimal rates for zero-order convex optimization: The power of two function evaluations,” IEEE Transactions on Information Theory , vol. 61, no. 5, pp. 2788–2806, 2015
2015
Earlier work this paper cites.
J. K. Gupta, M. Egorov, and M. Kochenderfer, “Cooperative multi-agent control using deep reinforcement learning,” in International Conference on Autonomous Agents and Multiagent Systems . Springer, 2017, pp. 66–83
2017
Earlier work this paper cites.
R. Lowe, Y. Wu, A. Tamar, J. Harb, P. Abbeel, and I. Mordatch, “Multi-agent actor-critic for mixed cooperative-competitive environments,” in Advances in Neural Information Processing Systems , 2017, pp. 6379–6390
2017
Earlier work this paper cites.
S. Omidshafiei, J. Pazis, C. Amato, J. P. How, and J. Vian, “Deep decentralized multi-task multi-agent reinforcement learning under partial observability,” in Proceedings of the 34th International Conference on Machine Learning-Volume 70 . JMLR. org, 2017, pp. 2681–2690
2017
Earlier work this paper cites.
M. Lanctot, V. Zambaldi, A. Gruslys, A. Lazaridou, K. Tuyls, J. Pérolat, D. Silver, and T. Graepel, “A unified game-theoretic approach to multiagent reinforcement learning,” in Advances in Neural Information Processing Systems , 2017, pp. 4190–4203
2017
Earlier work this paper cites.
Y. Nesterov and V. Spokoiny, “Random gradient-free minimization of convex functions,” Foundations of Computational Mathematics , vol. 17, no. 2, pp. 527–566, 2017
2017
Earlier work this paper cites.
A. V. Gasnikov, E. A. Krymova, A. A. Lagunovskaya, I. N. Usmanova, and F. A. Fedorenko, “Stochastic online optimization. single-point and multi-point non-linear multi-armed bandits. convex and strongly-convex case,” Automation and remote control , vol. 78, no. 2, pp. 224–234, 2017
2017
Cited alongside, same era.
A. Nedic, 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.
J. Foerster, G. Farquhar, T. Afouras, N. Nardelli, and S. Whiteson, “Counterfactual multi-agent policy gradients,” in Thirty-Second AAAI Conference on Artificial Intelligence , 2018
2018
Cited alongside, same era.
K. Zhang, Z. Yang, H. Liu, T. Zhang, and T. Basar, “Fully decentralized multi-agent reinforcement learning with networked agents,” in International Conference on Machine Learning , 2018, pp. 5867–5876
2018
Cited alongside, same era.
2019
Later among the works it cites.
P. C. Heredia and S. Mou, “Distributed multi-agent reinforcement learning by actor-critic method,” IFAC-PapersOnLine , vol. 52, no. 20, pp. 363–368, 2019
2019
Later among the works it cites.
2019
Later among the works it cites.
R. Dixit, A. S. Bedi, and K. Rajawat, “Online learning over dynamic graphs via distributed proximal gradient algorithm,” IEEE Transactions on Automatic Control , vol. 66, no. 11, pp. 5065–5079, 2020
2020
Closest in time.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
M. Fazel, R. Ge, S. Kakade, and M. Mesbahi, “Global convergence of policy gradient methods for the linear quadratic regulator,” in Proceedings of the 35th International Conference on Machine Learning , vol. 80, 2018
2018
Cited alongside, same era.
2018
Cited alongside, same era.
D. Hajinezhad and M. M. Zavlanos, “Gradient-free multi-agent nonconvex nonsmooth optimization,” in 2018 IEEE Conference on Decision and Control (CDC) . IEEE, 2018, pp. 4939–4944
2018
Cited alongside, same era.
A. K. Sahu, D. Jakovetic, D. Bajovic, and S. Kar, “Distributed zeroth order optimization over random networks: A kiefer-wolfowitz stochastic approximation approach,” in 2018 IEEE Conference on Decision and Control (CDC) . IEEE, 2018, pp. 4951–4958
2018
Cited alongside, same era.
S. Srinivasan, M. Lanctot, V. Zambaldi, J. Pérolat, K. Tuyls, R. Munos, and M. Bowling, “Actor-critic policy optimization in partially observable multiagent environments,” in Advances in neural information processing systems , 2018, pp. 3422–3435
2018
Cited alongside, same era.
Y. Zhang and M. M. Zavlanos, “Distributed off-policy actor-critic reinforcement learning with policy consensus,” in 58th IEEE Conference on Decision and Control , Nice, France, December 2019
2019
Cited alongside, same era.
Y. Yang, J. Hao, G. Chen, H. Tang, Y. Chen, Y. Hu, C. Fan, and Z. Wei, “Q-value path decomposition for deep multiagent reinforcement learning,” in International Conference on Machine Learning . PMLR, 2020, pp. 10 706–10 715
2020
Closest in time.
Y. Zhang, Y. Zhou, K. Ji, and M. M. Zavlanos, “A new one-point residual-feedback oracle for black-box learning and control,” Automatica , p. 110006, 2021. [Online]. Available: https://www.sciencedirect.com/science/article/pii/S000510982100532X
2021
Closest in time.
N. Bastianello and E. Dall’Anese, “Distributed and inexact proximal gradient method for online convex optimization,” in 2021 European Control Conference (ECC) . IEEE, 2021, pp. 2432–2437
2021
Closest in time.
D. Yuan, L. Wang, A. Proutiere, and G. Shi, “Distributed zeroth-order optimization: Convergence rates that match centralized counterpart,” 2021
2021
Closest in time.
X. Chen, Y. Tang, and N. Li, “Improve single-point zeroth-order optimization using high-pass and low-pass filters,” in International Conference on Machine Learning . PMLR, 2022, pp. 3603–3620
2022
Closest in time.