Abstract
Population based stochastic algorithms have long been used for the solution of multiobjective optimization problems. In the event the problem involves computationally expensive analysis, the existing practice is to use some form of surrogates or approximations. Surrogates are either used to screen promising solutions or approximate the objective functions corresponding to the solutions. In this paper, we investigate the effects of selective evaluation of promising solutions and try to derive answers to the following questions: (a) should we discard the solution right away relying on a classifier without any further evaluation? (b) should we evaluate its first objective function and then decide to select or discard it? (c) should we evaluate its second objective function instead and then decide its fate or (d) should we evaluate both its objective functions before selecting or discarding it? The last form is typically an optimization algorithm in its native form. While evaluation of solutions generate information that can be potentially learned by the optimization algorithm, it comes with a computational cost which might still be insignificant when compared with the cost of actual computationally expensive analysis. In this paper, a simple scheme, referred as Combined Classifier Based Approach (CCBA) is proposed. The performance of CCBA along with other strategies have been evaluated using five well studied unconstrained bi-objective optimization problems (DTLZ1-DTLZ5) with limited computational budget. The aspect of selective evaluation has rarely been investigated in literature and we hope that this study would prompt design of efficient algorithms that selectively evaluate solutions on the fly i.e. based on the trade-off between need to learn/evaluate and cost to learn.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Runarsson, T.P., Yao, X.: Stochastic ranking for constrained evolutionary optimization. IEEE Trans. Evol. Comput. 4(3), 284–294 (2000)
Ray, T., Singh, H.K., Isaacs, A., Smith, W.: Infeasibility driven evolutionary algorithm for constrained optimization. In: Mezura-Montes, E. (ed.) Constraint-Handling in Evolutionary Optimization. SCI, vol. 198, pp. 145–165. Springer, Heidelberg (2009)
Takahama, T., Sakai, S.: Constrained optimization by the \(\epsilon \) constrained differential evolution with gradient-based mutation and feasible elites. In: Proceedings of the IEEE Congress on Evolutionary Computation (CEC), pp. 1–8 (2006)
Asafuddoula, M., Ray, T., Sarker, R.: Evaluate till you violate: a differential evolution algorithm based on partial evaluation of the constraint set. In: Proceedings of the IEEE Symposium on Differential Evolution (SDE), pp. 31–37 (2013)
Jin, Y.: Surrogate-assisted evolutionary computation: recent advances and future challenges. Swarm Evol. Comput. 1(2), 61–70 (2011)
Suykens, J.A.K., Van Gestel, T., De Brabanter, J., De Moor, B., Vandewalle, J.: Least Squares Support Vector Machines, vol. 4. World Scientific, Singapore (2002)
Loshchilov, I., Schoenauer, M., Sebag, M.: A mono surrogate for multiobjective optimization. In: Proceedings of the 12th Annual Conference on Genetic and Evolutionary Computation (GECCO), pp. 471–478. ACM (2010)
Chawla, N.V., Bowyer, K.W., Hall, L.O., Kegelmeyer, W.P.: SMOTE: synthetic minority over-sampling technique. J. Artif. Intell. Res. 16, 321–357 (2002)
Deb, K., Pratap, A., Agarwal, S., Meyarivan, T.: A fast and elitist multiobjective genetic algorithm: NSGA-II. IEEE Trans. Evol. Comput. 6(2), 182–197 (2002)
Deb, K., Thiele, L., Laumanns, M., Zitzler, E.: Scalable Test Problems for Evolutionary Multiobjective Optimization. Springer, Heidelberg (2005)
Beume, N., Fonseca, C., Lopez-Ibanez, M., Paquete, L., Vahrenhold, J.: On the complexity of computing the hypervolume indicator. IEEE Trans. Evol. Comput. 13(5), 1075–1082 (2009)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2015 Springer International Publishing Switzerland
About this paper
Cite this paper
Bhattacharjee, K.S., Ray, T. (2015). Cost to Evaluate Versus Cost to Learn? Performance of Selective Evaluation Strategies in Multiobjective Optimization. In: Pfahringer, B., Renz, J. (eds) AI 2015: Advances in Artificial Intelligence. AI 2015. Lecture Notes in Computer Science(), vol 9457. Springer, Cham. https://doi.org/10.1007/978-3-319-26350-2_6
Download citation
DOI: https://doi.org/10.1007/978-3-319-26350-2_6
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-26349-6
Online ISBN: 978-3-319-26350-2
eBook Packages: Computer ScienceComputer Science (R0)