Abstract
In the context of Noisy Multi-Objective Optimization, dealing with uncertainties requires the decision maker to define some preferences about how to handle them, through some statistics (e.g., mean, median) to be used to evaluate the qualities of the solutions, and define the corresponding Pareto set. Approximating these statistics requires repeated samplings of the population, drastically increasing the overall computational cost. To tackle this issue, this paper proposes to directly estimate the probability of each individual to be selected, using some Hoeffding races to dynamically assign the estimation budget during the selection step. The proposed racing approach is validated against static budget approaches with NSGA-II on noisy versions of the ZDT benchmark functions.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Basseur, M., Zitzler, E.: A Preliminary Study on Handling Uncertainty in Indicator-Based Multiobjective Optimization. In: Rothlauf, F., et al. (eds.) EvoWorkshops 2006. LNCS, vol. 3907, pp. 727–739. Springer, Heidelberg (2006)
Boonma, P., Suzuki, J.: A Confidence-based Dominance Operator in Evolutionary Algorithms for Noisy Multiobjective Optimization Problems. In: Proc. ICTAI 2009. IEEE Press (2009)
Deb, K.: Multi-Objective Optimization Using Evolutionary Algorithms. John Wiley & Sons (2001)
Eskandari, H., Geiger, C.D., Bird, R.: Handling uncertainty in evolutionary multiobjective optimization: SPGA. In: CEC 2007, pp. 4130–4137. IEEE Press (2007)
Fieldsend, J., Everson, R.: Multi-Objective Optimisation in the Presence of Uncertainty. In: CEC 2005, pp. 243–250. IEEE Press (2005)
Heidrich-Meisner, V., Igel, C.: Hoeffding and Bernstein Races for Selecting Policies in Evolutionary Direct Policy Search. In: Danyluk, A.P., et al. (eds.) Proc. ICML 2009. ACM Intl. Conf. Proc. Series, vol. 382, p. 51 (2009)
Hughes, E.J.: Evolutionary Multiobjective Ranking with Uncertainty and Noise. In: Zitzler, E., Deb, K., Thiele, L., Coello Coello, C.A., Corne, D.W. (eds.) EMO 2001. LNCS, vol. 1993, pp. 329–343. Springer, Heidelberg (2001)
Phan, D.H., Suzuki, J.: A Non-parametric Statistical Dominance Operator for Noisy Multiobjective Optimization. In: Bui, L.T., Ong, Y.S., Hoai, N.X., Ishibuchi, H., Suganthan, P.N. (eds.) SEAL 2012. LNCS, vol. 7673, pp. 42–51. Springer, Heidelberg (2012)
Siegmund, F.: Sequential Sampling in Noisy Multi-Objective Evolutionary Optimization. Master’s thesis, School of Humanities and Informatics, Skövde (2009)
Teich, J.: Pareto-Front Exploration with Uncertain Objectives. In: Zitzler, E., Deb, K., Thiele, L., Coello Coello, C.A., Corne, D.W. (eds.) EMO 2001. LNCS, vol. 1993, pp. 314–328. Springer, Heidelberg (2001)
Trautmann, H., Mehnen, J., Naujoks, B.: Pareto-Dominance in Noisy Environments. In: Tyrrell, A. (ed.) Proc. CEC 2009, pp. 3119–3126. IEEE Press (2009)
Voß, T., Trautmann, H., Igel, C.: New Uncertainty Handling Strategies in Multi-objective Evolutionary Optimization. In: Schaefer, R., Cotta, C., Kołodziej, J., Rudolph, G. (eds.) PPSN XI. LNCS, vol. 6239, pp. 260–269. Springer, Heidelberg (2010)
Zhou, A., Qu, B.Y., Li, H., Zhao, S.Z., Suganthan, P.N., Zhang, Q.: Multiobjective evolutionary algorithms: A survey of the state of the art. Swarm and Evolutionary Computation 1(1), 32–49 (2011)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2014 Springer International Publishing Switzerland
About this paper
Cite this paper
Marceau-Caron, G., Schoenauer, M. (2014). Racing Multi-objective Selection Probabilities. In: Bartz-Beielstein, T., Branke, J., Filipič, B., Smith, J. (eds) Parallel Problem Solving from Nature – PPSN XIII. PPSN 2014. Lecture Notes in Computer Science, vol 8672. Springer, Cham. https://doi.org/10.1007/978-3-319-10762-2_62
Download citation
DOI: https://doi.org/10.1007/978-3-319-10762-2_62
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-10761-5
Online ISBN: 978-3-319-10762-2
eBook Packages: Computer ScienceComputer Science (R0)