High Dimensional Quadratic Discriminant Analysis: Optimality and Phase Transitions
Abstract
Consider a two-class classification problem where we observe samples (Xi, Yi) for i = 1, ..., n, Xi ∈ Rp and Yi in 0, 1. Given Yi = k, Xi is assumed to follow a multivariate normal distribution with mean μk ∈ Rk and covariance matrix k, k=0,1. Supposing a new sample X from the same mixture is observed, our goal is to estimate its class label Y. Such a high-dimensional classification problem has been studied thoroughly when Sigma0 = Sigma1. However, the discussions over the case 0 ≠ 1 are much less over the years. This paper presents the quadratic discriminant analysis (QDA) for the weak signals (QDAw) algorithm, and the QDA with feature selection (QDAfs) algorithm. QDAfs applies Partial Correlation Screening to estimate 0 and 1, and then applies a hard-thresholding on the diagonals of 0 - 1. QDAfs further includes the linear term dT X, where d is achieved by a hard-thresholding on 1μ1 - 0μ0. We further propose the rare and weak model to model the signals in 0 - 1 and μ0 - μ1. Based on the signal weakness and sparsity in μ0 - μ1, we propose two ways to estimate labels: 1) QDAw for weak but dense signals; 2) QDAfs for relatively strong but sparse signals. We figure out the classification boundary on the 4-dim parameter space: 1) Region of possibility, where either QDAw or QDAfs will achieve a mis-classification error rate of 0; 2) Region of impossibility, where all classifiers will have a constant error rate. The numerical results from real datasets support our theories and demonstrate the necessity and superiority of using QDA over LDA for classification.
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.