Abstract

A fixed kernel width in MCC algorithm imposes a trade-off among robustness, convergence rate and steady-state accuracy. With a variable kernel width, the adaptive kernel width MCC (AMCC) algorithm can improve the learning speed of the MCC algorithm especially when the initial weight vector is far away from the optimal weight vector. In this paper, the steady-state excess mean square error (EMSE) of the AMCC algorithm is studied based on energy conservation relation. In addition, a novel convergence measure called initial convergence rate is introduced to evaluate the convergence speed at the beginning of the learning. Simulation experiments are carried out to verify the theoretical analysis and confirm the desirable performance of the AMCC algorithm in several different non-Gaussian noise environments.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.