Pith. sign in

REVIEW 3 major objections 4 minor 37 references

Structural Effect and Spectral Enhancement of High-Dimensional Regularized Linear Discriminant Analysis

T0 review · 3 major / 4 minor · reviewed 2026-08-06 · deepseek-v4-flash

Challenge this review Re-run · record.json Download PDF Read on arXiv ↗ Review JSON

Pith's one-line read The RLDA misclassification rate is, at finite sample size, a deterministic function of the population covariance spectrum, and a spectral enhancement that boosts small spiked eigenvalues provably improves high-dimensional classification.

desk verdict Theorem 1 is a genuinely useful non-asymptotic RLDA approximation, but the SEDA part rests on an unproved spectral-gap assumption and a sketched proof of Theorem 2. read the letter →

arxiv 2507.16682 v1 pith:XBHXGP7Y submitted 2025-07-22 stat.ML cs.LGmath.STstat.MEstat.TH

Yonghan Zhang , Zhangni Pu , Lu Yan , Jiang Hu This is my paper · ORCID
classification stat.MLcs.LGmath.STstat.MEstat.TH MSC 62H3060B20
keywords DiscriminantanalysisStructuraleffectRandommatrixtheorySpectralenhancementRegularizedlinearSpikedcovariancemodelMisclassificationrateEigenvectorconvergence
verification ladder T0 review T1 audit T2 compute T3 formal

The pith

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The reading

Regularized linear discriminant analysis (RLDA) is widely used but its high-dimensional error behavior has been understood only asymptotically and under restrictive assumptions. This paper derives a non-asymptotic approximation of the RLDA misclassification rate, valid for finite n and p, showing that the rate is governed by the population covariance spectrum through deterministic Marchenko-Pastur-type transforms. The formula reveals that each eigenvector direction $v_j$ contributes with weight $\langle \mu_1-\mu_2, v_j\rangle^2/s_j$, so directions with small eigenvalues can dominate and degrade classification. Based on this, the paper proposes Spectral Enhanced Discriminant Analysis (SEDA), which modifies spiked eigenvalues of the estimated covariance, and proves an asymptotic misclassification-rate formula for it under a generalized spiked model. Simulations and real-data experiments support the theory and indicate SEDA improves accuracy relative to existing LDA methods.

What carries the argument

The machinery is a pair of population spectral measures---$H_n$, the empirical distribution of the eigenvalues of the population covariance matrix $\Sigma$, and $G_n$, the distribution of the squared projections of the normalized mean difference onto the eigenvectors of $\Sigma$---together with the Marchenko-Pastur-type transforms $T_1(\lambda; H_n, y)$, $U_1(\lambda; H_n, G_n, y)$, $T_2(\lambda; H_n, y)$, and $U_2(\lambda; H_n, G_n, y)$. Theorem 1 shows the RLDA error is a function of these objects alone, which converts a random classifier into a predictable function of data structure. For SEDA, the load-bearing new result is Lemma 1, which states that for a deterministic unit vector $\xi$, the sample spiked-eigenvector projection $\xi^T u_j u_j^T \xi$ converges almost surely to $\sum_i \chi_j(i) \xi^T v_i v_i^T \xi$, with weights $\chi_j(i)$ determined by the spiked eigenvalues and the companion solutions of the Marchenko-Pastur equation; this is what lets the paper replace the adjusted sample inverse by an equivalent population version and obtain the asymptotic error formula for the enhanced spectrum.

What would settle it

Generate data from two normal classes with a population covariance whose spiked-eigenvalue separation shrinks with $n$ so that Assumption 7 fails, compute the empirical SEDA error rate, and compare it with the almost-sure limit in Theorem 2; if the two disagree systematically in the limit, the claimed eigenvector convergence fails.

Watch

Extended reading notes

Core claim

