2000 character limit reached
Deterministic Conditions for Subspace Identifiability from Incomplete Sampling
Published 2 Oct 2014 in stat.ML, cs.LG, and math.CO | (1410.0633v3)
Abstract: Consider a generic $r$-dimensional subspace of $\mathbb{R}d$, $r<d$, and suppose that we are only given projections of this subspace onto small subsets of the canonical coordinates. The paper establishes necessary and sufficient deterministic conditions on the subsets for subspace identifiability.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.
