added to experiment section

2 files changed, 4 insertions, 1 deletions

diff --git a/paper/sections/appendix.tex b/paper/sections/appendix.tex
index 4c6aed7..8e82e0c 100644
--- a/paper/sections/appendix.tex
+++ b/paper/sections/appendix.tex
@@ -35,7 +35,7 @@ Choosing $\lambda\defeq 2\sqrt{\frac{\log m}{\alpha n^{1-\delta}}}$ concludes
 the proof.
 \end{proof}
 
-\subsubsection{Approximate sparsity proof}
+%\subsubsection{Approximate sparsity proof}
 \subsubsection{RE with high probability}
 
 \begin{proof}Writing $H\defeq \nabla^2\mathcal{L}(\theta^*)$, if
diff --git a/paper/sections/experiments.tex b/paper/sections/experiments.tex
index 3566e20..cacc882 100644
--- a/paper/sections/experiments.tex
+++ b/paper/sections/experiments.tex
@@ -66,6 +66,9 @@ interval $[0.2, 0.7]$, except when testing for approximately sparse graphs (see
 paragraph on robustness). Adjusting for the variance of our experiments, all
 data points are reported with at most a $\pm 1$ error margin. The parameter
 $\lambda$ is chosen to be of the order ${\cal O}(\sqrt{\log m / (\alpha n)})$.
+We report our results as a function of the number of \emph{cascades} and not the
+number of \emph{measurements}: in practice, very few cascades have depth
+greater than 3.
 
 \paragraph{Benchmarks}