mlsanityData to 14 Oct 2026

FLInt: Exploiting Floating Point Enabled Integer Arithmetic for Efficient Random Forest Inference

arXiv 2209.04181 ↗First posted 9 Sep 2022cs.LG cs.ARcited by 3

Not on the map. Why?

Abstract (arXiv)

In many machine learning applications, e.g., tree-based ensembles, floating point numbers are extensively utilized due to their expressiveness. Nowadays performing data analysis on embedded devices from dynamic data masses becomes available, but such systems often lack hardware capabilities to process floating point numbers, introducing large overheads for their processing. Even if such hardware is present in general computing systems, using integer operations instead of floating point operations promises to reduce operation overheads and improve the performance. In this paper, we provide mdname, a full precision floating point comparison for random forests, by only using integer and logic operations. To ensure the same functionality preserves, we formally prove the correctness of this comparison. Since random forests only require comparison of floating point numbers during inference, we implement mdname~in low level realizations and therefore eliminate the need for floating point hardware entirely, by keeping the model accuracy unchanged. The usage of mdname~basically boils down to a one-by-one replacement of conditions: For instance, a comparison statement in C: if(pX[3]<=(float)10.074347) becomes if((*(((int*)(pX))+3))<=((int)(0x41213087))). Experimental evaluation on X86 and ARMv8 desktop and server class systems shows that the execution time can be reduced by up to ≈ 30% with our novel approach.

Key facts. Cited by 3 papers in the map (data through 14 Oct 2026). Builds on 1 of its 16 references that are in the map. First posted on arXiv 9 Sep 2022.

Builds on

1 of 16 references.

References · 1

  1. 2020A Tensor Compiler for Unified Machine Learning Prediction Servingcited by 20

Built on by

Cited by year

Citing papers per year: 2023: 1; 2024: 1; 2025: 1.

3 papers.