×

Privacy preserving distributed online projected residual feedback optimization over unbalanced directed graphs. (English) Zbl 1530.93138

Summary: The distributed online optimization (DOO) problem with privacy guarantees over an unbalanced directed graph is considered in this paper, where the cost function is explicitly unknown. To solve this problem, a distributed online one-point residual feedback optimization algorithm based on differential privacy is designed. For the objective function explicitly unknown, this algorithm employs the residual feedback to estimate the true gradient information. In addition, only the row stochastic adjacency matrix utilized releases the requirement of double stochastic weighting matrices, making the algorithm easier to implement on directed graphs. Theoretical results show that the algorithm not only protects the privacy information of the nodes but also achieves the same sublinear rate regret as the DOO algorithm based on two-point feedback. Moreover, our regret bound depends on weaker assumptions than the traditional DOO algorithm based on one-point feedback. Finally, the simulation results verify the effectiveness of the algorithm.

MSC:

93B52 Feedback control
90C90 Applications of mathematical programming
05C20 Directed graphs (digraphs), tournaments

Software:

PrivateLR
Full Text: DOI

References:

[1] Zhang, H.; Liang, S.; Ou, M.; Wei, M., An asynchronous distributed gradient algorithm for economic dispatch over stochastic networks. Int. J. Electr. Power Energy Syst., 106240 (2021)
[2] Peng, Z.; Wu, B.; Wen, G.; Yang, S.; Huang, T., Distributed adaptive optimization-based formation tracking with double parameter projections for multi-agent systems. J. Franklin Inst., 11, 5251-5271 (2022) · Zbl 1492.93096
[3] Wang, S.; Li, C., Distributed robust optimization in networked system. IEEE Trans. Cybern., 8, 2321-2333 (2016)
[4] Zhu, S.; Chen, C.; Xu, J.; Guan, X.; Xie, L.; Johansson, K. H., Mitigating quantization effects on distributed sensor fusion: a least squares approach. IEEE Trans. Signal Process., 13, 3459-3474 (2018) · Zbl 1415.94313
[5] Xi, C.; Wu, Q.; Khan, U. A., On the distributed optimization over directed networks. Neurocomputing, 508-515 (2017)
[6] Niu, Y.; Wang, H.; Wang, Z.; Xia, D.; Li, H., Primal-dual stochastic distributed algorithm for constrained convex optimization. J. Franklin Inst., 16, 9763-9787 (2019) · Zbl 1452.90245
[7] Li, H.; Wang, Z.; Chen, G.; Dong, Z. Y., Distributed robust algorithm for economic dispatch in smart grids over general unbalanced directed networks. IEEE Trans. Ind. Inf., 7, 4322-4332 (2019)
[8] Chen, G.; Yang, Q., An ADMM-based distributed algorithm for economic dispatch in islanded microgrids. IEEE Trans. Ind. Inf., 9, 3892-3903 (2017)
[9] Sun, C.; Ye, M.; Hu, G., Distributed time-varying quadratic optimization for multiple agents under undirected graphs. IEEE Trans. Automat. Contr., 7, 3687-3694 (2017) · Zbl 1370.90172
[10] Mateos-Núnez, D.; Cortés, J., Distributed online convex optimization over jointly connected digraphs. IEEE Trans. Network Sci. Eng., 1, 23-37 (2014)
[11] Ma, W.-J.; Wang, J.; Gupta, V.; Chen, C., Distributed energy management for networked microgrids using online ADMM with regret. IEEE Trans. Smart Grid, 2, 847-856 (2016)
[12] Pang, Y.; Hu, G., Randomized gradient-free distributed online optimization with time-varying cost functions. 2019 IEEE 58th Conference on Decision and Control (CDC), 4910-4915 (2019), IEEE
[13] Hosseini, S.; Chapman, A.; Mesbahi, M., Online distributed convex optimization on dynamic networks. IEEE Trans. Automat. Contr., 11, 3545-3550 (2016) · Zbl 1359.90094
[14] Akbari, M.; Gharesifard, B.; Linder, T., Distributed online convex optimization on time-varying directed graphs. IEEE Trans. Control Netw. Syst., 3, 417-428 (2015) · Zbl 1507.93085
[15] Li, X.; Yi, X.; Xie, L., Distributed online optimization for multi-agent networks with coupled inequality constraints. IEEE Trans. Automat. Contr., 8, 3575-3591 (2020) · Zbl 1471.93019
[16] Yan, J.; Cao, J., Privacy preserving modified projection subgradient algorithm for multi-agent online optimization. 2021 IEEE Symposium Series on Computational Intelligence (SSCI), 1-8 (2021), IEEE
[17] A.D. Flaxman, A.T. Kalai, H.B. McMahan, Online convex optimization in the bandit setting: gradient descent without a gradient, arXiv preprint arXiv:cs/0408007
[18] Wang, C.; Xu, S.; Yuan, D.; Zhang, B.; Zhang, Z., Push-sum distributed online optimization with bandit feedback. IEEE Trans. Cybern., 4, 2263-2273 (2020)
[19] Yi, X.; Li, X.; Yang, T.; Xie, L.; Chai, T.; Johansson, K. H., Distributed bandit online convex optimization with time-varying coupled inequality constraints. IEEE Trans. Automat. Contr., 10, 4620-4635 (2020) · Zbl 1536.93279
[20] Shamir, O., An optimal algorithm for bandit and zero-order convex optimization with two-point feedback. J. Mach. Learn. Res., 1, 1703-1713 (2017)
[21] Pang, Y.; Hu, G., Randomized gradient-free distributed optimization methods for a multiagent system with unknown cost function. IEEE Trans. Automat. Contr., 1, 333-340 (2019) · Zbl 1483.90181
[22] Y. Xiong, X. Li, K. You, L. Wu, Distributed online optimization in time-varying unbalanced networks without explicit subgradients, arXiv preprint arXiv:2202.11313
[23] Zhang, Y.; Zhou, Y.; Ji, K.; Zavlanos, M. M., A new one-point residual-feedback oracle for black-box learning and control. Automatica, 110006 (2022) · Zbl 1480.93149
[24] Y. Zhang, Y. Zhou, K. Ji, M.M. Zavlanos, Boosting one-point derivative-free online optimization via residual feedback, arXiv preprint arXiv:2010.07378
[25] Mao, S.; Tang, Y.; Dong, Z.; Meng, K.; Dong, Z. Y.; Qian, F., A privacy preserving distributed optimization algorithm for economic dispatch over time-varying directed networks. IEEE Trans. Ind. Inf., 3, 1689-1701 (2020)
[26] Zhang, C.; Wang, Y., Enabling privacy-preservation in decentralized optimization. IEEE Trans. Control Netw. Syst., 2, 679-689 (2018) · Zbl 1515.93019
[27] Dwork, C., Differential privacy. 33rd International Colloquium on Automata (2006)
[28] Lü, Q.; Liao, X.; Xiang, T.; Li, H.; Huang, T., Privacy masking stochastic subgradient-push algorithm for distributed online optimization. IEEE Trans. Cybern., 6, 3224-3237 (2020)
[29] Xiong, Y.; Xu, J.; You, K.; Liu, J.; Wu, L., Privacy-preserving distributed online optimization over unbalanced digraphs via subgradient rescaling. IEEE Trans. Control Netw. Syst., 3, 1366-1378 (2020) · Zbl 07255387
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.