Part of Advances in Neural Information Processing Systems 31 (NeurIPS 2018)

*Roie Levin, Anish Prasad Sevekari, David Woodruff*

<p>We study robust subspace estimation in the streaming and distributed settings. Given a set of n data points {a<em>i}</em>{i=1}^n in R^d and an integer k, we wish to find a linear subspace S of dimension k for which sum<em>i M(dist(S, a</em>i)) is minimized, where dist(S,x) := min<em>{y in S} |x-y|</em>2, and M() is some loss function. When M is the identity function, S gives a subspace that is more robust to outliers than that provided by the truncated SVD. Though the problem is NP-hard, it is approximable within a (1+epsilon) factor in polynomial time when k and epsilon are constant. We give the first sublinear approximation algorithm for this problem in the turnstile streaming and arbitrary partition distributed models, achieving the same time guarantees as in the offline case. Our algorithm is the first based entirely on oblivious dimensionality reduction, and significantly simplifies prior methods for this problem, which held in neither the streaming nor distributed models.</p>

Do not remove: This comment is monitored to verify that the site is working properly