资源论文Model-Based Genetic Algorithms for Algorithm Configuration

Model-Based Genetic Algorithms for Algorithm Configuration

2019-11-18 | |  71 |   57 |   0

Abstract

Automatic  algorithm  configurators  are  important practical tools for improving program performance measures,  such as solution time or prediction ac-curacy.  Local search approaches in particular have proven very effective for tuning algorithms.  In se-quential local search, the use of predictive models has proven beneficial for obtaining good tuning re-sults. We study the use of non-parametric models in the context of population-based algorithm configu-rators. We introduce a new model designed specif-ically for the task of predicting high-performance regions in the parameter space. Moreover, we intro-duce the ideas of genetic engineering of offspring as well as sexual selection of parents.  Numerical results  show  that  model-based  genetic  algorithms significantly improve our ability to effectively con-figure algorithms automatically


上一篇:Bayesian Modelling of Community-Based Multidimensional Trust in Participatory Sensing under Data Sparsity

下一篇:ICBS: Improved Conflict-Based Search Algorithm for Multi-Agent Pathfinding

用户评价
全部评价

热门资源

  • The Variational S...

    Unlike traditional images which do not offer in...

  • Learning to Predi...

    Much of model-based reinforcement learning invo...

  • Stratified Strate...

    In this paper we introduce Stratified Strategy ...

  • A Mathematical Mo...

    Direct democracy, where each voter casts one vo...

  • Rating-Boosted La...

    The performance of a recommendation system reli...