Data Driven Evolutionary Optimization of Complex Systems: Big Data Versus Small Data

This invited talk Existing evolutionary algorithms typically assume that there are explicit objective functions available for fitness evaluations. In the real world, such explicit objective functions may not be available in many cases. For example, many industrial optimization problems such as structural design [8] need to perform computationally very intensive numerical simulations, such as computational fluid dynamic simulations or finite element analysis, where a large set of partial differential equations must be solved. In many process industry optimization problems, no explicit models exist for describing the relationship between the final quality of the product and the decision variables, such as temperature and humidity. Thus, only historical experimental data can be used for optimization. There are also cases where only factual data can be collected. A good example of such optimization problems is trauma systems design [11], where only patient records are available for optimization. For solving such optimization problems, evolutionary optimization can be conducted only using a data-driven approach. The main challenges in data-driven evolutionary optimization can roughly be divided into two categories according to the amount of available data, namely, small data and big data. The lack of data can mainly be attributed to the fact that data acquisition is very expensive, either computationally or costly. In [11], data-driven evolutionary optimization problems are divided into two paradigms, one termed off-line data-driven optimization, where no new data can be actively sampled, and the other on-line data-driven optimization, where a small number of new data points can

[1]  Yaochu Jin,et al.  Surrogate-assisted evolutionary computation: Recent advances and future challenges , 2011, Swarm Evol. Comput..

[2]  Yaochu Jin,et al.  A comprehensive survey of fitness approximation in evolutionary computation , 2005, Soft Comput..

[3]  Bernhard Sendhoff,et al.  Generalizing Surrogate-Assisted Evolutionary Computation , 2010, IEEE Transactions on Evolutionary Computation.

[4]  Yang Yu,et al.  A two-layer surrogate-assisted particle swarm optimization algorithm , 2014, Soft Computing.

[5]  Kian Hsiang Low,et al.  A Unifying Framework of Anytime Sparse Gaussian Process Regression Models with Stochastic Variational Inference for Big Data , 2015, ICML.

[6]  J. Hensman,et al.  Gaussian Processes for Big Data through Stochastic Variational Inference , 2012 .

[7]  Handing Wang,et al.  Data-Driven Surrogate-Assisted Multiobjective Evolutionary Optimization of a Trauma System , 2016, IEEE Transactions on Evolutionary Computation.

[8]  Neil D. Lawrence,et al.  G aussian Processes for Big Data with Stochastic Variational Inference , 2012 .

[9]  Kaisa Miettinen,et al.  On Constraint Handling in Surrogate-Assisted Evolutionary Many-Objective Optimization , 2016, PPSN.

[10]  Bernd Bischl,et al.  Model-Based Multi-objective Optimization: Taxonomy, Multi-Point Proposal, Toolbox and Benchmark , 2015, EMO.

[11]  Marianthi G. Ierapetritou,et al.  A kriging based method for the solution of mixed-integer nonlinear programs containing black-box functions , 2009, J. Glob. Optim..

[12]  Bernhard Sendhoff,et al.  A systems approach to evolutionary multiobjective structural optimization and beyond , 2009, IEEE Computational Intelligence Magazine.

[13]  Graham J. Williams,et al.  Big Data Opportunities and Challenges: Discussions from Data Analytics Perspectives [Discussion Forum] , 2014, IEEE Computational Intelligence Magazine.