Let random matrix $\mathbf{X} \in \mathbb{C^{\mathrm{m} \times \mathrm{n}}}$ and random vector $\mathbf{y} \in \mathbb{C^{\mathrm{m} \times 1}}$ are unknown distributed, but their covariance and correlation are known, $\mathbf{C}_{\mathbf{X}}$, $\mathbf{C}_{\mathbf{y}}$, and $\mathbf{C}_{\mathbf{Xy}}$. The question is whether there is any bound for the following expression, (like Cauchy-Schwarz or Jensen's)
$?\le \mathbb{E}[(\mathbf{X}^{\mathrm{H}} \mathbf{X})^{-1} \mathbf{X}^{\mathrm{H}} \mathbf{y}] \le ?$
I have to add that each element in matrix $\mathbf{X}$ or $\mathbf{y}$ is the output of a sign function, or in other words
Let $x : = \mathbf{X}_{i,j}, \ \forall i=1,\ldots m, \ \forall j=1,\ldots n$ , $\ y : = \mathbf{y}_{l}, \ \forall l=1,\ldots m $
then $x = sgn(z), \ y = sgn(t)$ where both $z$ and $t$ are gaussian random variables, and $sgn(.)$ means sign function. Also, I have to mention $\le$ here means an element-wise inequality since the corresponding expectation is an $\mathrm{n} \times 1$ vector.