Department of Mathematics
 Search | Help | Login | pdf version | printable version

Math @ Duke



Publications [#287180] of Ingrid Daubechies

Papers Published

  1. Rudin, C; Schapire, RE; Daubechies, I, Analysis of boosting algorithms using the smooth margin function, Annals of statistics, vol. 35 no. 6 (2007), pp. 2723-2768, ISSN 0090-5364 [doi]
    (last updated on 2018/03/22)

    We introduce a useful tool for analyzing boosting algorithms called the "smooth margin function," a differentiable approximation of the usual margin for boosting algorithms. We present two boosting algorithms based on this smooth margin, "coordinate ascent boosting" and "approximate coordinate ascent boosting," which are similar to Freund and Schapire's AdaBoost algorithm and Breiman's arc-gv algorithm. We give convergence rates to the maximum margin solution for both of our algorithms and for arc-gv. We then study AdaBoost's convergence properties using the smooth margin function. We precisely bound the margin attained by AdaBoost when the edges of the weak classifiers fall within a specified range. This shows that a previous bound proved by Ratsch and Warmuth is exactly tight. Furthermore, we use the smooth margin to capture explicit properties of AdaBoost in cases where cyclic behavior occurs. © Institute of Mathematical Statistics, 2007.
ph: 919.660.2800
fax: 919.660.2821

Mathematics Department
Duke University, Box 90320
Durham, NC 27708-0320