{"title":"四元数值神经网络的Levenberg-Marquardt学习算法","authors":"Călin-Adrian Popa","doi":"10.1109/SYNASC.2016.050","DOIUrl":null,"url":null,"abstract":"In this paper, we present the deduction of the Levenberg-Marquardt algorithm for training quaternion-valued feedforward neural networks, using the framework of the HR calculus. Its performances in the real-and complex-valued cases lead to the idea of extending it to the quaternion domain, also. The proposed method is exemplified on time series prediction applications, showing a significant improvement over the quaternion gradient descent algorithm.","PeriodicalId":268635,"journal":{"name":"2016 18th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC)","volume":"75 2-3","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2016-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"Levenberg-Marquardt Learning Algorithm for Quaternion-Valued Neural Networks\",\"authors\":\"Călin-Adrian Popa\",\"doi\":\"10.1109/SYNASC.2016.050\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this paper, we present the deduction of the Levenberg-Marquardt algorithm for training quaternion-valued feedforward neural networks, using the framework of the HR calculus. Its performances in the real-and complex-valued cases lead to the idea of extending it to the quaternion domain, also. The proposed method is exemplified on time series prediction applications, showing a significant improvement over the quaternion gradient descent algorithm.\",\"PeriodicalId\":268635,\"journal\":{\"name\":\"2016 18th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC)\",\"volume\":\"75 2-3\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2016-09-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2016 18th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/SYNASC.2016.050\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2016 18th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/SYNASC.2016.050","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Levenberg-Marquardt Learning Algorithm for Quaternion-Valued Neural Networks
In this paper, we present the deduction of the Levenberg-Marquardt algorithm for training quaternion-valued feedforward neural networks, using the framework of the HR calculus. Its performances in the real-and complex-valued cases lead to the idea of extending it to the quaternion domain, also. The proposed method is exemplified on time series prediction applications, showing a significant improvement over the quaternion gradient descent algorithm.