Pith. sign in

REVIEW 5 major objections 6 minor 34 references

Adaptive Reference-Guided Estimation of Principal Component Subspace in High Dimensions

T0 review · 5 major / 6 minor · reviewed 2026-08-12 · deepseek-v4-flash

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

Pith's one-line read The paper proves that adding reference directions to sample PCA yields a subspace estimator that, when the references carry enough information, is asymptotically closer to the true PC subspace in every principal angle, and requires no…

desk verdict Solid new theorem for reference-guided PCA, but the abstract oversells case (ii) and the paper's own t5 simulations show the improvement fades without rho-mixing. read the letter →

arxiv 2411.15899 v3 pith:AIBEPYO4 submitted 2024-11-24 math.ST stat.TH

Dongsun Yoon , Sungkyu Jung This is my paper · ORCID
classification math.STstat.TH MSC 62H25
keywords PCAsubspaceestimationhigh-dimensionallow-sample-sizedataspikedcovariancemodelreferencedirectionsJames-Steinestimatorprincipalanglesnegativeridgeregularizationadaptive
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

In the high-dimension, low-sample-size regime, the sample principal component subspace is inconsistent: its principal angles to the truth converge to random values, not zero. The paper asks whether prior information, in the form of reference directions believed to lie near the true PC subspace, can repair this. It proposes the Adaptive Reference-Guided (ARG) estimator: take the signal subspace spanned by the leading sample PC directions and the references, find vectors inside it that are asymptotically orthogonal to the true PC subspace, and discard them. The paper's main theorem says that if the reference directions are collectively informative—the limiting alignment matrix between references and true PCs has full rank—then ARG asymptotically reduces every principal angle to the true PC subspace compared with the sample PC subspace. Because ARG also coincides exactly with a James-Stein shrinkage estimator, the result supplies the first theoretical justification for that shrinkage approach in the general multi-spike, multi-reference setting.

What carries the argument

The load-bearing object is the negatively ridged discriminant vector d_i = -tilde_lambda (S_m - tilde_lambda I_p)^{-1} v_i, where S_m is the spiked part of the sample covariance and tilde_lambda is the average noise eigenvalue. These data-only vectors are asymptotically orthogonal to the true PC subspace, which is counterintuitive but follows by scaling each sample PC contribution by the inverse of the fraction of inner product preserved by the sample projection. The ARG estimator takes the orthogonal complement of the span of these vectors inside the signal subspace; an equivalent basis form is (S_m - tilde_lambda I_p)(I_p - P_{V_r}) hat U_m, and this is the identity that identifies ARG with a James-Stein shrinkage of the sample PC subspace toward the reference span.

What would settle it

Repeat the single-spike simulation with a perfectly aligned reference ($a_1^{2}$ = 1) but draw the data from a t distribution with 5 degrees of freedom: the theorem predicts the ARG angle to the truth tends to zero as p grows, whereas the paper's own numerics leave it around 1.28 radians, confirming the rho-mixing premise decides whether the improvement exists.

Watch

Extended reading notes

Core claim

The central claim is Theorem 7(i): under the spiked HDLSS model with the paper's mixing assumptions, if the m-by-r matrix A of asymptotic alignments between reference directions and true PC directions has full rank, then the probability that every principal angle between the ARG subspace and the true PC subspace is smaller than the corresponding angle for the naive sample PC subspace tends to one. The construction is geometric. Within the signal subspace S = span(hat u_1,...,hat u_m, v_1,...,v_r), the paper builds negatively ridged discriminant vectors d_1,...,d_r; Theorem 4 shows they are asymptotically orthogonal to the true PC subspace. The ARG estimator, the orthogonal complement of their span inside S, is therefore the subspace in S that is asymptotically closest to the truth. When A is full rank, the same matrix algebra that forces this closeness also forces a strict reduction in every principal angle. If A is the zero matrix, the estimator matches the naive one asymptotically; for intermediate rank-deficient A, it is never worse by more than an arbitrary epsilon. The paper further shows that ARG is exactly the James-Stein subspace estimator previously proposed on shrinkage grounds, so the geometric argument also explains why shrinkage works.

Load-bearing premise

