In this article, we introduce an analytic formulation for compressive binary classification. The formulation seeks to solve the least ℓp-norm of the parameter vector subject to a classification error constraint. An analytic and stretchable estimation is conjectured where the estimation can be viewed as an extension of the pseudoinverse with left and right constructions. Our variance analysis indicates that the estimation based on the left pseudoinverse is unbiased and the estimation based on the right pseudoinverse is biased. Sparseness can be obtained for the biased estimation under certain mild conditions. The proposed estimation is investigated numerically using both synthetic and real-world data.
Bibliographical noteFunding Information:
The authors are thankful to the editor and reviewers for their constructive comments and Dr. Bernd Burgstaller for proof reading the manuscript. This research was supported by Basic Science Research Program through the National Research Foundation of Korea (NRF) funded by the Ministry of Education, Science and Technology (Grant Number: NRF-2015R1D1A1A09061316 ).
All Science Journal Classification (ASJC) codes
- Cognitive Neuroscience
- Artificial Intelligence