A Well-Tempered Landscape for Non-convex Robust Subspace Recovery & Adaptive Sampling for Coarse Ranking
We present a mathematical analysis of a non-convex energy landscape for Robust Subspace Recovery. Under a deterministic condition, the only stationary point in a large neighborhood of an underlying subspace is the subspace itself. The same deterministic condition implies that a geodesic gradient descent method can exactly recover the underlying …