Evolutionary Multi-Objective Optimization Algorithm Framework with Three Solution Sets

• URL: http://arxiv.org/abs/2012.07319v1
• Date: Mon, 14 Dec 2020 08:04:07 GMT
• Title: Evolutionary Multi-Objective Optimization Algorithm Framework with Three Solution Sets
• Authors: Hisao Ishibuchi and Lie Meng Pang and Ke Shang
• Abstract summary: It is assumed that a final solution is selected by a decision maker from a non-dominated solution set obtained by an EMO algorithm. In this paper, we suggest the use of a general EMO framework with three solution sets to handle various situations.
• Score: 7.745468825770201
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: It is assumed in the evolutionary multi-objective optimization (EMO) community that a final solution is selected by a decision maker from a non-dominated solution set obtained by an EMO algorithm. The number of solutions to be presented to the decision maker can be totally different. In some cases, the decision maker may want to examine only a few representative solutions from which a final solution is selected. In other cases, a large number of non-dominated solutions may be needed to visualize the Pareto front. In this paper, we suggest the use of a general EMO framework with three solution sets to handle various situations with respect to the required number of solutions. The three solution sets are the main population of an EMO algorithm, an external archive to store promising solutions, and a final solution set which is presented to the decision maker. The final solution set is selected from the archive. Thus the population size and the archive size can be arbitrarily specified as long as the archive size is not smaller than the required number of solutions. The final population is not necessarily to be a good solution set since it is not presented to the decision maker. Through computational experiments, we show the advantages of this framework over the standard final population and final archive frameworks. We also discuss how to select a final solution set and how to explain the reason for the selection, which is the first attempt towards an explainable EMO framework.

Related papers

• Learning Multiple Initial Solutions to Optimization Problems [52.9380464408756]
  Sequentially solving similar optimization problems under strict runtime constraints is essential for many applications. We propose learning to predict emphmultiple diverse initial solutions given parameters that define the problem instance. We find significant and consistent improvement with our method across all evaluation settings and demonstrate that it efficiently scales with the number of initial solutions required.
  arXiv  Detail & Related papers  (2024-11-04T15:17:19Z)
• An incremental preference elicitation-based approach to learning potentially non-monotonic preferences in multi-criteria sorting [53.36437745983783]
  We first construct a max-margin optimization-based model to model potentially non-monotonic preferences. We devise information amount measurement methods and question selection strategies to pinpoint the most informative alternative in each iteration. Two incremental preference elicitation-based algorithms are developed to learn potentially non-monotonic preferences.
  arXiv  Detail & Related papers  (2024-09-04T14:36:20Z)
• Efficient anytime algorithms to solve the bi-objective Next Release Problem [2.8148957592979422]
  Next Release Problem consists in selecting a subset of requirements to develop in the next release of a software product. We propose five new methods that maintain a well-spread set of solutions at any time during the search.
  arXiv  Detail & Related papers  (2024-02-07T05:03:31Z)
• Learning Proximal Operators to Discover Multiple Optima [66.98045013486794]
  We present an end-to-end method to learn the proximal operator across non-family problems. We show that for weakly-ized objectives and under mild conditions, the method converges globally.
  arXiv  Detail & Related papers  (2022-01-28T05:53:28Z)
• Benchmarking Subset Selection from Large Candidate Solution Sets in Evolutionary Multi-objective Optimization [6.544757635738911]
  In the evolutionary multi-objective optimization (EMO) field, the standard practice is to present the final population of an EMO algorithm as the output. Recently, a new EMO framework has been proposed to solve this issue by storing all the non-dominated solutions generated during the evolution in an archive. This paper proposes a benchmark test suite for subset selection from large candidate solution sets.
  arXiv  Detail & Related papers  (2022-01-18T02:09:08Z)
• Modularity in Reinforcement Learning via Algorithmic Independence in Credit Assignment [79.5678820246642]
  We show that certain action-value methods are more sample efficient than policy-gradient methods on transfer problems that require only sparse changes to a sequence of previously optimal decisions. We generalize the recently proposed societal decision-making framework as a more granular formalism than the Markov decision process.
  arXiv  Detail & Related papers  (2021-06-28T21:29:13Z)
• A Mutual Information Maximization Approach for the Spurious Solution Problem in Weakly Supervised Question Answering [60.768146126094955]
  Weakly supervised question answering usually has only the final answers as supervision signals. There may exist many spurious solutions that coincidentally derive the correct answer, but training on such solutions can hurt model performance. We propose to explicitly exploit such semantic correlations by maximizing the mutual information between question-answer pairs and predicted solutions.
  arXiv  Detail & Related papers  (2021-06-14T05:47:41Z)
• Decomposition-Based Multi-Objective Evolutionary Algorithm Design under Two Algorithm Frameworks [7.745468825770201]
  We use an offline genetic algorithm-based hyper-heuristic method to find the optimal configuration of MOEA/D in each framework. The experimental results suggest the possibility that a more flexible, robust and high-performance MOEA/D algorithm can be obtained when the solution selection framework is used.
  arXiv  Detail & Related papers  (2020-08-17T05:28:20Z)
• Algorithm Configurations of MOEA/D with an Unbounded External Archive [7.745468825770201]
  We show that the performance of MOEA/D is improved by linearly changing the reference point specification during its execution. We also examine the use of a genetic algorithm-based offline hyper-heuristic method to find the best configuration of MOEA/D in each framework.
  arXiv  Detail & Related papers  (2020-07-27T08:14:37Z)
• Learning What to Defer for Maximum Independent Sets [84.00112106334655]
  We propose a novel DRL scheme, coined learning what to defer (LwD), where the agent adaptively shrinks or stretch the number of stages by learning to distribute the element-wise decisions of the solution at each stage. We apply the proposed framework to the maximum independent set (MIS) problem, and demonstrate its significant improvement over the current state-of-the-art DRL scheme.
  arXiv  Detail & Related papers  (2020-06-17T02:19:31Z)
• Solution Subset Selection for Final Decision Making in Evolutionary Multi-Objective Optimization [7.745468825770201]
  We discuss subset selection from a viewpoint of the final decision making. We show that the formulated function is the same as the IGD plus indicator.
  arXiv  Detail & Related papers  (2020-06-15T06:26:58Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.