diff options
| author | Thibaut Horel <thibaut.horel@gmail.com> | 2015-02-06 18:27:55 -0500 |
|---|---|---|
| committer | Thibaut Horel <thibaut.horel@gmail.com> | 2015-02-06 18:27:55 -0500 |
| commit | 85d2de4ff3588b8059b2bb45ec9444097b996aa7 (patch) | |
| tree | 06c50a6d889e68a3d7920130a3441bfb4a15d4bf /paper/sections/lowerbound.tex | |
| parent | 8d7b0d99cfadc38a15b0f63d28d0edd024e8c5f0 (diff) | |
| download | cascades-85d2de4ff3588b8059b2bb45ec9444097b996aa7.tar.gz | |
Typos
Diffstat (limited to 'paper/sections/lowerbound.tex')
| -rw-r--r-- | paper/sections/lowerbound.tex | 2 |
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}. |