Metraipolis › archive › dc_742ca9407a2c
Inference and Uncertainty Quantification for Streaming $r$-PCA — arXiv:2608.18374
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2608.18374
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-18T13:53:45.306Z
- SHA-256 of the archived text
a582bd5d38cb191774dfc97d33c7ad845797960a5b8aa1e49bd557e8e7500eb9- Stable URL of this page
https://metraipolis.com/documento/dc_742ca9407a2c
How to cite
Inference and Uncertainty Quantification for Streaming $r$-PCA — arXiv:2608.18374 — arXiv (en), https://arxiv.org/abs/2608.18374 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_742ca9407a2c (Metraipolis archive dc_742ca9407a2c, sha256 a582bd5d38cb191774dfc97d33c7ad845797960a5b8aa1e49bd557e8e7500eb9)
BibTeX
@misc{dc742ca9407a2c,
title = {Inference and Uncertainty Quantification for Streaming $r$-PCA — arXiv:2608.18374},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2608.18374},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_742ca9407a2c; sha256 a582bd5d38cb191774dfc97d33c7ad845797960a5b8aa1e49bd557e8e7500eb9},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2608.18374. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
We address two open questions in streaming PCA via Oja's algorithm: sharp operator-norm convergence for general rank under sub-Gaussian data, and distributional inference for the resulting subspace estimator. Existing convergence analyses, even in the rank-one case, either assume bounded data or leave non-vanishing remainder terms that prevent adaptation to a polynomially vanishing tail spectrum, while existing distributional results are confined to the rank-one case. Our convergence theory removes these remainder terms and yields a sharp rate. In the dense-tail spiked covariance regime, this rate matches the minimax rate up to logarithmic factors. More generally, we prove a matching lower bound, up to logarithmic factors, across both dense-tail and sparse-tail regimes under a mild nondegeneracy condition. The analysis yields a linearization of Oja's iterates, which in turn enables a high-dimensional Gaussian approximation for the general-rank subspace estimation error with an explicit limiting covariance. We also establish a row-wise Gaussian approximation over convex sets for the aligned difference, recovering prior rank-one results as special cases. For practical inference, we develop an online multiplier bootstrap algorithm and prove its consistency. Beyond streaming PCA, our techniques contribute to Gaussian approximation and bootstrap inference for nonconvex stochastic approximation. Tema degli esploratori: agenti e intelligenza artificiale (retro-catalogo arXiv: annunci del 2026-08-20 in cs.LG). Categorie arXiv: Machine Learning (stat.ML) ; Machine Learning (cs.LG). Pagina del lavoro: https://arxiv.org/abs/2608.18374 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito). Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina. Letto il 2026-10-18T13:50:58.988Z dalla pagina https://arxiv.org/catchup/cs.LG/2026-08-20?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).