Fast Greedy Subset Selection From Large Candidate Solution Sets in Evolutionary Multiobjective Optimization

Subset selection is an interesting and important topic in the field of evolutionary multi-objective optimization (EMO). Especially, in an EMO algorithm with an unbounded external archive, subset selection is an essential post-processing procedure to select a pre-specified number of solutions as the final result. In this paper, we discuss the efficiency of greedy subset selection for the hypervolume, IGD and IGD+ indicators. Greedy algorithms usually efficiently handle subset selection. However, when a large number of solutions are given (e.g., subset selection from tens of thousands of solutions in an unbounded external archive), they often become time-consuming. Our idea is to use the submodular property, which is known for the hypervolume indicator, to improve their efficiency. First, we prove that the IGD and IGD+ indicators are also submodular. Next, based on the submodular property, we propose an efficient greedy inclusion algorithm for each indicator. Then, we demonstrate through computational experiments that the proposed algorithms are much faster than the standard greedy subset selection algorithms.

[1]  Hisao Ishibuchi,et al.  Benchmarking Multi- and Many-Objective Evolutionary Algorithms Under Two Optimization Scenarios , 2017, IEEE Access.

[2]  Hisao Ishibuchi,et al.  Lazy Greedy Hypervolume Subset Selection from Large Candidate Solution Sets , 2020, 2020 IEEE Congress on Evolutionary Computation (CEC).

[3]  Carlos M. Fonseca,et al.  Computing and Updating Hypervolume Contributions in Up to Four Dimensions , 2018, IEEE Transactions on Evolutionary Computation.

[4]  Tobias Friedrich,et al.  An Efficient Algorithm for Computing Hypervolume Contributions , 2010, Evolutionary Computation.

[5]  Carlos A. Coello Coello,et al.  A Study of the Parallelization of a Coevolutionary Multi-objective Evolutionary Algorithm , 2004, MICAI.

[6]  Hisao Ishibuchi,et al.  How to compare many-objective algorithms under different settings of population and archive sizes , 2016, 2016 IEEE Congress on Evolutionary Computation (CEC).

[7]  Balas K. Natarajan,et al.  Sparse Approximate Solutions to Linear Systems , 1995, SIAM J. Comput..

[8]  Lothar Thiele,et al.  Multiobjective Optimization Using Evolutionary Algorithms - A Comparative Case Study , 1998, PPSN.

[9]  Hisao Ishibuchi,et al.  A Survey on the Hypervolume Indicator in Evolutionary Multiobjective Optimization , 2021, IEEE Transactions on Evolutionary Computation.

[10]  Michel Minoux,et al.  Accelerated greedy algorithms for maximizing submodular set functions , 1978 .

[11]  Hisao Ishibuchi,et al.  How to Specify a Reference Point in Hypervolume Calculation for Fair Performance Comparison , 2018, Evolutionary Computation.

[12]  Yang Yu,et al.  Subset Selection by Pareto Optimization , 2015, NIPS.

[13]  Xin Yao,et al.  An Empirical Investigation of the Optimality and Monotonicity Properties of Multiobjective Archiving Methods , 2019, EMO.

[14]  Tobias Friedrich,et al.  Generic Postprocessing via Subset Selection for Hypervolume and Epsilon-Indicator , 2014, PPSN.

[15]  Karl Bringmann,et al.  Two-dimensional subset selection for hypervolume and epsilon-indicator , 2014, GECCO.

[16]  Hisao Ishibuchi,et al.  Reference Point Specification in Inverted Generational Distance for Triangular Linear Pareto Front , 2018, IEEE Transactions on Evolutionary Computation.

[17]  Hisao Ishibuchi,et al.  Modified Distance Calculation in Generational Distance and Inverted Generational Distance , 2015, EMO.

[18]  Jure Leskovec,et al.  Inferring networks of diffusion and influence , 2010, KDD.

[19]  Kalyanmoy Deb,et al.  An Evolutionary Many-Objective Optimization Algorithm Using Reference-Point Based Nondominated Sorting Approach, Part II: Handling Constraints and Extending to an Adaptive Approach , 2014, IEEE Transactions on Evolutionary Computation.

[20]  K. C. Seow,et al.  MULTIOBJECTIVE DESIGN OPTIMIZATION BY AN EVOLUTIONARY ALGORITHM , 2001 .

[21]  E. Polak,et al.  On Multicriteria Optimization , 1976 .

[22]  Hisao Ishibuchi,et al.  Algorithm Configurations of MOEA/D with an Unbounded External Archive , 2020, 2020 IEEE International Conference on Systems, Man, and Cybernetics (SMC).

[23]  Lucas Bradstreet,et al.  A Fast Incremental Hypervolume Algorithm , 2008, IEEE Transactions on Evolutionary Computation.

