Pivotal Estimation of Linear Discriminant Analysis in High Dimensions
Not on the map. Why?
Abstract (arXiv)
We consider the linear discriminant analysis problem in the high-dimensional settings. In this work, we propose PANDA(PivotAl liNear Discriminant Analysis), a tuning-insensitive method in the sense that it requires very little effort to tune the parameters. Moreover, we prove that PANDA achieves the optimal convergence rate in terms of both the estimation error and misclassification rate. Our theoretical results are backed up by thorough numerical studies using both simulated and real datasets. In comparison with the existing methods, we observe that our proposed PANDA yields equal or better performance, and requires substantially less effort in parameter tuning.
Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 4 of its 33 references that are in the map. First posted on arXiv 18 Sep 2023.
Builds on
4 of 33 references.
References · 4
- 2018High-dimensional Linear Discriminant Analysis: Optimality, Adaptive Algorithm, and Missing Datacited by 17
- 2014Optimal variable selection in multi-group sparse discriminant analysiscited by 5
- 2013Optimal Feature Selection in High-Dimensional Discriminant Analysiscited by 4
- 2013Calibrated Multivariate Regression with Application to Neural Semantic Basis Discoverycited by 2
Built on by
Not cited yet.