TinyMo: Graph-Level Memory Optimizer for Tiny Machine Learning

Effective memory optimization is essential for tiny machine learning because tiny embedded systems generally have limited memory for model execution. Previous research has proposed various model compression methods to reduce the memory usage of machine learning models. However, the methods often entail accuracy loss resulting from altering model weights. This letter proposes a graph-level memory optimizer for tiny embedded systems, TinyMo, which optimizes the memory usage of an input model by changing the structure of the model graph. TinyMo mainly uses two optimization methods: 1) tensor spilling and 2) tensor splitting, to reduce unnecessary memory usage from long skip connections and large separable convolutions. In the evaluation, this letter shows that the proposed optimizer can successfully reduce the peak memory usage of various neural network models for commercial embedded systems with little runtime overhead.

Authors

Institutions

Publication Details

Journal
IEEE Embedded Systems Letters
Published
2024-10-24
DOI
https://doi.org/10.1109/les.2024.3485630
Citations
2
Primary Topic
Graph Theory and Algorithms
Type
article
Field-Weighted Citation Impact
0.50
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

TinyMo: Graph-Level Memory Optimizer for Tiny Machine Learning

Seonyeong Heo, Byungchul Chae
2 citations
IEEE Embedded Systems Letters
Graph Theory and Algorithms
0.50
article

TinyMo: Graph-Level Memory Optimizer for Tiny Machine Learning

Seonyeong Heo, Byungchul Chae
article en
2 citations

Abstract

Effective memory optimization is essential for tiny machine learning because tiny embedded systems generally have limited memory for model execution. Previous research has proposed various model compression methods to reduce the memory usage of machine learning models. However, the methods often entail accuracy loss resulting from altering model weights. This letter proposes a graph-level memory optimizer for tiny embedded systems, TinyMo, which optimizes the memory usage of an input model by changing the structure of the model graph. TinyMo mainly uses two optimization methods: 1) tensor spilling and 2) tensor splitting, to reduce unnecessary memory usage from long skip connections and large separable convolutions. In the evaluation, this letter shows that the proposed optimizer can successfully reduce the peak memory usage of various neural network models for commercial embedded systems with little runtime overhead.

IEEE Embedded Systems LettersVol. 17(3)
Kyung Hee University (KR)
Openalex Percentile: Top 34%
Graph Theory and Algorithms
0.50
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.