At finite sample size and dimension satisfying mild boundedness conditions, the paper claims the RLDA misclassification rate $R_{\mathrm{RLDA}}(\lambda)$ is, with probability at least $1 - C n^{-D}$, within $C n^{-(1-\varepsilon)/2}$ of an explicit deterministic expression built from the population spectral measures $H_n$ and $G_n$ via the Marchenko-Pastur equation and the companion transforms $T_1, U_1, T_2, U_2$. This makes precise how data structure drives performance: the contribution of population eigenvector $v_j$ is weighted by $\langle\mu_1-\mu_2, v_j\rangle^2/s_j$, so small-eigenvalue components of the mean difference can dominate and hurt accuracy. The paper then introduces SEDA, which replaces the identity in the regularized inverse by $I_p - \sum_{j\in J} \ell_j u_j u_j^T$, enlarging small spiked eigenvalues and shrinking large ones, and proves under generalized spiked-model assumptions and a new eigenvector convergence lemma that its misclassification rate converges almost surely to the same type of formula with the enhanced spectral measures $H_f$ and $G_f$. A bias-corrected version and a direct parameter-selection rule are derived from the formula; numerical comparisons on synthetic and real data show SEDA improving classification and dimensionality reduction over existing LDA variants.

Load-bearing premise

For the SEDA misclassification-rate formula to hold, the population covariance's outlying (spiked) eigenvalues must stay well separated from each other and from the bulk spectrum; if a spike sits too close to another spike or to the bulk, the eigenvector convergence on which the formula rests can fail.

Editorial extensions

If this is right

  • The contribution of each eigenvector direction $v_j$ to the RLDA error is weighted by $\langle\mu_1-\mu_2, v_j\rangle^2/s_j$, so directions with small eigenvalues can dominate classification and degrade accuracy.
  • Amplifying small spiked eigenvalues and shrinking large ones, as SEDA does, improves the misclassification rate, and SEDA reduces to RLDA when all adjustment parameters are zero.
  • Under the generalized spiked model, the asymptotic error of SEDA is given by the same deterministic formula as RLDA, evaluated at the enhanced spectral measures $H_f$ and $G_f$.
  • For unequal sample sizes, the bias-corrected SEDA has a strictly lower asymptotic error than the uncorrected one, because $\Phi$ is strictly convex on $(-\infty, 0)$.
  • The parameters of SEDA can be selected without cross-validation by maximizing a consistent estimate of $U_1^2/(U_2 + (y_1+y_2)T_2)$, and the resulting classifier outperforms cross-validated SRLDA, SIDA, and RLDA in the paper's simulations.

Reading between the lines

Editorial extensions of the paper, not claims the author makes directly.

  • Because Theorem 1 holds at finite $n$, it suggests using the formula as a predictive diagnostic: given an estimate of the spectrum and of the mean-difference projections, one could predict which data sets will defeat RLDA before training.
  • The weighting $\langle\mu_1-\mu_2, v_j\rangle^2/s_j$ implies that any preprocessing that rescales eigenvalues, not just spiked ones, should change classification error in a predictable way, potentially enabling optimal nonlinear feature transforms beyond the spiked adjustment.
  • The eigenvector limit in Lemma 1 could be used to estimate population eigenvector alignment from sample eigenvectors in other high-dimensional problems, such as principal-component-based inference, where projections onto spiked directions matter.
Share X Bluesky LinkedIn Reddit HN

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, and a circularity audit.

Referee Report

3 major / 4 minor

Summary. The paper studies regularized linear discriminant analysis (RLDA) in high dimensions and derives a non-asymptotic, finite-sample approximation of the misclassification rate that depends explicitly on the population spectral measures H_n and G_n defined in (5). It then uses this approximation to argue that small-eigenvalue directions can dominate the classification error, and proposes a Spectral Enhanced Discriminant Analysis (SEDA) classifier that adjusts spiked eigenvalues of the population covariance matrix. The main theoretical results are Theorem 1 for RLDA, Lemma 1 on convergence of sample spiked eigenvectors under a generalized spiked model, and Theorem 2 and Corollary 2 giving asymptotic misclassification rates for SEDA and its bias-corrected version. The paper also provides parameter-selection formulas, bias correction, simulations, and real-data experiments on MNIST and CIFAR-10.

