Understand
In this paper we present CatBoost, a new open-sourced gradient boosting library that successfully handles categorical features and outperforms existing publicly available implementations of gradient boosting in terms of quality on a set of popular publicly available datasets.
- The library has a GPU implementation of learning algorithm and a CPU implementation of scoring algorithm, which are significantly faster than other gradient boosting libraries on ensembles of similar sizes.
Built on
Estimating probabilities: a crucial task in machine learning
B. Cestnik et al · 1990
Earlier work this paper cites.
Oblivious decision trees and abstract cases
P. Langley and S. Sage · 1994
Earlier work this paper cites.
Oblivious decision trees, graphs, and top-down pruning
R. Kohavi and C.-H. Li · 1995
Earlier work this paper cites.
Out-of-bag estimation, 1996
L. Breiman · 1996
Earlier work this paper cites.
Greedy function approximation: a gradient boosting machine
J. H. Friedman · 2001
Earlier work this paper cites.
A preprocessing scheme for high-cardinality categorical attributes in classification and prediction problems
D. Micci-Barreca · 2001
Earlier work this paper cites.
Similar
Stochastic gradient boosting
J. H. Friedman · 2002
Cited alongside, same era.
Boosted decision trees as an alternative to artificial neural networks for particle identification
B. P. Roe, H.-J. Yang, J. Zhu, Y. Liu, I. Stancu, and G. McGregor · 2005
Cited alongside, same era.
An empirical comparison of supervised learning algorithms
R. Caruana and A. Niculescu-Mizil · 2006
Cited alongside, same era.
Efficient parallel scan algorithms for gpus
M. G. Shubhabrata Sengupta, Mark Harris · 2008
Cited alongside, same era.
Adapting boosting for information retrieval measures
Q. Wu, C. J. Burges, K. M. Svore, and J. Gao · 2010
Cited alongside, same era.
Winning the transfer learning track of yahoo!’s learning to rank challenge with yetirank
A. Gulin, I. Kuralenok, and D. Pavlov · 2011
Cited alongside, same era.
Then
A gradient boosting method to improve travel time prediction
Y. Zhang and A. Haghani · 2015
Later among the works it cites.
Xgboost: A scalable tree boosting system
T. Chen and C. Guestrin · 2016
Later among the works it cites.
Single-pass parallel prefix scan with decoupled look-back
M. G. Duane Merrill NVIDIA Corporation · 2016
Later among the works it cites.
Enhancing lambdamart using oblivious trees
M. Ferov and M. Modrỳ · 2016
Later among the works it cites.
Catboost: unbiased boosting with categorical features
A. V. Dorogush, A. Gulin, G. Gusev, L. Ostroumova Prokhorenkova, and A. Vorobev · 2017
Later among the works it cites.
Gpu-acceleration for large-scale tree boosting
C.-J. H. Huan Zhang, Si Si · 2017
Later among the works it cites.
Beyond the bibliography
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…