diff options
| author | jeanpouget-abadie <jean.pougetabadie@gmail.com> | 2015-01-28 22:27:09 -0500 |
|---|---|---|
| committer | jeanpouget-abadie <jean.pougetabadie@gmail.com> | 2015-01-28 22:27:09 -0500 |
| commit | de7df38121cc8a39ee72899c9ed0628421dab7e1 (patch) | |
| tree | cc532c434848b0abce0732d1a4438d1a890ed294 /paper/sections/assumptions.tex | |
| parent | a9972e9bf028bc337ffd448791b242f1c92cc21c (diff) | |
| download | cascades-de7df38121cc8a39ee72899c9ed0628421dab7e1.tar.gz | |
updated results section
Diffstat (limited to 'paper/sections/assumptions.tex')
| -rw-r--r-- | paper/sections/assumptions.tex | 7 |
1 files changed, 7 insertions, 0 deletions
diff --git a/paper/sections/assumptions.tex b/paper/sections/assumptions.tex index eccd095..d6fed83 100644 --- a/paper/sections/assumptions.tex +++ b/paper/sections/assumptions.tex @@ -4,3 +4,10 @@ Proving the restricted eigenvalue assumption for correlated measurements is non- \subsection{The Irrepresentability Condition} +If our objective is to recover only the support of the graph and to do it exactly , then the irrepresentability condition\footnote{{\it incoherence} in the text} used in \cite{Daneshmand:2014} is believed to be necessary. + +However, assuming we only wish to recover all edges above a certain threshold, bounding the $\ell2$-error allows us to recover the full graph above a certain minimum threshold. Furthermore, it is intuitive that the irrepresentability condition is stronger than our suggested {\bf(RE)} assumption. In fact, by adapting slightly the following result from \cite{vandegeer:2009}, we can show that a `strong' irrepresentability condition directly {\it implies} the {\bf(RE)} condition for $\ell2$-recovery + +\begin{proposition} +If the irrepresentability condition holds with $\epsilon > \frac{2}{3}$, then the restricted eigenvalue condition holds with constant: $(1 - 3\epsilon)^2 \lambda_{\min}n/s$ +\end{proposition}
\ No newline at end of file |
