Broad Learning System with Coordinate Iterative Training Mode

Broad learning system (BLS) has emerged as an effective alternative to deep learning. Due to the linear output characteristics of BLS, the generalized inverse method based on ridge regression is commonly used to solve for the hidden layer weights. However, when dealing with large matri-ces, the generalized inverse algorithm often underperforms. Moreover, it considers all features simultaneously during computation, resulting in redundancy and inefficiency. To address these issues, we first extend the RCD algorithm for multi-output problems, enabling parallel computation of multiple systems. Furthermore, the introduction of a novel iterative update strategy allows for the incorporation of randomness while capturing important low-probability feature information, thereby achieving superior results. Thus, we propose an enhanced parallel randomized coordinate de-scent (EPRCD) algorithm for weight calculation. Numerical experiments demonstrate that the newly proposed algorithm performs well on hlah-dimcnsional datasets.

Authors

Institutions

Publication Details

Published
2024-10-18
DOI
https://doi.org/10.1109/ntci64025.2024.10776043
Primary Topic
Machine Learning and ELM
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Broad Learning System with Coordinate Iterative Training Mode

Xuetao Xie, Sergey Ablameyko, Jian Wang, Xiaoyu Gao
Machine Learning and ELM
article

Broad Learning System with Coordinate Iterative Training Mode

Xuetao Xie, Sergey Ablameyko, Jian Wang, Xiaoyu Gao
article en

Abstract

Broad learning system (BLS) has emerged as an effective alternative to deep learning. Due to the linear output characteristics of BLS, the generalized inverse method based on ridge regression is commonly used to solve for the hidden layer weights. However, when dealing with large matri-ces, the generalized inverse algorithm often underperforms. Moreover, it considers all features simultaneously during computation, resulting in redundancy and inefficiency. To address these issues, we first extend the RCD algorithm for multi-output problems, enabling parallel computation of multiple systems. Furthermore, the introduction of a novel iterative update strategy allows for the incorporation of randomness while capturing important low-probability feature information, thereby achieving superior results. Thus, we propose an enhanced parallel randomized coordinate de-scent (EPRCD) algorithm for weight calculation. Numerical experiments demonstrate that the newly proposed algorithm performs well on hlah-dimcnsional datasets.

Belarusian State University (BY), China University of Petroleum, East China (CN)
Openalex Percentile: Top 79%
Machine Learning and ELM
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.