Exploring Sparsity in Multi-class Linear Discriminant Analysis
Dong Xia

TL;DR
This paper introduces a grouped LASSO-based estimator for multi-class linear discriminant analysis, effectively leveraging sparsity to improve feature selection and classification performance in multi-class settings.
Contribution
It proposes a novel grouped LASSO estimator for multi-class LDA, with strong non-asymptotic properties and improved performance over existing methods.
Findings
Superior performance on simulated data
Effective feature selection in real data
Non-asymptotic theoretical guarantees
Abstract
Recent studies in the literature have paid much attention to the sparsity in linear classification tasks. One motivation of imposing sparsity assumption on the linear discriminant direction is to rule out the noninformative features, making hardly contribution to the classification problem. Most of those work were focused on the scenarios of binary classification. In the presence of multi-class data, preceding researches recommended individually pairwise sparse linear discriminant analysis(LDA). However, further sparsity should be explored. In this paper, an estimator of grouped LASSO type is proposed to take advantage of sparsity for multi-class data. It enjoys appealing non-asymptotic properties which allows insignificant correlations among features. This estimator exhibits superior capability on both simulated and real data.
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
TopicsFace and Expression Recognition · Advanced Statistical Methods and Models · Statistical Methods and Inference
