Towards Efficient and Scalable Acceleration of Online Decision Tree Learning on FPGA
Zhe Lin, Sharad Sinha, Wei Zhang

TL;DR
This paper presents a lightweight, scalable FPGA-based online decision tree learning system using a novel quantile-based algorithm that significantly improves speed and accuracy for large-scale data processing.
Contribution
The paper introduces a new quantile-based algorithm for Hoeffding trees and system-level FPGA optimizations, enabling efficient, high-speed online decision tree learning.
Findings
Achieved up to 12.3% accuracy improvement over state-of-the-art methods.
Real FPGA implementation yields 384x to 1581x speedup.
Reduced memory and computational requirements compared to existing algorithms.
Abstract
Decision trees are machine learning models commonly used in various application scenarios. In the era of big data, traditional decision tree induction algorithms are not suitable for learning large-scale datasets due to their stringent data storage requirement. Online decision tree learning algorithms have been devised to tackle this problem by concurrently training with incoming samples and providing inference results. However, even the most up-to-date online tree learning algorithms still suffer from either high memory usage or high computational intensity with dependency and long latency, making them challenging to implement in hardware. To overcome these difficulties, we introduce a new quantile-based algorithm to improve the induction of the Hoeffding tree, one of the state-of-the-art online learning models. The proposed algorithm is light-weight in terms of both memory and…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
