PSO中信息不足的动力

Christopher K. Monson, Kevin Seppi
{"title":"PSO中信息不足的动力","authors":"Christopher K. Monson, Kevin Seppi","doi":"10.1145/2598394.2598490","DOIUrl":null,"url":null,"abstract":"Particle Swarm Optimization is fundamentally a stochastic algorithm, where each particle takes into account noisy information from its own history as well as that of its neighborhood. Though basic information-theoretic principles would suggest that less noise indicates greater certainty, the momentum term is simultaneously the least directly-informed and the most deterministically applied. This dichotomy suggests that the typically confident treatment of momentum is misplaced, and that swarm performance can benefit from better-motivated processes that obviate momentum entirely.","PeriodicalId":298232,"journal":{"name":"Proceedings of the Companion Publication of the 2014 Annual Conference on Genetic and Evolutionary Computation","volume":"27 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2014-07-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Under-informed momentum in PSO\",\"authors\":\"Christopher K. Monson, Kevin Seppi\",\"doi\":\"10.1145/2598394.2598490\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Particle Swarm Optimization is fundamentally a stochastic algorithm, where each particle takes into account noisy information from its own history as well as that of its neighborhood. Though basic information-theoretic principles would suggest that less noise indicates greater certainty, the momentum term is simultaneously the least directly-informed and the most deterministically applied. This dichotomy suggests that the typically confident treatment of momentum is misplaced, and that swarm performance can benefit from better-motivated processes that obviate momentum entirely.\",\"PeriodicalId\":298232,\"journal\":{\"name\":\"Proceedings of the Companion Publication of the 2014 Annual Conference on Genetic and Evolutionary Computation\",\"volume\":\"27 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2014-07-12\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings of the Companion Publication of the 2014 Annual Conference on Genetic and Evolutionary Computation\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1145/2598394.2598490\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of the Companion Publication of the 2014 Annual Conference on Genetic and Evolutionary Computation","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/2598394.2598490","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

粒子群优化基本上是一种随机算法,其中每个粒子都考虑到其自身历史及其邻近区域的噪声信息。虽然基本的信息论原理表明,噪声越少意味着确定性越大,但动量项同时是最不直接的信息,也是最确定的应用。这种二分法表明,通常对动量的自信处理是错误的,群体绩效可以从完全消除动量的更好的激励过程中受益。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Under-informed momentum in PSO
Particle Swarm Optimization is fundamentally a stochastic algorithm, where each particle takes into account noisy information from its own history as well as that of its neighborhood. Though basic information-theoretic principles would suggest that less noise indicates greater certainty, the momentum term is simultaneously the least directly-informed and the most deterministically applied. This dichotomy suggests that the typically confident treatment of momentum is misplaced, and that swarm performance can benefit from better-motivated processes that obviate momentum entirely.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术文献互助群
群 号:481959085
Book学术官方微信