The whole improvement argument depends on the standardized PC scores being weakly dependent across variables, with bounded fourth moments; when that fails, the paper's own heavy-tailed simulations show the ARG estimator's advantage shrinking or vanishing.

Editorial extensions

If this is right

  • When reference directions carry collective information about the true PC subspace, ARG asymptotically beats the sample PC subspace on every principal angle, not just on a first or average direction.
  • When the references are uninformative, ARG collapses to the naive estimator asymptotically, so the method does not need a safeguard against useless references.
  • Because ARG equals the James-Stein subspace estimator, the geometric derivation gives the first theoretical account of why shrinkage toward reference vectors improves subspace estimation.
  • The estimator is parameter-free: the adaptive step selects the asymptotically closest subspace inside the signal subspace without a tuning constant.
  • The ARG-PCA algorithm uses the estimator in place of sample PCA and is applicable whenever an interpretable set of reference directions, for example a market factor, is available.

Reading between the lines

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

  • Editorial inference: the full-rank condition on A means the references must collectively span all m directions of the true PC subspace; if the references miss one direction, the strict-angle theorem should be expected to fail for that direction, and the rank-deficient case in Theorem 7(ii) is the relevant fallback.
  • Editorial inference: the exact equivalence with James-Stein implies that any existing or future implementation of the James-Stein subspace estimator inherits this paper's geometry and no-tuning property, which could simplify software implementation.
  • Editorial inference: a natural testable extension is to run ARG-PCA in approximate factor models with p and n both growing; the paper's fixed-n HDLSS theory suggests improvement that scales with the informativeness of the reference factors, but that regime is not treated here.
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

5 major / 6 minor

Summary. The paper proposes an Adaptive Reference-Guided (ARG) estimator for the leading principal component subspace in the HDLSS regime. The estimator collects the sample PC directions and the reference directions into a signal subspace, constructs negatively ridged discriminant vectors that are asymptotically orthogonal to the true PC subspace, and defines the ARG estimator as the orthogonal complement of the span of those vectors within the signal subspace. The main theoretical result, Theorem 7, compares principal angles: when the reference-to-true-PC alignment matrix A is full rank, all principal angles of the ARG estimator are asymptotically strictly smaller than those of the sample PC subspace with probability tending to one; when A is rank-deficient but nonzero, the improvement is only up to an arbitrarily small additive epsilon; when A is zero, the two estimators are asymptotically equivalent. The paper also claims that the ARG estimator is exactly equivalent to the James-Stein estimator of Shkolnik et al. (2025), and supports the theory with Gaussian simulations, a real-data illustration on NASDAQ returns, and supplementary simulations under a multivariate t-distribution.

Significance. If the main results hold, the paper provides a novel geometric rationale for reference-guided PCA and gives the first asymptotic guarantee of improvement over the naive sample PC subspace by a James-Stein-type estimator in the multi-spike, multi-reference setting. The construction is conceptually interesting: the estimator is adaptive in the sense that the ridge parameter is determined from the data rather than tuned, and the claimed equivalence with James-Stein shrinkage offers a bridging explanation between two different methodological perspectives. The main theorem is nontrivial and the proof strategy of comparing norms along all unit vectors before applying a singular-value perturbation lemma is elegant. However, the practical scope of the central improvement claim is narrower than the abstract suggests: the improvement is driven by the cross-sectional rho-mixing assumption (Assumption 2), and the paper's own t-distribution simulations show that the improvement nearly vanishes when that assumption is violated. In addition, the two foundational asymptotic lemmas are imported with proofs omitted, which weakens the verifiability of the chain of arguments.

