On the Computation of the Empirical Attainment Function
The attainment function provides a description of the location of the distribution of a random non-dominated point set. This function can be estimated from experimental data via its empirical counterpart, the empirical attainment function (EAF). However, computation of the EAF in more than two dimensions is a non-trivial task. In this article, the problem of computing the empirical attainment function is formalised, and upper and lower bounds on the corresponding number of output points are presented. In addition, efficient algorithms for the two and three-dimensional cases are proposed, and their time complexities are related to lower bounds derived for each case.
KeywordsEmpirical attainment function algorithms multiobjective optimiser performance estimation
Unable to display preview. Download preview PDF.
- 4.Grunert da Fonseca, V., Fonseca, C.M.: The attainment-function approach to stochastic multiobjective optimizer assessment and comparison. In: Bartz-Beielstein, T., et al. (eds.) Experimental Methods for the Analysis of Optimization Algorithms, pp. 103–130. Springer, Berlin (2010)CrossRefGoogle Scholar
- 6.Knowles, J.D.: A summary-attainment-surface plotting method for visualizing the performance of stochastic multiobjective optimizers. In: Proceedings of the 5th International Conference on Intelligent Systems Design and Applications, pp. 552–557 (2005)Google Scholar