Binary Linear Classification and Feature Selection via Generalized Approximate Message Passing

Abstract

For the problem of binary linear classification and feature selection, we propose algorithmic approaches to classifier design based on the generalized approximate message passing (GAMP) algorithm, recently proposed in the context of compressive sensing. We are particularly motivated by problems where the number of features greatly exceeds the number of training examples, but where only a few features suffice for accurate classification. We show that sum-product GAMP can be used to (approximately) minimize the classification error rate and max-sum GAMP can be used to minimize a wide variety of regularized loss functions. Furthermore, we describe an expectation-maximization (EM)-based scheme to learn the associated model parameters online, as an alternative to cross-validation, and we show that GAMP's state-evolution framework can be used to accurately predict the misclassification rate. Finally, we present a detailed numerical study to confirm the accuracy, speed, and flexibility afforded by our GAMP-based approaches to binary linear classification and feature selection.

References in corpus (1)

• Compressive Phase Retrieval via Generalized Approximate Message Passing

Cited by in corpus (6)

• Statistical physics of inference: Thresholds and algorithms
• Bayes-Optimal Joint Channel-and-Data Estimation for Massive MIMO with Low-Precision ADCs
• Joint Channel-Estimation/Decoding with Frequency-Selective Channels and Few-Bit ADCs
• Sparse Multinomial Logistic Regression via Approximate Message Passing
• Approximate message-passing for convex optimization with non-separable penalties
• Generalized Approximate Message Passing for Unlimited Sampling of Sparse Signals