
provided that \(\gamma \)  is positive. The above holds universally for boosting algorithms that are derived from exponential type loss functions and various possible adaptive step-sizes. For these, general non-asymptotic bounds have been developed in [1]}, [2]}.