Significance. If the results are fully established, the paper makes a valuable contribution: Theorem 1 gives a rate-of-convergence statement with an explicit structural characterization that goes beyond the asymptotic random-effects analysis of Dobriban and Wager (2018) and the structural assumptions of Wang and Jiang (2018). The proposed SEDA algorithm is conceptually interesting, and Lemma 1, if correct, is a useful random-matrix-theory result on spiked eigenvectors under a generalized spiked model. The paper also provides parameter-selection estimates and comparisons with SRLDA and SIDA, and its simulations support the practical promise of the method. However, the proof of the central SEDA result is incomplete at a load-bearing point, and the eigenvector-convergence proof relies on a spectral-gap assertion that needs additional justification.

major comments (3)
  1. [Appendix, Proof of Theorem 2] The proof of Theorem 2 ends with the sentence "We simplify the study of the asymptotic performance of SEDA to the case of Corollary 1. The proof is completed." This is not a proof. The reduction requires (i) showing that the quadratic forms involving Mn converge to those involving Wn at the level needed for the Φ arguments, (ii) verifying that the limiting quantities for the transformed data coincide exactly with U1(λ; H_f, G_f, y), U2(λ; H_f, G_f, y), and T2(λ; H_f, y), and (iii) checking that the transformed covariance matrix PΣP and transformed mean vector satisfy the conditions of Corollary 1. As written, the central asymptotic claim for SEDA is asserted rather than demonstrated.
  2. [Appendix, Proof of Lemma 1] The contour argument defines an event Ω = {bσ1j + c1 < a_j < bσ2j − c1} and states that it holds almost surely with a constant c1 independent of n, with existence of the contour C_j "guaranteed by Assumption 7." Assumption 7 is a separation condition on population spike ratios s_k/s_j only; it does not by itself control the n-dependent fluctuations of the sample eigenvalues a_j or their distance to the bulk and to neighboring spikes. In particular, near the phase-transition boundary allowed by Assumption 4, sample spikes can exhibit n^{-1/3} fluctuations, and eigenvalue repulsion gives much smaller gaps in general. The proof needs an explicit almost-sure eigenvalue-separation argument showing that a_j stays in a deterministic interval of constant width that excludes all other sample eigenvalues.
  3. [Section 3.1, Assumption 8 and Theorem 2] Theorem 2 reduces SEDA to Corollary 1 applied to the transformed spectrum H_f and G_f, but Corollary 1 requires the Assumption 1-type conditions, including the inverse-moment bound ∫ s^{-1} dH(s) ≤ M and boundedness of the spectrum. Assumption 8 only postulates weak convergence of H_f and G_f; it does not ensure that H_f has bounded support bounded away from zero or that the integrals defining T1, T2, U1, and U2 are finite. If the non-spiked bulk of H_f accumulates near zero, the claimed limiting expression in Theorem 2 is not well-defined. The authors should add explicit support/inverse-moment conditions on H_f or prove they follow from Assumptions 4–8.
minor comments (4)
  1. [Lemma 7 statement] In the display after Lemma 7, the term Σ_i χ_j(i) v_j v_j^T does not depend on i and appears to be a typo; it should likely be Σ_i χ_j(i) v_i v_i^T to match the preceding and following algebra.
  2. [Sections 5.2 and 5.3] The dataset name is written as "CIF AR-10"; the standard name is CIFAR-10. This typo appears in both the text and the table caption.
  3. [Section 3.3] The estimator bθ0 in (18) is defined as the argmax of a ratio of consistent point estimates, but no consistency of the argmax is established. Since the parameter set is not compact and the estimated functions may not converge uniformly, a short justification or an explicit compactness/continuity argument would be helpful.
  4. [Section 2, Example 1] The claim that U1^2 / (U2 + 4 y_n T2) is an increasing function of s_k is stated without proof; a short derivation or a reference would make the structural-effect discussion easier to verify.

