Deterministic Conditions for Subspace Identifiability from Incomplete Sampling

Consider a generic r-dimensional subspace of 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.


page 1

page 2

page 3

page 4


A Perturbation Bound on the Subspace Estimator from Canonical Projections

This paper derives a perturbation bound on the optimal subspace estimato...

Eigenspace conditions for homomorphic sensing

Given two endomorphisms τ_1,τ_2 of C^m with m > 2n and a general n-dimen...

Subspace Learning with Partial Information

The goal of subspace learning is to find a k-dimensional subspace of R^d...

Ham-Sandwich cuts and center transversals in subspaces

The Ham-Sandwich theorem is a well-known result in geometry. It states t...

Semi-Deterministic Subspace Selection for Sparse Recursive Projection-Aggregation Decoding of Reed-Muller Codes

Recursive projection aggregation (RPA) decoding as introduced in [1] is ...

First steps towards a formalization of Forcing

We lay the ground for an Isabelle/ZF formalization of Cohen's technique ...

Tensor Matched Subspace Detection

The problem of testing whether an incomplete tensor lies in a given tens...

Please sign up or login with your details

Forgot password? Click here to reset