Byzantine-Resilient Distributed Optimization of Multi-Dimensional Functions (2003.09038v5)
Abstract: The problem of distributed optimization requires a group of agents to reach agreement on a parameter that minimizes the average of their local cost functions using information received from their neighbors. While there are a variety of distributed optimization algorithms that can solve this problem, they are typically vulnerable to malicious (or ``Byzantine'') agents that do not follow the algorithm. Recent attempts to address this issue focus on single dimensional functions, or provide analysis under certain assumptions on the statistical properties of the functions at the agents. In this paper, we propose a resilient distributed optimization algorithm for multi-dimensional convex functions. Our scheme involves two filtering steps at each iteration of the algorithm: (1) distance-based and (2) component-wise removal of extreme states. We show that this algorithm can mitigate the impact of up to $F$ Byzantine agents in the neighborhood of each regular node, without knowing the identities of the Byzantine agents in advance. In particular, we show that if the network topology satisfies certain conditions, all of the regular states are guaranteed to asymptotically converge to a bounded region that contains the global minimizer.
- A. Nedić and A. Olshevsky, “Distributed optimization over time-varying directed graphs,” IEEE Transactions on Automatic Control, vol. 60, no. 3, pp. 601–615, 2014.
- R. Xin, C. Xi, and U. A. Khan, “Frost—fast row-stochastic optimization with uncoordinated step-sizes,” EURASIP Journal on Advances in Signal Processing, vol. 2019, no. 1, p. 1, 2019.
- B. Gharesifard and J. Cortés, “Distributed continuous-time convex optimization on weight-balanced digraphs,” IEEE Transactions on Automatic Control, vol. 59, no. 3, pp. 781–786, 2013.
- M. Zhu and S. Martínez, “On distributed convex optimization under inequality and equality constraints,” IEEE Transactions on Automatic Control, vol. 57, no. 1, pp. 151–164, 2011.
- S. Sundaram and B. Gharesifard, “Distributed optimization under adversarial nodes,” IEEE Transactions on Automatic Control, vol. 64, no. 3, pp. 1063–1076, 2018.
- N. Ravi, A. Scaglione, and A. Nedić, “A case of distributed optimization in adversarial environment,” in IEEE International Conference on Acoustics, Speech and Signal Processing, 2019, pp. 5252–5256.
- S. X. Wu, H.-T. Wai, A. Scaglione, A. Nedić, and A. Leshem, “Data injection attack on decentralized optimization,” in IEEE Int. Conf. on Acoustics, Speech and Signal Processing, 2018, pp. 3644–3648.
- L. Su and N. Vaidya, “Byzantine multi-agent optimization: Part i,” arXiv preprint arXiv:1506.04681, 2015.
- L. Su and N. H. Vaidya, “Fault-tolerant multi-agent optimization: optimal iterative distributed algorithms,” in ACM Symposium on Principles of Distributed Computing, 2016, pp. 425–434.
- C. Zhao, J. He, and Q.-G. Wang, “Resilient distributed optimization algorithm against adversary attacks,” in IEEE International Conference on Control & Automation (ICCA), 2017, pp. 473–478.
- K. Kuwaranancharoen and S. Sundaram, “On the location of the minimizer of the sum of two strongly convex functions,” in IEEE Conference on Decision and Control (CDC), 2018, pp. 1769–1774.
- Z. Yang and W. U. Bajwa, “Byrdie: Byzantine-resilient distributed coordinate descent for decentralized learning,” IEEE Transactions on Signal and Information Processing over Networks, 2019.
- ——, “Bridge: Byzantine-resilient decentralized gradient descent,” arXiv preprint arXiv:1908.08098, 2019.
- N. Gupta and N. H. Vaidya, “Byzantine fault tolerant distributed linear regression,” arXiv preprint arXiv:1903.08752, 2019.
- P. Blanchard, R. Guerraoui, J. Stainer et al., “Machine learning with adversaries: Byzantine tolerant gradient descent,” in Advances in Neural Information Processing Systems, 2017, pp. 119–129.
- H. J. LeBlanc, H. Zhang, X. Koutsoukos, and S. Sundaram, “Resilient asymptotic consensus in robust networks,” IEEE Journal on Selected Areas in Communications, vol. 31, no. 4, pp. 766–781, 2013.
- B. S. Mordukhovich and N. M. Nam, “An easy path to convex analysis and applications,” Synthesis Lectures on Mathematics and Statistics, vol. 6, no. 2, pp. 1–218, 2013.
- D. Castano, V. E. Paksoy, and F. Zhang, “Angles, triangle inequalities, correlation matrices and metric-preserving and subadditive functions,” Linear Algebra and its Applications, vol. 491, pp. 15–29, 2016.