Passer à la navigation principale Passer à la recherche Passer au contenu principal

New Asymptotic Results in Principal Component Analysis

  • School Of Mathematics
  • College of Computing
  • Université Côte D’Azur

Résultats de recherche: Contribution à un journalArticleRevue par des pairs

22 Citations (Scopus)

Résumé

Let X be a mean zero Gaussian random vector in a separable Hilbert space ℍ with covariance operator Σ : = E(X⊗ X). Let Σ = ∑ r 1μrPr be the spectral decomposition of Σ with distinct eigenvalues μ1>μ2>… and the corresponding spectral projectors P1, P2, …. Given a sample X1, … , Xn of size n of i.i.d. copies of X, the sample covariance operator is defined as Σ̂n:=n−1∑j=1nXj⊗Xj. The main goal of principal component analysis is to estimate spectral projectors P1,P2,… by their empirical counterparts P̂1,P̂2,… properly defined in terms of spectral decomposition of the sample covariance operator Σ ̂ n. The aim of this paper is to study asymptotic distributions of important statistics related to this problem, in particular, of statistic ∥P̂r−Pr∥22, where 22 is the squared Hilbert–Schmidt norm. This is done in a “high-complexity” asymptotic framework in which the so called effective rank r(Σ):=tr(Σ) (tr(⋅) being the trace and ∥ ⋅ ∥ being the operator norm) of the true covariance Σ is becoming large simultaneously with the sample size n, but r(Σ) = o(n) as n→ ∞. In this setting, we prove that, in the case of one-dimensional spectral projector Pr, the properly centered and normalized statistic ∥P̂r−Pr∥22 with data-dependent centering and normalization converges in distribution to a Cauchy type limit. The proofs of this and other related results rely on perturbation analysis and Gaussian concentration.

langue originaleAnglais
Pages (de - à)254-297
Nombre de pages44
journalSankhya A
Volume79
Numéro de publication2
Les DOIs
étatPublié - 1 août 2017
Modification externeOui

Empreinte digitale

Examiner les sujets de recherche de « New Asymptotic Results in Principal Component Analysis ». Ensemble, ils forment une empreinte digitale unique.

Contient cette citation