scholarly journals EvoStencils: a grammar-based genetic programming approach for constructing efficient geometric multigrid methods

Author(s):  
Jonas Schmitt ◽  
Sebastian Kuckuk ◽  
Harald Köstler

AbstractFor many systems of linear equations that arise from the discretization of partial differential equations, the construction of an efficient multigrid solver is challenging. Here we present EvoStencils, a novel approach for optimizing geometric multigrid methods with grammar-guided genetic programming, a stochastic program optimization technique inspired by the principle of natural evolution. A multigrid solver is represented as a tree of mathematical expressions that we generate based on a formal grammar. The quality of each solver is evaluated in terms of convergence and compute performance by automatically generating an optimized implementation using code generation that is then executed on the target platform to measure all relevant performance metrics. Based on this, a multi-objective optimization is performed using a non-dominated sorting-based selection. To evaluate a large number of solvers in parallel, they are distributed to multiple compute nodes. We demonstrate the effectiveness of our implementation by constructing geometric multigrid solvers that are able to outperform hand-crafted methods for Poisson’s equation and a linear elastic boundary value problem with up to 16 million unknowns on multi-core processors with Ivy Bridge and Broadwell microarchitecture.

2016 ◽  
Vol 24 (1) ◽  
pp. 143-182 ◽  
Author(s):  
Harith Al-Sahaf ◽  
Mengjie Zhang ◽  
Mark Johnston

In the computer vision and pattern recognition fields, image classification represents an important yet difficult task. It is a challenge to build effective computer models to replicate the remarkable ability of the human visual system, which relies on only one or a few instances to learn a completely new class or an object of a class. Recently we proposed two genetic programming (GP) methods, one-shot GP and compound-GP, that aim to evolve a program for the task of binary classification in images. The two methods are designed to use only one or a few instances per class to evolve the model. In this study, we investigate these two methods in terms of performance, robustness, and complexity of the evolved programs. We use ten data sets that vary in difficulty to evaluate these two methods. We also compare them with two other GP and six non-GP methods. The results show that one-shot GP and compound-GP outperform or achieve results comparable to competitor methods. Moreover, the features extracted by these two methods improve the performance of other classifiers with handcrafted features and those extracted by a recently developed GP-based method in most cases.


2014 ◽  
Vol 2014 ◽  
pp. 1-12 ◽  
Author(s):  
Afshin Pedram Pourhashemi ◽  
S. M. Mehdi Ansarey Movahed ◽  
Masoud Shariat Panahi

In spite of occasional criticism they have attracted, hybrid vehicles (HVs) have been warmly welcomed by industry and academia alike. The key advantages of an HV, including fuel economy and environment friendliness, however, depend greatly on its energy management strategy and the way its design parameters are “tuned.” The optimal design and sizing of the HV remain a challenge for the engineering community, due to the variety of criteria and especially dynamic measures related to nature of its working conditions. This paper proposes an optimal design scheme that begins with presenting an energy management strategy based on minimum fuel consumption in finite driving cycle horizon. The strategy utilizes a dynamic programming approach and is consistent with charge sustenance. The sensitivity of the vehicle’s performance metrics to multiple design parameters is then studied using a design of experiments (DOE) methodology. The proposed scheme provides the designer with a reliable tool for investigating various design scenarios and achieving the optimal one.


2009 ◽  
Vol 18 (05) ◽  
pp. 757-781 ◽  
Author(s):  
CÉSAR L. ALONSO ◽  
JOSÉ LUIS MONTAÑA ◽  
JORGE PUENTE ◽  
CRUZ ENRIQUE BORGES

Tree encodings of programs are well known for their representative power and are used very often in Genetic Programming. In this paper we experiment with a new data structure, named straight line program (slp), to represent computer programs. The main features of this structure are described, new recombination operators for GP related to slp's are introduced and a study of the Vapnik-Chervonenkis dimension of families of slp's is done. Experiments have been performed on symbolic regression problems. Results are encouraging and suggest that the GP approach based on slp's consistently outperforms conventional GP based on tree structured representations.


2012 ◽  
Vol 42 (4) ◽  
pp. 415-431 ◽  
Author(s):  
Georgios A. Vasilakis ◽  
Konstantinos A. Theofilatos ◽  
Efstratios F. Georgopoulos ◽  
Andreas Karathanasopoulos ◽  
Spiros D. Likothanassis

Sign in / Sign up

Export Citation Format

Share Document