In this paper, distributed regression estimation problem with incomplete data in a time-varying multi-agent network is investigated. Regression estimation is carried out based on local agent information with incomplete in the non-ignorable mechanism. By virtue of gradient-based design and adaptive filter, a distributed algorithm is proposed to deal with a regression estimation problem with incomplete data. With the help of convex analysis and stochastic approximation techniques, the exact convergence is obtained for the proposed algorithm with incomplete data and a jointly-connected multi-agent topology. Moreover, online regret analysis is also given for real-time learning. Then, simulations for the proposed algorithm are also given to demonstrate how it can solve the estimation problem in a distributed way, even when the network configuration is time-varying.
multi-agent systems time-varying network estimation with incomplete data online learning stochastic approximation
This is a preview of subscription content, log in to check access.
This work was supported by National Key Research and Development Program of China (Grant No. 2016YFB0901902) and National Natural Science Foundation of China (Grant Nos. 61573344, 61333001, 61374168).
Zhang Y Q, Lou Y C, Hong Y G, et al. Distributed projection-based algorithms for source localization in wireless sensor networks. IEEE Trans Wirel Commun, 2015, 43: 3131–3142CrossRefGoogle Scholar
Feng H, Jiang Z D, Hu B, et al. The incremental subgradient methods on distributed estimations in-network. Sci China Inf Sci, 2014, 57: 092103Google Scholar
Lou Y C, Hong Y G, Wang S Y. Distributed continuous-time approximate projection protocols for shortest distance optimization problems. Automatica, 2016, 69: 289–297MathSciNetCrossRefzbMATHGoogle Scholar
Yi P, Hong Y G, Liu F. Initialization-free distributed algorithms for optimal resource allocation with feasibility con-straints and application to economic dispatch of power systems. Automatica, 2016, 74: 259–269MathSciNetCrossRefzbMATHGoogle Scholar
Kokaram A C. On missing data treatment for degraded video and film archives: a survey and a new Bayesian approach. IEEE Trans Image Process, 2004, 13: 397–415CrossRefGoogle Scholar
Ibrahim J G, Chen M H, Lipsitz S R, et al. Missing data methods for generalized linear models: a comparative review. J Am Stat Assoc, 2005, 100: 332–346MathSciNetCrossRefzbMATHGoogle Scholar
Gholami M R, Jansson M, Strom E G, et al. Diffusion estimation over cooperative multi-agent networks with missing data. IEEE Trans Signal Inf Process Netw, 2016, 2: 276–289MathSciNetCrossRefGoogle Scholar
Davey A, Savla J. Statistical Power Analysis with Missing Data: A Structural Equation Modeling Approach. Oxford, UK: Routledge Academic, 2009Google Scholar
Ram S S, Nedić A, Veeravalli V V. Distributed stochastic subgradient projection algorithms for convex optimization. J Optim Theory Appl, 2010, 147: 516–545MathSciNetCrossRefzbMATHGoogle Scholar
Graybill F, Iyer H K. Regression Analysis: Concepts and Applications. California: Duxbury Press Belmont, 1994zbMATHGoogle Scholar
Feng Y, Sundaram S, Vishwanathan S V N, et al. Distributed autonomous online learning: regrets and intrinsic privacy-preserving properties. IEEE Trans Knowl Data Eng, 2013, 25: 2483–2493CrossRefGoogle Scholar
Hazan E, Kale S. Beyond the regret minimization barrier: optimal algorithms for stochastic strongly-convex optimiza-tion. J Mach Learn Res, 2014, 15: 2489–2512MathSciNetzbMATHGoogle Scholar
Shamir O, Zhang T. Stochastic gradient descent for non-smooth optimization: convergence results and optimal aver-aging schemes. In: Proceedings of International Conference on Machine Learning, Edinburgh, 2012. 71–79Google Scholar
Towfic Z J, Chen J S, Sayed A H. On distributed online classification in the midst of concept drifts. Neurocomputing, 2013, 112: 138–152CrossRefGoogle Scholar
Widrow B, Stearns S D. Adaptive Signal Processing. Cliffs: Prentice-Hall, 1985. 1–32zbMATHGoogle Scholar