An Adaptive Multi-Granular Pareto-Optimal Subspace Learning Algorithm for Sparse Large-Scale Multi-Objective Optimization
2025 IEEE Congress on Evolutionary Computation (CEC)（2025）
Key words
Learning Algorithms,Multi-objective Optimization,Adaptive Learning,Pareto Optimal,Large-scale Optimization,Subspace Learning,Sparse Optimization,Subspace Learning Algorithm,Neural Network,Important Variables,Sparsity,Large-scale Problems,Multi-objective Optimization Problem,Hierarchical Strategy,Benchmark Problems,Non-dominated Solutions,Large-scale Optimization Problems,Unsupervised Neural Network,Experimental Analysis,Dimensionality Reduction,Restricted Boltzmann Machine,Denoising Autoencoder,Adaptive Adjustment,Dynamic Adjustment,Decision Variables,Original Space,Sparsity Pattern,Pareto Front,High Computational Overhead,Genetic Operators
AI Read Science
Must-Reading Tree
Example
Generate MRT to find the research sequence of this paper
Chat Paper
Summary is being generated by the instructions you defined