演化蒙特卡罗树搜索上置信度对单峰、多峰和欺骗性景观树木选择策略的影响分析

IF 8.1 1区 计算机科学 0 COMPUTER SCIENCE, INFORMATION SYSTEMS
Edgar Galván , Fred Valdez Ameneyro
{"title":"演化蒙特卡罗树搜索上置信度对单峰、多峰和欺骗性景观树木选择策略的影响分析","authors":"Edgar Galván ,&nbsp;Fred Valdez Ameneyro","doi":"10.1016/j.ins.2025.122226","DOIUrl":null,"url":null,"abstract":"<div><div>Monte Carlo Tree Search (MCTS) is a best-first sampling/planning method used to find optimal decisions. The effectiveness of MCTS depends on the construction of its statistical tree, with the selection policy playing a crucial role. A particularly effective selection policy in MCTS is the Upper Confidence Bounds for Trees (UCT). While MCTS/UCT generally performs well, there may be variants that outperform it, leading to efforts to evolve selection policies for use in MCTS. However, these efforts have often been limited in their ability to demonstrate when these evolved policies might be beneficial. They frequently rely on single, poorly understood problems or on new methods that are not fully comprehended. To address these limitations, we use three evolutionary-inspired methods: Evolutionary Algorithm (EA)-MCTS, Semantically-inspired EA (SIEA)-MCTS as well as Self-adaptive (SA)-MCTS, which evolve online selection policies to be used in place of UCT. We compare these three methods against five variants of the standard MCTS on ten test functions of varying complexity and nature, including unimodal, multimodal, and deceptive features. By using well-defined metrics, we demonstrate how the evolution of MCTS/UCT can yield benefits in multimodal and deceptive scenarios, while MCTS/UCT remains robust across all functions used in this work.</div></div>","PeriodicalId":51063,"journal":{"name":"Information Sciences","volume":"715 ","pages":"Article 122226"},"PeriodicalIF":8.1000,"publicationDate":"2025-04-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"An analysis on the effects of evolving the Monte Carlo tree search upper confidence for trees selection policy on unimodal, multimodal and deceptive landscapes\",\"authors\":\"Edgar Galván ,&nbsp;Fred Valdez Ameneyro\",\"doi\":\"10.1016/j.ins.2025.122226\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div><div>Monte Carlo Tree Search (MCTS) is a best-first sampling/planning method used to find optimal decisions. The effectiveness of MCTS depends on the construction of its statistical tree, with the selection policy playing a crucial role. A particularly effective selection policy in MCTS is the Upper Confidence Bounds for Trees (UCT). While MCTS/UCT generally performs well, there may be variants that outperform it, leading to efforts to evolve selection policies for use in MCTS. However, these efforts have often been limited in their ability to demonstrate when these evolved policies might be beneficial. They frequently rely on single, poorly understood problems or on new methods that are not fully comprehended. To address these limitations, we use three evolutionary-inspired methods: Evolutionary Algorithm (EA)-MCTS, Semantically-inspired EA (SIEA)-MCTS as well as Self-adaptive (SA)-MCTS, which evolve online selection policies to be used in place of UCT. We compare these three methods against five variants of the standard MCTS on ten test functions of varying complexity and nature, including unimodal, multimodal, and deceptive features. By using well-defined metrics, we demonstrate how the evolution of MCTS/UCT can yield benefits in multimodal and deceptive scenarios, while MCTS/UCT remains robust across all functions used in this work.</div></div>\",\"PeriodicalId\":51063,\"journal\":{\"name\":\"Information Sciences\",\"volume\":\"715 \",\"pages\":\"Article 122226\"},\"PeriodicalIF\":8.1000,\"publicationDate\":\"2025-04-23\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Information Sciences\",\"FirstCategoryId\":\"94\",\"ListUrlMain\":\"https://www.sciencedirect.com/science/article/pii/S0020025525003585\",\"RegionNum\":1,\"RegionCategory\":\"计算机科学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"0\",\"JCRName\":\"COMPUTER SCIENCE, INFORMATION SYSTEMS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Information Sciences","FirstCategoryId":"94","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0020025525003585","RegionNum":1,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"0","JCRName":"COMPUTER SCIENCE, INFORMATION SYSTEMS","Score":null,"Total":0}
引用次数: 0

摘要

蒙特卡罗树搜索(MCTS)是一种用于寻找最优决策的最佳优先抽样/规划方法。MCTS的有效性取决于其统计树的构建,其中选择策略起着至关重要的作用。MCTS中一个特别有效的选择策略是树的上置信限(UCT)。虽然MCTS/UCT通常表现良好,但可能存在优于它的变体,因此需要努力发展用于MCTS的选择策略。然而,这些努力往往在证明这些逐渐形成的政策何时可能有益的能力方面受到限制。它们经常依赖于单一的、理解不透彻的问题,或者依赖于尚未完全理解的新方法。为了解决这些限制,我们使用了三种受进化启发的方法:进化算法(EA)-MCTS,语义启发的EA (SIEA)-MCTS以及自适应(SA)-MCTS,它们进化了在线选择策略以取代UCT。我们将这三种方法与标准MCTS的五种变体进行比较,并对10种不同复杂性和性质的测试函数进行比较,包括单模态、多模态和欺骗特征。通过使用定义良好的指标,我们展示了MCTS/UCT的发展如何在多模态和欺骗场景中产生好处,同时MCTS/UCT在本工作中使用的所有功能中保持稳健。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
An analysis on the effects of evolving the Monte Carlo tree search upper confidence for trees selection policy on unimodal, multimodal and deceptive landscapes
Monte Carlo Tree Search (MCTS) is a best-first sampling/planning method used to find optimal decisions. The effectiveness of MCTS depends on the construction of its statistical tree, with the selection policy playing a crucial role. A particularly effective selection policy in MCTS is the Upper Confidence Bounds for Trees (UCT). While MCTS/UCT generally performs well, there may be variants that outperform it, leading to efforts to evolve selection policies for use in MCTS. However, these efforts have often been limited in their ability to demonstrate when these evolved policies might be beneficial. They frequently rely on single, poorly understood problems or on new methods that are not fully comprehended. To address these limitations, we use three evolutionary-inspired methods: Evolutionary Algorithm (EA)-MCTS, Semantically-inspired EA (SIEA)-MCTS as well as Self-adaptive (SA)-MCTS, which evolve online selection policies to be used in place of UCT. We compare these three methods against five variants of the standard MCTS on ten test functions of varying complexity and nature, including unimodal, multimodal, and deceptive features. By using well-defined metrics, we demonstrate how the evolution of MCTS/UCT can yield benefits in multimodal and deceptive scenarios, while MCTS/UCT remains robust across all functions used in this work.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
Information Sciences
Information Sciences 工程技术-计算机:信息系统
CiteScore
14.00
自引率
17.30%
发文量
1322
审稿时长
10.4 months
期刊介绍: Informatics and Computer Science Intelligent Systems Applications is an esteemed international journal that focuses on publishing original and creative research findings in the field of information sciences. We also feature a limited number of timely tutorial and surveying contributions. Our journal aims to cater to a diverse audience, including researchers, developers, managers, strategic planners, graduate students, and anyone interested in staying up-to-date with cutting-edge research in information science, knowledge engineering, and intelligent systems. While readers are expected to share a common interest in information science, they come from varying backgrounds such as engineering, mathematics, statistics, physics, computer science, cell biology, molecular biology, management science, cognitive science, neurobiology, behavioral sciences, and biochemistry.
×
引用
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学术官方微信