Towards Compact Broad Learning System by Combined Sparse Regularization

Abstract

Broad Learning System (BLS) has been proven to be one of the most important techniques for classification and regression in machine learning and data mining. BLS directly collects all the features from feature and enhancement nodes as input of the output layer, which neglects vast amounts of redundant information. It usually leads to be inefficient and overfitting. To resolve this issue, we propose sparse regularization-based compact broad learning system (CBLS) framework, which can simultaneously remove redundant nodes and weights. To be more specific, we use group sparse regularization based on [Formula: see text] norm to promote the competition between different nodes and then remove redundant nodes, and a class of nonconvex sparsity regularization to promote the competition between different weights and then remove redundant weights. To optimize the resulting problem of the proposed CBLS, we exploit an efficient alternative optimization algorithm based on proximal gradient method together with computational complexity. Finally, extensive experiments on the classification task are conducted on public benchmark datasets to verify the effectiveness and superiority of the proposed CBLS.