Performance Optimization of Physics Simulations Through Genetic Algorithms

The GeantV R&D approach is revisiting the standard particle transport simulation approach to be able to benefit from “Single Instruction, Multiple Data” (SIMD) computational architectures or extremely parallel systems like coprocessors and GPUs. The goal of this work is to develop a mechanism for optimizing the programs used for High-Energy Physics (HEP) particle transport simulations using a “black-box” optimization approach. Taking in account that genetic algorithms are among the most widely used “black-box” optimization methods, we analyzed a simplified model that allows precise mathematical definition and description of the genetic algorithm. The work done in this article is focused on the studies of evolutionary algorithms and particularly on stochastic optimization algorithms and unsupervised machine learning methods for the optimization of the parameters of the GeantV applications.

[1]  Marco Laumanns,et al.  Scalable Test Problems for Evolutionary Multiobjective Optimization , 2005, Evolutionary Multiobjective Optimization.

[2]  Federico Carminati,et al.  GeantV: from CPU to accelerators , 2017 .

[3]  S. Incerti,et al.  Geant4 developments and applications , 2006, IEEE Transactions on Nuclear Science.

[4]  Kalyanmoy Deb,et al.  A fast and elitist multiobjective genetic algorithm: NSGA-II , 2002, IEEE Trans. Evol. Comput..

[5]  Stephen R. Marsland,et al.  Convergence Properties of (μ + λ) Evolutionary Algorithms , 2011, AAAI.

[6]  Federico Carminati,et al.  Stochastic performance tuning of complex simulation applications using unsupervised machine learning , 2016, 2016 IEEE Symposium Series on Computational Intelligence (SSCI).

[7]  Philippe Canal,et al.  Stochastic optimization of GeantV code by use of genetic algorithms , 2017 .

[8]  Kalyanmoy Deb,et al.  An Evolutionary Many-Objective Optimization Algorithm Using Reference-Point-Based Nondominated Sorting Approach, Part I: Solving Problems With Box Constraints , 2014, IEEE Transactions on Evolutionary Computation.

[9]  Franz Rothlauf,et al.  On the importance of the second largest eigenvalue on the convergence rate of genetic algorithms , 2001 .

[10]  I. Jolliffe,et al.  ON RELATIONSHIPS BETWEEN UNCENTRED AND COLUMN-CENTRED PRINCIPAL COMPONENT ANALYSIS , 2009 .

[11]  Michael D. Vose,et al.  The simple genetic algorithm - foundations and theory , 1999, Complex adaptive systems.

[12]  H. Hotelling Relations Between Two Sets of Variates , 1936 .

[13]  Jonathan E. Rowe Genetic algorithm theory , 2011, GECCO.

[14]  A. Dell'Acqua,et al.  Geant4 - A simulation toolkit , 2003 .