A penalized likelihood method for classification with matrix-valued predictors
Aaron J. Molstad, Adam J. Rothman

TL;DR
This paper introduces a penalized likelihood approach for classification with matrix-valued predictors, estimating means and a Kronecker-structured precision matrix, improving interpretability and accuracy in EEG data analysis.
Contribution
It presents a novel penalized likelihood method that leverages Kronecker structure for efficient estimation in matrix predictor classification tasks.
Findings
Outperforms relevant competitors in classification accuracy.
Demonstrates interpretability on EEG dataset.
Effective even when modeling assumptions are violated.
Abstract
We propose a penalized likelihood method to fit the linear discriminant analysis model when the predictor is matrix valued. We simultaneously estimate the means and the precision matrix, which we assume has a Kronecker product decomposition. Our penalties encourage pairs of response category mean matrices to have equal entries and also encourage zeros in the precision matrix. To compute our estimators, we use a blockwise coordinate descent algorithm. To update the optimization variables corresponding to response category mean matrices, we use an alternating minimization algorithm that takes advantage of the Kronecker structure of the precision matrix. We show that our method can outperform relevant competitors in classification, even when our modeling assumptions are violated. We analyze an EEG dataset to demonstrate our method's interpretability and classification accuracy.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsBlind Source Separation Techniques · Neural Networks and Applications · Neural dynamics and brain function
