arrow
返回

Solving Large-Scale Multiobjective Optimization Problems With Sparse Optimal Solutions via Unsupervised Neural Networks

delete2021-06-01
delete175
delete
OA
AI
Y
Ye Tian
C
Chang Lü
X
Xingyi Zhang *
K
Kay Chen Tan
Y
Yaochu Jin
DOI:10.1109/TCYB.2020.2979930delete
delete原文链接
delete分享
delete收藏
查看原文
摘要

摘要

En 中文
Due to the curse of dimensionality of search space, it is extremely difficult for evolutionary algorithms to approximate the optimal solutions of large-scale multiobjective optimization problems (LMOPs) by using a limited budget of evaluations. If the Pareto-optimal subspace is approximated during the evolutionary process, the search space can be reduced and the difficulty encountered by evolutionary algorithms can be highly alleviated. Following the above idea, this article proposes an evolutionary algorithm to solve sparse LMOPs by learning the Pareto-optimal subspace. The proposed algorithm uses two unsupervised neural networks, a restricted Boltzmann machine, and a denoising autoencoder to learn a sparse distribution and a compact representation of the decision variables, where the combination of the learnt sparse distribution and compact representation is regarded as an approximation of the Pareto-optimal subspace. The genetic operators are conducted in the learnt subspace, and the resultant offspring solutions then can be mapped back to the original search space by the two neural networks. According to the experimental results on eight benchmark problems and eight real-world problems, the proposed algorithm can effectively solve sparse LMOPs with 10000 decision variables by only 100000 evaluations.
Keyword:
Optimization
Neural networks
Evolutionary computation
Search problems
Computer science
Sociology
Statistics
Denoising autoencoder (DAE)
large-scale multiobjective optimization
Pareto-optimal subspace
restricted Boltzmann machine (RBM)
sparse Pareto-optimal solutions
AI总结

AI总结

对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。

期刊

IEEE Transactions on Cybernetics 封面图
IEEE Transactions on Cybernetics
IF:
10.5
论文数:
1.1W
被引数:
5.0W

机构

C
City University of Hong Kong
学者数:
2.3W
论文数: 3.0W
被引数: 6.1W
U
University of Surrey
学者数:
1.2W
论文数: 1.3W
被引数: 22
A
anhui university
学者数:
1.9W
论文数: 1.2W
被引数: 24
学者 查看更多机构
引用论文

引用论文

A faster algorithm for calculating hypervolume
err2006-02-01
err759
PREAI
errWhile, L; Hingston, P; Barone, L; Huband, S
err分享
err收藏
学者 查看更多内容