Circularity Check

0 steps flagged · score 2.0 of 10

No circular reduction found; the RLDA and SEDA error-rate formulas are derived from population spectral quantities via concentration and contour arguments, with only minor, non-load-bearing self-citations.

full rationale

The paper's derivation chain is self-contained and does not reduce any prediction to a fit or to an unverified self-citation. Theorem 1 starts from the exact expression for R_RLDA(lambda) and uses Gaussian concentration and random-matrix trace concentration (Lemmas 2-4) to replace random quadratic forms by the population spectral averages T1, U1, T2, U2; the target misclassification rate never appears as an input. Corollary 1 and the structural examples then follow by weak convergence and monotonicity calculations, not by construction. Theorem 2 likewise derives the SEDA limit by proving, in Lemmas 1 and 7, that the SEDA discriminant operator is asymptotically equivalent to an RLDA operator on a transformed population spectrum Hf, Gf; the chi_j coefficients and f(s_i) in Assumption 8 are the output of explicit residue calculations in the Lemma 1 proof, not an assumed ansatz. The parameter-selection estimators (15)-(17) are consistent estimates of the theoretical objective using sample spectral quantities and the estimators of Jiang and Bai (2021) and Pu et al. (2024); they are not fitted to the error rates they later predict. The only self-references are contextual (Li et al., 2025a) or supporting the availability of consistent spiked estimates (Pu et al., 2024), and neither is load-bearing for Theorems 1-2. The manuscript honestly flags in Section 3.3 that the optimal-parameter theory is limited to simplified structures and delegates general settings to numerical experiments, which is a limitation, not a circularity. The proof of Lemma 1 contains a correctness-sensitive assertion that a constant-width spectral gap event Omega holds almost surely under Assumption 7, but this is a gap-checking concern about the proof's assumptions, not a circular reduction of the conclusion to the input. Overall, no prediction reduces by definition to its inputs; the score reflects only minor self-citations that do not carry the central argument.

Assumptions & free parameters 3 free parameters · 8 assumptions · 0 invented entities

The central theorems do not fit parameters to data; the key free parameters are the tuning coefficients λ and ℓ_j. The theoretical claims rely on the spiked model assumptions listed above, some of which are violated by the paper's own Case 3 simulation and by the p/n=1 case in Figure 2. The parameter-selection rule requires a simplified equal-bulk model and prior estimates from the same group.

free parameters (3)
  • regularization parameter λ = fixed by user or cross-validation; e.g., 0.1 in simulations
    Enters the RLDA and SEDA classifiers directly and is a tuning parameter; the theoretical results hold for any 1/M ≤ λ ≤ M in Theorem 1.
  • spike adjustment coefficients ℓ_j = user-chosen or optimized via (18)
    Each spike j has an adjustment ℓ_j (ℓ_j ≤ 0 for large spikes, 0 ≤ ℓ_j < 1 for small spikes). These are the design parameters of SEDA.
  • number of spikes r1, r2 = assumed known; estimated via Jiang (2023) in experiments
    The spiked model requires knowing which eigenvalues are spikes; the paper assumes r1, r2 are known in the theory.
