aboutsummaryrefslogtreecommitdiffstats
path: root/paper/sections/lowerbound.tex
diff options
context:
space:
mode:
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 becd13f..a7ae21c 100644
--- a/paper/sections/lowerbound.tex
+++ b/paper/sections/lowerbound.tex
@@ -4,7 +4,7 @@ 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
information-theoretic lower bound on the number of measurements necessary to
-approximately recover the parameter $\theta$ of a cascade model from observed
+approximately recover the parameter $\theta^*$ of a cascade model from observed
cascades. Similar lower bounds were obtained for sparse \emph{linear} inverse
problems in \cite{pw11, pw12, bipw11}.