一种增强可扩展性的模式学习框架。

IF 8.9 1区 计算机科学 Q1 COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE
Jian Qin,Yuanqiu Mo,Hongzhe Liu,Zhi-Hui Zhan,Wenwu Yu
{"title":"一种增强可扩展性的模式学习框架。","authors":"Jian Qin,Yuanqiu Mo,Hongzhe Liu,Zhi-Hui Zhan,Wenwu Yu","doi":"10.1109/tnnls.2025.3610993","DOIUrl":null,"url":null,"abstract":"Multiobjective optimization problems (MOPs) arise in numerous real-world scenarios, yet finding their solutions with optimal trade-offs can be a formidable challenge. This article studies the continuous optimization problem involving large-scale variables, many objectives, and intricate constraints, which is rarely comprehensively discussed in existing works, due to the coexisting difficulties posed by the curse of dimensionality, selection pressure, and feasibility restrictions. To address these problems, this work pioneers a novel optimization framework, optimization pattern learning, embedded with machine learning (ML) techniques. Within this framework, the concept of measurable order and its corresponding learning mechanism are proposed to extract valuable knowledge from solutions. This measurable order is a general form of those orders used explicitly or implicitly in the existing studies, providing a more flexible means to evaluate solutions for efficient optimization adaptively. By substituting original solutions with their measurable orders, this framework effectively avoids the selection pressure from many objectives and the feasibility restrictions from intricate constraints. Furthermore, two novel ML models based on measurable orders are developed to progressively learn effective optimization patterns from iterative data in high-dimensional search spaces. Leveraging these learned patterns, this framework successfully addresses the curse of dimensionality from large-scale variables and thus achieves efficient optimization. Owing to the strong adaptability and search capabilities of this framework, it also demonstrates excellent scalability as the number of variables, objectives, and constraints increases. Extensive simulations validate the effectiveness of the framework and underscore its competitiveness relative to state-of-the-art algorithms in this field.","PeriodicalId":13303,"journal":{"name":"IEEE transactions on neural networks and learning systems","volume":"58 1","pages":""},"PeriodicalIF":8.9000,"publicationDate":"2025-10-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"A Novel Pattern Learning Framework With Enhanced Scalability for Continuous Optimization.\",\"authors\":\"Jian Qin,Yuanqiu Mo,Hongzhe Liu,Zhi-Hui Zhan,Wenwu Yu\",\"doi\":\"10.1109/tnnls.2025.3610993\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Multiobjective optimization problems (MOPs) arise in numerous real-world scenarios, yet finding their solutions with optimal trade-offs can be a formidable challenge. This article studies the continuous optimization problem involving large-scale variables, many objectives, and intricate constraints, which is rarely comprehensively discussed in existing works, due to the coexisting difficulties posed by the curse of dimensionality, selection pressure, and feasibility restrictions. To address these problems, this work pioneers a novel optimization framework, optimization pattern learning, embedded with machine learning (ML) techniques. Within this framework, the concept of measurable order and its corresponding learning mechanism are proposed to extract valuable knowledge from solutions. This measurable order is a general form of those orders used explicitly or implicitly in the existing studies, providing a more flexible means to evaluate solutions for efficient optimization adaptively. By substituting original solutions with their measurable orders, this framework effectively avoids the selection pressure from many objectives and the feasibility restrictions from intricate constraints. Furthermore, two novel ML models based on measurable orders are developed to progressively learn effective optimization patterns from iterative data in high-dimensional search spaces. Leveraging these learned patterns, this framework successfully addresses the curse of dimensionality from large-scale variables and thus achieves efficient optimization. Owing to the strong adaptability and search capabilities of this framework, it also demonstrates excellent scalability as the number of variables, objectives, and constraints increases. Extensive simulations validate the effectiveness of the framework and underscore its competitiveness relative to state-of-the-art algorithms in this field.\",\"PeriodicalId\":13303,\"journal\":{\"name\":\"IEEE transactions on neural networks and learning systems\",\"volume\":\"58 1\",\"pages\":\"\"},\"PeriodicalIF\":8.9000,\"publicationDate\":\"2025-10-07\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"IEEE transactions on neural networks and learning systems\",\"FirstCategoryId\":\"94\",\"ListUrlMain\":\"https://doi.org/10.1109/tnnls.2025.3610993\",\"RegionNum\":1,\"RegionCategory\":\"计算机科学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q1\",\"JCRName\":\"COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"IEEE transactions on neural networks and learning systems","FirstCategoryId":"94","ListUrlMain":"https://doi.org/10.1109/tnnls.2025.3610993","RegionNum":1,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE","Score":null,"Total":0}
引用次数: 0

摘要

多目标优化问题(MOPs)出现在许多现实场景中,然而找到具有最佳权衡的解决方案可能是一项艰巨的挑战。本文研究的是变量大、目标多、约束复杂的连续优化问题,由于维数诅咒、选择压力、可行性限制等困难并存,在现有文献中很少有全面的讨论。为了解决这些问题,这项工作开创了一个新的优化框架,优化模式学习,嵌入了机器学习(ML)技术。在此框架下,提出了可度量顺序的概念及其相应的学习机制,从解决方案中提取有价值的知识。这种可测量的顺序是现有研究中显式或隐式使用的顺序的一般形式,提供了一种更灵活的方法来评估有效优化的解决方案。该框架通过将原解替换为可测量阶数,有效地避免了多目标的选择压力和复杂约束的可行性限制。此外,开发了两种基于可测量阶数的机器学习模型,从高维搜索空间的迭代数据中逐步学习有效的优化模式。利用这些学习到的模式,该框架成功地解决了大规模变量的维度诅咒,从而实现了有效的优化。由于该框架具有较强的适应性和搜索能力,随着变量、目标和约束数量的增加,它也表现出良好的可扩展性。广泛的仿真验证了该框架的有效性,并强调了其相对于该领域最先进算法的竞争力。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
A Novel Pattern Learning Framework With Enhanced Scalability for Continuous Optimization.
Multiobjective optimization problems (MOPs) arise in numerous real-world scenarios, yet finding their solutions with optimal trade-offs can be a formidable challenge. This article studies the continuous optimization problem involving large-scale variables, many objectives, and intricate constraints, which is rarely comprehensively discussed in existing works, due to the coexisting difficulties posed by the curse of dimensionality, selection pressure, and feasibility restrictions. To address these problems, this work pioneers a novel optimization framework, optimization pattern learning, embedded with machine learning (ML) techniques. Within this framework, the concept of measurable order and its corresponding learning mechanism are proposed to extract valuable knowledge from solutions. This measurable order is a general form of those orders used explicitly or implicitly in the existing studies, providing a more flexible means to evaluate solutions for efficient optimization adaptively. By substituting original solutions with their measurable orders, this framework effectively avoids the selection pressure from many objectives and the feasibility restrictions from intricate constraints. Furthermore, two novel ML models based on measurable orders are developed to progressively learn effective optimization patterns from iterative data in high-dimensional search spaces. Leveraging these learned patterns, this framework successfully addresses the curse of dimensionality from large-scale variables and thus achieves efficient optimization. Owing to the strong adaptability and search capabilities of this framework, it also demonstrates excellent scalability as the number of variables, objectives, and constraints increases. Extensive simulations validate the effectiveness of the framework and underscore its competitiveness relative to state-of-the-art algorithms in this field.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
IEEE transactions on neural networks and learning systems
IEEE transactions on neural networks and learning systems COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE-COMPUTER SCIENCE, HARDWARE & ARCHITECTURE
CiteScore
23.80
自引率
9.60%
发文量
2102
审稿时长
3-8 weeks
期刊介绍: The focus of IEEE Transactions on Neural Networks and Learning Systems is to present scholarly articles discussing the theory, design, and applications of neural networks as well as other learning systems. The journal primarily highlights technical and scientific research in this domain.
×
引用
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学术文献互助群
群 号:604180095
Book学术官方微信