Regularized Least-Mean-Square Algorithms

Details Regularized Least-Mean-Square Algorithms Regularized Least-Mean-Square Algorithms

2010-12-22

arxiv.org/abs/1012.5066v2

Statistics

Methodology

9 pages, double column, submitted to IEEE Transactions on Signal Processing

Scientific paper

We consider adaptive system identification problems with convex constraints and propose a family of regularized Least-Mean-Square (LMS) algorithms. We show that with a properly selected regularization parameter the regularized LMS provably dominates its conventional counterpart in terms of mean square deviations. We establish simple and closed-form expressions for choosing this regularization parameter. For identifying an unknown sparse system we propose sparse and group-sparse LMS algorithms, which are special examples of the regularized LMS family. Simulation results demonstrate the advantages of the proposed filters in both convergence rate and steady-state error under sparsity assumptions on the true coefficient vector.

Affiliated with

Also associated with

No associations

Rating

Regularized Least-Mean-Square Algorithms does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Regularized Least-Mean-Square Algorithms, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Regularized Least-Mean-Square Algorithms will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-582682