Learning and Searching Pseudo-Boolean Surrogate Functions from Small Samples

被引:4
|
作者
Swingler, Kevin [1 ]
机构
[1] Univ Stirling, Comp Sci & Math, Stirling FK9 4LA, Scotland
关键词
Fitness function modelling; estimation of distribution algorithms; pseudo-Boolean functions; linkage learning; Walsh decomposition; mixed order hyper networks; statistical machine learning; NEURAL-NETWORKS; FITNESS APPROXIMATION; OPTIMIZATION; SELECTION; DEUM;
D O I
10.1162/evco_a_00257
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
When searching for input configurations that optimise the output of a system, it can be useful to build a statistical model of the system being optimised. This is done in approaches such as surrogate model-based optimisation, estimation of distribution algorithms, and linkage learning algorithms. This article presents a method for modelling pseudo-Boolean fitness functions using Walsh bases and an algorithm designed to discover the non-zero coefficients while attempting to minimise the number of fitness function evaluations required. The resulting models reveal linkage structure that can be used to guide a search of the model efficiently. It presents experimental results solving benchmark problems in fewer fitness function evaluations than those reported in the literature for other search methods such as EDAs and linkage learners.
引用
收藏
页码:317 / 338
页数:22
相关论文
共 50 条
  • [1] Walsh Functions as Surrogate Model for Pseudo-Boolean Optimization Problems
    Lepretre, Florian
    Verel, Sebastien
    Fonlupt, Cyril
    Marion, Virginie
    [J]. PROCEEDINGS OF THE 2019 GENETIC AND EVOLUTIONARY COMPUTATION CONFERENCE (GECCO'19), 2019, : 303 - 311
  • [2] A Surrogate Model Based on Walsh Decomposition for Pseudo-Boolean Functions
    Verel, Sebastien
    Derbel, Bilel
    Liefooghe, Arnaud
    Aguirre, Hernan
    Tanaka, Kiyoshi
    [J]. PARALLEL PROBLEM SOLVING FROM NATURE - PPSN XV, PT II, 2018, 11102 : 181 - 193
  • [3] Calculus of Pseudo-Boolean Functions
    Zhao Yin
    Cheng Daizhan
    [J]. PROCEEDINGS OF THE 31ST CHINESE CONTROL CONFERENCE, 2012, : 267 - 272
  • [4] Efficient learning of pseudo-Boolean functions from limited training data
    Ding, GL
    Chen, JH
    Lax, R
    Chen, P
    [J]. FOUNDATIONS OF INTELLIGENT SYSTEMS, PROCEEDINGS, 2005, 3488 : 323 - 331
  • [5] Locally monotone Boolean and pseudo-Boolean functions
    Couceiro, Miguel
    Marichal, Jean-Luc
    Waldhauser, Tamas
    [J]. DISCRETE APPLIED MATHEMATICS, 2012, 160 (12) : 1651 - 1660
  • [6] Learning Pseudo-Boolean k-DNF and Submodular Functions
    Raskhodnikova, Sofya
    Yaroslavtsev, Grigory
    [J]. PROCEEDINGS OF THE TWENTY-FOURTH ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS (SODA 2013), 2013, : 1356 - 1368
  • [7] Understanding Transforms of Pseudo-Boolean Functions
    Whitley, Darrell
    Aguirre, Hernan
    Sutton, Andrew
    [J]. GECCO'20: PROCEEDINGS OF THE 2020 GENETIC AND EVOLUTIONARY COMPUTATION CONFERENCE, 2020, : 760 - 768
  • [8] Compact quadratizations for pseudo-Boolean functions
    Boros, Endre
    Crama, Yves
    Rodriguez-Heck, Elisabeth
    [J]. JOURNAL OF COMBINATORIAL OPTIMIZATION, 2020, 39 (03) : 687 - 707
  • [9] Compact quadratizations for pseudo-Boolean functions
    Endre Boros
    Yves Crama
    Elisabeth Rodríguez-Heck
    [J]. Journal of Combinatorial Optimization, 2020, 39 : 687 - 707
  • [10] Quadratization of symmetric pseudo-Boolean functions
    Anthony, Martin
    Boros, Endre
    Crama, Yves
    Gruber, Aritanan
    [J]. DISCRETE APPLIED MATHEMATICS, 2016, 203 : 1 - 12