Boosted Trees on a Diet: Compact Models for Resource-Constrained Devices

Jan Stenkamp, Nina Herrmann, Benjamin Karic, Stefan Oehmcke, Fabian Gieseke
10/30/2025
cs.LG

No confident code implementation found for this paper.

Abstract

Deploying machine learning models on compute-constrained devices has become a key building block of modern IoT applications. In this work, we present a compression scheme for boosted decision trees, addressing the growing need for lightweight machine learning models. Specifically, we provide techniques for training compact boosted decision tree ensembles that exhibit a reduced memory footprint by rewarding, among other things, the reuse of features and thresholds during training. Our experimental evaluation shows that models achieved the same performance with a compression ratio of 4-16x compared to LightGBM models using an adapted training process and an alternative memory layout. Once deployed, the corresponding IoT devices can operate independently of constant communication or external energy supply, and, thus, autonomously, requiring only minimal computing power and energy. This capability opens the door to a wide range of IoT applications, including remote monitoring, edge analytics, and real-time decision making in isolated or power-limited environments.

View on arXivView PDF

Code Implementations

No confident code match yet

We couldn't find an author-owned or strongly-evidenced community implementation for this paper. Any repos shown below are weak matches — verify before relying on them.

No code implementations found yet.

Know of an implementation? Let us know in the comments below!

Similar Papers

Cite this paper

@article{stenkamp2025boosted,
  title  = {Boosted Trees on a Diet: Compact Models for Resource-Constrained Devices},
  author = {Jan Stenkamp and Nina Herrmann and Benjamin Karic and Stefan Oehmcke and Fabian Gieseke},
  year   = {2025},
  eprint = {2510.26557},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2510.26557v1}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2510.26557.svg)](https://codeofpaper.com/paper/2510.26557)

Discussion