Forgetting factor multi-error stochastic gradient algorithm based on minimum error entropy

Shaoxue Jing
{"title":"Forgetting factor multi-error stochastic gradient algorithm based on minimum error entropy","authors":"Shaoxue Jing","doi":"10.1109/IAI50351.2020.9262232","DOIUrl":null,"url":null,"abstract":"Entropy has been widely applied in system identification in the last decade. In this paper, a novel stochastic gradient algorithm based on minimum entropy is proposed. Though needing less computation than the mean squares error algorithm, traditional stochastic gradient algorithm converges quite slowly. To fasten the algorithm, a multi-error method and a forgetting factor are integrated into the algorithm. Firstly, the scalar error is replaced by a vector error with different error length. Secondly, a forgetting factor is adopted to calculate the step size. The proposed algorithm is utilized to estimate the parameters of a finite impulse response model. Estimation results indicate that the proposed algorithm can obtain more accurate estimates than traditional gradient algorithm and has a faster converge speed.","PeriodicalId":137183,"journal":{"name":"2020 2nd International Conference on Industrial Artificial Intelligence (IAI)","volume":"51 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2020-10-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2020 2nd International Conference on Industrial Artificial Intelligence (IAI)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/IAI50351.2020.9262232","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

Entropy has been widely applied in system identification in the last decade. In this paper, a novel stochastic gradient algorithm based on minimum entropy is proposed. Though needing less computation than the mean squares error algorithm, traditional stochastic gradient algorithm converges quite slowly. To fasten the algorithm, a multi-error method and a forgetting factor are integrated into the algorithm. Firstly, the scalar error is replaced by a vector error with different error length. Secondly, a forgetting factor is adopted to calculate the step size. The proposed algorithm is utilized to estimate the parameters of a finite impulse response model. Estimation results indicate that the proposed algorithm can obtain more accurate estimates than traditional gradient algorithm and has a faster converge speed.
基于最小误差熵的遗忘因子多误差随机梯度算法
近十年来,熵被广泛应用于系统辨识。本文提出了一种基于最小熵的随机梯度算法。传统的随机梯度算法虽然比均方误差算法计算量少,但收敛速度较慢。为了提高算法的可靠性,在算法中引入了多误差法和遗忘因子。首先,用不同误差长度的矢量误差代替标量误差;其次,采用遗忘因子计算步长。该算法用于估计有限脉冲响应模型的参数。估计结果表明,与传统的梯度算法相比,该算法可以获得更精确的估计,并且收敛速度更快。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术文献互助群
群 号:604180095
Book学术官方微信