Optimal variable selection in multi-group sparse discriminant analysis

11/23/2014
by   Irina Gaynanova, et al.
0

This article considers the problem of multi-group classification in the setting where the number of variables p is larger than the number of observations n. Several methods have been proposed in the literature that address this problem, however their variable selection performance is either unknown or suboptimal to the results known in the two-group case. In this work we provide sharp conditions for the consistent recovery of relevant variables in the multi-group case using the discriminant analysis proposal of Gaynanova et al., 2014. We achieve the rates of convergence that attain the optimal scaling of the sample size n, number of variables p and the sparsity level s. These rates are significantly faster than the best known results in the multi-group case. Moreover, they coincide with the optimal minimax rates for the two-group case. We validate our theoretical results with numerical analysis.

READ FULL TEXT

page 7

page 8

research
06/27/2013

Optimal Feature Selection in High-Dimensional Discriminant Analysis

We consider the high-dimensional discriminant analysis problem. For this...
research
08/23/2022

Variable selection and basis learning for ordinal classification

We propose a method for variable selection and basis learning for high-d...
research
02/11/2008

On the ℓ_1-ℓ_q Regularized Regression

In this paper we consider the problem of grouped variable selection in h...
research
12/30/2021

Variable selection, monotone likelihood ratio and group sparsity

In the pivotal variable selection problem, we derive the exact non-asymp...
research
03/24/2014

Simultaneous sparse estimation of canonical vectors in the p>>N setting

This article considers the problem of sparse estimation of canonical vec...
research
11/17/2014

Group Regularized Estimation under Structural Hierarchy

Variable selection for models including interactions between explanatory...
research
04/23/2021

Certifiably Polynomial Algorithm for Best Group Subset Selection

Best group subset selection aims to choose a small part of non-overlappi...

Please sign up or login with your details

Forgot password? Click here to reset