Register Your Forests: Decision Tree Ensemble Optimization by Explicit CPU Register Allocation
Not on the map. Why?
Abstract (arXiv)
Bringing high-level machine learning models to efficient and well-suited machine implementations often invokes a bunch of tools, e.g.~code generators, compilers, and optimizers. Along such tool chains, abstractions have to be applied. This leads to not optimally used CPU registers. This is a shortcoming, especially in resource constrained embedded setups. In this work, we present a code generation approach for decision tree ensembles, which produces machine assembly code within a single conversion step directly from the high-level model representation. Specifically, we develop various approaches to effectively allocate registers for the inference of decision tree ensembles. Extensive evaluations of the proposed method are conducted in comparison to the basic realization of C code from the high-level machine learning model and succeeding compilation. The results show that the performance of decision tree ensemble inference can be significantly improved (by up to ≈1.6×), if the methods are applied carefully to the appropriate scenario.
Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 5 of its 20 references that are in the map. First posted on arXiv 10 Apr 2024.
Builds on
5 of 20 references.
References · 5
- 2020TensorFlow Lite Micro: Embedded Machine Learning on TinyML Systemscited by 165
- 2018ADMM-NN: An Algorithm-Hardware Co-Design Framework of DNNs Using Alternating Direction Method of Multiplierscited by 42
- 2018Intelligence Beyond the Edge: Inference on Intermittent Embedded Systemscited by 25
- 2020A Tensor Compiler for Unified Machine Learning Prediction Servingcited by 20
- 2018GANAX: A Unified MIMD-SIMD Acceleration for Generative Adversarial Networkscited by 11
Built on by
Not cited yet.