Pareto-Front Exploration with Uncertain Objectives

  • Authors:
  • Jürgen Teich

  • Affiliations:
  • -

  • Venue:
  • EMO '01 Proceedings of the First International Conference on Evolutionary Multi-Criterion Optimization
  • Year:
  • 2001

Quantified Score

Hi-index 0.00

Visualization

Abstract

We consider the problem of exploration of the set of all global optima (Pareto-points) or an approximation thereof in the context of multi-objective function optimization. Up to now, set oriented techniques assume that the evaluation of the m-dimensional vector of objectives can be done exactly which is important to steer the search process towards global optima. Here, we extend such techniques to allow objectives to be uncertain, i.e., vary within intervals. This may be often the case if the exact computation of objectives is computationally too expensive such that only estimates on the objective values of a design point may be derived. For objective values that are constrained by intervals, we derive a theory of probabilistic dominance, an extension of the definition of Pareto-dominance. Also, we show how this theory may be used in order to guide the selection process to approximate the Pareto-set.