major comments (5)
  1. [Section 3.3, Theorem 7(ii) vs. abstract] The abstract and Section 1 state that the ARG estimator 'asymptotically reduces all principal angles' whenever the reference directions carry nontrivial information, but Theorem 7(ii) only proves P(theta_k(ARG) < theta_k(naive) + epsilon) -> 1 for any epsilon > 0 when A is neither full-rank nor zero. This is not strict improvement; the abstract and introduction must either impose the full-rank condition on A or state the weaker epsilon-improvement claim for the rank-deficient case.
  2. [Assumption 2 and Appendix S2, Tables 3-4] The rho-mixing Assumption 2 is not a technical convenience: it is the engine that produces the limits in Lemmas 1 and 2, on which Theorem 4 and Theorem 7 rely. The paper's own Appendix S2 shows that under a multivariate t5 distribution, which violates only the rho-mixing part of Assumption 2, the improvement of the ARG estimator essentially disappears. In the single-spike case with perfectly informative reference (a1^2=1, p=2000), Table 3 reports an ARG angle of about 1.30 rad versus a naive angle of about 1.36 rad, whereas the Gaussian Table 1 gives 0.047 versus 0.810; in the two-spike case, Table 4 shows that the second principal angle barely changes. The sentence in Section 4.1 that the ARG estimator 'remains to outperform' under t5 is therefore too strong and should be replaced by a precise statement of the near-vanishing improvement, and the abstract should carry an explicit caveat about the dependence structure.
  3. [Section 2, Lemmas 1 and 2] Lemmas 1 and 2 are the foundation of the entire paper, but both are imported as 'slight modifications' of results in Jung et al. (2012) and Chang et al. (2021) with proofs omitted. Since the asymptotic formulas in these lemmas are load-bearing for Theorem 4 and Theorem 7, the paper should either state the exact modifications and provide proofs in the Supporting Information, or explicitly quote the original results in their applicable form. As written, a reader cannot verify that the modified statements are valid under the stated assumptions.
  4. [Section 3.3, equivalence to James-Stein] The paper claims that the ARG estimator is 'exactly equivalent' to the James-Stein estimator of Shkolnik et al. (2025), and this equivalence is advertised in the abstract and introduction as a main contribution. However, no formal definition of the Shkolnik et al. estimator is given and no proof of the equivalence is provided. Since the equivalence is part of the paper's central message, it should be stated as a proposition with the explicit form of the James-Stein estimator and a derivation, or clearly referenced to a specific equation in Shkolnik et al.
  5. [Theorem 7(ii) proof, 'taking the arccosine'] The proof of Theorem 7(ii) applies Lemma 6(ii), which gives P(sigma_k(A_p) > sigma_k(B_p) - epsilon) -> 1 for singular values, and then concludes the same epsilon-type bound for the principal angles by 'taking the arccosine'. Because arccosine is not Lipschitz near pi/2, this step needs a justification that the relevant singular value of the naive estimator is eventually bounded away from zero on a high-probability event, or the rank-deficient conclusion should be stated directly in terms of singular values rather than angles. As written, the angle conclusion is not a direct consequence of the singular-value comparison.
minor comments (6)
  1. [Section 3.2] The word 'propposed' in the second paragraph of Section 3.2 should be 'proposed'.
  2. [Notation throughout] The symbol hat U_m is used both for the subspace span(hat u_1,...,hat u_m) and for a matrix of orthonormal basis vectors, for example in the proof of Theorem 7. The matrix should be explicitly denoted as the p x m orthonormal basis matrix, e.g., hat U_m, to avoid ambiguity in the norm and singular-value arguments.
  3. [Figure 1] In Figure 1, both the discriminant vector d1 and the ARG estimator hat u_1^ARG are labeled in blue, which makes the geometry confusing; using distinct colors for d1, the projection P_S u1, and the estimator would clarify the construction.
  4. [Section 4.1] The sentence 'The ARG estimator remains to outperform in such situations' is grammatically awkward and, as discussed in the major comments, is not supported by the magnitude of the improvement in Table 3.
  5. [Table 3 caption] The caption reads 'multivariatet-distribution' without a space; it should be 'multivariate t-distribution'.
  6. [Section 4.2] The real-data analysis reports nonzero principal angles between the ARG and sample PC subspaces, but because the true subspace is unknown, the angles are descriptive only; the text should state explicitly that no claim of improvement is being made on the real data.

Circularity Check

0 steps flagged · score 0.0 of 10

No significant circularity: the ARG estimator is constructed from published asymptotic lemmas, and the James-Stein equivalence is an algebraic identity derived in the paper, not an input.

full rationale

