Joint Nuclear and ℓ1 Regularization for Logistic Matrix Regression with Applications to Brain Imaging
Not on the map. Why?
Abstract (arXiv)
We introduce a new convex optimization framework for logistic scalar-on-matrix regression which incorporates nuclear and ℓ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).
Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 4 of its 35 references that are in the map. First posted on arXiv 12 Jun 2026.
Builds on
4 of 35 references.
References · 4
- 2018A modern maximum-likelihood theory for high-dimensional logistic regressioncited by 81
- 2021Sparse Plus Low Rank Matrix Decomposition: A Discrete Optimization Approachcited by 14
- 2016Bayesian sparse multiple regression for simultaneous rank reduction and variable selectioncited by 6
- 2023Debiased Lasso After Sample Splitting for Estimation and Inference in High Dimensional Generalized Linear Modelscited by 2
Built on by
Not cited yet.