assumptions (8)
  • domain assumption Assumption 1: eigenvalues of Σ are bounded and do not accumulate near zero (∫ s^{-1} dH_n ≤ M)
    Needed for the Marchenko-Pastur equation and the boundedness of the deterministic equivalents; excludes rank-deficient covariances (e.g., Case 3 with a zero eigenvalue).
  • domain assumption Assumption 3: |1-p/n| ≥ 1/M and p/n_i bounded
    The paper treats p/n bounded away from 1; simulation Figure 2 includes p/n=1, which is outside this assumption.
  • domain assumption Assumption 4: generalized spiked model with ∫ s² dH/(s_j-s)² < 1/y for each spike
    Core structural model for SEDA; discussed in Section 3.
  • domain assumption Assumption 7: gaps between spiked eigenvalues bounded below by c
    Required for the contour-integral eigenvector proof (Lemma 1); load-bearing for Theorem 2.
  • domain assumption Assumption 8: H_f, G_f weak convergence after spectral transformation
    Ensures the transformed spectrum has a limit for the stated asymptotics.
  • standard math Marchenko-Pastur equation has a unique solution under the stated conditions
    Standard RMT result (Marchenko and Pastur 1967; El Karoui 2008) used to define m(-λ).
  • ad hoc to paper Parameter-selection setup: simple spiked model with equal non-spiked eigenvalues σ² and equal µ projections on non-spiked eigenvectors
    Section 3.3 introduces this extra condition to estimate ∥µ∥ and obtain consistent estimates (15)-(17).
  • domain assumption Consistent estimates of σ², s_j, χ_j(j) exist from Jiang and Bai (2021) and Pu et al. (2024)
    The parameter-selection step treats these as known and cites prior work by the same group; no proofs are repeated here.

how reviews work

0 comments
Cite this review

Pith. "Pith review of Structural Effect and Spectral Enhancement of High-Dimensional Regularized Linear Discriminant Analysis." pith.science (2026). https://pith.science/paper/XBHXGP7Y

