aboutsummaryrefslogtreecommitdiffstats
path: root/paper/sections/lowerbound.tex
diff options
context:
space:
mode:
authorjeanpouget-abadie <jean.pougetabadie@gmail.com>2015-05-15 18:54:54 +0200
committerjeanpouget-abadie <jean.pougetabadie@gmail.com>2015-05-15 18:54:54 +0200
commit2586d50b4ce7c932656b8f144784511f08692e14 (patch)
tree9fcaf074ece2abcd71decf78cf63129e9e7ffe86 /paper/sections/lowerbound.tex
parent0f6b315caf29f67d89b876ee14178dc7b1db6254 (diff)
downloadcascades-2586d50b4ce7c932656b8f144784511f08692e14.tar.gz
fixing small typos + adding style file
Diffstat (limited to 'paper/sections/lowerbound.tex')
-rw-r--r--paper/sections/lowerbound.tex2
1 files changed, 1 insertions, 1 deletions
diff --git a/paper/sections/lowerbound.tex b/paper/sections/lowerbound.tex
index 36fbbbe..215d3e6 100644
--- a/paper/sections/lowerbound.tex
+++ b/paper/sections/lowerbound.tex
@@ -1,5 +1,5 @@
In \cite{Netrapalli:2012}, the authors explicitate a lower bound of
-$\Omega(s\log\frac{n}{s})$ on the number of cascades necessary to achieve good
+$\Omega(s\log\frac{m}{s})$ on the number of cascades necessary to achieve good
support recovery with constant probability under a \emph{correlation decay}
assumption. In this section, we will consider the stable sparse recovery
setting of Section~\ref{sec:relaxing_sparsity}. Our goal is to obtain an