Abstract

This paper investigates conditions under which certain kinds of systems of bilinear equations have a unique structured solution. In particular, we look at when we can recover vectors w,q\boldsymbol{w},\boldsymbol{q} from observations of the form yℓ=<w,bℓ><cℓ,q>,ℓ=1,…,L, y_{\ell} = <\boldsymbol{w},\boldsymbol{b}_{\ell}><\boldsymbol{c}_{\ell},\boldsymbol{q}>, \quad \ell = 1,\ldots,L, where bℓ,cℓ\boldsymbol{b}_\ell,\boldsymbol{c}_\ell are known. We show that if w∈CM1\boldsymbol{w}\in\mathbb{C}^{M_1} and q∈CM2\boldsymbol{q}\in\mathbb{C}^{M_2} are sparse, with no more than KK and NN nonzero entries, respectively, and the bℓ,cℓ\boldsymbol{b}_\ell,\boldsymbol{c}_\ell are generic, selected as independent Gaussian random vectors, then w,q\boldsymbol{w},\boldsymbol{q} are uniquely determined from L≥Const⋅(K+N)log⁡5(M1M2) L \geq \mathrm{Const}\cdot (K+N)\log^5(M_1M_2) such equations with high probability. The key ingredient in our analysis is a uniform probabilistic bound on how far a random process of the form Z(X)=∑ℓ=1L∣bℓ∗Xcℓ∣2Z(\boldsymbol{X}) = \sum_{\ell=1}^L|\boldsymbol{b}_\ell^*\boldsymbol{X}\boldsymbol{c}_\ell|^2 deviates from its mean over a set of structured matrices X∈X\boldsymbol{X}\in\mathcal{X}. As both bℓ\boldsymbol{b}_\ell and cℓ\boldsymbol{c}_\ell are random, this is a specialized type of 44th order chaos; we refer to Z(X)Z(\boldsymbol{X}) as an {\em empirical chaos process}. Bounding this process yields a set of general conditions for when the map X→{bℓ∗Xcℓ}ℓ=1L\boldsymbol{X}\rightarrow \{\boldsymbol{b}_\ell^*\boldsymbol{X}\boldsymbol{c}_\ell\}_{\ell=1}^L is a restricted isometry over the set of matrices X\mathcal{X}. The conditions are stated in terms of general geometric properties of the set X\mathcal{X}, and are explicitly computed for the case where X\mathcal{X} is the set of matrices that are simultaneously sparse and low rank.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.