I walked the derivation chain from Assumptions 1-4 through Lemmas 1-2 to Theorem 4 and Theorem 7. The ARG estimator is defined by explicit formulas: the negatively ridged discriminant vectors d_i in Eq. (1)-(2) and the subspace complement in Eq. (8). Theorem 4, which establishes asymptotic orthogonality of d_i to the true PC subspace, is proven from Lemmas 1 and 2, which are cited published results (Jung et al. 2012 and Chang et al. 2021) with stated assumptions that do not include the paper's own target claims; even though a coauthor is involved, these are independent published theorems rather than a self-citation chain forcing the result. The claimed equivalence to the James-Stein estimator is derived via the Sherman-Morrison-Woodbury identity and the span identity D_r^T(S_m - lambda-tilde I)(I - P_Vr) U-hat_m = 0, so it is an algebraic consequence of the definitions, not a fitted input or an assumed ansatz. No parameter is fitted to the target quantity and then renamed as a prediction; the ridge parameter lambda-tilde is data-dependent but is chosen from the asymptotic formulas, not tuned against the true PC subspace. The Appendix S2 t-distribution simulations show that the improvement is fragile to violation of the rho-mixing assumption, but that is an assumption-dependence limitation, not circularity. No load-bearing step reduces by construction to its own inputs, so the circularity score is 0.

Assumptions & free parameters 1 free parameters · 5 assumptions · 0 invented entities

The central claim rests on the spiked covariance model, a mixing assumption on the PC scores, and fixed reference directions with prescribed asymptotic alignments. The number of spikes m is an assumed input, not estimated. No new physical entities or speculative constructs are introduced.

free parameters (1)
  • Number of spikes m = assumed known, not estimated (m=2 in real data, m=1 in single-spike simulations)
    Entered directly into the estimator in Algorithm 1 and into Assumption 1. No data-driven selection or sensitivity analysis for m is provided.
assumptions (5)
  • domain assumption Spiked covariance model with equal spike exponent (Assumption 1): lambda_i = sigma_i^2 p + tau_i^2 for i = 1,...,m and bounded bulk eigenvalues.
    All asymptotic results use this equal-exponent, alpha=1 boundary case. Different spike growth rates are not covered.
  • domain assumption Rho-mixing and uniformly bounded fourth moments on the standardized PC scores (Assumption 2).
    Needed for the p-to-infinity law of large numbers underpinning Lemmas 1 and 2. Appendix S2 shows the theoretical gains fail to materialize under a t-distribution.
  • domain assumption Reference directions are fixed, linearly independent, and have a well-conditioned Gram matrix limit (Assumption 3).
    Ensures non-degenerate signal subspace and invertible random Gram matrices in Lemma 3.
  • domain assumption Reference directions have deterministic asymptotic alignments with the true PC subspace (Assumption 4).
    The theorem cases are parameterized by the matrix A of limits a_ij. The model treats references as nonrandom, while the real-data references are data-dependent.
  • standard math Prior asymptotic lemmas: Lemma 1 from Jung et al. (2012) and Lemma 2 from Chang et al. (2021), stated as slight modifications with proofs omitted.
    These cited theorems supply the limits of sample PC directions and reference inner products used throughout, including Theorem 7.

how reviews work

0 comments
Cite this review

Pith. "Pith review of Adaptive Reference-Guided Estimation of Principal Component Subspace in High Dimensions." pith.science (2026). https://pith.science/paper/AIBEPYO4

