Sparse Multinomial Logistic Regression via Approximate Message Passing
arXiv:1509.04491 · doi:10.1109/TSP.2016.2593691
Abstract
For the problem of multi-class linear classification and feature selection, we propose approximate message passing approaches to sparse multinomial logistic regression (MLR). First, we propose two algorithms based on the Hybrid Generalized Approximate Message Passing (HyGAMP) framework: one finds the maximum a posteriori (MAP) linear classifier and the other finds an approximation of the test-error-rate minimizing linear classifier. Then we design computationally simplified variants of these two algorithms. Next, we detail methods to tune the hyperparameters of their assumed statistical models using Stein's unbiased risk estimate (SURE) and expectation-maximization (EM), respectively. Finally, using both synthetic and real-world datasets, we demonstrate improved error-rate and runtime performance relative to existing state-of-the-art approaches to sparse MLR.
References in corpus (6)
- Message Passing Algorithms for Compressed Sensing
- Expectation-Maximization Gaussian-Mixture Approximate Message Passing
- Variable selection using MM algorithms
- Parameterless Optimal Approximate Message Passing
- Binary Linear Classification and Feature Selection via Generalized Approximate Message Passing
- Sparse Multinomial Logistic Regression via Approximate Message Passing