Factorized MultiClass Boosting
Reviewed by Pith T0 review T1 audit T2 compute T3 formal T4 kernel pith:A56FAJIOrecord.jsonopen to challenge →
classification
cs.LG
stat.ML
keywords
multiclassproblemsignificantlyalgorithmallowingapproachboostingcart
read the original abstract
In this paper, we introduce a new approach to multiclass classification problem. We decompose the problem into a series of regression tasks, that are solved with CART trees. The proposed method works significantly faster than state-of-the-art solutions while giving the same level of model quality. The algorithm is also robust to imbalanced datasets, allowing to reach high-quality results in significantly less time without class re-balancing.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.