The proof of theorem 2 contains an error, where lemma 7
(which upper bounds ||L^-L||) is used to upper bound ||c*L^-L||
where c is different than 1. As a result, theorem 2 does not
hold as stated, and there are no formal theoretical guarantees
on the behavior of the adaptive algorithm.
Thanks to Ethan Fetaya for pointing this out.