Combined multiple random features least mean square algorithm for online applications

نویسندگان

چکیده

The multikernel least mean square (MKLMS) algorithm is a classical of adaptive filters due to its simplicity. However, the linear growth network structure main challenge MKLMS. To address this issue, novel multiple random features (MRFLMS) proposed by approximating Gaussian kernels with method. In addition, combined weight transfer strategy adopted in MRFLMS develop another (CMRFLMS) alleviate influence step-size on filtering performance and convergence rate. CMRFLMS fixed dimensional can provide comparable faster rate than Simulations prediction synthetic real non-linear system identification illustrate superiorities from aspects accuracy, rate, tracking performance.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Least Mean Square Algorithm

The Least Mean Square (LMS) algorithm, introduced by Widrow and Hoff in 1959 [12] is an adaptive algorithm, which uses a gradient-based method of steepest decent [10]. LMS algorithm uses the estimates of the gradient vector from the available data. LMS incorporates an iterative procedure that makes successive corrections to the weight vector in the direction of the negative of the gradient vect...

متن کامل

Least Mean Square Algorithm

The Least Mean Square (LMS) algorithm, introduced by Widrow and Hoff in 1959 [12] is an adaptive algorithm, which uses a gradient-based method of steepest decent [10]. LMS algorithm uses the estimates of the gradient vector from the available data. LMS incorporates an iterative procedure that makes successive corrections to the weight vector in the direction of the negative of the gradient vect...

متن کامل

Mean square convergence analysis for kernel least mean square algorithm

In this paper, we study the mean square convergence of the kernel least mean square (KLMS). The fundamental energy conservation relation has been established in feature space. Starting from the energy conservation relation, we carry out the mean square convergence analysis and obtain several important theoretical results, including an upper bound on step size that guarantees the mean square con...

متن کامل

Kernel Least Mean Square Algorithm

A simple, yet powerful, learning method is presented by combining the famed kernel trick and the least-mean-square (LMS) algorithm, called the KLMS. General properties of the KLMS algorithm are demonstrated regarding its well-posedness in very high dimensional spaces using Tikhonov regularization theory. An experiment is studied to support our conclusion that the KLMS algorithm can be readily u...

متن کامل

Splitting the Least-mean-square Algorithm

The least-mean-square (LMS) algorithm is an adaptation scheme widely used in practice due to its simplicity. In some applications the involved signals are continuous-time. Then, usually either a fully analog implementation of the LMS algorithm is applied or the input data are sampled by analog-to-digital (AD) converters to be processed digitally. A purely digital realization is most often the p...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Iet Signal Processing

سال: 2022

ISSN: ['1751-9675', '1751-9683']

DOI: https://doi.org/10.1049/sil2.12102