Package for Fast ABC-Boost
Ping Li, Weijie Zhao

TL;DR
This paper introduces an open-source package implementing advanced boosting techniques, including histogram-based binning, second-order gain formulas, and the novel ABC-Boost for multi-class classification, with efficient base class selection.
Contribution
The package integrates standard and novel boosting methods, notably the efficient ABC-Boost for multi-class classification with a fast base class search strategy.
Findings
Effective simple binning algorithm comparable to sophisticated variants
Second-order gain formula improves over first-order methods
Efficient base class selection enhances multi-class boosting accuracy
Abstract
This report presents the open-source package which implements the series of our boosting works in the past years. In particular, the package includes mainly three lines of techniques, among which the following two are already the standard implementations in popular boosted tree platforms: (i) The histogram-based (feature-binning) approach makes the tree implementation convenient and efficient. In Li et al (2007), a simple fixed-length adaptive binning algorithm was developed. In this report, we demonstrate that such a simple algorithm is still surprisingly effective compared to more sophisticated variants in popular tree platforms. (ii) The explicit gain formula in Li (20010) for tree splitting based on second-order derivatives of the loss function typically improves, often considerably, over the first-order methods. Although the gain formula in Li (2010) was derived for logistic…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Code & Models
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsMachine Learning and Data Classification · Statistical Methods and Inference
MethodsBalanced Selection · Logistic Regression
