KalmanHD: Robust On-Device Time Series Forecasting with Hyperdimensional Computing

Ivannia Gomez Moreno, Xiaofan Yu, Tajana Rosing
{"title":"KalmanHD: Robust On-Device Time Series Forecasting with Hyperdimensional Computing","authors":"Ivannia Gomez Moreno, Xiaofan Yu, Tajana Rosing","doi":"10.1109/ASP-DAC58780.2024.10473878","DOIUrl":null,"url":null,"abstract":"Time series forecasting is shifting towards Edge AI, where models are trained and executed on edge devices instead of in the cloud. However, training forecasting models at the edge faces two challenges concurrently: (1) dealing with streaming data containing abundant noise, which can lead to degradation in model predictions, and (2) coping with limited on-device resources. Traditional approaches focus on simple statistical methods like ARIMA or neural networks, which are either not robust to sensor noise or not efficient for edge deployment, or both. In this paper, we propose a novel, robust, and lightweight method named KalmanHD for on-device time series forecasting using Hyperdimensional Computing (HDC). KalmanHD integrates Kalman Filter (KF) with HDC, resulting in a new regression method that combines the robustness of KF towards sensor noise and the efficiency of HDC. KalmanHD first encodes the past values into a high-dimensional vector representation, then applies the Expectation-Maximization (EM) approach as in KF to iteratively update the model based on the incoming samples. KalmanHD inherently considers the variability of each sample and thereby enhances robustness. We further accelerate KalmanHD by substituting the expensive matrix multiplication with efficient binary operations between the covariance and the encoded values. Our results show that KalmanHD achieves MAE comparable to the state-of-the-art noise-optimized NN-based methods while running $3.6-8.6\\times$ faster on typical edge platforms. The source code is available at https://github.com/DarthIV02/Ka1manHD","PeriodicalId":518586,"journal":{"name":"2024 29th Asia and South Pacific Design Automation Conference (ASP-DAC)","volume":"225 2","pages":"710-715"},"PeriodicalIF":0.0000,"publicationDate":"2024-01-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2024 29th Asia and South Pacific Design Automation Conference (ASP-DAC)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ASP-DAC58780.2024.10473878","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

Time series forecasting is shifting towards Edge AI, where models are trained and executed on edge devices instead of in the cloud. However, training forecasting models at the edge faces two challenges concurrently: (1) dealing with streaming data containing abundant noise, which can lead to degradation in model predictions, and (2) coping with limited on-device resources. Traditional approaches focus on simple statistical methods like ARIMA or neural networks, which are either not robust to sensor noise or not efficient for edge deployment, or both. In this paper, we propose a novel, robust, and lightweight method named KalmanHD for on-device time series forecasting using Hyperdimensional Computing (HDC). KalmanHD integrates Kalman Filter (KF) with HDC, resulting in a new regression method that combines the robustness of KF towards sensor noise and the efficiency of HDC. KalmanHD first encodes the past values into a high-dimensional vector representation, then applies the Expectation-Maximization (EM) approach as in KF to iteratively update the model based on the incoming samples. KalmanHD inherently considers the variability of each sample and thereby enhances robustness. We further accelerate KalmanHD by substituting the expensive matrix multiplication with efficient binary operations between the covariance and the encoded values. Our results show that KalmanHD achieves MAE comparable to the state-of-the-art noise-optimized NN-based methods while running $3.6-8.6\times$ faster on typical edge platforms. The source code is available at https://github.com/DarthIV02/Ka1manHD
KalmanHD:利用超维计算进行稳健的设备上时间序列预测
时间序列预测正在向边缘人工智能(Edge AI)转变,在边缘设备上而不是在云端训练和执行模型。然而,在边缘设备上训练预测模型同时面临两个挑战:(1) 处理包含大量噪声的流数据,这会导致模型预测效果下降;(2) 应对有限的设备资源。传统方法侧重于 ARIMA 或神经网络等简单的统计方法,这些方法要么对传感器噪声不具有鲁棒性,要么对边缘部署不高效,或者两者兼而有之。在本文中,我们提出了一种新颖、稳健、轻量级的方法,名为 KalmanHD,用于使用超维计算(HDC)进行设备上时间序列预测。KalmanHD 将卡尔曼滤波(KF)与超维计算(HDC)整合在一起,形成了一种新的回归方法,该方法结合了 KF 对传感器噪声的鲁棒性和超维计算的高效性。KalmanHD 首先将过去的值编码为高维向量表示,然后应用 KF 中的期望最大化(EM)方法,根据输入样本迭代更新模型。KalmanHD 本身考虑了每个样本的可变性,从而增强了鲁棒性。我们用协方差和编码值之间的高效二进制运算取代了昂贵的矩阵乘法,从而进一步加快了 KalmanHD 的速度。我们的研究结果表明,KalmanHD 的 MAE 可与最先进的基于噪声优化 NN 方法相媲美,同时在典型边缘平台上的运行速度可提高 3.6-8.6 倍。源代码见 https://github.com/DarthIV02/Ka1manHD
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信