Cache-conscious runtime optimization for ranking ensembles
Authors:
Open Access
- 3 July 2014
- conference paper
- Published by Association for Computing Machinery (ACM)
- p. 1123-1126
Abstract
Multi-tree ensemble models have been proven to be effective for document ranking. Using a large number of trees can improve accuracy, but it takes time to calculate ranking scores of matched documents. This paper investigates data traversal methods for fast score calculation with a large ensemble. We propose a 2D blocking scheme for better cache utilization with simpler code structure compared to previous work. The experiments with several benchmarks show significant acceleration in score calculation without loss of ranking accuracy.Keywords
Funding Information
- Division of Information and Intelligent Systems (NSF IIS-1118106)
This publication has 6 references indexed in Scilit:
- Training Efficient Tree-Based Models for Document Ranking2013
- Bagging gradient-boosted trees for high precision, low variance ranking models2011
- BagBoo2010
- Early exit optimizations for additive machine learned ranking systems2010
- Greedy function approximation: A gradient boosting machine.The Annals of Statistics, 2001
- Compiler transformations for high-performance computingACM Computing Surveys, 1994