AI Chat AI Image Generator AI Video Text to Speech

Deterministic Conditions for Subspace Identifiability from Incomplete Sampling

10/02/2014

∙

by Daniel L. Pimentel-Alarcón, et al.

∙

∙

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.

Daniel L. Pimentel-Alarcón
5 publications
Robert D. Nowak
23 publications
Nigel Boston
2 publications

page 1

page 2

page 3

page 4

research

∙ 06/28/2022

A Perturbation Bound on the Subspace Estimator from Canonical Projections

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

0 Karan Srivastava, et al. ∙

research

∙ 12/05/2018

Eigenspace conditions for homomorphic sensing

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

0 Manolis C. Tsakiris, et al. ∙

research

∙ 02/19/2014

Subspace Learning with Partial Information

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

0 Alon Gonen, et al. ∙

research

∙ 03/29/2019

Ham-Sandwich cuts and center transversals in subspaces

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

0 Patrick Schnider, et al. ∙

research

∙ 11/02/2022

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

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

0 Johannes Voigt, et al. ∙

research

∙ 07/13/2018

First steps towards a formalization of Forcing

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

0 Emmanuel Gunther, et al. ∙

research

∙ 10/23/2017

Tensor Matched Subspace Detection

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

0 Cuiping Li, et al. ∙