[24]  R. Lyndon While,et al.  Improving the IWFG algorithm for calculating incremental hypervolume , 2016, 2016 IEEE Congress on Evolutionary Computation (CEC).

[25]  Lucas Bradstreet,et al.  Incrementally maximising hypervolume for selection in multi-objective evolutionary algorithms , 2007, 2007 IEEE Congress on Evolutionary Computation.

[26]  Mark H. Overmars,et al.  New upper bounds in Klee's measure problem , 1988, [Proceedings 1988] 29th Annual Symposium on Foundations of Computer Science.

[27]  Lucas Bradstreet,et al.  A Fast Way of Calculating Exact Hypervolumes , 2012, IEEE Transactions on Evolutionary Computation.

[28]  Hisao Ishibuchi,et al.  An analysis of control parameters of MOEA/D under two different optimization scenarios , 2018, Appl. Soft Comput..

[29]  Hisao Ishibuchi,et al.  Modified Distance-based Subset Selection for Evolutionary Multi-objective Optimization Algorithms , 2020, 2020 IEEE Congress on Evolutionary Computation (CEC).

[30]  Carlos A. Coello Coello,et al.  IGD+-EMOA: A multi-objective evolutionary algorithm based on IGD+ , 2016, CEC.

[31]  Marco Laumanns,et al.  Performance assessment of multiobjective optimizers: an analysis and review , 2003, IEEE Trans. Evol. Comput..

[32]  Carlos M. Fonseca,et al.  Hypervolume Subset Selection in Two Dimensions: Formulations and Algorithms , 2016, Evolutionary Computation.

[33]  Hisao Ishibuchi,et al.  Solution Subset Selection for Final Decision Making in Evolutionary Multi-Objective Optimization , 2020, ArXiv.

[34]  Zhang Yi,et al.  IGD Indicator-Based Evolutionary Algorithm for Many-Objective Optimization Problems , 2018, IEEE Transactions on Evolutionary Computation.

[35]  Andreas Krause,et al.  Cost-effective outbreak detection in networks , 2007, KDD '07.

[36]  Marco Laumanns,et al.  Scalable multi-objective optimization test problems , 2002, Proceedings of the 2002 Congress on Evolutionary Computation. CEC'02 (Cat. No.02TH8600).

[37]  Tapabrata Ray,et al.  Distance-Based Subset Selection for Benchmarking in Evolutionary Multi/Many-Objective Optimization , 2019, IEEE Transactions on Evolutionary Computation.

[38]  Kalyanmoy Deb,et al.  A fast and elitist multiobjective genetic algorithm: NSGA-II , 2002, IEEE Trans. Evol. Comput..

[39]  Joshua D. Knowles,et al.  Bounded archiving using the lebesgue measure , 2003, The 2003 Congress on Evolutionary Computation, 2003. CEC '03..

[40]  Michael G. Parsons,et al.  Formulation of Multicriterion Design Optimization Problems for Solution With Scalar Numerical Optimization Methods , 2004 .

[41]  Hisao Ishibuchi,et al.  Selecting a small number of non-dominated solutions to be presented to the decision maker , 2014, 2014 IEEE International Conference on Systems, Man, and Cybernetics (SMC).

[42]  Eckart Zitzler,et al.  HypE: An Algorithm for Fast Hypervolume-Based Many-Objective Optimization , 2011, Evolutionary Computation.

[43]  Bilel Derbel,et al.  Landscape-Aware Performance Prediction for Evolutionary Multiobjective Optimization , 2020, IEEE Transactions on Evolutionary Computation.

[44]  Hisao Ishibuchi,et al.  Comparison of Hypervolume, IGD and IGD+ from the Viewpoint of Optimal Distributions of Solutions , 2019, EMO.

[45]  S. Mallat,et al.  Adaptive greedy approximations , 1997 .

[46]  Jie Zhang,et al.  A Simple and Fast Hypervolume Indicator-Based Multiobjective Evolutionary Algorithm , 2015, IEEE Transactions on Cybernetics.

[47]  Kalyanmoy Deb,et al.  An Evolutionary Many-Objective Optimization Algorithm Using Reference-Point-Based Nondominated Sorting Approach, Part I: Solving Problems With Box Constraints , 2014, IEEE Transactions on Evolutionary Computation.

[48]  Antonio J. Nebro,et al.  jMetal: A Java framework for multi-objective optimization , 2011, Adv. Eng. Softw..

[49]  Tobias Friedrich,et al.  Approximating the volume of unions and intersections of high-dimensional geometric objects , 2008, Comput. Geom..

[50]  M. L. Fisher,et al.  An analysis of approximations for maximizing submodular set functions—I , 1978, Math. Program..

[51]  Nicola Beume,et al.  S-Metric Calculation by Considering Dominated Hypervolume as Klee's Measure Problem , 2009, Evolutionary Computation.