  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.
