An Efficient Neural Network Training Algorithm with Maximized Gradient Function and Modulated Chaos

Mobarakol Islam, Arifur Rahaman, M. K. Hasan, M. Shahjahan
{"title":"An Efficient Neural Network Training Algorithm with Maximized Gradient Function and Modulated Chaos","authors":"Mobarakol Islam, Arifur Rahaman, M. K. Hasan, M. Shahjahan","doi":"10.1109/ISCID.2011.18","DOIUrl":null,"url":null,"abstract":"Biological brain involves chaos and the structure of artificial neural networks (ANNs) is similar to human brain. In order to imitate the structure and the function of human brain better, it is more logical to combine chaos with neural networks. In this paper we proposed a chaotic learning algorithm called Maximized Gradient function and Modulated Chaos (MGMC). MGMC maximizes the gradient function and also added a modulated version of chaos in learning rate (LR) as well as in activation function. Activation function made adaptive by using chaos as gain factor. MGMC generates a chaotic time series as modulated form of Mackey Glass, Logistic Map and Lorenz Attractor. A rescaled version of this series is used as learning rate (LR) called Modulated Learning Rate (MLR) during NN training. As a result neural network becomes biologically plausible and may get escaped from local minima zone and faster convergence rate is obtained as maximizing the derivative of activation function together with minimizing the error function. MGMC is extensively tested on three real world benchmark classification problems such as australian credit card, wine and soybean identification. The proposed MGMC outperforms the existing BP and BPfast in terms of generalization ability and also convergence rate.","PeriodicalId":224504,"journal":{"name":"2011 Fourth International Symposium on Computational Intelligence and Design","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2011-10-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2011 Fourth International Symposium on Computational Intelligence and Design","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISCID.2011.18","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2

Abstract

Biological brain involves chaos and the structure of artificial neural networks (ANNs) is similar to human brain. In order to imitate the structure and the function of human brain better, it is more logical to combine chaos with neural networks. In this paper we proposed a chaotic learning algorithm called Maximized Gradient function and Modulated Chaos (MGMC). MGMC maximizes the gradient function and also added a modulated version of chaos in learning rate (LR) as well as in activation function. Activation function made adaptive by using chaos as gain factor. MGMC generates a chaotic time series as modulated form of Mackey Glass, Logistic Map and Lorenz Attractor. A rescaled version of this series is used as learning rate (LR) called Modulated Learning Rate (MLR) during NN training. As a result neural network becomes biologically plausible and may get escaped from local minima zone and faster convergence rate is obtained as maximizing the derivative of activation function together with minimizing the error function. MGMC is extensively tested on three real world benchmark classification problems such as australian credit card, wine and soybean identification. The proposed MGMC outperforms the existing BP and BPfast in terms of generalization ability and also convergence rate.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
基于最大梯度函数和调制混沌的高效神经网络训练算法
生物大脑涉及混沌,人工神经网络(ann)的结构与人脑相似。为了更好地模仿人脑的结构和功能,将混沌与神经网络相结合更符合逻辑。本文提出了一种称为最大梯度函数和调制混沌(MGMC)的混沌学习算法。MGMC最大化了梯度函数,并在学习率(LR)和激活函数中加入了混沌的调制版本。利用混沌作为增益因子使激活函数自适应。MGMC以麦基玻璃、Logistic映射和洛伦兹吸引子的调制形式产生混沌时间序列。在神经网络训练过程中,这个系列的一个重新缩放版本被用作学习率(LR),称为调制学习率(MLR)。通过最大化激活函数的导数和最小化误差函数,使神经网络具有生物似然性,可以脱离局部极小区,从而获得更快的收敛速度。MGMC在澳大利亚信用卡、葡萄酒和大豆识别等三个现实世界的基准分类问题上进行了广泛的测试。本文提出的MGMC算法在泛化能力和收敛速度上都优于现有的BP算法和BP算法。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
The Public Electromagnetic Radiation Environment Comparison between China and Germany A Linear Camera Self-calibration Approach from Four Points Applications of Bayesian Network in Fault Diagnosis of Braking Deviation System Agent-Based Modelling and Simulation System for Mass Violence Event Intuitionistic Fuzzy Sets with Single Parameter and its Application to Pattern Recognition
×
引用
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