{"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/provable-dynamic-robust-pca-or-robust","title":"Provable Dynamic Robust PCA or Robust Subspace Tracking","arxiv_id":"1705.08948","date":"2017-05-24","proceeding":null,"authors":["Praneeth Narayanamurthy","Namrata Vaswani"],"abstract":"Dynamic robust PCA refers to the dynamic (time-varying) extension of robust\nPCA (RPCA). It assumes that the true (uncorrupted) data lies in a\nlow-dimensional subspace that can change with time, albeit slowly. The goal is\nto track this changing subspace over time in the presence of sparse outliers.\nWe develop and study a novel algorithm, that we call simple-ReProCS, based on\nthe recently introduced Recursive Projected Compressive Sensing (ReProCS)\nframework. Our work provides the first guarantee for dynamic RPCA that holds\nunder weakened versions of standard RPCA assumptions, slow subspace change and\na lower bound assumption on most outlier magnitudes. Our result is significant\nbecause (i) it removes the strong assumptions needed by the two previous\ncomplete guarantees for ReProCS-based algorithms; (ii) it shows that it is\npossible to achieve significantly improved outlier tolerance, compared with all\nexisting RPCA or dynamic RPCA solutions by exploiting the above two simple\nextra assumptions; and (iii) it proves that simple-ReProCS is online (after\ninitialization), fast, and, has near-optimal memory complexity.","url_abs":"http://arxiv.org/abs/1705.08948v4","url_pdf":"http://arxiv.org/pdf/1705.08948v4.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":"provable-dynamic-robust-pca-or-robust","repo_url":"https://github.com/andrewssobral/lrslibrary","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":1,"framework":"none","reach":null},{"paper_slug":"provable-dynamic-robust-pca-or-robust","repo_url":"https://github.com/praneethmurthy/ReProCS","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":0,"framework":"none","reach":null}],"tasks":[{"task_slug":"compressive-sensing","task_name":"Compressive Sensing"}],"methods":[{"method_slug":"pca","method_name":"PCA"}],"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":"andrewssobral/lrslibrary","kind":"official","samples":0,"ran":0,"instrument":0,"unverified":0},{"repo":"praneethmurthy/ReProCS","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":"a94c1e4772f94e43a4150fd6aee7268a8903115ec251e5d7264197dc86669d7c","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}