{"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/nearly-optimal-robust-subspace-tracking","title":"Nearly Optimal Robust Subspace Tracking","arxiv_id":"1712.06061","date":"2017-12-17","proceeding":"ICML 2018 7","authors":["Praneeth Narayanamurthy","Namrata Vaswani"],"abstract":"In this work, we study the robust subspace tracking (RST) problem and obtain\none of the first two provable guarantees for it. The goal of RST is to track\nsequentially arriving data vectors that lie in a slowly changing\nlow-dimensional subspace, while being robust to corruption by additive sparse\noutliers. It can also be interpreted as a dynamic (time-varying) extension of\nrobust PCA (RPCA), with the minor difference that RST also requires a short\ntracking delay. We develop a recursive projected compressive sensing algorithm\nthat we call Nearly Optimal RST via ReProCS (ReProCS-NORST) because its\ntracking delay is nearly optimal. We prove that NORST solves both the RST and\nthe dynamic RPCA problems under weakened standard RPCA assumptions, two simple\nextra assumptions (slow subspace change and most outlier magnitudes lower\nbounded), and a few minor assumptions.\n  Our guarantee shows that NORST enjoys a near optimal tracking delay of $O(r\n\\log n \\log(1/\\epsilon))$. Its required delay between subspace change times is\nthe same, and its memory complexity is $n$ times this value. Thus both these\nare also nearly optimal. Here $n$ is the ambient space dimension, $r$ is the\nsubspaces' dimension, and $\\epsilon$ is the tracking accuracy. NORST also has\nthe best outlier tolerance compared with all previous RPCA or RST methods, both\ntheoretically and empirically (including for real videos), without requiring\nany model on how the outlier support is generated. This is possible because of\nthe extra assumptions it uses.","url_abs":"http://arxiv.org/abs/1712.06061v4","url_pdf":"http://arxiv.org/pdf/1712.06061v4.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":"nearly-optimal-robust-subspace-tracking","repo_url":"https://github.com/praneethmurthy/NORST","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":1,"framework":"none","reach":{"status":"ok","spdx":"MIT"}}],"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":"praneethmurthy/NORST","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":"c896a67898e32e85e8a850428bec53012fdb9b64c87fbd53938845db2737bc9c","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}