TinyML设备上用压缩数据集实现低耗增量学习,防止遗忘且节省内存。
A Continual and Incremental Learning Approach for TinyML On-device Training Using Dataset Distillation and Model Size Adaption
- 用知识蒸馏生成小规模压缩数据集,缓解模型遗忘问题。
- 仅用43%算力,准确率损失仅1%,兼顾效率与性能。
- 模型大小可动态调整,适合资源受限的嵌入式设备。
针对资源受限的嵌入式设备(如微控制器)中的微型机器学习(TinyML)场景,提出一种新型增量学习算法。该方法通过知识蒸馏生成小型化、高信息密度的压缩数据集,有效缓解灾难性遗忘问题。其核心创新在于支持模型规模的动态自适应调整,使模型复杂度可根据任务需求灵活变化。实验在CIFAR10、MNIST、CORE50、HAR、Speech Commands五个数据集上验证,结果表明:相比固定大模型,本方法仅需43%的浮点运算量(FLOPs),准确率下降仅为1%,同时内存消耗仅为原始数据集的1%。该方法显著提升了资源受限环境下的计算效率与存储效率,为边缘设备上的持续学习提供了可行方案。
原文摘要 · Abstract (English)
A new algorithm for incremental learning in the context of Tiny Machine learning (TinyML) is presented, which is optimized for low-performance and energy efficient embedded devices. TinyML is an emerging field that deploys machine learning models on resource-constrained devices such as microcontrollers, enabling intelligent applications like voice recognition, anomaly detection, predictive maintenance, and sensor data processing in environments where traditional machine learning models are not feasible. The algorithm solve the challenge of catastrophic forgetting through the use of knowledge distillation to create a small, distilled dataset. The novelty of the method is that the size of the model can be adjusted dynamically, so that the complexity of the model can be adapted to the requirements of the task. This offers a solution for incremental learning in resource-constrained environments, where both model size and computational efficiency are critical factors. Results show that the proposed algorithm offers a promising approach for TinyML incremental learning on embedded devices. The algorithm was tested on five datasets including: CIFAR10, MNIST, CORE50, HAR, Speech Commands. The findings indicated that, despite using only 43% of Floating Point Operations (FLOPs) compared to a larger fixed model, the algorithm experienced a negligible accuracy loss of just 1%. In addition, the presented method is memory efficient. While state-of-the-art incremental learning is usually very memory intensive, the method requires only 1% of the original data set.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。