Active and Compact Entropy Search for High-Dimensional Bayesian Optimization

被引:2
作者
Li, Run [1 ,2 ]
Shi, Yucheng [1 ,2 ]
Han, Yahong [1 ,2 ,3 ]
Shao, Yunfeng [4 ]
Qi, Meiyu [4 ]
Li, Bingshuai [4 ]
机构
[1] Tianjin Univ, Coll Intelligence & Comp, Tianjin 300072, Peoples R China
[2] Tianjin Univ, Tianjin Key Lab Machine Learning, Tianjin 300072, Peoples R China
[3] Peng Cheng Lab, Shenzhen 518066, Peoples R China
[4] Huawei Technol, Huawei Noahs Ark Lab, Shenzhen 518129, Peoples R China
关键词
Bayesian optimization; entropy search; high dimensionality;
D O I
10.1109/TKDE.2021.3077279
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Entropy search and its derivative methods are one class of Bayesian Optimization methods that achieve active exploration of black-box functions. They maximize the information gain about the position in the input space where the black-box function gets the global optimum. However, existing entropy search methods suffer from harassment caused by high dimensional optimization problems. On the one hand, the computation for estimating entropies increases exponentially as dimensions increase, which limits the applicability of entropy search to high dimensional problems. On the other hand, many high-dimensional problems have the property that a large number of dimensions have little influence on the objective function, but currently there is no compress mechanism to exclude these redundant dimensions. In this work, we propose Active Compact Entropy Search (AcCES) to fix the above two defects. Under the guidance of historical evaluation, we bring forward a novel acquisition function that considers the correlation between dimensions in entropy search, which is ignored by existing Bayesian Optimization methods. The correlation term added in the acquisition function will help discover the potential correlation between dimensions. In order to build a more compact input space, redundant dimensions are compressed by exploiting inter-dimensional correlations. We use Pearson Correlation Coefficient and curve fitting to represent the inter-dimensional correlations. Extensive experiments on several benchmarks demonstrate that AcCES achieves higher query efficiency as well as optimal results after convergence than existing entropy search methods.
引用
收藏
页码:59 / 70
页数:12
相关论文
共 59 条
  • [1] [Anonymous], 2011, Advances in neural information processing systems
  • [2] Auer P., 2003, Journal of Machine Learning Research, V3, P397, DOI 10.1162/153244303321897663
  • [3] Baptista R, 2018, PR MACH LEARN RES, V80
  • [4] Consciousness is not a property of states: A reply to Wilberg
    Berger, Jacob
    [J]. PHILOSOPHICAL PSYCHOLOGY, 2014, 27 (06) : 829 - 842
  • [5] Bayes-Optimal Hierarchical Multilabel Classification
    Bi, Wei
    Kwok, Jame T.
    [J]. IEEE TRANSACTIONS ON KNOWLEDGE AND DATA ENGINEERING, 2015, 27 (11) : 2907 - 2918
  • [6] On the choice of the low-dimensional domain for global optimization via random embeddings
    Binois, Mickael
    Ginsbourger, David
    Roustant, Olivier
    [J]. JOURNAL OF GLOBAL OPTIMIZATION, 2020, 76 (01) : 69 - 90
  • [7] A Warped Kernel Improving Robustness in Bayesian Optimization Via Random Embeddings
    Binois, Mickael
    Ginsbourger, David
    Roustant, Olivier
    [J]. LEARNING AND INTELLIGENT OPTIMIZATION, LION 9, 2015, 8994 : 281 - 286
  • [8] Random forests
    Breiman, L
    [J]. MACHINE LEARNING, 2001, 45 (01) : 5 - 32
  • [9] Bull AD, 2011, J MACH LEARN RES, V12, P2879
  • [10] Optimization Techniques for Reactive Network Monitoring
    Bulut, Ahmet
    Koudas, Nick
    Meka, Anand
    Singh, Ambuj K.
    Srivastava, Divesh
    [J]. IEEE TRANSACTIONS ON KNOWLEDGE AND DATA ENGINEERING, 2009, 21 (09) : 1343 - 1357