• Home
  • Search
  • Knowledge Learning-Based Dimensionality Reduction for Solving Large-Scale Sparse Multiobjective Optimization Problems.
  • Cite Icon28
  • https://doi.org/10.1109/tcyb.2025.3558354Copy DOI Icon

Knowledge Learning-Based Dimensionality Reduction for Solving Large-Scale Sparse Multiobjective Optimization Problems.

Show More
  • Abstract
  • Literature Map
  • References
  • Citations
  • Similar Papers
Abstract

Large-scale sparse multiobjective optimization problems (LSMOPs) are of great significance in the context of practical applications, such as critical node detection, feature selection, and pattern mining. Since many LSMOPs are pursued based on large datasets, they involve a large number of decision variables, resulting in a huge search space that is challenging to explore efficiently. To rapidly approximate sparse Pareto optimal solutions, some evolutionary algorithms have been proposed to reduce the dimensionality of LSMOPs. However, their adaptability to different LSMOPs remains limited due to their reliance on fixed dimensionality reduction schemes, which can potentially lead to local optima and inefficient utilization of function evaluations. To address this issue, a knowledge learning-based dimensionality reduction approach is proposed in this article. First, in the early stages of evolution, the impact of different dimensionality reduction schemes on the sparse distribution of the population is evaluated. Then, the multilayer perceptron is employed to learn the accumulated knowledge from the evolutionary process, thereby constructing a mapping model between the sparse features of the evolutionary process and the candidate dimensionality reduction schemes. Finally, the model recommends the best dimensionality reduction scheme in each generation, achieving a good balance between exploration and exploitation. Experimental evaluations on both benchmark and real-world LSMOPs demonstrate that an evolutionary algorithm incorporating the proposed knowledge learning-based dimensionality reduction approach outperforms most existing evolutionary algorithms.

Similar Papers
  • Research Article
  • Citations40

Benefits of sparse population sampling in multi-objective evolutionary computing for large-Scale sparse optimization problems

  • Mar 01, 2022
  • Swarm and Evolutionary Computation
  • Ian Kropp +2
  • Book Chapter
  • Citations9

A Comparison Study of Evolutionary Algorithms on Large-Scale Sparse Multi-objective Optimization Problems

  • Jan 01, 2021
  • Yajie Zhang +2
  • Research Article
  • Citations6

Evolution algorithm with adaptive genetic operator and dynamic scoring mechanism for large-scale sparse many-objective optimization

  • Mar 18, 2025
  • Scientific Reports
  • Xia Wang +4
  • Conference Article
  • Citations2

An adaptive fitness evolutionary algorithm for sparse large-scale multi-objective optimization problems

  • Dec 04, 2022
  • Ge Zhang +3
  • PDF
  • Research Article
  • Citations86

Improved SparseEA for sparse large-scale multi-objective optimization problems

  • Oct 09, 2021
  • Complex & Intelligent Systems
  • Yajie Zhang +2
  • Conference Article
  • Citations3

A Modified MOEA/D Based on Guided Search Directions for Large-scale Multiobjective Optimization

  • Jul 01, 2023
  • Yanhui Tang +3
  • Research Article
  • Citations76

A multi-stage knowledge-guided evolutionary algorithm for large-scale sparse multi-objective optimization problems

  • Aug 01, 2022
  • Swarm and Evolutionary Computation
  • Zhuanlian Ding +3
  • Conference Article
  • Citations16

A Kriging-Assisted Evolutionary Algorithm Using Feature Selection for Expensive Sparse Multi-Objective optimization

  • Jul 01, 2020
  • Zheng Tan +1
  • Research Article
  • Citations7

A novel interval sparse evolutionary algorithm for efficient spectral variable selection.

  • Mar 01, 2025
  • Analytica chimica acta
  • Mingrui Li +4
  • Research Article

An Jaccard similarity coefficient-based evolutionary algorithm for sparse large-scale multi-objective optimization problems

  • Jan 01, 2026
  • Swarm and Evolutionary Computation
  • Jiawei Chen +4
  • Research Article
  • Citations57

Multi-stage dimension reduction for expensive sparse multi-objective optimization problems

  • Feb 17, 2021
  • Neurocomputing
  • Zheng Tan +2
  • Research Article
  • Citations155

A Pattern Mining-Based Evolutionary Algorithm for Large-Scale Sparse Multiobjective Optimization Problems.

  • Jul 01, 2022
  • IEEE transactions on cybernetics
  • Ye Tian +4
  • Conference Article

Improved Evolutionary Strategies for Sparse Large-Scale Many-objective Optimization Problems

  • Dec 05, 2023
  • Jiawei Chen +2
  • Research Article

The smoothing objective penalty function method for two-cardinality sparse constrained optimization problems

  • Dec 08, 2021
  • Optimization
  • Min Jiang +3
  • Research Article
  • Citations40

A two-stage evolutionary algorithm for large-scale sparse multiobjective optimization problems

  • Jul 01, 2022
  • Swarm and Evolutionary Computation
  • Jing Jiang +5
Cactus Communications logo

Copyright 2026 Cactus Communications. All rights reserved.