A modified Lanczos Algorithm for fast regularization of extreme learning machines

16Citations
Citations of this article
18Readers
Mendeley users who have this article in their library.
Get full text

Abstract

This paper presents a new regularization for Extreme Learning Machines (ELMs). ELMs are Randomized Neural Networks (RNNs) that are known for their fast training speed and good accuracy. Nevertheless the complexity of ELMs has to be selected, and regularization has to be performed in order to avoid underfitting or overfitting. Therefore, a novel Regularization is proposed using a modified Lanczos Algorithm: Iterative Lanczos Extreme Learning Machine (Lan-ELM). As summarized in the experimental Section, the computational time is on average divided by 4 and the Normalized MSE is on average reduced by 11%. In addition, the proposed method can be intuitively parallelized, which makes it a very valuable tool to analyze huge data sets in real-time.

Cite

CITATION STYLE

APA

Hu, R., Ratner, E., Stewart, D., Björk, K. M., & Lendasse, A. (2020). A modified Lanczos Algorithm for fast regularization of extreme learning machines. Neurocomputing, 414, 172–181. https://doi.org/10.1016/j.neucom.2020.07.015

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free