aboutsummaryrefslogtreecommitdiffstats
path: root/paper/sections/appendix.tex
diff options
context:
space:
mode:
Diffstat (limited to 'paper/sections/appendix.tex')
-rw-r--r--paper/sections/appendix.tex2
1 files changed, 1 insertions, 1 deletions
diff --git a/paper/sections/appendix.tex b/paper/sections/appendix.tex
index 22b87c2..a72114d 100644
--- a/paper/sections/appendix.tex
+++ b/paper/sections/appendix.tex
@@ -159,7 +159,7 @@ convex optimization, the MLE algorithm is faster. This is due to the overhead
caused by the $\ell_1$-regularisation in~\eqref{eq:pre-mle}.
The dependency of the running time on the number of cascades increases is
-linear, as expected. The slope is largest for our algorithm, which is against
+linear, as expected. The slope is largest for our algorithm, which is again
caused by the overhead induced by the $\ell_1$-regularization.