Efficient Estimation of Linear Functionals of Principal Components
Vladimir Koltchinskii, Matthias L\"offler, Richard Nickl

TL;DR
This paper introduces a bias-reduced estimation method for linear functionals of principal components in high-dimensional Gaussian settings, achieving asymptotic normality and optimality under certain rank conditions.
Contribution
It develops a novel bias reduction technique for estimating linear functionals of eigenvectors in PCA within infinite-dimensional spaces, establishing asymptotic properties and minimax optimality.
Findings
Establishes asymptotic normality of the estimators.
Proves minimax lower bounds matching the estimators' risk.
Demonstrates semi-parametric optimality under effective rank conditions.
Abstract
We study principal component analysis (PCA) for mean zero i.i.d. Gaussian observations in a separable Hilbert space with unknown covariance operator The complexity of the problem is characterized by its effective rank where denotes the trace of and denotes its operator norm. We develop a method of bias reduction in the problem of estimation of linear functionals of eigenvectors of Under the assumption that we establish the asymptotic normality and asymptotic properties of the risk of the resulting estimators and prove matching minimax lower bounds, showing their semi-parametric optimality.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
