Hard-ODT: Hardware-Friendly Online Decision Tree Learning Algorithm and System
Zhe Lin, Sharad Sinha, Wei Zhang

TL;DR
Hard-ODT introduces a hardware-efficient online decision tree learning system optimized for FPGA implementation, achieving high performance with low memory and computational requirements for large-scale data processing.
Contribution
The paper presents a novel quantile-based online decision tree algorithm and a hardware-optimized FPGA system, addressing memory and computational challenges of existing methods.
Findings
Reduced memory and computational demands compared to prior algorithms.
Achieved high performance and scalability on FPGA hardware.
Validated system with FPGA run-time power monitoring case study.
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.
