Complexity-Optimized Sparse Bayesian Learning for Scalable Classification Tasks
원문 초록
Sparse Bayesian Learning (SBL) constructs an extremely sparse probabilistic model with very competitive generalization. However, SBL needs to invert a big covariance matrix with complexity $O(M^3)$ (M: feature size) for updating the regularization priors, making it difficult for problems with high dimensional feature space or large data size. As it may easily suffer from the memory overflow issue in such problems. This paper addresses this issue with a newly proposed diagonal Quasi-Newton (DQN) method for SBL called DQN-SBL where the inversion of big covariance matrix is ignored so that the complexity is reduced to $O(M)$. The DQN-SBL is thoroughly evaluated for non linear and linear classifications with various benchmarks of different sizes. Experimental results verify that DQN-SBL receives competitive generalization with a very sparse model and scales well to large-scale problems.
함께 살펴볼 논문
공통 태그를 근거로 연결했습니다. 실제 인용 관계나 논문의 우수성을 뜻하지 않습니다.
Malware Classification Leveraging NLP & Machine Learning for Enhanced Accuracy
Margin-aware Fuzzy Rough Feature Selection: Bridging Uncertainty Characterization and Pattern Classification
An Interpretable Adaptive Multiscale Attention Deep Neural Network for Tabular Data
Bio-Inspired Feature Selection in Brain Disease Detection via an Improved Sparrow Search Algorithm
Feature Selection With Maximal Relevance and Minimal Supervised Redundancy
LLSF - Learning Label Specific Features for Multi-Label Classifcation
토론
이 논문과 연결된 포럼 글이 아직 없습니다.