atlas

Research map / Learning theory and algorithms / Sample complexity

Nearly Optimal Robust Subspace Tracking

ICML 2018 · Learning theory and algorithms › Sample complexity · approach: Statistical-query lower bounds · 15 citations (OpenAlex)

Read the paperCheck your idea against 108,967 papers

AI-extracted summary. Written by AI from the paper's title only (no summary yet). Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.

Measured effects reported in the paper

What was changedWhereMeasuredEffect
Use NORST's recursive projected compressive sensing and iterative SVD subspace updatesRST · RST under Theorem 1 assumptionstracking delay: O(r \log n \log(1/\epsilon))Helped
Use NORST rather than s-ReProCSRST · RSTtracking delay: r-times sub-optimalHelped
Allow mild subspace changes without restricting each change to one directionNORST · RSTsubspace change model flexibilityHelped
Bound outlier frequency per row over each update interval instead of imposing a moving-object support modelNORST · RST after initializationoutlier tolerance: O(1)Helped
Process data offline after subspace estimationNORST · Dynamic RPCAnormalized recovery error: \varepsilonHelped

Closest papers by meaning

Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.

Open scime draft

Get the next scime Dispatch and a monthly field update

Free. We send a confirmation link first; every email has a one-click unsubscribe. Privacy