Study of Diffusion Normalized Least Mean M-estimate Algorithms
arXiv:2004.08998
Abstract
This work proposes diffusion normalized least mean M-estimate algorithm based on the modified Huber function, which can equip distributed networks with robust learning capability in the presence of impulsive interference. In order to exploit the system's underlying sparsity to further improve the learning performance, a sparse-aware variant is also developed by incorporating the -norm of the estimates into the update process. We then analyze the transient, steady-state and stability behaviors of the algorithms in a unified framework. In particular, we present an analytical method that is simpler than conventional approaches to deal with the score function since it removes the requirements of integrals and Price's theorem. Simulations in various impulsive noise scenarios show that the proposed algorithms are superior to some existing diffusion algorithms and the theoretical results are verifiable.
arXiv comment14 pages, 13 figures
References in corpus (18)
- Generalized Correntropy for Robust Adaptive Filtering
- Diffusion Adaptation Strategies for Distributed Optimization and Learning over Networks
- Diffusion Strategies Outperform Consensus Strategies for Distributed Estimation over Adaptive Networks
- Sparse Distributed Learning Based on Diffusion Adaptation
- Kernel Risk-Sensitive Loss: Definition, Properties and Application to Robust Adaptive Filtering
- Distributed Pareto Optimization via Diffusion Strategies
- A stochastic gradient approach on compressive sensing signal reconstruction based on adaptive filtering framework
- Low-Complexity Design of Generalized Block Diagonalization Precoding Algorithms for Multiuser MIMO Systems
- Branch-and-Bound Precoding for Multiuser MIMO Systems with 1-Bit Quantization
- Design of Robust Adaptive Beamforming Algorithms Based on Low-Rank and Cross-Correlation Techniques
- Dictionary Learning over Distributed Models
- Distributed Space-Time Coding Based on Adjustable Code Matrices for Cooperative MIMO Relaying Systems
- Sparsity-Aware Adaptive Algorithms Based on Alternating Optimization with Shrinkage
- Proximal Multitask Learning over Networks with Sparsity-inducing Coregularization
- Adaptive Reduced-Rank Minimum Symbol-Error-Rate Receive Processing for Large-Scale Multiple-Antenna Systems
- Direction Finding Algorithms with Joint Iterative Subspace Optimization
- Subspace-Orbit Randomized Decomposition for Low-rank Matrix Approximation
- Diffusion Leaky Zero Attracting Least Mean Square Algorithm and Its Performance Analysis