Optimal combination rules for adaptation and learning over networks
Authors:
- 1 December 2011
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 317-320
Abstract
Adaptive networks, consisting of a collection of nodes with learning abilities, are well-suited to solve distributed inference problems and to model various types of self-organized behavior observed in nature. One important issue in designing adaptive networks is how to fuse the information collected from the neighbors, especially since the mean-square performance of the network depends on the choice of combination weights. We consider the problem of optimal selection of the combination weights and motivate one combination rule, along with an adaptive implementation. The rule is related to the inverse of the noise variances and is shown to be effective in simulations.Keywords
This publication has 8 references indexed in Scilit:
- Mobile Adaptive NetworksIEEE Journal of Selected Topics in Signal Processing, 2011
- Modeling Bird Flight Formations Using Diffusion AdaptationIEEE Transactions on Signal Processing, 2011
- Diffusion Least-Mean Squares With Adaptive Combiners: Formulation and Performance AnalysisIEEE Transactions on Signal Processing, 2010
- Weight Optimization for Consensus Algorithms With Correlated Switching TopologyIEEE Transactions on Signal Processing, 2010
- Diffusion LMS Strategies for Distributed EstimationIEEE Transactions on Signal Processing, 2009
- Fast Distributed Average Consensus Algorithms Based on Advection-Diffusion ProcessesIEEE Transactions on Signal Processing, 2009
- Diffusion Least-Mean Squares Over Adaptive Networks: Formulation and Performance AnalysisIEEE Transactions on Signal Processing, 2008
- Adaptive Filters2008