diff options
| author | jeanpouget-abadie <jean.pougetabadie@gmail.com> | 2015-05-19 01:15:33 +0200 |
|---|---|---|
| committer | jeanpouget-abadie <jean.pougetabadie@gmail.com> | 2015-05-19 01:15:33 +0200 |
| commit | a13116fa67cd0811c8660d38e20500433bb7a3a3 (patch) | |
| tree | 1d2cecf8acb84dc2e923200b2f0abbf21953b2c2 /paper/sections/appendix.tex | |
| parent | 3d3e1b5804b871fa9c7bc8fa2a712c997f629c3e (diff) | |
| download | cascades-a13116fa67cd0811c8660d38e20500433bb7a3a3.tar.gz | |
fixed typos
Diffstat (limited to 'paper/sections/appendix.tex')
| -rw-r--r-- | paper/sections/appendix.tex | 2 |
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. |