A convex optimization approach to high-dimensional sparse quadratic discriminant analysis
From MaRDI portal
Publication:820816
Abstract: 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.
Recommendations
Cites work
- A direct approach for sparse quadratic discriminant analysis
- A direct approach to sparse discriminant analysis in ultra-high dimensions
- A direct estimation approach to sparse linear discriminant analysis
- A unified theory of confidence regions and testing for high-dimensional estimating equations
- CHIME: clustering of high-dimensional Gaussian mixtures with EM algorithm and its optimality
- CODA: high dimensional copula discriminant analysis
- Direct estimation of differential networks
- Discriminant analysis through a semiparametric model
- High Dimensional Linear Discriminant Analysis: Optimality, Adaptive Algorithm and Missing Data
- High-dimensional Gaussian copula regression: adaptive estimation and statistical inference
- High-dimensional semiparametric Gaussian copula graphical models
- scientific article; zbMATH DE number 1964693 (Why is no real title available?)
- Introduction to nonparametric estimation
- Large-scale inference. Empirical Bayes methods for estimation, testing, and prediction
- Law of log determinant of sample covariance matrix and optimal estimation of differential entropy for high-dimensional Gaussian distributions
- Regularized rank-based estimation of high-dimensional nonparanormal graphical models
- ROCKET: robust confidence intervals via Kendall's tau for transelliptical graphical models
- Smooth discrimination analysis
- Some theory for Fisher's linear discriminant function, `naive Bayes', and some alternatives when there are many more variables than observations
- Sparse Quadratic Discriminant Analysis For High Dimensional Data
- Sparse semiparametric discriminant analysis
- Statistical analysis of latent generalized correlation matrix estimation in transelliptical distribution
- Testing differential networks with applications to the detection of gene-gene interactions
Cited in
(17)- Ridge-forward quadratic discriminant analysis in high-dimensional situations
- Efficient computation for differential network analysis with applications to quadratic discriminant analysis
- QUADRO: a supervised dimension reduction method via Rayleigh quotient optimization
- Sparse Quadratic Discriminant Analysis For High Dimensional Data
- A direct approach for sparse quadratic discriminant analysis
- Quadratic Discriminant Analysis for High-Dimensional Data
- Rejoinder on ‘A review of distributed statistical inference’
- Sparse quadratic classification rules via linear dimension reduction
- Optimal discriminant analysis in high-dimensional latent factor models
- High dimensional discriminant analysis under weak sparsity
- High-dimensional data analysis: change point detection via bootstrap MOSUM
- Efficient distributed differential network estimation
- High-dimensional differential networks with sparsity and reduced-rank
- Network alternating direction method of multipliers for ultrahigh-dimensional decentralised federated learning
- Quadratic discriminant analysis in distributed frameworks
- Non-splitting Neyman-Pearson classifiers
- Proximal Methods for Sparse Optimal Scoring and Discriminant Analysis
This page was built for publication: A convex optimization approach to high-dimensional sparse quadratic discriminant analysis
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q820816)
