激活连接以加速循环反向传播中的学习

R. Kamimura
{"title":"激活连接以加速循环反向传播中的学习","authors":"R. Kamimura","doi":"10.1109/CMPEUR.1992.218512","DOIUrl":null,"url":null,"abstract":"A method of accelerating learning in recurrent neural networks is described. To activate and use connections, a complexity term defined by an equation was added to a standard quadratic error function. In experiments, a method was used in which a derivative of the complexity term was normally effective for positive connections, while negative connections were pushed toward smaller values. Thus, some connections were expected to be activated and were large enough to speed up learning. It was confirmed that the complexity term was effective in increasing the variance of the connections, especially the hidden connections. It was also confirmed that eventually some connections, especially some hidden connections, were activated and were large enough to be used in speeding up learning.<<ETX>>","PeriodicalId":390273,"journal":{"name":"CompEuro 1992 Proceedings Computer Systems and Software Engineering","volume":"34 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1992-05-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Activation of connections to accelerate the learning in recurrent back-propagation\",\"authors\":\"R. Kamimura\",\"doi\":\"10.1109/CMPEUR.1992.218512\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"A method of accelerating learning in recurrent neural networks is described. To activate and use connections, a complexity term defined by an equation was added to a standard quadratic error function. In experiments, a method was used in which a derivative of the complexity term was normally effective for positive connections, while negative connections were pushed toward smaller values. Thus, some connections were expected to be activated and were large enough to speed up learning. It was confirmed that the complexity term was effective in increasing the variance of the connections, especially the hidden connections. It was also confirmed that eventually some connections, especially some hidden connections, were activated and were large enough to be used in speeding up learning.<<ETX>>\",\"PeriodicalId\":390273,\"journal\":{\"name\":\"CompEuro 1992 Proceedings Computer Systems and Software Engineering\",\"volume\":\"34 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1992-05-04\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"CompEuro 1992 Proceedings Computer Systems and Software Engineering\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/CMPEUR.1992.218512\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"CompEuro 1992 Proceedings Computer Systems and Software Engineering","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CMPEUR.1992.218512","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

介绍了一种加速递归神经网络学习的方法。为了激活和使用连接,将一个由方程定义的复杂度项添加到标准二次误差函数中。在实验中,使用了一种方法,其中复杂性项的导数通常对正连接有效,而负连接被推向较小的值。因此,一些连接被激活,并且足够大以加速学习。结果表明,复杂度项可以有效地增加连接的方差,特别是隐藏连接的方差。研究还证实,最终一些连接,特别是一些隐藏的连接被激活,并且足够大,可以用来加速学习。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
Activation of connections to accelerate the learning in recurrent back-propagation
A method of accelerating learning in recurrent neural networks is described. To activate and use connections, a complexity term defined by an equation was added to a standard quadratic error function. In experiments, a method was used in which a derivative of the complexity term was normally effective for positive connections, while negative connections were pushed toward smaller values. Thus, some connections were expected to be activated and were large enough to speed up learning. It was confirmed that the complexity term was effective in increasing the variance of the connections, especially the hidden connections. It was also confirmed that eventually some connections, especially some hidden connections, were activated and were large enough to be used in speeding up learning.<>
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Neural clustering algorithms for classification and pre-placement of VLSI cells General-to-specific learning of Horn clauses from positive examples Minimization of NAND circuits by rewriting-rules heuristic A generalized stochastic Petri net model of Multibus II Activation of connections to accelerate the learning in recurrent back-propagation
×
引用
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