An Efficient Algorithm for the Incremental Broad Learning System by Inverse Cholesky Factorization of a Partitioned Matrix
In this paper, we propose an efficient algorithm to accelerate the existing Broad Learning System (BLS) algorithm for new added nodes. The existing BLS algorithm computes the output weights from the pseudoinverse with the ridge regression approximation, and updates the pseudoinverse iteratively. As...
Main Authors: | Hufei Zhu, Zhulin Liu, C. L. Philip Chen, Yanyang Liang |
---|---|
Format: | Article |
Language: | English |
Published: |
IEEE
2021-01-01
|
Series: | IEEE Access |
Subjects: | |
Online Access: | https://ieeexplore.ieee.org/document/9326429/ |
Similar Items
-
An improved algorithm for incremental extreme learning machine
by: Shaojian Song, et al.
Published: (2020-01-01) -
Efficient Incremental Learning Using Dynamic Correction Vector
by: Yun Xiang, et al.
Published: (2020-01-01) -
Novel Four-Layer Neural Network and Its Incremental Learning Based on Randomly Mapped Features
by: YANG Yue, WANG Shitong
Published: (2021-07-01) -
Rich Feature Combination for Cost-Based Broad Learning System
by: Tian-Lun Zhang, et al.
Published: (2019-01-01) -
Facial Beauty Prediction via Local Feature Fusion and Broad Learning System
by: Yikui Zhai, et al.
Published: (2020-01-01)