Joint Nuclear and $\ell_1$ Regularization for Logistic Matrix Regression with Applications to Brain Imaging
Introduces a new convex optimization framework for logistic scalar-on-matrix regression with low-rank and sparse structures.
The paper introduces a new convex optimization framework that combines low-rank and sparse structures, which is novel compared to prior work that may only consider one of these structures.
Before reading this…
Applications
- →Brain imaging data analysis
- →Functional brain connectivity matrices
To understand this paper, make sure you know these concepts first:
- Convex optimizationfind papers →
- Logistic regressionfind papers →
Abstract
More Like ThisWe introduce a new convex optimization framework for logistic scalar-on-matrix regression which incorporates nuclear and $\ell_1$ norm penalties to enforce simultaneously low-rank and sparse structures in the estimated coefficient matrix. The proposed method enables interpretable modeling of high-dimensional matrix-valued predictors in the presence of binary responses. We derive a custom algorithm based on the Alternating Direction Method of Multipliers (ADMM) to efficiently solve the resulting convex optimization problem and establish the theoretical properties of the obtained solution. Numerical experiments clearly demonstrate the effectiveness of our method in recovering meaningful predictive patterns. Finally, we apply our method to the brain imaging data to identify structures in functional brain connectivity matrices that are characteristic of subjects with a family history of alcohol use disorders (AUDs).