{"title":"演化蒙特卡罗树搜索上置信度对单峰、多峰和欺骗性景观树木选择策略的影响分析","authors":"Edgar Galván , 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 , 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}
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.
期刊介绍:
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.