Level-set entropy and sparse randomized embeddings

Let $\mathrm{\Pi }$ be a $k\times n$ sparse random matrix. For a fixed $r$-dimensional subspace $V\subset {\mathbb{R}}^n$, let $U_V:{\mathbb{R}}^r\to {\mathbb{R}}^n$ denote an isometry from ${\mathbb{R}}^r$ onto $V$. The product $\mathrm{\Pi }{U}_V$ is a central model in randomized dimension reduction and has been studied primarily through trace and Gaussian comparison inequalities. In this work, we develop an approach to the spectral norm of the matrix product $\mathrm{\Pi }{U}_V$, based on entropy estimates for level sets of vectors $x\in V$. Combining the method with existing estimates, we show the following. Assume that $$k\ge Cr(\log \log r{)}^2,p\ge (\log k)\mathrm{/}k\mathrm{.}$$ Let $\mathrm{\Pi }$ be a $k\times n$ matrix with i.i.d. entries equidistributed with the product $b\xi$, where $b$ is a Bernoulli($p$) random variable and $\xi$ is mean-zero, independent of $b$, and satisfies $\mathrm{\mid }\xi \mathrm{\mid }\le 1$ almost surely. Then with high probability $$\mathrm{\parallel }\mathrm{\Pi }{U}_V\mathrm{\parallel }\le C\sqrt{kp}\mathrm{.}$$ Matching results hold for other random models with negatively associated entries.