arXiv (All)
open access
Streaming PCA: averaging from a geometric perspective
We study principal component analysis (PCA) under memory constraints, a setting that is increasingly important in large-scale data analysis. Our focus is on Oja's algorithm, which is a one-pass, memory-efficient algorithm requiring only $O(p)$ storage in the rank-one case and $O(pk)$ storage for $k$
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Benchmarking Active Spot Selection for Cost-Efficient Spatial Transcriptomics#1063419
- A Note on the Norm of the Embedding of $\text{PW}^2$ into $\text{PW}^q$#924702
- A Note on the Norm of the Embedding of $\text{PW}^2$ into $\text{PW}^q$#920468
- Trio: Learning Time-Series Forecasting with Temporal-Spatial-Sample Attention and Structural Causal Priors#266188
- Trainable clustering framework for spatial transcriptomics.#266979
Record · ID 1049075
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive