基于树的模型预测的优化
Runtime Optimizations for Prediction with Tree-Based Models
摘要:
基于树的模型已被证明是一个有效的解决方案,网络排名以及在不同领域的其他问题。本文的重点是优化应用这些模型进行预测的运行时性能,给定一个已经训练好的模型。虽然概念上非常简单,但基于树的模型的大多数实现都不能有效地利用现代超标量处理器架构。通过在内存中以更有缓存意识的方式布局数据结构,使用称为预测的技术从执行流中删除分支,以及使用称为向量化的技术进行微处理器预测,我们能够更好地利用现代处理器架构,并显着提高基于树的模型的速度,而不是硬编码的if-else块。我们的工作有助于探索架构意识的运行时实现的机器学习算法。
英文摘要:
Tree-based models have proven to be an effective solution for web ranking as well as other problems in diverse domains. This paper focuses on optimizing the runtime performance of applying such models to make predictions, given an already-trained model. Although exceedingly simple conceptually, most implementations of tree-based models do not efficiently utilize modern superscalar processor architectures. By laying out data structures in memory in a more cache-conscious fashion, removing branches from the execution flow using a technique called predication, and micro-batching predictions using a technique called vectorization, we are able to better exploit modern processor architectures and significantly improve the speed of tree-based models over hard-coded if-else blocks. Our work contributes to the exploration of architecture-conscious runtime implementations of machine learning algorithms.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。