The following lemma shows that AdaBoost, as described in Algorithm REF , provides an \((1-\varepsilon )\) -approximation of the \(\ell _1\) -margin, when it is run long enough. The proof is a simple adaptation of results by [1]} to our setting.
