• DocumentCode
    2918376
  • Title

    TaylorBoost: First and second-order boosting algorithms with explicit margin control

  • Author

    Saberian, Mohammad J. ; Masnadi-Shirazi, Hamed ; Vasconcelos, Nuno

  • Author_Institution
    Dept. of Electr. & Comput. Eng., Univ. of California, San Diego, CA, USA
  • fYear
    2011
  • fDate
    20-25 June 2011
  • Firstpage
    2929
  • Lastpage
    2934
  • Abstract
    A new family of boosting algorithms, denoted Taylor-Boost, is proposed. It supports any combination of loss function and first or second order optimization, and includes classical algorithms such as AdaBoost, Gradient-Boost, or LogitBoost as special cases. Its restriction to the set of canonical losses makes it possible to have boosting algorithms with explicit margin control. A new large family of losses with this property, based on the set of cumulative distributions of zero mean random variables, is then proposed. A novel loss function in this family, the Laplace loss, is finally derived. The combination of this loss and second order TaylorBoost produces a boosting algorithm with explicit margin control.
  • Keywords
    Laplace equations; computer vision; learning (artificial intelligence); optimisation; Laplace loss; TaylorBoost; explicit margin control; first-order boosting algorithms; loss function; optimization; second-order boosting algorithms; Approximation methods; Boosting; Face; Logistics; Optimization; Taylor series; Training;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Computer Vision and Pattern Recognition (CVPR), 2011 IEEE Conference on
  • Conference_Location
    Providence, RI
  • ISSN
    1063-6919
  • Print_ISBN
    978-1-4577-0394-2
  • Type

    conf

  • DOI
    10.1109/CVPR.2011.5995605
  • Filename
    5995605