diff options
| author | jeanpouget-abadie <jean.pougetabadie@gmail.com> | 2015-01-29 17:33:32 -0500 |
|---|---|---|
| committer | jeanpouget-abadie <jean.pougetabadie@gmail.com> | 2015-01-29 17:33:32 -0500 |
| commit | 752ca266a44613a2b505f4f81cfed38cfd8fa5d4 (patch) | |
| tree | 22fb5513294a98355cf4284d5591577132a4b1af /paper/sections/results.tex | |
| parent | f6a02eeb1e006510bc2221eaac38681bc918c2c1 (diff) | |
| download | cascades-752ca266a44613a2b505f4f81cfed38cfd8fa5d4.tar.gz | |
linear threshold section
Diffstat (limited to 'paper/sections/results.tex')
| -rw-r--r-- | paper/sections/results.tex | 3 |
1 files changed, 2 insertions, 1 deletions
diff --git a/paper/sections/results.tex b/paper/sections/results.tex index 449ae02..965447b 100644 --- a/paper/sections/results.tex +++ b/paper/sections/results.tex @@ -26,7 +26,8 @@ Interestingly, finding such an upper-bound is commonly studied in sparse recover \begin{equation} \nonumber -\forall X \in {\cal C}, \| \Sigma X \|_2^2 \geq \gamma_n \|X\|_2^2 \qquad \text{\bf (RE)} +\forall X \in {\cal C}, \| \Sigma X \|_2^2 \geq \gamma_n \|X\|_2^2 +\tag{RE} \end{equation} We compare this condition to the irrepresentability condition used in prior work in section~\ref{sec:lowerbound}. We cite the following theorem from \cite{Negahban:2009} |