A New Steady-State MOEA/D for Sparse Optimization
The classical algorithms based on regularization usually solve sparse optimization problems under the framework of single objective optimization, which combines the sparse term with the loss term. The majority of these algorithms suffer from the setting of regularization parameter or its estimation. To overcome this weakness, the extension of multiobjective evolutionary algorithm based on decomposition (MOEA/D) has been studied for sparse optimization. The major advantages of MOEA/D lie in two aspects: (1) free setting of regularization parameter and (2) detection of true sparsity. Due to the generational mode of MOEA/D, its efficiency for searching the knee region of the Pareto front is not very satisfactory. In this paper, we proposed a new steady-state MOEA/D with the preference to search the region of Pareto front near the true sparse solution. Within each iteration of our proposed algorithm, a local search step is performed to examine a number of solutions with similar sparsity levels in a neighborhood. Our experimental results have shown that the new MOEA/D clearly performs better than its previous version on reconstructing artificial sparse signals.
KeywordsSparse optimization Multiobjective optimization Evolutionary algorithm MOEA/D
The authors would like to thank the anonymous reviewers for their constructive comments and suggestions on the original manuscript. This work was supported by the National Science Foundation of China under Grant 61573279, Grant 61175063, and Grant 61473241, Grant 11626252, Grant 11690011, the National Basic Research Program of China under Grant 2017CB329404.
- 11.Li, H., Su, X., Xu, Z., Zhang, Q.: MOEA/D with iterative thresholding algorithm to sparse optimization problems. In: Proceedings of 12th International Conference on Parallel Problem Solving from Nature (PPSN), pp. 93–101 (2012)Google Scholar