Double-Base Asymmetric AdaBoost

TL;DR

The paper introduces AdaBoostDB, a highly efficient asymmetric boosting algorithm that maintains theoretical guarantees while drastically reducing training time compared to existing cost-sensitive boosting methods.

Contribution

It presents a novel derivation scheme for AdaBoostDB that enables an extremely efficient training process without sacrificing theoretical properties.

Findings

Achieves over 99% reduction in training time compared to Cost-Sensitive AdaBoost.

Maintains the same cost-sensitive classification performance.

Demonstrates effectiveness on both synthetic and real datasets.

Abstract

Based on the use of different exponential bases to define class-dependent error bounds, a new and highly efficient asymmetric boosting scheme, coined as AdaBoostDB (Double-Base), is proposed. Supported by a fully theoretical derivation procedure, unlike most of the other approaches in the literature, our algorithm preserves all the formal guarantees and properties of original (cost-insensitive) AdaBoost, similarly to the state-of-the-art Cost-Sensitive AdaBoost algorithm. However, the key advantage of AdaBoostDB is that our novel derivation scheme enables an extremely efficient conditional search procedure, dramatically improving and simplifying the training phase of the algorithm. Experiments, both over synthetic and real datasets, reveal that AdaBoostDB is able to save over 99% training time with regard to Cost-Sensitive AdaBoost, providing the same cost-sensitive results. This computational advantage of AdaBoostDB can make a difference in problems managing huge pools of weak classifiers in which boosting techniques are commonly used.