On the Instance Hardness as a Decision Criterion in TinyML Systems
Not on the map. Why?
Abstract (arXiv)
TinyML includes the implementation of machine learning on devices with limited memory and computing resources. With the development of technology, AI systems continue to scale in terms of size and computational requirements. This forces researchers to adapt methods to be environmentally sustainable by designing techniques for reducing computational costs and energy consumption in inferring AI models, even in small devices. In this work, we present preliminary findings on a novel application of the tree depth prune instance hardness method to the TinyML system. The results indicate that threshold control can change energy consumption with limited classification quality changes. This method allows us to adjust classification accuracy, thereby influencing computational complexity and energy consumption for inference. We present a work in progress with initial results as a proof of concept.
Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 5 of its 17 references that are in the map. First posted on arXiv 30 Aug 2026.
Builds on
5 of 17 references.
References · 5
- 2023A Machine Learning-oriented Survey on Tiny Machine Learningcited by 27
- 2018DESlib: A Dynamic ensemble selection library in Pythoncited by 18
- 2022Machine Learning Sensorscited by 5
- 2018Dynamic Ensemble Selection VS K-NN: why and when Dynamic Selection obtains higher classification performance?cited by 4
- 2025On The Dynamic Ensemble Selection for TinyML-based Systems -- a Preliminary Studycited by 1
Built on by
Not cited yet.