{"about":{"non_affiliation":"Code with Papers and Syntology are not affiliated with, endorsed by, or sponsored by Papers with Code, Meta, or the pwc-archive mirror.","site":"https://codewithpapers.app","licence":"CC BY-SA 4.0","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","attribution":"https://codewithpapers.app/attribution","modified":"archive material modified by Syntology; see the attribution page","syntology":{"site":"https://syntology.ai","developers":"https://syntology.ai/developers","mcp":{"server":"https://syntology.ai/mcp","transport":"streamable-http","server_card":"https://syntology.ai/.well-known/mcp/server-card.json","auth":{"type":"trial token, no account","trial_token":"https://syntology.ai/api/oauth/trial/token","method":"POST","docs":"https://syntology.ai/developers"}},"have":"https://syntology.ai/api/graph/have?x=<method, arXiv id or title> (free, answers coverage only)","paper_base":"https://syntology.ai/paper/","atlas_base":"https://app.syntology.ai/?focus="},"machine_readable":[{"url":"https://codewithpapers.app/llms.txt","what":"the machine catalog: every machine-readable file, counted"},{"url":"https://codewithpapers.app/index/manifest.json","what":"paper-to-code index by arXiv id, with Syntology's counts"},{"url":"https://codewithpapers.app/search/manifest.json","what":"site search index (titles, authors) and its files"},{"url":"https://codewithpapers.app/download","what":"bulk files: Syntology's layer, described there"},{"url":"https://codewithpapers.app/build_manifest.json","what":"the build record: inputs, counts, exclusions, probes"}]},"url":"/paper/lazy-stochastic-principal-component-analysis","title":"Lazy stochastic principal component analysis","arxiv_id":"1709.07175","date":"2017-09-21","proceeding":null,"authors":["Michael Wojnowicz","Dinh Nguyen","Li Li","Xuan Zhao"],"abstract":"Stochastic principal component analysis (SPCA) has become a popular\ndimensionality reduction strategy for large, high-dimensional datasets. We\nderive a simplified algorithm, called Lazy SPCA, which has reduced\ncomputational complexity and is better suited for large-scale distributed\ncomputation. We prove that SPCA and Lazy SPCA find the same approximations to\nthe principal subspace, and that the pairwise distances between samples in the\nlower-dimensional space is invariant to whether SPCA is executed lazily or not.\nEmpirical studies find downstream predictive performance to be identical for\nboth methods, and superior to random projections, across a range of predictive\nmodels (linear regression, logistic lasso, and random forests). In our largest\nexperiment with 4.6 million samples, Lazy SPCA reduced 43.7 hours of\ncomputation to 9.9 hours. Overall, Lazy SPCA relies exclusively on matrix\nmultiplications, besides an operation on a small square matrix whose size\ndepends only on the target dimensionality.","url_abs":"http://arxiv.org/abs/1709.07175v1","url_pdf":"http://arxiv.org/pdf/1709.07175v1.pdf","source":{"archive":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","row_kind":"abstracts"},"code_links":[{"paper_slug":"lazy-stochastic-principal-component-analysis","repo_url":"https://github.com/CylanceSPEAR/lazy-stochastic-principal-component-analysis","is_official":1,"mentioned_in_paper":0,"mentioned_in_github":0,"framework":"none","reach":null}],"tasks":[{"task_slug":"dimensionality-reduction","task_name":"Dimensionality Reduction"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"syntology_url":null,"atlas_url":null,"mcp":null,"developers":"https://syntology.ai/developers","held":null,"reason":"arxiv_id_not_in_atlas","checked_against":{"atlas_ids":549449,"atlas_ids_sha256":"afd72399dafd9906e9062927f70655952385a3d75488558e1f0484e950ab09b7","read_at":"2026-10-05T01:46:21Z"},"by_repo":[{"repo":"CylanceSPEAR/lazy-stochastic-principal-component-analysis","kind":"official","samples":0,"ran":0,"instrument":0,"unverified":0}],"by_repo_is":"one row per repository in the archive's code links, Syntology's graph links or the samples; samples 0 means no sample is linked to this paper, a statement about Syntology's coverage, not about the repository: with harvested_for_other_papers present, Syntology harvested the repository for that many other papers, and without it, Syntology harvested nothing from it; placed_by_identical_code counts samples whose link records no repository, placed here because identical code was harvested from this repository for another paper; ran counts executions on a synthesized input and instrument counts failures of Syntology's instrument, not of the code"},"code_links_note":null,"arxiv_metadata":null,"syntology_extracted_results":null,"record_sha256":"8c167f30f8babf8d08aa2346f2b9eaea1f27d77abc8b67c2f74335943258ed6a","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}