{"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/accelerated-alternating-projections-for","title":"Accelerated Alternating Projections for Robust Principal Component Analysis","arxiv_id":"1711.05519","date":"2017-11-15","proceeding":null,"authors":["HanQin Cai","Jian-Feng Cai","Ke Wei"],"abstract":"We study robust PCA for the fully observed setting, which is about separating\na low rank matrix $\\boldsymbol{L}$ and a sparse matrix $\\boldsymbol{S}$ from\ntheir sum $\\boldsymbol{D}=\\boldsymbol{L}+\\boldsymbol{S}$. In this paper, a new\nalgorithm, dubbed accelerated alternating projections, is introduced for robust\nPCA which significantly improves the computational efficiency of the existing\nalternating projections proposed in [Netrapalli, Praneeth, et al., 2014] when\nupdating the low rank factor. The acceleration is achieved by first projecting\na matrix onto some low dimensional subspace before obtaining a new estimate of\nthe low rank matrix via truncated SVD. Exact recovery guarantee has been\nestablished which shows linear convergence of the proposed algorithm. Empirical\nperformance evaluations establish the advantage of our algorithm over other\nstate-of-the-art algorithms for robust PCA.","url_abs":"http://arxiv.org/abs/1711.05519v4","url_pdf":"http://arxiv.org/pdf/1711.05519v4.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":"accelerated-alternating-projections-for","repo_url":"https://github.com/caesarcai/AccAltProj_for_RPCA","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":0,"framework":"none","reach":{"status":"ok","spdx":"MIT"}}],"tasks":[{"task_slug":"computational-efficiency","task_name":"Computational Efficiency"}],"methods":[{"method_slug":"pca","method_name":"PCA"}],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"syntology_url":"https://syntology.ai/paper/1711.05519","atlas_url":"https://app.syntology.ai/?focus=1711.05519","mcp":null,"developers":"https://syntology.ai/developers","held":true,"reason":"arxiv_id_in_atlas","checked_against":{"atlas_ids":549449,"atlas_ids_sha256":"afd72399dafd9906e9062927f70655952385a3d75488558e1f0484e950ab09b7","read_at":"2026-10-05T01:46:21Z"},"agent_calls":[{"tool":"get_citation_path","arguments":{"paper_1":"1711.05519"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"1711.05519\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"1711.05519"},"call":"get_concepts_for_paper(arxiv_id=\"1711.05519\")"}],"by_repo":[{"repo":"caesarcai/AccAltProj_for_RPCA","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":"73791ac56e47a28ab49fb3c424e07c26ff1a9c3e484572ea88ad9d43b07981ac","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}