A Novel Fast Feedforward Neural Networks Training Algorithm

IF 3.3 3区 计算机科学 Q2 COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE Journal of Artificial Intelligence and Soft Computing Research Pub Date : 2021-10-01 DOI:10.2478/jaiscr-2021-0017
J. Bilski, Bartosz Kowalczyk, A. Marjański, M. Gandor, J. Zurada
{"title":"A Novel Fast Feedforward Neural Networks Training Algorithm","authors":"J. Bilski, Bartosz Kowalczyk, A. Marjański, M. Gandor, J. Zurada","doi":"10.2478/jaiscr-2021-0017","DOIUrl":null,"url":null,"abstract":"Abstract In this paper1 a new neural networks training algorithm is presented. The algorithm originates from the Recursive Least Squares (RLS) method commonly used in adaptive filtering. It uses the QR decomposition in conjunction with the Givens rotations for solving a normal equation - resulting from minimization of the loss function. An important parameter in neural networks is training time. Many commonly used algorithms require a big number of iterations in order to achieve a satisfactory outcome while other algorithms are effective only for small neural networks. The proposed solution is characterized by a very short convergence time compared to the well-known backpropagation method and its variants. The paper contains a complete mathematical derivation of the proposed algorithm. There are presented extensive simulation results using various benchmarks including function approximation, classification, encoder, and parity problems. Obtained results show the advantages of the featured algorithm which outperforms commonly used recent state-of-the-art neural networks training algorithms, including the Adam optimizer and the Nesterov’s accelerated gradient.","PeriodicalId":48494,"journal":{"name":"Journal of Artificial Intelligence and Soft Computing Research","volume":"11 1","pages":"287 - 306"},"PeriodicalIF":3.3000,"publicationDate":"2021-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"4","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Journal of Artificial Intelligence and Soft Computing Research","FirstCategoryId":"94","ListUrlMain":"https://doi.org/10.2478/jaiscr-2021-0017","RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE","Score":null,"Total":0}
引用次数: 4

Abstract

Abstract In this paper1 a new neural networks training algorithm is presented. The algorithm originates from the Recursive Least Squares (RLS) method commonly used in adaptive filtering. It uses the QR decomposition in conjunction with the Givens rotations for solving a normal equation - resulting from minimization of the loss function. An important parameter in neural networks is training time. Many commonly used algorithms require a big number of iterations in order to achieve a satisfactory outcome while other algorithms are effective only for small neural networks. The proposed solution is characterized by a very short convergence time compared to the well-known backpropagation method and its variants. The paper contains a complete mathematical derivation of the proposed algorithm. There are presented extensive simulation results using various benchmarks including function approximation, classification, encoder, and parity problems. Obtained results show the advantages of the featured algorithm which outperforms commonly used recent state-of-the-art neural networks training algorithms, including the Adam optimizer and the Nesterov’s accelerated gradient.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
一种新的快速前馈神经网络训练算法
摘要本文提出了一种新的神经网络训练算法。该算法源于自适应滤波中常用的递归最小二乘法。它使用QR分解和Givens旋转来求解一个正常方程——这是损失函数最小化的结果。神经网络中的一个重要参数是训练时间。许多常用的算法需要大量的迭代才能获得令人满意的结果,而其他算法仅对小型神经网络有效。与众所周知的反向传播方法及其变体相比,所提出的解决方案的特点是收敛时间非常短。本文对所提出的算法进行了完整的数学推导。使用各种基准,包括函数近似、分类、编码器和奇偶校验问题,给出了广泛的模拟结果。获得的结果显示了该特征算法的优势,它优于最近常用的最先进的神经网络训练算法,包括Adam优化器和Nesterov的加速梯度。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
Journal of Artificial Intelligence and Soft Computing Research
Journal of Artificial Intelligence and Soft Computing Research COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE-
CiteScore
7.00
自引率
25.00%
发文量
10
审稿时长
24 weeks
期刊介绍: Journal of Artificial Intelligence and Soft Computing Research (available also at Sciendo (De Gruyter)) is a dynamically developing international journal focused on the latest scientific results and methods constituting traditional artificial intelligence methods and soft computing techniques. Our goal is to bring together scientists representing both approaches and various research communities.
期刊最新文献
Bending Path Understanding Based on Angle Projections in Field Environments Self-Organized Operational Neural Networks for The Detection of Atrial Fibrillation Interpreting Convolutional Layers in DNN Model Based on Time–Frequency Representation of Emotional Speech A Few-Shot Learning Approach for Covid-19 Diagnosis Using Quasi-Configured Topological Spaces Metrics for Assessing Generalization of Deep Reinforcement Learning in Parameterized Environments
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1