A Convex Optimization Approach to High-Dimensional Sparse Quadratic Discriminant Analysis

12/05/2019
by   T. Tony Cai, et al.
0

In this paper, we study high-dimensional sparse Quadratic Discriminant Analysis (QDA) and aim to establish the optimal convergence rates for the classification error. Minimax lower bounds are established to demonstrate the necessity of structural assumptions such as sparsity conditions on the discriminating direction and differential graph for the possible construction of consistent high-dimensional QDA rules. We then propose a classification algorithm called SDAR using constrained convex optimization under the sparsity assumptions. Both minimax upper and lower bounds are obtained and this classification rule is shown to be simultaneously rate optimal over a collection of parameter spaces, up to a logarithmic factor. Simulation studies demonstrate that SDAR performs well numerically. The algorithm is also illustrated through an analysis of prostate cancer data and colon tissue data. The methodology and theory developed for high-dimensional QDA for two groups in the Gaussian setting are also extended to multi-group classification and to classification under the Gaussian copula model.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
04/09/2018

High-dimensional Linear Discriminant Analysis: Optimality, Adaptive Algorithm, and Missing Data

This paper aims to develop an optimality theory for linear discriminant ...
research
10/01/2015

QUDA: A Direct Approach for Sparse Quadratic Discriminant Analysis

Quadratic discriminant analysis (QDA) is a standard tool for classificat...
research
07/25/2022

Minimax Rates for High-dimensional Double Sparse Structure over ℓ_q-balls

In this paper, we focus on the high-dimensional double sparse structure,...
research
06/27/2013

Optimal Feature Selection in High-Dimensional Discriminant Analysis

We consider the high-dimensional discriminant analysis problem. For this...
research
03/14/2022

The Role of Interactivity in Structured Estimation

We study high-dimensional sparse estimation under three natural constrai...
research
11/28/2010

A ROAD to Classification in High Dimensional Space

For high-dimensional classification, it is well known that naively perfo...
research
03/24/2019

Non-Standard Asymptotics in High Dimensions: Manski's Maximum Score Estimator Revisited

Manski's celebrated maximum score estimator for the binary choice model ...

Please sign up or login with your details

Forgot password? Click here to reset