Logarithmic regret bound over diffusion based distributed estimation
Sayin, M. O.
Vanii, N. D.
Kozat, S. S.
ICASSP, IEEE International Conference on Acoustics, Speech and Signal Processing - Proceedings
Institute of Electrical and Electronics Engineers Inc.
8287 - 8291
Item Usage Stats
MetadataShow full item record
We provide a logarithmic upper-bound on the regret function of the diffusion implementation for the distributed estimation. For certain learning rates, the bound shows guaranteed performance convergence of the distributed least mean square (DLMS) algorithms to the performance of the best estimation generated with hindsight of spatial and temporal data. We use a new cost definition for distributed estimation based on the widely-used statistical performance measures and the corresponding global regret function. Then, for certain learning rates, we provide an upper-bound on the global regret function without any statistical assumptions. © 2014 IEEE.
Least mean squares
Statistical performance measures