Machine-learnt models based on additive ensembles of binary regression trees are currently deemed the best solution to address complex classification, regression, and ranking tasks. Evaluating these models is a computationally demanding task as it needs to traverse thousands of trees with hundreds of nodes each. The cost of traversing such large forests of trees significantly impacts their application to big and stream input data, when the time budget available for each prediction is limited to guarantee a given processing throughput. Document ranking in Web search is a typical example of this challenging scenario, where the exploitation of tree-based models to score query-document pairs, and finally rank lists of documents for each incoming query, is the state-of-art method for ranking (a.k.a. Learning-to-Rank). This paper presents QuickScorer, a novel algorithm for the traversal of huge decision trees ensembles that, thanks to a cache-and CPU-aware design, provides a similar to 9x speedup over best competitors.
|Data di pubblicazione:||2017|
|Titolo:||Efficient Traversal of Large Ensembles of Decision Trees.|
|Titolo del libro:||Machine Learning and Knowledge Discovery in Databases. European Conference, ECML PKDD 2017, Skopje, Macedonia, September 18-22, 2017, Proceedings, Part III|
|Digital Object Identifier (DOI):||http://dx.doi.org/10.1007/978-3-319-71273-4_36|
|Appare nelle tipologie:||4.1 Articolo in Atti di convegno|
File in questo prodotto:
|qs-nectar.pdf||Documento in Pre-print||Accesso chiuso-personale||Riservato|