arrow
Return

Scalable and memory-efficient sparse learning for classification with approximate Bayesian regularization priors

delete2021-10-01
delete7
PRE
AI
J
Jiahua Luo
Y
Yanfen Gan
C
Chi‐Man Vong
C
Chi-Man Wong
C
Chuangquan Chen *
DOI:10.1016/j.neucom.2021.06.025delete
deleteOriginal
deleteOriginal request for help
deleteShare
deleteSave
Abstract

Abstract

En 中文
Sparse Bayesian learning (SBL) provides state-of-the-art performance in accuracy, sparsity and probabilistic prediction for classification. In SBL, the regularization priors are automatically determined that avoids an exhaustive hyperparameter selection by cross-validation. However, scalability to large problems is a drawback of SBL because of the inversion of a potentially enormous covariance matrix for updating the regularization priors in every iteration. This paper develops an approximate SBL algorithm called ARP-SBL, where the regularization priors are approximated without inverting the covariance matrix. Therefore, our approach can easily scale up to problems with large data size or feature dimension. It alleviates the long training time and high memory complexity in SBL. Based on ARP-SBL, two scalable nonlinear SBL models: scalable relevance vector machine (ARP-RVM) and scalable sparse Bayesian extreme learning machine (ARP-SBELM) are developed for problems of large data size and large feature size respectively. Experiments on a variety of benchmarks have shown that the proposed models are with competitive accuracy compared to existing methods while i) converging faster; ii) requiring thousands of times less memory; iii) without exhaustive regularized hyperparameter selection; and iv) easily scaling up to large data size and high dimensional features. (c) 2021 Elsevier B.V. All rights reserved.
Keywords:
Scalable Sparse Bayesian Learning
Approximate Bayesian Regularization Priors
Relevance Vector Machine
Sparse Bayesian Extreme Learning Machine
AI Summary

AI Summary

Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.

Journal

Neurocomputing cover
Neurocomputing
IF:
6.5
Papers:
2.5W
Citations:
6.5W

Organization

W
Wuyi University
Scholars:
4.3K
Papers: 2.3K
Citations: 2.9K
G
Guangdong University of Foreign Studies
Scholars:
1.3K
Papers: 1.4K
Citations: 1.5K
U
University of Macau
Scholars:
1.1W
Papers: 1.3W
Citations: 2.0W
researcher View more organizations