@misc{pith2026250716682,
  author       = {Pith},
  title        = {Pith review of: Structural Effect and Spectral Enhancement of High-Dimensional Regularized Linear Discriminant Analysis},
  year         = {2026},
  howpublished = {\url{https://pith.science/paper/XBHXGP7Y}},
  note         = {Machine review of arXiv:2507.16682}
}
read the original abstract

Regularized linear discriminant analysis (RLDA) is a widely used tool for classification and dimensionality reduction, but its performance in high-dimensional scenarios is inconsistent. Existing theoretical analyses of RLDA often lack clear insight into how data structure affects classification performance. To address this issue, we derive a non-asymptotic approximation of the misclassification rate and thus analyze the structural effect and structural adjustment strategies of RLDA. Based on this, we propose the Spectral Enhanced Discriminant Analysis (SEDA) algorithm, which optimizes the data structure by adjusting the spiked eigenvalues of the population covariance matrix. By developing a new theoretical result on eigenvectors in random matrix theory, we derive an asymptotic approximation on the misclassification rate of SEDA. The bias correction algorithm and parameter selection strategy are then obtained. Experiments on synthetic and real datasets show that SEDA achieves higher classification accuracy and dimensionality reduction compared to existing LDA methods.

Figures

Figures reproduced from arXiv: 2507.16682 by the authors.

Figure 1
Figure 1. The empirical misclassification rates for [PITH_FULL_IMAGE:figures/full_fig_p007_1.png] view at source ↗
Figure 2
Figure 2. Consistency of theoretical and empirical error rate. [PITH_FULL_IMAGE:figures/full_fig_p013_2.png] view at source ↗
Figure 3
Figure 3. Comparison of misclassification rates of RLDA, SEDA, SIDA, SRLDA, and opSEDA [PITH_FULL_IMAGE:figures/full_fig_p014_3.png] view at source ↗
Figures from the paper (1 more)
Figure 4
Figure 4. Figure 4: Simulations for SEDA, bias corrected SEDA (C-SEDA) and SEDA with optimal [PITH_FULL_IMAGE:figures/full_fig_p015_4.png]

Discussion (0). Continue with ORCID to comment.

Reference graph

Works this paper leans on

37 extracted references · 35 canonical work pages

  1. [1]

    and Ding, X

    Bai, Z. and Ding, X. (2012). Estimation of spiked eigenvalues in spiked models. Random Matrices: Theory and Applications , 01(02):1150011

    work page 2012

  2. [2]

    Bai, Z., Miao, B., and Pan, G. (2007). On asymptotics of eigenvectors of large sample covariance matrix. The Annals of Probability , 35(4):1532--1572

    work page 2007

  3. [3]

    Bao, Z., Ding, X., Wang, J., and Wang, K. (2022). Statistical inference for principal components of spiked covariance matrices. The Annals of Statistics , 50(2):1144--1169

    work page 2022

  4. [4]

    Bickel, P. J. and Levina, E. (2004). Some theory for fisher's linear discriminant function, `naive bayes', and some alternatives when there are many more variables than observations. Bernoulli , 10(6):989--1010

    work page 2004

  5. [5]

    Bickel, P. J. and Levina, E. (2008). Covariance regularization by thresholding. The Annals of Statistics , 36(6):2577--2604

    work page 2008

  6. [6]

    B \"u hlmann, P. (2013). Statistical significance in high-dimensional linear models. Bernoulli , 19(4):1212--1242

    2013

  7. [7]

    and Liu, W

    Cai, T. and Liu, W. (2011). A direct estimation approach to sparse linear discriminant analysis. Journal of the American Statistical Association , 106(496):1566--1577

    work page 2011

  8. [8]

    Chen, L., Paul, D., Prentice, R., and Wang, P. (2011). A regularized hotelling's t 2 test for pathway analysis in proteomic studies. Journal of the American Statistical Association , 106(496):1345--1360

    work page 2011

Show all 37 references
  1. [9]

    Davidson, D. J. (2009). Functional mixed-effect models for electrophysiological responses. Neurophysiology , 41(1):71--79

    2009

  2. [10]

    and Wager, S

    Dobriban, E. and Wager, S. (2018). High-dimensional asymptotics of prediction: ridge regression and classification. The Annals of Statistics , 46(1):247--279

    2018

  3. [11]

    El Karoui, N. (2008). Spectrum estimation for large dimensional covariance matrices using random matrix theory. The Annals of Statistics , 36(6):2757--2790

    2008

  4. [12]

    Friedman, J. H. (1989). Regularized discriminant analysis. Journal of the American Statistical Association , 84(405):165--175

    1989

  5. [13]

    Guo, Y., Hastie, T., and Tibshirani, R. (2007). Regularized linear discriminant analysis and its application in microarrays. Biostatistics , 8(1):86--100

    2007

  6. [14]

    Gurunathan, R., Van Emden, B., Panchanathan, S., and Kumar, S. (2004). Identifying spatially similar gene expression patterns in early stage fruit fly embryo images: binary feature versus invariant moment digital representations. BMC Bioinformatics , 5(1):202

    2004

  7. [15]

    Hastie, T., Montanari, A., Rosset, S., and Tibshirani, R. (2022). Surprises in high-dimensional ridgeless least squares interpolation. The Annals of Statistics , 50(2):949--986

    2022

  8. [16]

    Jiang, D. (2023). A universal test on spikes in a high-dimensional generalized spiked model and its applications. Statistica Sinica , 33:1749--1770

    2023

  9. [17]

    and Bai, Z

    Jiang, D. and Bai, Z. (2021). Generalized four moment theorem and an application to clt for spiked eigenvalues of high-dimensional covariance matrices. Bernoulli , 27(1):274--294

    2021

  10. [18]

    Johnstone, I. M. (2001). On the distribution of the largest eigenvalue in principal components analysis. The Annals of Statistics , 29(2):295--327

    2001

  11. [19]

    and Nadler, B

    Kritchman, S. and Nadler, B. (2008). Determining the number of components in a factor model from limited noisy data. Chemometrics and Intelligent Laboratory Systems , 94(1):19--32

    2008

  12. [20]

    and Wolf, M

    Ledoit, O. and Wolf, M. (2004). Honey, i shrunk the sample covariance matrix. The Journal of Portfolio Management , 30(4):110--119

    2004

  13. [21]

    Li, H., Luo, W., Bai, Z., Zhou, H., and Pu, Z. (2025a). Spectrally-corrected and regularized lda for spiked model. IEEE Transactions on Pattern Analysis and Machine Intelligence , 47(3):1991--1999

    2025

  14. [22]

    Li, M., Wang, C., Yin, Y., and Zheng, S. (2025b). High-dimensional scale invariant discriminant analysis. Statistica Sinica . in press

    2025

  15. [23]

    Liu, X., Liu, Y., Pan, G., Zhang, L., and Zhang, Z. (2025). Asymptotic limits of spiked eigenvalues and eigenvectors of signal-plus-noise matrices with weak signals and heteroskedastic noise. Bernoulli , 31(3):2351--2376

    2025

  16. [24]

    Mai, Q., Zou, H., and Yuan, M. (2012). A direct approach to sparse discriminant analysis in ultra-high dimensions. Biometrika , 99(1):29--42

    2012

  17. [25]

    and Pastur, L

    Mar c enko, V. and Pastur, L. (1967). Distribution of eigenvalues for some sets of random matrices. Mathematics of the USSR-Sbornik , 1(4):457--483

    1967

  18. [26]

    Mestre, X. (2008). On the asymptotic behavior of the sample estimates of eigenvalues and eigenvectors of covariance matrices. IEEE Transactions on Signal Processing , 56(11):5353--5368

    2008

  19. [27]

    Park, H., Jeon, M., and Rosen, J. B. (2003). Lower dimensional representation of text data based on centroids and least squares. Bit Numerical Mathematics , 43(2):427--448

    2003

  20. [28]

    Passemier, D., Li, Z., and Yao, J. (2017). On estimation of the noise variance in high dimensional probabilistic principal component analysis. Journal of the Royal Statistical Society Series B: Statistical Methodology , 79(1):51--67

    2017

  21. [29]

    E., Kim, J

    Pomeroy, S., Tamayo, P., Gaasenbeek, M., Sturla, L., Angelo, M., McLaughlin, M. E., Kim, J. Y. H., Goumnerova, L. C., Black, P. M., Lau, C., Allen, J. C., Zagzag, Da ., Olson, J. M., Curran, T., Wetmore, C., Biegel, J. A., Poggio, T., Mukherjee, S., Rifkin, R., Califano, A., S...

    2002

  22. [30]

    Hu , and Bai, Z

    Pu, Z., Zhang, X., J. Hu , and Bai, Z. (2024). The asymptotic properties of the extreme eigenvectors of high-dimensional generalized spiked covariance model. arXiv.2405.08524

    2024 arXiv

  23. [31]

    Shao, J., Wang, Y., Deng, X., and Wang, S. (2011). Sparse linear discriminant analysis by thresholding for high dimensional data. The Annals of Statistics , 39(2):1241--1265

    2011

  24. [32]

    and Weng, J

    Swets, D. and Weng, J. (1996). Using discriminant eigenfeatures for image retrieval. IEEE Transactions on Pattern Analysis and Machine Intelligence , 18(8):831--836

    1996

  25. [33]

    and Jiang, B

    Wang, C. and Jiang, B. (2018). On the dimension effect of regularized linear discriminant analysis. Electronic Journal of Statistics , 12(2):2709--2742

    2018

  26. [34]

    Wang, C., Pan, G., Tong, T., and Zhu, L. (2015). Shrinkage estimation of large dimensional precision matrix using random matrix theory. Statistica Sinica , 25(3):993--1008

    2015

  27. [35]

    and Leng, C

    Wang, X. and Leng, C. (2016). High dimensional ordinary least squares projection for screening variables. Journal of the Royal Statistical Society Series B: Statistical Methodology , 78(3):589--611

    2016

  28. [36]

    Zhao, L., Krishnaiah, P., and Bai, Z. (1986). On detection of the number of signals in presence of white noise. Journal of Multivariate Analysis , 20(1):1--25

    1986

  29. [37]

    and Dougherty, E

    Zollanvari, A. and Dougherty, E. R. (2015). Generalized consistent error estimator of linear discriminant analysis. IEEE Transactions on Signal Processing , 63(11):2804--2814

    2015

Pith tools

Reviewed August 6, 2026 · model on record in the stance chip above.