@misc{pith2026241115899,
  author       = {Pith},
  title        = {Pith review of: Adaptive Reference-Guided Estimation of Principal Component Subspace in High Dimensions},
  year         = {2026},
  howpublished = {\url{https://pith.science/paper/AIBEPYO4}},
  note         = {Machine review of arXiv:2411.15899}
}
read the original abstract

We propose a novel estimator for the principal component (PC) subspace tailored to the high-dimension, low-sample size (HDLSS) context. The method, termed Adaptive Reference-Guided (ARG) estimator, is designed for data exhibiting spiked covariance structures and seeks to improve upon the conventional sample PC subspace by leveraging auxiliary information from reference vectors, presumed to carry prior knowledge about the true PC subspace. The estimator is constructed by first identifying vectors asymptotically orthogonal to the true PC subspace within a signal subspace, the subspace spanned by the leading sample PC directions and the references, and then taking the orthogonal complement. The estimator is adaptive, as it automatically selects the subspace asymptotically closest to the true PC subspace inside the signal subspace, without requiring parameter tuning. We show that when the reference vectors carry nontrivial information, the proposed estimator asymptotically reduces all principal angles between the estimated and true PC subspaces compared to the naive sample-based estimator. Interestingly, despite being derived from a completely different rationale, the ARG estimator is theoretically equivalent to an estimator based on James-Stein shrinkage. Our results thus establish a theoretical foundation that unifies these two distinct approaches.

Figures

Figures reproduced from arXiv: 2411.15899 by the authors.

Figure 1
Figure 1. Geometric representation of the ARG estimator in the single-spike, single [PITH_FULL_IMAGE:figures/full_fig_p012_1.png] view at source ↗
Figure 2
Figure 2. Score plot of the first two estimated PCs. Standard PCA scores are shown [PITH_FULL_IMAGE:figures/full_fig_p021_2.png] view at source ↗

Discussion (0). Continue with ORCID to comment.

Reference graph

Works this paper leans on

34 extracted references · 31 canonical work pages

  1. [1]

    S., Muller, K

    Ahn, J., Marron, J. S., Muller, K. M., and Chi, Y.-Y. (2007). The high-dimension, low-sample-size geometric representation holds under mild conditions. Biometrika , 94(3):760--766

    work page 2007

  2. [2]

    and Ng, S

    Bai, J. and Ng, S. (2002). Determining the number of factors in approximate factor models. Econometrica , 70(1):191--221

    2002

  3. [3]

    L., Long, P

    Bartlett, P. L., Long, P. M., Lugosi, G., and Tsigler, A. (2020). Benign overfitting in linear regression. Proceedings of the National Academy of Sciences , 117(48):30063--30070

    2020

  4. [4]

    Bradley, R. C. (2005). Basic properties of strong mixing conditions. a survey and some open questions. Probability Surveys , 2:107 -- 144

    work page 2005

  5. [5]

    and Rothschild, M

    Chamberlain, G. and Rothschild, M. (1983). Arbitrage, factor structure, and mean-variance analysis on large asset markets. Econometrica , 51(5):1281--1304

    work page 1983

  6. [6]

    A., and Willsky, A

    Chandrasekaran, V., Parrilo, P. A., and Willsky, A. S. (2012). Latent variable graphical model selection via convex optimization. The Annals of Statistics , 40(4):1935--1967

    work page 2012

  7. [7]

    A., and Willsky, A

    Chandrasekaran, V., Sanghavi, S., Parrilo, P. A., and Willsky, A. S. (2011). Rank-sparsity incoherence for matrix decomposition. SIAM Journal on Optimization , 21(2):572--596

    work page 2011

  8. [8]

    Chang, W., Ahn, J., and Jung, S. (2021). Double data piling leads to perfect classification . Electronic Journal of Statistics , 15(2):6382 -- 6428

    work page 2021

Show all 34 references
  1. [9]

    Donoho, D., Gavish, M., and Johnstone, I. (2018). Optimal shrinkage of eigenvalues in the spiked covariance model . The Annals of Statistics , 46(4):1742 -- 1778

    2018

  2. [10]

    Fama, E. F. and French, K. R. (1993). Common risk factors in the returns on stocks and bonds. Journal of Financial Economics , 33(1):3--56

    1993

  3. [11]

    Fama, E. F. and French, K. R. (2015). A five-factor asset pricing model. Journal of Financial Economics , 116(1):1--22

    2015

  4. [12]

    Fan, J., Liao, Y., and Mincheva, M. (2011). High-dimensional covariance matrix estimation in approximate factor models . The Annals of Statistics , 39(6):3320 -- 3356

    2011

  5. [13]

    Fan, J., Liao, Y., and Mincheva, M. (2013). Large covariance estimation by thresholding principal orthogonal complements. Journal of the Royal Statistical Society. Series B (Statistical Methodology) , 75(4):603--680

    2013

  6. [14]

    and Montanari, A

    Farnè, M. and Montanari, A. (2020). A large covariance matrix estimator under intermediate spikiness regimes. Journal of Multivariate Analysis , 176:104577

    2020

  7. [15]

    and Montanari, A

    Farnè, M. and Montanari, A. (2024). Large factor model estimation by nuclear norm plus _1 norm penalization. Journal of Multivariate Analysis , 199:105244

    2024

  8. [16]

    Goldberg, L. R. and Kercheval, A. N. (2023). James–stein for the leading eigenvector. Proceedings of the National Academy of Sciences , 120(2):e2207046120

    2023

  9. [17]

    R., Papanicolaou, A., and Shkolnik, A

    Goldberg, L. R., Papanicolaou, A., and Shkolnik, A. (2022). The dispersion bias. SIAM Journal on Financial Mathematics , 13(2):521--550

    2022

  10. [18]

    R., Papanicolaou, A., Shkolnik, A., and Ulucam, S

    Goldberg, L. R., Papanicolaou, A., Shkolnik, A., and Ulucam, S. (2020). Better betas. The Journal of Portfolio Management , 47(1):119 -- 136

    2020

  11. [19]

    and Kercheval, A

    Gurdogan, H. and Kercheval, A. (2022). Multiple anchor point shrinkage for the sample covariance matrix. SIAM Journal on Financial Mathematics , 13(3):1112--1143

    2022

  12. [20]

    and Shkolnik, A

    Gurdogan, H. and Shkolnik, A. (2024). The quadratic optimization bias of large covariance matrices. arXiv no. 2410.03053

    2024 arXiv

  13. [21]

    S., and Neeman, A

    Hall, P., Marron, J. S., and Neeman, A. (2005). Geometric representation of high dimension, low sample size data. Journal of the Royal Statistical Society. Series B (Statistical Methodology) , 67(3):427--444

    2005

  14. [22]

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

    2001

  15. [23]

    and Marron, J

    Jung, S. and Marron, J. S. (2009). PCA consistency in high dimension, low sample size context . The Annals of Statistics , 37(6B):4104 -- 4130

    2009

  16. [24]

    Jung, S., Sen, A., and Marron, J. (2012). Boundary behavior in High Dimension, Low Sample Size asymptotics of PCA . Journal of Multivariate Analysis , 109:190--203

    2012

  17. [25]

    and Goto, S

    Kanehisa, M. and Goto, S. (2000). KEGG : Kyoto Encyclopedia of Genes and Genomes . Nucleic Acids Research , 28(1):27--30

    2000

  18. [26]

    T., Ma, Y., and Lin, X

    Ke, Z. T., Ma, Y., and Lin, X. (2023). Estimation of the number of spiked eigenvalues in a covariance matrix by bulk eigenvalue matching analysis. Journal of the American Statistical Association , 118(541):374--392

    2023

  19. [27]

    Kim, T., Chang, W., Ahn, J., and Jung, S. (2024). Double data piling: a high-dimensional solution for asymptotically perfect multi-category classification. Journal of the Korean Statistical Society , 53:704--737

    2024

  20. [28]

    Kobak, D., Lomond, J., and Sanchez, B. (2020). The optimal ridge penalty for real-world high-dimensional data can be zero or negative due to the implicit ridge regularization. Journal of Machine Learning Research , 21(1)

    2020

  21. [29]

    Kolmogorov, A. N. and Rozanov, Y. A. (1960). On strong mixing conditions for stationary gaussian processes. Theory of Probability & Its Applications , 5(2):204--208

    1960

  22. [30]

    Lintner, J. (1965). The valuation of risk assets and the selection of risky investments in stock portfolios and capital budgets. The Review of Economics and Statistics , 47(1):13--37

    1965

  23. [31]

    Sharpe, W. F. (1964). Capital asset prices: A theory of market equilibrium under conditions of risk. The Journal of Finance , 19(3):425--442

    1964

  24. [32]

    Shkolnik, A. (2022). James–Stein estimation of the first principal component . Stat , 11(1):e419

    2022

  25. [33]

    R., and Bar, H

    Shkolnik, A., Kercheval, A., Gurdogan, H., Goldberg, L. R., and Bar, H. (2025). Portfolio selection revisited. Annals of Operations Research , 346(1):137--155

    2025

  26. [34]

    and Aoshima, M

    Yata, K. and Aoshima, M. (2012). Effective PCA for high-dimension, low-sample-size data with noise reduction via geometric representations. Journal of Multivariate Analysis , 105(1):193--215

    2012

Pith tools

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