From 752ca266a44613a2b505f4f81cfed38cfd8fa5d4 Mon Sep 17 00:00:00 2001
From: jeanpouget-abadie <jean.pougetabadie@gmail.com>
Date: Thu, 29 Jan 2015 17:33:32 -0500
Subject: linear threshold section

---
 paper/sections/results.tex | 3 ++-
 1 file changed, 2 insertions(+), 1 deletion(-)

(limited to 'paper/sections/results.tex')

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}
-- 
cgit v1.2.3-70-g09d2

