2 problems

Fix $s=O(1)$. Let $d$ be the representation width, $F$ the number of features, and let $\mathbf b\in\{0,1\}^F$ be an $s$-sparse Boolean feature vector. An input code is a matrix…

Let $\mathbf{\Phi}_0$ be an overcomplete dictionary and let $X_0$ be a coefficient matrix, with the recovery condition involving $u_k$ and $\bar{X}_k^{\star}$ as defined in the sur…